Lines Matching defs:mLeft
36 LocHeapNode* mLeft;
41 mSize(1), mLeft(NULL), mRight(NULL), mData(&data) {}
74 if (mLeft) {
75 delete mLeft;
76 mLeft = NULL;
114 if (NULL == mLeft) {
115 mLeft = &node;
118 } else if (mLeft->mSize <= mRight->mSize) {
119 mLeft->push(node);
144 if (top->mLeft || top->mRight) {
145 // if mLeft is NULL, mRight for sure is NOT NULL, take that;
146 // else if mRight is NULL, mLeft for sure is NOT, take that;
148 LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight :
149 ((NULL == top->mRight) ? top->mLeft :
150 (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight));
158 // subTop is the reference of ether mLeft or mRight
178 if (top->mLeft) {
179 removedNode = remove(top->mLeft, data);
181 // if we did not find in mLeft, and mRight is not empty
200 if (mLeft) {
202 if (mLeft->outRanks(*this) || !mLeft->checkNodes()) {
206 totalSize -= mLeft->mSize;
