reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

tools/lldb/include/lldb/Utility/RangeMap.h
  343   void Append(const Entry &entry) { m_entries.push_back(entry); }
  345   void Append(B base, S size) { m_entries.emplace_back(base, size); }
  350     if (m_entries.empty()) {
  351       m_entries.push_back(entry);
  354     auto begin = m_entries.begin();
  355     auto end = m_entries.end();
  370     m_entries.insert(pos, entry);
  374     if (idx < m_entries.size()) {
  375       m_entries.erase(m_entries.begin() + idx);
  375       m_entries.erase(m_entries.begin() + idx);
  382     if (m_entries.size() > 1)
  383       std::stable_sort(m_entries.begin(), m_entries.end());
  383       std::stable_sort(m_entries.begin(), m_entries.end());
  405     if (m_entries.size() > 1) {
  413       for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
  413       for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
  425         for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
  425         for (pos = m_entries.begin(), end = m_entries.end(), prev = end;
  436         m_entries.swap(minimal_ranges);
  445     if (m_entries.empty())
  449     return m_entries.front().GetRangeBase();
  456     if (m_entries.empty())
  460     return m_entries.back().GetRangeEnd();
  465     for (pos = m_entries.begin(), end = m_entries.end(); pos != end; ++pos)
  465     for (pos = m_entries.begin(), end = m_entries.end(); pos != end; ++pos)
  469   void Clear() { m_entries.clear(); }
  471   void Reserve(typename Collection::size_type size) { m_entries.reserve(size); }
  473   bool IsEmpty() const { return m_entries.empty(); }
  475   size_t GetSize() const { return m_entries.size(); }
  478     return ((i < m_entries.size()) ? &m_entries[i] : nullptr);
  478     return ((i < m_entries.size()) ? &m_entries[i] : nullptr);
  483   Entry &GetEntryRef(size_t i) { return m_entries[i]; }
  484   const Entry &GetEntryRef(size_t i) const { return m_entries[i]; }
  486   Entry *Back() { return (m_entries.empty() ? nullptr : &m_entries.back()); }
  486   Entry *Back() { return (m_entries.empty() ? nullptr : &m_entries.back()); }
  489     return (m_entries.empty() ? nullptr : &m_entries.back());
  489     return (m_entries.empty() ? nullptr : &m_entries.back());
  500     if (!m_entries.empty()) {
  502       typename Collection::const_iterator begin = m_entries.begin();
  503       typename Collection::const_iterator end = m_entries.end();
  522     if (!m_entries.empty()) {
  524       typename Collection::const_iterator begin = m_entries.begin();
  525       typename Collection::const_iterator end = m_entries.end();
  545     if (!m_entries.empty()) {
  546       typename Collection::const_iterator begin = m_entries.begin();
  547       typename Collection::const_iterator end = m_entries.end();
  567     if (pos != m_entries.begin()) {
  570         m_entries.erase(pos);
  574     auto end = m_entries.end();
  579           m_entries.erase(next);