Lines Matching refs:node
41 // The pointer of the input node would be stored in the heap.
57 // help beter balance the tree with lower cost. When a node is pushed to the tree,
58 // it is guaranteed that the subtree that is smaller gets to have the new node.
67 // tree by adding the new node to the smaller of the subtrees.
68 // node is reference to an obj that is managed by client, that client
70 // node is popped out from the heap.
71 void push(LocRankable& node);
73 // Peeks the node data on tree top, which has currently the highest ranking
75 // Returns NULL if the tree is empty, otherwise pointer to the node data of
81 // Return - pointer to the node popped out, or NULL if heap is already empty
84 // navigating through the tree and find the node that ranks the same
87 // returns the pointer to the node removed; or NULL (if failed).