31 class LocHeapNode {  class
36     LocHeapNode* mLeft;
37     LocHeapNode* mRight;
40     inline LocHeapNode(LocRankable& data) :  in LocHeapNode()  function in LocHeapNode
42     ~LocHeapNode();
46     void swap(LocHeapNode& node);
51     void push(LocHeapNode& node);
54     static LocHeapNode* pop(LocHeapNode*& top);
59     static LocHeapNode* remove(LocHeapNode*& top, LocRankable& data);
62     inline bool outRanks(LocHeapNode& node) { return mData->outRanks(*node.mData); }  in outRanks()
73 LocHeapNode::~LocHeapNode() {  in ~LocHeapNode()
88 void LocHeapNode::swap(LocHeapNode& node) {  in swap()
95 LocRankable* LocHeapNode::detachData()  {  in detachData()
107 void LocHeapNode::push(LocHeapNode& node) {  in push()
134 LocHeapNode* LocHeapNode::pop(LocHeapNode*& top) {  in pop()
141     LocHeapNode* poppedNode = top;  in pop()
148         LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight :  in pop()
170 LocHeapNode* LocHeapNode::remove(LocHeapNode*& top, LocRankable& data) {  in remove()
171     LocHeapNode* removedNode = NULL;  in remove()
197 bool LocHeapNode::checkNodes() {  in checkNodes()
229     LocHeapNode* heapNode = new LocHeapNode(node);  in push()
249         LocHeapNode* heapNode = LocHeapNode::pop(mTree);  in pop()
260         LocHeapNode* heapNode = LocHeapNode::remove(mTree, rankable);  in remove()