73     std::map<int, std::vector<DualCoverTreeMapEntry> >& referenceMap)  in Traverse()
75   if (referenceMap.size() == 0)  in Traverse()
79   ReferenceRecursion(queryNode, referenceMap);  in Traverse()
82   if (referenceMap.size() == 0)  in Traverse()
88       (queryNode.Scale() >= (*referenceMap.rbegin()).first))  in Traverse()
99       PruneMap(queryNode.Child(i), referenceMap, childMap);  in Traverse()
103     PruneMap(queryNode.Child(0), referenceMap, selfChildMap);  in Traverse()
112   Log::Assert((*referenceMap.begin()).first == INT_MIN);  in Traverse()
115       (*referenceMap.begin()).second;  in Traverse()
159     std::map<int, std::vector<DualCoverTreeMapEntry> >& referenceMap,  in PruneMap()
162   if (referenceMap.empty())  in PruneMap()
166   if ((*referenceMap.begin()).first == INT_MIN)  in PruneMap()
170         (*referenceMap.begin()).second;  in PruneMap()
175     const int thisScale = (*referenceMap.begin()).first;  in PruneMap()
211       childMap.erase((*referenceMap.begin()).first);  in PruneMap()
215       it = referenceMap.rbegin();  in PruneMap()
217   while ((it != referenceMap.rend()))  in PruneMap()
280     std::map<int, std::vector<DualCoverTreeMapEntry> >& referenceMap)  in ReferenceRecursion()
284   while (!referenceMap.empty())  in ReferenceRecursion()
287     if (queryNode.Parent() == NULL && (*referenceMap.rbegin()).first <  in ReferenceRecursion()
290     if (queryNode.Parent() != NULL && (*referenceMap.rbegin()).first <=  in ReferenceRecursion()
296        ((*referenceMap.rbegin()).first == INT_MIN))  in ReferenceRecursion()
301         (*referenceMap.rbegin()).second;  in ReferenceRecursion()
348         referenceMap[newFrame.referenceNode->Scale()].push_back(newFrame);  in ReferenceRecursion()
353     referenceMap.erase((*referenceMap.rbegin()).first);  in ReferenceRecursion()