lldb/Utility/RangeMap.h

64   void SetRangeEnd(BaseType end) {
65     if (end > base)
66       size = end - base;
153       std::stable_sort(m_entries.begin(), m_entries.end());
158     typename Collection::const_iterator pos, end, prev;
159     for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end;
161       if (prev != end && *pos < *prev)
176       typename Collection::iterator end;
180       // don't end up allocating and making a new collection for no reason
181       for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
182            pos != end; prev = pos++) {
183         if (prev != end && prev->DoesAdjoinOrIntersect(*pos)) {
193         for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
194              pos != end; prev = pos++) {
195           if (prev != end && prev->DoesAdjoinOrIntersect(*pos))
227     // range's end
232     typename Collection::iterator pos, end;
233     for (pos = m_entries.begin(), end = m_entries.end(); pos != end; ++pos)
268       typename Collection::const_iterator end = m_entries.end();
270           std::lower_bound(begin, end, entry, BaseLessThan);
272       if (pos != end && pos->Contains(addr)) {
290       typename Collection::const_iterator end = m_entries.end();
292           std::lower_bound(begin, end, entry, BaseLessThan);
294       if (pos != end && pos->Contains(addr)) {
312       typename Collection::const_iterator end = m_entries.end();
314           std::lower_bound(begin, end, range, BaseLessThan);
316       if (pos != end && pos->Contains(range)) {
355     auto end = m_entries.end();
356     auto pos = std::lower_bound(begin, end, entry);
358       if (pos != end && pos->Union(entry)) {
383       std::stable_sort(m_entries.begin(), m_entries.end());
388     typename Collection::const_iterator pos, end, prev;
390     // don't end up allocating and making a new collection for no reason
391     for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end;
393       if (prev != end && *pos < *prev)
408       typename Collection::iterator end;
412       // don't end up allocating and making a new collection for no reason
413       for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
414            pos != end; prev = pos++) {
415         if (prev != end && prev->DoesAdjoinOrIntersect(*pos)) {
425         for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
426              pos != end; prev = pos++) {
427           if (prev != end && prev->DoesAdjoinOrIntersect(*pos))
459     // range's end
464     typename Collection::iterator pos, end;
465     for (pos = m_entries.begin(), end = m_entries.end(); pos != end; ++pos)
503       typename Collection::const_iterator end = m_entries.end();
505           std::lower_bound(begin, end, entry, BaseLessThan);
507       if (pos != end && pos->Contains(addr)) {
525       typename Collection::const_iterator end = m_entries.end();
527           std::lower_bound(begin, end, entry, BaseLessThan);
529       if (pos != end && pos->Contains(addr)) {
547       typename Collection::const_iterator end = m_entries.end();
549           std::lower_bound(begin, end, range, BaseLessThan);
551       if (pos != end && pos->Contains(range)) {
574     auto end = m_entries.end();
575     if (pos != end) {
577       if (next != end) {
620       std::stable_sort(m_entries.begin(), m_entries.end(),
632     typename Collection::const_iterator pos, end, prev;
634     // don't end up allocating and making a new collection for no reason
635     for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end;
637       if (prev != end && *pos < *prev)
649     typename Collection::iterator end;
653     // don't end up allocating and making a new collection for no reason
654     for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end;
656       if (prev != end && prev->data == pos->data) {
666       for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
667            pos != end; prev = pos++) {
668         if (prev != end && prev->data == pos->data)
743       typename Collection::const_iterator end = m_entries.end();
745           std::lower_bound(begin, end, range, BaseLessThan);
750       if (pos != end && pos->Contains(range))
761       auto begin = m_entries.begin(), end = m_entries.end();
762       auto pos = std::lower_bound(begin, end, Entry(addr, 1), BaseLessThan);
763       if (pos != end && pos->base == addr)
784       typename Collection::const_iterator end = m_entries.end();
786           std::lower_bound(m_entries.begin(), end, addr,
794       if (pos != end)
853       std::stable_sort(m_entries.begin(), m_entries.end());
858     typename Collection::const_iterator pos, end, prev;
860     // don't end up allocating and making a new collection for no reason
861     for (pos = m_entries.begin(), end = m_entries.end(), prev = end; pos != end;
863       if (prev != end && *pos < *prev)
896       typename Collection::iterator end = m_entries.end();
898           std::lower_bound(begin, end, entry, BaseLessThan);
903       if (pos != end) {
912     if (entry >= &*m_entries.begin() && entry + 1 < &*m_entries.end())