56     static LocHeapNode* pop(LocHeapNode*& top);
61     static LocHeapNode* remove(LocHeapNode*& top, LocRankable& data);
136 LocHeapNode* LocHeapNode::pop(LocHeapNode*& top) {  in pop()  argument
143     LocHeapNode* poppedNode = top;  in pop()
145     top->mSize--;  in pop()
146     if (top->mLeft || top->mRight) {  in pop()
150         LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight :  in pop()
151             ((NULL == top->mRight) ? top->mLeft :  in pop()
152              (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight));  in pop()
154         top->swap(*subTop);  in pop()
162         top = NULL;  in pop()
172 LocHeapNode* LocHeapNode::remove(LocHeapNode*& top, LocRankable& data) {  in remove()  argument
175     if (&data == (LocRankable*)(top->mData)) {  in remove()
177         removedNode = pop(top);  in remove()
178     } else if (!data.outRanks(*top->mData)) {  in remove()
180         if (top->mLeft) {  in remove()
181             removedNode = remove(top->mLeft, data);  in remove()
184         if (!removedNode && top->mRight) {  in remove()
185             removedNode = remove(top->mRight, data);  in remove()
190             top->mSize--;  in remove()
240     LocRankable* top = NULL;  in peek()  local
242         top = mTree->mData;  in peek()
244     return top;  in peek()