| /openbsd/src/gnu/gcc/libstdc++-v3/include/debug/ |
| D | formatter.h | 212 _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 …]
|
| D | hash_multiset.h | 179 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()
|
| D | hash_set.h | 189 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()
|
| D | hash_multimap.h | 198 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()
|
| D | hash_map.h | 214 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()
|
| /openbsd/src/gnu/lib/libstdc++/libstdc++/include/ext/ |
| D | stl_hashtable.h | 137 bool operator==(const iterator& __it) const 138 { return _M_cur == __it._M_cur; } 139 bool operator!=(const iterator& __it) const 140 { return _M_cur != __it._M_cur; } 170 _Hashtable_const_iterator(const iterator& __it) in _Hashtable_const_iterator() 171 : _M_cur(__it._M_cur), _M_ht(__it._M_ht) {} in _Hashtable_const_iterator() 176 bool operator==(const const_iterator& __it) const 177 { return _M_cur == __it._M_cur; } 178 bool operator!=(const const_iterator& __it) const 179 { return _M_cur != __it._M_cur; } [all …]
|
| D | hash_set | 196 void erase(iterator __it) { _M_ht.erase(__it); } 345 void erase(iterator __it) { _M_ht.erase(__it); }
|
| D | hash_map | 195 void erase(iterator __it) { _M_ht.erase(__it); } 353 void erase(iterator __it) { _M_ht.erase(__it); }
|
| /openbsd/src/gnu/gcc/libstdc++-v3/include/ext/ |
| D | hashtable.h | 149 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 …]
|
| D | hash_set | 231 erase(iterator __it) 232 { _M_ht.erase(__it); } 429 erase(iterator __it) 430 { _M_ht.erase(__it); }
|
| D | hash_map | 242 erase(iterator __it) 243 { _M_ht.erase(__it); } 460 erase(iterator __it) 461 { _M_ht.erase(__it); }
|
| /openbsd/src/gnu/lib/libstdc++/libstdc++/include/bits/ |
| D | stl_tree.h | 196 _Rb_tree_iterator(const iterator& __it) { _M_node = __it._M_node; } in _Rb_tree_iterator() 1434 for (const_iterator __it = begin(); __it != end(); ++__it) in __rb_verify() local 1436 _Link_type __x = (_Link_type) __it._M_node; in __rb_verify()
|
| /openbsd/src/gnu/llvm/libcxx/include/experimental/ |
| D | functional | 151 auto __it = __table_.find (__key); 152 return __it == __table_.end() ? __default_value_ : __it->second;
|
| /openbsd/src/gnu/llvm/libcxx/include/ |
| D | __bit_reference | 1149 __bit_iterator(const __bit_iterator<_Cp, false>& __it) _NOEXCEPT 1150 : __seg_(__it.__seg_), __ctz_(__it.__ctz_) {} 1158 __bit_iterator& operator=(const _If<_IsConst, struct __private_nat, __bit_iterator>& __it) { 1159 __seg_ = __it.__seg_; 1160 __ctz_ = __it.__ctz_; 1239 …friend __bit_iterator operator+(difference_type __n, const __bit_iterator& __it) {return __it + __…
|
| D | __hash_table | 1151 _NodeHandle __node_handle_extract(const_iterator __it); 2155 for (typename _Table::iterator __it = __source.begin(); 2156 __it != __source.end();) 2158 __node_pointer __src_ptr = __it.__node_->__upcast(); 2162 auto __prev_iter = __it++; 2209 for (typename _Table::iterator __it = __source.begin(); 2210 __it != __source.end();) 2212 __node_pointer __src_ptr = __it.__node_->__upcast(); 2216 (void)__source.remove(__it++).release();
|
| D | set | 793 node_type extract(const_iterator __it) 795 return __tree_.template __node_handle_extract<node_type>(__it); 1328 node_type extract(const_iterator __it) 1330 return __tree_.template __node_handle_extract<node_type>(__it);
|
| D | deque | 259 __deque_iterator(const __deque_iterator<value_type, _Pp, _Rp, _MP, difference_type, _BS>& __it, 261 : __m_iter_(__it.__m_iter_), __ptr_(__it.__ptr_) {} 341 friend __deque_iterator operator+(difference_type __n, const __deque_iterator& __it) 342 {return __it + __n;}
|
| D | map | 1408 node_type extract(const_iterator __it) 1410 return __tree_.template __node_handle_extract<node_type>(__it.__i_); 2079 node_type extract(const_iterator __it) 2082 __it.__i_);
|
| D | unordered_map | 1390 node_type extract(const_iterator __it) 1393 __it.__i_); 2177 node_type extract(const_iterator __it) 2180 __it.__i_);
|
| D | __tree | 2326 iterator __it = find(__key); 2327 if (__it == end()) 2329 return __node_handle_extract<_NodeHandle>(__it);
|
| D | unordered_set | 737 node_type extract(const_iterator __it) 739 return __table_.template __node_handle_extract<node_type>(__it);
|
| D | list | 1955 bool __iterator_in_range(_Iterator __first, _Iterator __last, _Iterator __it) { 1957 if (__p == __it) {
|
| /openbsd/src/gnu/gcc/libstdc++-v3/include/tr1/ |
| D | hashtable | 1022 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);
|
| /openbsd/src/gnu/gcc/libstdc++-v3/include/bits/ |
| D | stl_tree.h | 244 _Rb_tree_const_iterator(const iterator& __it) in _Rb_tree_const_iterator() 245 : _M_node(__it._M_node) { } in _Rb_tree_const_iterator() 1528 for (const_iterator __it = begin(); __it != end(); ++__it) 1530 _Const_Link_type __x = static_cast<_Const_Link_type>(__it._M_node);
|