#include <allvars.h>
Data Fields | |
float | len |
float | center [3] |
union { | |
int suns [8] | |
struct { | |
float s [3] | |
float mass | |
int bitflags | |
int sibling | |
int nextnode | |
int father | |
} d | |
} | u |
|
a bit-field with various information on the node Definition at line 570 of file allvars.h. Referenced by force_exchange_pseudodata(), force_flag_localnodes(), force_treeevaluate_ewald_correction(), force_treeupdate_pseudos(), and force_update_node_recursive(). |
|
geometrical center of node Definition at line 558 of file allvars.h. Referenced by force_create_empty_nodes(), force_insert_pseudo_particles(), force_treebuild_single(), force_treeevaluate_ewald_correction(), force_update_node_len_local(), force_update_node_len_toptree(), and force_update_node_recursive(). |
|
|
this gives the parent node of each node (or -1 if we have the root node) Definition at line 573 of file allvars.h. Referenced by advance_and_find_timesteps(), force_flag_localnodes(), force_treeupdate_pseudos(), force_update_node_hmax_local(), force_update_node_hmax_toptree(), force_update_node_len_local(), force_update_node_len_toptree(), force_update_node_recursive(), restart(), and setup_smoothinglengths(). |
|
sidelength of treenode Definition at line 557 of file allvars.h. Referenced by force_create_empty_nodes(), force_treebuild_single(), force_treeevaluate_ewald_correction(), force_update_node_len_local(), force_update_node_len_toptree(), and setup_smoothinglengths(). |
|
mass of node Definition at line 569 of file allvars.h. Referenced by advance_and_find_timesteps(), force_exchange_pseudodata(), force_treeevaluate_ewald_correction(), force_treeupdate_pseudos(), force_update_node_recursive(), and setup_smoothinglengths(). |
|
this gives the next node in case the current node needs to be opened Definition at line 572 of file allvars.h. Referenced by force_treebuild_single(), force_treeevaluate_ewald_correction(), force_update_node_recursive(), ngb_treefind_variable(), and restart(). |
|
center of mass of node Definition at line 568 of file allvars.h. Referenced by force_exchange_pseudodata(), force_treeevaluate_ewald_correction(), force_treeupdate_pseudos(), force_update_node_recursive(), and move_particles(). |
|
this gives the next node in the walk in case the current node can be used Definition at line 571 of file allvars.h. Referenced by force_treeevaluate_ewald_correction(), force_update_node_recursive(), ngb_treefind_variable(), and restart(). |
|
temporary pointers to daughter nodes Definition at line 565 of file allvars.h. Referenced by force_create_empty_nodes(), force_treebuild_single(), and force_update_node_recursive(). |
|