Lines Matching defs:mData
38 LocRankable* mData;
41 mSize(1), mLeft(NULL), mRight(NULL), mData(&data) {}
62 inline bool outRanks(LocHeapNode& node) { return mData->outRanks(*node.mData); }
63 inline bool outRanks(LocRankable& data) { return mData->outRanks(data); }
82 if (mData) {
83 mData = NULL;
89 LocRankable* tmpData = node.mData;
90 node.mData = mData;
91 mData = tmpData;
96 LocRankable* data = mData;
97 mData = NULL;
104 // mData of tree top ranks lower than that of the incoming node,
105 // mData will be swapped with that of the incoming node to ensure
139 // recursively to the leaf level. So we swap the mData of the
147 // else we take the address of whatever has higher ranking mData
151 // swap mData, the tree top gets updated with the new data.
173 if (&data == (LocRankable*)(top->mData)) {
176 } else if (!data.outRanks(*top->mData)) {
240 top = mTree->mData;
