Lines Matching refs:it
6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
148 for (typename inode::iterator it =
150 it != static_cast<inode_pointer>(p_nd)->end();
151 ++it)
153 node_pointer p_child =* it;
168 erase(const_iterator it)
172 if (it == end())
173 return it;
175 const_iterator ret_it = it;
177 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node);
178 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
187 erase(iterator it)
191 if (it == end())
192 return it;
193 iterator ret_it = it;
195 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node);
196 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
205 erase(const_reverse_iterator it)
209 if (it.m_p_nd == m_p_head)
210 return it;
211 const_reverse_iterator ret_it = it;
214 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node);
215 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
224 erase(reverse_iterator it)
228 if (it.m_p_nd == m_p_head)
229 return it;
230 reverse_iterator ret_it = it;
233 _GLIBCXX_DEBUG_ASSERT(it.m_p_nd->m_type == leaf_node);
234 erase_leaf(static_cast<leaf_pointer>(it.m_p_nd));
249 iterator it = begin();
250 while (it != end())
253 if (pred(*it))
256 it = erase(it);
259 ++it;
303 iterator it(p_l);
304 ++it;
305 m_p_head->m_p_min = it.m_p_nd;
311 iterator it(p_l);
312 --it;
313 m_p_head->m_p_max = it.m_p_nd;
