Lines Matching refs:LocRankable
38 LocRankable* mData;
40 inline LocHeapNode(LocRankable& data) :
48 LocRankable* detachData();
59 static LocHeapNode* remove(LocHeapNode*& top, LocRankable& data);
63 inline bool outRanks(LocRankable& data) { return mData->outRanks(data); }
89 LocRankable* tmpData = node.mData;
95 LocRankable* LocHeapNode::detachData() {
96 LocRankable* data = mData;
170 LocHeapNode* LocHeapNode::remove(LocHeapNode*& top, LocRankable& data) {
173 if (&data == (LocRankable*)(top->mData)) {
228 void LocHeap::push(LocRankable& node) {
237 LocRankable* LocHeap::peek() {
238 LocRankable* top = NULL;
245 LocRankable* LocHeap::pop() {
246 LocRankable* locNode = NULL;
256 LocRankable* LocHeap::remove(LocRankable& rankable) {
257 LocRankable* locNode = NULL;
295 class LocHeapDebugData : public LocRankable {
299 inline virtual int ranks(LocRankable& rankable) {
323 heap.push(dynamic_cast<LocRankable&>(*data));
326 LocRankable* rankable = heap.pop();
347 for (LocRankable* data = heap.pop(); NULL != data; data = heap.pop()) {
