reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
45 bool IsEmpty() const { return m_pairs.empty(); } 47 size_t GetSize() const { return m_pairs.size(); }tools/lldb/source/Target/PathMappingList.cpp
48 : m_pairs(rhs.m_pairs), m_callback(nullptr), m_callback_baton(nullptr), 53 m_pairs = rhs.m_pairs; 53 m_pairs = rhs.m_pairs; 66 m_pairs.emplace_back(pair(NormalizePath(path), NormalizePath(replacement))); 73 if (!rhs.m_pairs.empty()) { 74 const_iterator pos, end = rhs.m_pairs.end(); 75 for (pos = rhs.m_pairs.begin(); pos != end; ++pos) 76 m_pairs.push_back(*pos); 87 if (index >= m_pairs.size()) 88 insert_iter = m_pairs.end(); 90 insert_iter = m_pairs.begin() + index; 91 m_pairs.emplace(insert_iter, pair(NormalizePath(path), 100 if (index >= m_pairs.size()) 103 m_pairs[index] = pair(NormalizePath(path), NormalizePath(replacement)); 110 if (index >= m_pairs.size()) 114 iterator iter = m_pairs.begin() + index; 115 m_pairs.erase(iter); 124 unsigned int numPairs = m_pairs.size(); 130 m_pairs[index].first.GetCString(), 131 m_pairs[index].second.GetCString()); 134 s->Printf("%s -> %s", m_pairs[pair_index].first.GetCString(), 135 m_pairs[pair_index].second.GetCString()); 140 if (!m_pairs.empty()) 142 m_pairs.clear(); 159 if (m_pairs.empty() || path.empty()) 162 for (const auto &it : m_pairs) { 190 for (const auto &it : m_pairs) { 202 if (m_pairs.empty()) 212 for (auto entry : m_pairs) { 248 if (idx < m_pairs.size()) { 250 m_pairs[idx].second = new_path; 260 if (pos != m_pairs.end()) { 262 m_pairs.erase(pos); 273 const_iterator begin = m_pairs.begin(); 274 const_iterator end = m_pairs.end(); 286 iterator begin = m_pairs.begin(); 287 iterator end = m_pairs.end(); 298 if (idx < m_pairs.size()) { 299 path = m_pairs[idx].first; 300 new_path = m_pairs[idx].second; 309 const_iterator begin = m_pairs.begin(); 310 const_iterator end = m_pairs.end();