00001 00002 //=======================================================// _\|/_ 00003 // __ _____ ___ ___ // /|\ ~ 00004 // / | ^ | \ | ^ | \ // _\|/_ 00005 // \__ | / \ |___/ | / \ |___/ // /|\ ~ 00006 // \ | /___\ | \ | /___\ | \ // _\|/_ 00007 // ___/ | / \ | \ |____ / \ |___/ // /|\ ~ 00008 // // _\|/_ 00009 //=======================================================// /|\ ~ 00010 00011 #include "hdyn.h" 00012 00013 // The n_top_level functions are a convenient way of keeping track 00014 // of the total number of top-level nodes. *Much* more efficient than 00015 // using root->n_daughters(). They should probably be made part of 00016 // the node class eventually... 00017 // 00018 // n_top_level is maintained via set_n_top_level in kira.C as the tree 00019 // changes. Currently, get_n_top_level is used only in kira_ev.C. 00020 00021 static int n_top_level = 0; 00022 00023 void set_n_top_level(hdyn* b) 00024 { 00025 n_top_level = b->n_daughters(); 00026 } 00027 00028 int get_n_top_level() 00029 { 00030 return n_top_level; 00031 }