Lines Matching refs:nodes
105 nodes;
221 splay_tree->nodes++;
252 static NodeInfo *LinkSplayTreeNodes(NodeInfo **nodes,const size_t low,
262 node=nodes[bisect];
266 node->left=LinkSplayTreeNodes(nodes,low,bisect-1);
270 node->right=LinkSplayTreeNodes(nodes,bisect+1,high);
274 static inline int SplayTreeToNodeArray(NodeInfo *node,const void *nodes)
279 p=(const NodeInfo ***) nodes;
289 **nodes;
291 if (splay_tree->nodes <= 2)
296 nodes=(NodeInfo **) AcquireQuantumMemory((size_t) splay_tree->nodes,
297 sizeof(*nodes));
298 if (nodes == (NodeInfo **) NULL)
300 node=nodes;
303 splay_tree->root=LinkSplayTreeNodes(nodes,0,splay_tree->nodes-1);
305 nodes=(NodeInfo **) RelinquishMagickMemory(nodes);
563 splay_tree->nodes--;
652 splay_tree->nodes--;
938 % GetNumberOfNodesInSplayTree() returns the number of nodes in the splay-tree.
957 return(splay_tree->nodes);
1006 **nodes;
1022 nodes=(NodeInfo **) AcquireQuantumMemory((size_t) splay_tree->nodes,
1023 sizeof(*nodes));
1024 transitions=(unsigned char *) AcquireQuantumMemory((size_t) splay_tree->nodes,
1026 if ((nodes == (NodeInfo **) NULL) || (transitions == (unsigned char *) NULL))
1030 nodes[0]=splay_tree->root;
1034 node=nodes[i];
1044 nodes[i]=node->left;
1054 nodes[i]=node->right;
1079 nodes=(NodeInfo **) RelinquishMagickMemory(nodes);
1135 splay_tree->nodes=0;
1231 splay_tree->nodes--;
1319 splay_tree->nodes--;
1349 % ResetSplayTree() resets the splay-tree. That is, it deletes all the nodes
1424 splay_tree->nodes=0;
1442 % conjunction with GetNextValueInSplayTree() to iterate over all the nodes in
