39     LocHeapNode* mRight;  member in loc_util::LocHeapNode
43         mSize(1), mLeft(NULL), mRight(NULL), mData(&data) {}  in LocHeapNode()
80     if (mRight) {  in ~LocHeapNode()
81         delete mRight;  in ~LocHeapNode()
82         mRight = NULL;  in ~LocHeapNode()
118     } else if (NULL == mRight) {  in push()
119         mRight = &node;  in push()
120     } else if (mLeft->mSize <= mRight->mSize) {  in push()
123         mRight->push(node);  in push()
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()
184         if (!removedNode && top->mRight) {  in remove()
185             removedNode = remove(top->mRight, data);  in remove()
211     if (mRight) {  in checkNodes()
213         if (mRight->outRanks(*this) || !mRight->checkNodes()) {  in checkNodes()
217         totalSize -= mRight->mSize;  in checkNodes()