Home
last modified time | relevance | path

Searched refs:__it (Results 1 – 12 of 12) sorted by relevance

/freebsd-10-stable/contrib/libstdc++/include/debug/
Dformatter.h212 _Parameter(const _Safe_iterator<_Iterator, _Sequence>& __it,
217 _M_variant._M_iterator._M_address = &__it;
218 _M_variant._M_iterator._M_type = &typeid(__it);
223 _M_variant._M_iterator._M_sequence = __it._M_get_sequence();
226 if (__it._M_singular())
230 bool __is_begin = __it._M_is_begin();
231 bool __is_end = __it._M_is_end();
242 _Parameter(const _Type*& __it, const char* __name, _Is_iterator)
246 _M_variant._M_iterator._M_address = &__it;
247 _M_variant._M_iterator._M_type = &typeid(__it);
[all …]
Dhash_multiset.h179 erase(iterator __it) in erase() argument
181 __glibcxx_check_erase(__it); in erase()
182 __it._M_invalidate(); in erase()
183 _Base::erase(__it.base()); in erase()
Dhash_set.h189 erase(iterator __it) in erase() argument
191 __glibcxx_check_erase(__it); in erase()
192 __it._M_invalidate(); in erase()
193 _Base::erase(__it.base()); in erase()
Dhash_multimap.h198 erase(iterator __it) in erase() argument
200 __glibcxx_check_erase(__it); in erase()
201 __it._M_invalidate(); in erase()
202 _Base::erase(__it.base()); in erase()
Dhash_map.h214 erase(iterator __it) in erase() argument
216 __glibcxx_check_erase(__it); in erase()
217 __it._M_invalidate(); in erase()
218 _Base::erase(__it.base()); in erase()
/freebsd-10-stable/contrib/libstdc++/include/ext/
Dhashtable.h149 operator==(const iterator& __it) const
150 { return _M_cur == __it._M_cur; }
153 operator!=(const iterator& __it) const
154 { return _M_cur != __it._M_cur; }
186 _Hashtable_const_iterator(const iterator& __it) in _Hashtable_const_iterator()
187 : _M_cur(__it._M_cur), _M_ht(__it._M_ht) { } in _Hashtable_const_iterator()
204 operator==(const const_iterator& __it) const
205 { return _M_cur == __it._M_cur; }
208 operator!=(const const_iterator& __it) const
209 { return _M_cur != __it._M_cur; }
[all …]
Dhash_set231 erase(iterator __it)
232 { _M_ht.erase(__it); }
429 erase(iterator __it)
430 { _M_ht.erase(__it); }
Dhash_map242 erase(iterator __it)
243 { _M_ht.erase(__it); }
460 erase(iterator __it)
461 { _M_ht.erase(__it); }
/freebsd-10-stable/contrib/libstdc++/include/tr1/
Dhashtable1022 erase(iterator __it)
1024 iterator __result = __it;
1026 _M_erase_node(__it._M_cur_node, __it._M_cur_bucket);
1039 erase(const_iterator __it)
1041 const_iterator __result = __it;
1043 _M_erase_node(__it._M_cur_node, __it._M_cur_bucket);
/freebsd-10-stable/contrib/libstdc++/include/bits/
Dstl_tree.h246 _Rb_tree_const_iterator(const iterator& __it) in _Rb_tree_const_iterator()
247 : _M_node(__it._M_node) { } in _Rb_tree_const_iterator()
1547 for (const_iterator __it = begin(); __it != end(); ++__it)
1549 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node);
/freebsd-10-stable/contrib/libc++/include/
D__bit_reference1117 __bit_iterator(const __bit_iterator<_Cp, false>& __it) _NOEXCEPT
1118 : __seg_(__it.__seg_), __ctz_(__it.__ctz_) {}
1193 …friend __bit_iterator operator+(difference_type __n, const __bit_iterator& __it) {return __it + __…
Ddeque290 …ue_iterator(const __deque_iterator<value_type, _Pp, _Rp, _MP, difference_type, __block_size>& __it,
292 : __m_iter_(__it.__m_iter_), __ptr_(__it.__ptr_) {}
372 friend __deque_iterator operator+(difference_type __n, const __deque_iterator& __it)
373 {return __it + __n;}