78       Aranges.reserve(count);  in extract()
79       AddArangeDescriptors range_adder(Aranges);  in extract()
102     const Range &range = Aranges[i];  in dump()
114   if (!Aranges.empty()) {  in appendRange()
115     if (Aranges.back().Offset == offset && Aranges.back().HiPC() == low_pc) {  in appendRange()
116       Aranges.back().setHiPC(high_pc);  in appendRange()
120   Aranges.push_back(Range(low_pc, high_pc, offset));  in appendRange()
124   const size_t orig_arange_size = Aranges.size();  in sort()
129   std::stable_sort(Aranges.begin(), Aranges.end(), RangeLessThan);  in sort()
146     if (!Range::SortedOverlapCheck(Aranges[i-1], Aranges[i], n))  in sort()
159   minimal_aranges[j] = Aranges[0];  in sort()
161     if(Range::SortedOverlapCheck (minimal_aranges[j], Aranges[i], n)) {  in sort()
162       minimal_aranges[j].setHiPC (Aranges[i].HiPC());  in sort()
165       minimal_aranges[++j] = Aranges[i];  in sort()
173   minimal_aranges.swap(Aranges);  in sort()
177   if (!Aranges.empty()) {  in findAddress()
179     RangeCollIterator begin = Aranges.begin();  in findAddress()
180     RangeCollIterator end = Aranges.end();  in findAddress()
196   if (Aranges.empty())  in allRangesAreContiguous()
200   RangeCollIterator begin = Aranges.begin();  in allRangesAreContiguous()
201   for (RangeCollIterator pos = begin, end = Aranges.end(); pos != end;  in allRangesAreContiguous()
208   LoPC = Aranges.front().LoPC;  in allRangesAreContiguous()
210   HiPC = Aranges.back().HiPC();  in allRangesAreContiguous()
215   if (Aranges.empty())  in getMaxRange()
218   LoPC = Aranges.front().LoPC;  in getMaxRange()
220   HiPC = Aranges.back().HiPC();  in getMaxRange()