Lines Matching refs:m_pairs
29 m_pairs (),
38 m_pairs (),
47 m_pairs (rhs.m_pairs),
60 m_pairs = rhs.m_pairs;
82 m_pairs.push_back(pair(path, replacement));
91 if (!rhs.m_pairs.empty())
93 const_iterator pos, end = rhs.m_pairs.end();
94 for (pos = rhs.m_pairs.begin(); pos != end; ++pos)
95 m_pairs.push_back(*pos);
109 if (index >= m_pairs.size())
110 insert_iter = m_pairs.end();
112 insert_iter = m_pairs.begin() + index;
113 m_pairs.insert(insert_iter, pair(path, replacement));
125 if (index >= m_pairs.size())
128 m_pairs[index] = pair(path, replacement);
137 if (index >= m_pairs.size())
141 iterator iter = m_pairs.begin() + index;
142 m_pairs.erase(iter);
153 unsigned int numPairs = m_pairs.size();
160 index, m_pairs[index].first.GetCString(), m_pairs[index].second.GetCString());
166 m_pairs[pair_index].first.GetCString(), m_pairs[pair_index].second.GetCString());
173 if (!m_pairs.empty())
175 m_pairs.clear();
188 const_iterator pos, end = m_pairs.end();
189 for (pos = m_pairs.begin(); pos != end; ++pos)
207 if (m_pairs.empty() || path == NULL || path[0] == '\0')
210 const_iterator pos, end = m_pairs.end();
211 for (pos = m_pairs.begin(); pos != end; ++pos)
228 if (!m_pairs.empty())
235 const_iterator pos, end = m_pairs.end();
236 for (pos = m_pairs.begin(); pos != end; ++pos)
264 if (idx < m_pairs.size())
267 m_pairs[idx].second = new_path;
279 if (pos != m_pairs.end())
282 m_pairs.erase (pos);
294 const_iterator begin = m_pairs.begin();
295 const_iterator end = m_pairs.end();
309 iterator begin = m_pairs.begin();
310 iterator end = m_pairs.end();
323 if (idx < m_pairs.size())
325 path = m_pairs[idx].first;
326 new_path = m_pairs[idx].second;
338 const_iterator begin = m_pairs.begin();
339 const_iterator end = m_pairs.end();
