Lines Matching refs:number_nodes
1286 static void InitializeList(IntervalTree **list,ssize_t *number_nodes, in InitializeList() argument
1292 list[(*number_nodes)++]=node; in InitializeList()
1293 InitializeList(list,number_nodes,node->sibling); in InitializeList()
1294 InitializeList(list,number_nodes,node->child); in InitializeList()
1355 number_nodes; in InitializeIntervalTree() local
1378 number_nodes=0; in InitializeIntervalTree()
1379 InitializeList(list,&number_nodes,root); in InitializeIntervalTree()
1383 for (j=0; j < number_nodes; j++) in InitializeIntervalTree()
1464 static void ActiveNodes(IntervalTree **list,ssize_t *number_nodes, in ActiveNodes() argument
1471 list[(*number_nodes)++]=node; in ActiveNodes()
1472 ActiveNodes(list,number_nodes,node->sibling); in ActiveNodes()
1476 ActiveNodes(list,number_nodes,node->sibling); in ActiveNodes()
1477 ActiveNodes(list,number_nodes,node->child); in ActiveNodes()
1521 number_nodes; in OptimalTau() local
1606 number_nodes=0; in OptimalTau()
1607 ActiveNodes(list,&number_nodes,root->child); in OptimalTau()
1613 for (i=0; i < number_nodes; i++) in OptimalTau()
1661 for (i=0; i < number_nodes; i++) in OptimalTau()
1663 average_tau/=(double) number_nodes; in OptimalTau()