#include <allvars.h>
Data Fields | |
int | Daughter |
int | Pstart |
int | Blocks |
int | Leaf |
peanokey | Size |
peanokey | StartKey |
long long | Count |
|
for the present top-level node, this gives the number of corresponding nodes in the concatenated list of topnodes collected from all processors Definition at line 205 of file allvars.h. Referenced by domain_topsplit(). |
|
counts the number of particles in this top-level node Definition at line 209 of file allvars.h. Referenced by domain_topsplit(), and domain_topsplit_local(). |
|
index of first daughter cell (out of 8) of top-level node Definition at line 203 of file allvars.h. Referenced by domain_countToGo(), domain_exchangeParticles(), domain_sumCost(), domain_topsplit(), domain_topsplit_local(), domain_walktoptree(), force_create_empty_nodes(), and force_treebuild_single(). |
|
if the node is a leaf, this gives its number when all leaves are traversed in Peano-Hilbert order Definition at line 206 of file allvars.h. Referenced by domain_countToGo(), domain_exchangeParticles(), domain_sumCost(), domain_walktoptree(), force_create_empty_nodes(), and force_treebuild_single(). |
|
for the present top-level node, this gives the index of the first node in the concatenated list of topnodes collected from all processors Definition at line 204 of file allvars.h. Referenced by domain_topsplit(), and domain_topsplit_local(). |
|
number of Peano-Hilbert mesh-cells represented by top-level node Definition at line 207 of file allvars.h. Referenced by domain_countToGo(), domain_exchangeParticles(), domain_sumCost(), domain_topsplit(), domain_topsplit_local(), and force_treebuild_single(). |
|
first Peano-Hilbert key in top-level node Definition at line 208 of file allvars.h. Referenced by domain_countToGo(), domain_exchangeParticles(), domain_sumCost(), domain_topsplit(), domain_topsplit_local(), and force_treebuild_single(). |