/haiku-buildtools/gcc/libstdc++-v3/include/profile/impl/ |
H A D | profiler_algos.h | 45 typename _Container::iterator __it = __output.begin(); local 56 if (__it == __output.end()) 59 if (*__it < __value) 62 ++__it; 66 __output.insert(__it, __value); 76 typename _Container::const_iterator __it; local 77 for (__it = __input.begin(); __it != __input.end(); ++__it) 78 __insert_top_n(__output, *__it, __ [all...] |
H A D | profiler_node.h | 87 __stack_npt::const_iterator __it; 88 for (__it = __stack->begin(); __it != __stack->end(); ++__it) 89 std::fprintf(__f, "%p ", *__it); 103 __stack_npt::const_iterator __it; local 104 for (__it = __s->begin(); __it != __s->end(); ++__it) 105 __index += reinterpret_cast<std::size_t>(*__it); [all...] |
H A D | profiler_trace.h | 201 for (typename __stack_table_t::iterator __it 202 = __stack_table.begin(); __it != __stack_table.end(); ++__it) 203 delete __it->first; 298 for (typename __stack_table_t::iterator __it 299 = __stack_table.begin(); __it != __stack_table.end(); ++__it) 300 if (__it->second.__is_valid()) 304 __gnu_profile::__write(__f, __it->first); 306 __it 580 __env_t::iterator __it local [all...] |
/haiku-buildtools/gcc/libstdc++-v3/include/debug/ |
H A D | safe_unordered_container.h | 71 [__local_end](__decltype(_M_cont()._M_base().cend(0)) __it) 72 { return __it != __local_end; }); 80 [__end](__decltype(_M_cont()._M_base().cend()) __it) 81 { return __it != __end; });
|
H A D | formatter.h | 215 _Parameter(const _Safe_iterator<_Iterator, _Sequence>& __it, argument 220 _M_variant._M_iterator._M_address = &__it; 222 _M_variant._M_iterator._M_type = &typeid(__it); 230 _M_variant._M_iterator._M_sequence = __it._M_get_sequence(); 237 if (__it._M_singular()) 241 if (__it._M_is_before_begin()) 243 else if (__it._M_is_end()) 245 else if (__it._M_is_begin()) 253 _Parameter(const _Safe_local_iterator<_Iterator, _Sequence>& __it, argument 258 _M_variant._M_iterator._M_address = &__it; 289 _Parameter(const _Type*& __it, const char* __name, _Is_iterator) argument 306 _Parameter(_Type*& __it, const char* __name, _Is_iterator) argument 323 _Parameter(const _Iterator& __it, const char* __name, _Is_iterator) argument 381 _M_iterator(const _Iterator& __it, const char* __name = 0) const argument [all...] |
H A D | safe_unordered_base.h | 164 _M_attach_local(_Safe_iterator_base* __it, bool __constant); 168 _M_attach_local_single(_Safe_iterator_base* __it, bool __constant) throw (); 172 _M_detach_local(_Safe_iterator_base* __it); 176 _M_detach_local_single(_Safe_iterator_base* __it) throw ();
|
H A D | safe_base.h | 246 _M_attach(_Safe_iterator_base* __it, bool __constant); 250 _M_attach_single(_Safe_iterator_base* __it, bool __constant) throw (); 254 _M_detach(_Safe_iterator_base* __it); 258 _M_detach_single(_Safe_iterator_base* __it) throw ();
|
H A D | functions.h | 184 __foreign_iterator_aux4(const _Safe_iterator<_Iterator, _Sequence>& __it, argument 194 const _Sequence* __seq = __it._M_get_sequence(); 211 __foreign_iterator_aux3(const _Safe_iterator<_Iterator, _Sequence>& __it, argument 218 if (__it._M_get_sequence()->begin() == __it._M_get_sequence()->end()) 220 return __foreign_iterator_aux4(__it, std::__addressof(*__other)); 234 __foreign_iterator_aux2(const _Safe_iterator<_Iterator, _Sequence>& __it, argument 237 { return __it._M_get_sequence() != __other._M_get_sequence(); } 243 __foreign_iterator_aux2(const _Safe_iterator<_Iterator, _Sequence>& __it, argument 251 __foreign_iterator_aux2(const _Safe_iterator<_Iterator, _Sequence>& __it, argument 279 __foreign_iterator_aux(const _Safe_iterator<_Iterator, _Sequence>& __it, _InputIterator __other, _InputIterator __other_end, std::__false_type) argument 290 __foreign_iterator(const _Safe_iterator<_Iterator, _Sequence>& __it, _InputIterator __other, _InputIterator __other_end) argument 558 __base(_Iterator __it) argument [all...] |
H A D | safe_iterator.h | 54 _S_Is_Beginnest(const _Safe_iterator<_Iterator, _Sequence>& __it) argument 55 { return __it.base() == __it._M_get_sequence()->_M_base().begin(); }
|
/haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
H A D | predefined_ops.h | 54 operator()(_Iterator __it, _Value& __val) const argument 55 { return *__it < __val; } 70 operator()(_Value& __val, _Iterator __it) const 71 { return __val < *__it; } 98 operator()(_Iterator __it, _Value& __val) const argument 99 { return *__it == __val; } 143 operator()(_Iterator __it, _Value& __val) argument 144 { return bool(_M_comp(*__it, __val)); } 168 operator()(_Value& __val, _Iterator __it) argument 169 { return bool(_M_comp(__val, *__it)); } 193 operator ()(_Iterator __it) argument 219 __iter_comp_iter(_Iter_equal_to_iter, _Iterator __it) argument 233 operator ()(_Iterator __it) argument 254 operator ()(_Iterator __it) argument 281 __iter_comp_iter(_Iter_comp_iter<_Compare> __comp, _Iterator __it) argument 295 operator ()(_Iterator __it) argument [all...] |
H A D | regex_scanner.h | 116 auto __it = _M_escape_tbl; local 117 for (; __it->first != '\0'; ++__it) 118 if (__it->first == __c) 119 return &__it->second;
|
H A D | stl_iterator_base_types.h | 215 static iterator_type _S_base(_Iterator __it) argument 216 { return __it; } 223 static iterator_type _S_base(_Iterator __it) argument 224 { return __it.base(); }
|
/haiku-buildtools/gcc/libstdc++-v3/src/filesystem/ |
H A D | path.cc | 158 auto __it = _M_cmpts.begin(); local 159 if (__it->_M_type == _Type::_Root_name) 160 ++__it; 161 if (__it != _M_cmpts.end() && __it->_M_type == _Type::_Root_dir) 162 __ret = *__it; 176 auto __it = _M_cmpts.begin(); local 177 if (__it->_M_type == _Type::_Root_name) 179 __ret = *__it++; 180 if (__it ! 200 auto __it = _M_cmpts.begin(); local 242 auto __it = _M_cmpts.begin(); local 272 auto __it = _M_cmpts.begin(); local [all...] |
/haiku-buildtools/gcc/libstdc++-v3/include/parallel/ |
H A D | list_partition.h | 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 90 * @param __f Functor to be applied to each element by traversing __it 117 _IIter __prev = __begin, __it = __begin; local 122 while (__it != __end) 125 for (; __cur < __os_starts.size() and __it != __end; ++__cur) 128 __dist < __dist_limit and __it != __end; ++__dist) 130 __f(__it); 131 ++__it; [all...] |
/haiku-buildtools/gcc/libstdc++-v3/src/c++11/ |
H A D | debug.cc | 266 _M_attach(_Safe_iterator_base* __it, bool __constant) 269 _M_attach_single(__it, __constant); 274 _M_attach_single(_Safe_iterator_base* __it, bool __constant) throw () 278 __it->_M_next = __its; 279 if (__it->_M_next) 280 __it->_M_next->_M_prior = __it; 281 __its = __it; 286 _M_detach(_Safe_iterator_base* __it) argument 288 // Remove __it fro 295 _M_detach_single(_Safe_iterator_base* __it) argument 501 _M_detach_local(_Safe_iterator_base* __it) argument 510 _M_detach_local_single(_Safe_iterator_base* __it) argument [all...] |
/haiku-buildtools/gcc/libstdc++-v3/include/profile/ |
H A D | unordered_base.h | 245 auto __it = __uc.begin(); local 246 while (__it != __uc.end()) 248 auto __bkt = __get_bucket_index(__uc, __it._M_cur); 251 for (++__it, ++__lit; __lit != __lend; ++__it, ++__lit) 274 auto __it = __uc.begin(); local 275 while (__it != __uc.end()) 277 auto __bkt = __get_bucket_index(__uc, __it._M_cur); 280 auto __pit = __it; 282 for (++__it, [all...] |
/haiku-buildtools/gcc/libstdc++-v3/config/locale/gnu/ |
H A D | messages_members.cc | 67 for (vector<Catalog_info*>::iterator __it = _M_infos.begin(); 68 __it != _M_infos.end(); ++__it) 69 delete *__it;
|
/haiku-buildtools/legacy/gcc/libstdc++/stl/ |
H A D | stl_hashtable.h | 100 bool operator==(const iterator& __it) const 101 { return _M_cur == __it._M_cur; } 102 bool operator!=(const iterator& __it) const 103 { return _M_cur != __it._M_cur; } 133 _Hashtable_const_iterator(const iterator& __it) argument 134 : _M_cur(__it._M_cur), _M_ht(__it._M_ht) {} 141 bool operator==(const const_iterator& __it) const 142 { return _M_cur == __it._M_cur; } 143 bool operator!=(const const_iterator& __it) cons 846 erase(const iterator& __it) argument 910 erase(const const_iterator& __it) argument [all...] |
H A D | stl_hash_map.h | 193 void erase(iterator __it) { _M_ht.erase(__it); } argument 373 void erase(iterator __it) { _M_ht.erase(__it); } argument
|
H A D | stl_hash_set.h | 187 void erase(iterator __it) { _M_ht.erase(__it); } argument 359 void erase(iterator __it) { _M_ht.erase(__it); } argument
|
H A D | stl_tree.h | 165 _Rb_tree_iterator(const iterator& __it) { _M_node = __it._M_node; } argument 1279 for (const_iterator __it = begin(); __it != end(); ++__it) { 1280 _Link_type __x = (_Link_type) __it._M_node;
|
/haiku-buildtools/gcc/libstdc++-v3/include/backward/ |
H A D | hashtable.h | 145 operator==(const iterator& __it) const 146 { return _M_cur == __it._M_cur; } 149 operator!=(const iterator& __it) const 150 { return _M_cur != __it._M_cur; } 182 _Hashtable_const_iterator(const iterator& __it) argument 183 : _M_cur(__it._M_cur), _M_ht(__it._M_ht) { } 200 operator==(const const_iterator& __it) const 201 { return _M_cur == __it._M_cur; } 204 operator!=(const const_iterator& __it) cons 940 erase(const iterator& __it) argument 1015 erase(const const_iterator& __it) argument [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tree-ssa/ |
H A D | pr22444.C | 101 _Rb_tree_const_iterator(const iterator& __it) : _M_node(__it._M_node) { } argument
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | 20070621-1.C | 37 static const _Iterator& __b(const _Iterator& __it) { argument 38 return __it;
|
/haiku-buildtools/gcc/libstdc++-v3/include/tr1/ |
H A D | hashtable.h | 1000 erase(iterator __it) argument 1002 iterator __result = __it; 1004 _M_erase_node(__it._M_cur_node, __it._M_cur_bucket); 1017 erase(const_iterator __it) argument 1019 const_iterator __result = __it; 1021 _M_erase_node(__it._M_cur_node, __it._M_cur_bucket);
|