Main Page | Alphabetical List | Data Structures | File List | Data Fields | Globals | Related Pages

NODE Struct Reference

#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


Field Documentation

int NODE::bitflags
 

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().

float NODE::center[3]
 

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().

struct { ... } NODE::d
 

Referenced by advance_and_find_timesteps(), force_exchange_pseudodata(), force_flag_localnodes(), force_treebuild_single(), force_treeevaluate_ewald_correction(), 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(), move_particles(), ngb_treefind_variable(), restart(), and setup_smoothinglengths().

int NODE::father
 

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().

float NODE::len
 

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().

float NODE::mass
 

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().

int NODE::nextnode
 

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().

float NODE::s[3]
 

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().

int NODE::sibling
 

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().

int NODE::suns[8]
 

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().

union { ... } NODE::u
 

Referenced by advance_and_find_timesteps(), force_create_empty_nodes(), force_exchange_pseudodata(), force_flag_localnodes(), force_treebuild_single(), force_treeevaluate_ewald_correction(), 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(), move_particles(), restart(), and setup_smoothinglengths().


The documentation for this struct was generated from the following file:
Generated on Sun May 22 17:33:31 2005 for GADGET-2 by  doxygen 1.3.9.1