33 class LocHeapNode {  class
38     LocHeapNode* mLeft;
39     LocHeapNode* mRight;
42     inline LocHeapNode(LocRankable& data) :  in LocHeapNode()  function in loc_util::LocHeapNode
44     ~LocHeapNode();
48     void swap(LocHeapNode& node);
53     void push(LocHeapNode& node);
56     static LocHeapNode* pop(LocHeapNode*& top);
61     static LocHeapNode* remove(LocHeapNode*& top, LocRankable& data);
64     inline bool outRanks(LocHeapNode& node) { return mData->outRanks(*node.mData); }  in outRanks()
75 LocHeapNode::~LocHeapNode() {  in ~LocHeapNode()
90 void LocHeapNode::swap(LocHeapNode& node) {  in swap()
97 LocRankable* LocHeapNode::detachData()  {  in detachData()
109 void LocHeapNode::push(LocHeapNode& node) {  in push()
136 LocHeapNode* LocHeapNode::pop(LocHeapNode*& top) {  in pop()
143     LocHeapNode* poppedNode = top;  in pop()
150         LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight :  in pop()
172 LocHeapNode* LocHeapNode::remove(LocHeapNode*& top, LocRankable& data) {  in remove()
173     LocHeapNode* removedNode = NULL;  in remove()
199 bool LocHeapNode::checkNodes() {  in checkNodes()
231     LocHeapNode* heapNode = new LocHeapNode(node);  in push()
251         LocHeapNode* heapNode = LocHeapNode::pop(mTree);  in pop()
262         LocHeapNode* heapNode = LocHeapNode::remove(mTree, rankable);  in remove()