Searched refs:__it (Results 1 - 19 of 19) sorted by relevance

/external/stlport/stlport/stl/debug/
H A D_iterator.h37 void _Decrement(_Iterator& __it, const bidirectional_iterator_tag &) argument
38 { --__it; }
41 void _Decrement(_Iterator& __it, const random_access_iterator_tag &) argument
42 { --__it; }
45 void _Decrement(_Iterator& __it, const forward_iterator_tag &) argument
53 void _Advance(_Iterator& __it, ptrdiff_t, const bidirectional_iterator_tag &) argument
57 void _Advance(_Iterator& __it, ptrdiff_t __n, const random_access_iterator_tag &) argument
58 { __it += __n; }
93 bool _Dereferenceable(const _Iterator& __it) argument
94 { return (__it
97 _Incrementable(const _Iterator& __it, ptrdiff_t __n, const forward_iterator_tag &) argument
101 _Incrementable(const _Iterator& __it, ptrdiff_t __n, const bidirectional_iterator_tag &) argument
109 _Incrementable(const _Iterator& __it, ptrdiff_t __n, const random_access_iterator_tag &) argument
138 _DBG_iter_base(const __owned_list* __c, const _Const_iterator& __it) argument
190 _DBG_iter_mid(const _Nonconst_self& __it) argument
193 _DBG_iter_mid(const __owned_list* __c, const _Const_iterator& __it) argument
223 _DBG_iter(const __owned_list* __c, const _Const_iterator& __it) argument
355 operator +(ptrdiff_t __n, const _DBG_iter<_Container, _Traits>& __it) argument
362 _Non_Dbg_iter(_Iterator __it) argument
368 _Non_Dbg_iter(const _DBG_iter<_Container, _Traits>& __it) argument
[all...]
H A D_debug.c47 stlp_in_range_aux(const _Iterator& __it, const _Iterator& __first, argument
49 return ( __it >= __first &&
50 __it < __last);
56 inline bool _STLP_CALL stlp_in_range_aux(_Iterator1 __it, const _Iterator& __first, argument
58 inline bool _STLP_CALL stlp_in_range_aux(const _Iterator1& __it, const _Iterator& __first,
62 for (; __i != __last && __i != __it; ++__i);
69 stlp_in_range_aux(const _Iterator1& __it, const _Iterator& __first, argument
72 for (; __i != __last && __i != __it; ++__i);
96 bool _STLP_CALL __check_range(const _Iterator& __it, argument
98 _STLP_VERBOSE_RETURN(stlp_in_range(__it, __star
146 __invalidate_iterator(const __owned_list* __base, const _Iterator& __it) argument
214 __change_ite_owner(const _Iterator& __it, const __owned_list* __dst) argument
601 _Check_if_owner( const __owned_list * __l, const __owned_link& __it) argument
610 _Check_if_not_owner( const __owned_list * __l, const __owned_link& __it) argument
[all...]
H A D_hashtable.h124 void _Invalidate_iterator(const const_iterator& __it) argument
125 { _STLP_PRIV __invalidate_iterator(&_M_iter_list, __it); }
292 void erase(const const_iterator& __it) { argument
293 _STLP_DEBUG_CHECK(_STLP_PRIV _Dereferenceable(__it))
294 _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __it))
295 _Invalidate_iterator(__it);
296 _M_non_dbg_impl.erase(__it._M_iterator);
H A D_debug.h404 const _Iterator& __it);
412 void _STLP_CALL __change_ite_owner(const _Iterator& __it,
426 const _Iterator& __it)
427 { return __stl_debugger::_Check_if_owner(__owner, (const __owned_link&)__it); }
431 const _Iterator& __it)
432 { return __stl_debugger::_Check_if_not_owner(__owner, (const __owned_link&)__it); }
425 __check_if_owner( const __owned_list* __owner, const _Iterator& __it) argument
430 __check_if_not_owner( const __owned_list* __owner, const _Iterator& __it) argument
H A D_slist.h66 static bool _Check(const _Iterator& __it) argument
67 { return !(__it._M_iterator == (__it._Get_container_ptr())->before_begin()); }
99 void _Invalidate_iterator(const iterator& __it) argument
100 { _STLP_PRIV __invalidate_iterator(&_M_iter_list, __it); }
H A D_deque.h80 void _Invalidate_iterator(const iterator& __it) argument
81 { _STLP_PRIV __invalidate_iterator(&_M_iter_list,__it); }
H A D_tree.h112 void _Invalidate_iterator(const iterator& __it) argument
113 { _STLP_PRIV __invalidate_iterator(&_M_iter_list,__it); }
H A D_vector.h126 void _Invalidate_iterator(const iterator& __it) argument
127 { _STLP_PRIV __invalidate_iterator(&_M_iter_list, __it); }
H A D_list.h83 void _Invalidate_iterator(const iterator& __it) argument
84 { _STLP_PRIV __invalidate_iterator(&_M_iter_list, __it); }
H A D_string.h80 void _Invalidate_iterator(const iterator& __it) argument
81 { _STLP_PRIV __invalidate_iterator(&_M_iter_list, __it); }
/external/stlport/stlport/stl/
H A D_iterator_base.h318 _InputIterator __it(__first);
319 while (__it != __last) {
320 ++__it; ++__n;
331 _ForwardIterator __it(__first);
332 while (__it != __last) {
333 ++__it; ++__n;
343 _BidirectionalIterator __it(__first);
344 while (__it != __last) {
345 ++__it; ++__n;
H A D_unordered_map.h154 iterator __it = _M_ht.find(__key); local
155 return (__it == _M_ht.end() ?
157 (*__it).second );
171 void erase(const_iterator __it) { _M_ht.erase(__it); } argument
331 void erase(const_iterator __it) { _M_ht.erase(__it); } argument
H A D_hashtable.h126 _Ht_iterator(const iterator& __it) : _M_ite(__it._M_ite) {} argument
127 _Ht_iterator(_BaseIte __it) : _M_ite(__it) {} argument
566 void erase(const_iterator __it);
H A D_hash_map.h201 iterator __it = _M_ht.find(__key); local
202 return (__it == _M_ht.end() ?
204 (*__it).second );
219 void erase(iterator __it) { _M_ht.erase(__it); } argument
404 void erase(iterator __it) { _M_ht.erase(__it); } argument
H A D_unordered_set.h157 void erase(const_iterator __it) { _M_ht.erase(__it); } argument
307 void erase(const_iterator __it) { _M_ht.erase(__it); } argument
H A D_hash_set.h213 void erase(iterator __it) { _M_ht.erase(__it); } argument
395 void erase(iterator __it) { _M_ht.erase(__it); } argument
H A D_hashtable.c303 ::erase(const_iterator __it) { argument
304 const size_type __n = _M_bkt_num(*__it);
308 if (__cur == __it._M_ite) {
319 if (__cur == __it._M_ite) {
H A D_tree.c690 for (const_iterator __it = begin(); __it != end(); ++__it) {
691 _Base_ptr __x = __it._M_node;
H A D_tree.h168 _Rb_tree_iterator(const iterator& __it) : _Rb_tree_base_iterator(__it._M_node) {} argument

Completed in 260 milliseconds