Home
last modified time | relevance | path

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

12345

/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/debug/
H A Dformatter.h267 _Parameter(_Safe_iterator<_Iterator, _Sequence, _Category> const& __it, in _Parameter()
272 _M_variant._M_iterator._M_address = std::__addressof(__it); in _Parameter()
275 __it._S_constant() ? __const_iterator : __mutable_iterator; in _Parameter()
276 _M_variant._M_iterator._M_sequence = __it._M_get_sequence(); in _Parameter()
279 if (__it._M_singular()) in _Parameter()
283 if (__it._M_is_before_begin()) in _Parameter()
285 else if (__it._M_is_end()) in _Parameter()
287 else if (__it._M_is_begin()) in _Parameter()
295 _Parameter(_Safe_local_iterator<_Iterator, _Sequence> const& __it, in _Parameter()
300 _M_variant._M_iterator._M_address = std::__addressof(__it); in _Parameter()
[all …]
H A Dstl_iterator.h52 __can_advance(const std::reverse_iterator<_Iterator>& __it, _Size __n) in __can_advance() argument
53 { return __can_advance(__it.base(), -__n); } in __can_advance()
57 __can_advance(const std::reverse_iterator<_Iterator>& __it, in __can_advance() argument
60 { return __can_advance(__it.base(), __dist, -__way); } in __can_advance()
65 _Iterator, _Sequence, std::random_access_iterator_tag> >& __it) in __base()
66 { return std::reverse_iterator<_Iterator>(__it.base().base()); } in __base()
78 __unsafe(const std::reverse_iterator<_Iterator>& __it)
81 return std::reverse_iterator<_UnsafeType>(__unsafe(__it.base()));
86 __unsafe(const std::reverse_iterator<_Iterator>& __it)
87 -> decltype(std::__make_reverse_iterator(__unsafe(__it.base())))
[all …]
H A Dfunctions.h72 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux4() argument
82 const _Sequence* __seq = __it._M_get_sequence(); in __foreign_iterator_aux4()
102 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux3() argument
108 if (__it._M_get_sequence()->empty()) in __foreign_iterator_aux3()
110 return __foreign_iterator_aux4(__it, std::__addressof(*__other)); in __foreign_iterator_aux3()
128 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux2() argument
131 { return __it._M_get_sequence() != __other._M_get_sequence(); } in __foreign_iterator_aux2()
151 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux2() argument
164 return __foreign_iterator_aux3(__it, __other, __other_end, __tag()); in __foreign_iterator_aux2()
181 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux() argument
[all …]
H A Dforward_list76 this->_M_invalidate_if([this](_Base_const_iterator __it)
78 return __it != _M_this()._M_base().cbefore_begin()
79 && __it != _M_this()._M_base().cend(); });
381 this->_M_invalidate_if([this](_Base_const_iterator __it)
382 { return __it == this->_M_base().cbegin(); });
450 this->_M_invalidate_if([__next](_Base_const_iterator __it)
451 { return __it == __next; });
474 this->_M_invalidate_if([__victim](_Base_const_iterator __it)
475 { return __it == __victim; });
502 this->_M_invalidate_if([__victim](_Base_const_iterator __it)
[all …]
H A Dunordered_map320 auto __it = _Base::emplace_hint(__hint.base(),
323 return { __it, this };
363 auto __it = _Base::insert(__hint.base(), __obj);
365 return { __it, this };
375 auto __it = _Base::insert(__hint.base(), std::move(__x));
377 return { __it, this };
388 auto __it = _Base::insert(__hint.base(), std::forward<_Pair>(__obj));
390 return { __it, this };
572 erase(const_iterator __it)
574 __glibcxx_check_erase(__it);
[all …]
H A Dsafe_unordered_container.h71 [__local_end](__decltype(__local_end) __it) in _M_invalidate_locals()
72 { return __it != __local_end; }); in _M_invalidate_locals()
79 this->_M_invalidate_if([__end](__decltype(__end) __it) in _M_invalidate_all()
80 { return __it != __end; }); in _M_invalidate_all()
H A Dunordered_set314 auto __it = _Base::emplace_hint(__hint.base(),
317 return { __it, this };
334 auto __it = _Base::insert(__hint.base(), __obj);
336 return { __it, this };
353 auto __it = _Base::insert(__hint.base(), std::move(__obj));
355 return { __it, this };
457 erase(const_iterator __it)
459 __glibcxx_check_erase(__it);
460 return { _M_erase(__it.base()), this };
464 erase(iterator __it)
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/debug/
H A Dformatter.h267 _Parameter(_Safe_iterator<_Iterator, _Sequence, _Category> const& __it, in _Parameter()
272 _M_variant._M_iterator._M_address = std::__addressof(__it); in _Parameter()
275 __it._S_constant() ? __const_iterator : __mutable_iterator; in _Parameter()
276 _M_variant._M_iterator._M_sequence = __it._M_get_sequence(); in _Parameter()
279 if (__it._M_singular()) in _Parameter()
283 if (__it._M_is_before_begin()) in _Parameter()
285 else if (__it._M_is_end()) in _Parameter()
287 else if (__it._M_is_begin()) in _Parameter()
295 _Parameter(_Safe_local_iterator<_Iterator, _Sequence> const& __it, in _Parameter()
300 _M_variant._M_iterator._M_address = std::__addressof(__it); in _Parameter()
[all …]
H A Dstl_iterator.h52 __can_advance(const std::reverse_iterator<_Iterator>& __it, _Size __n) in __can_advance() argument
53 { return __can_advance(__it.base(), -__n); } in __can_advance()
57 __can_advance(const std::reverse_iterator<_Iterator>& __it, in __can_advance() argument
60 { return __can_advance(__it.base(), __dist, -__way); } in __can_advance()
65 _Iterator, _Sequence, std::random_access_iterator_tag> >& __it) in __base()
66 { return std::reverse_iterator<_Iterator>(__it.base().base()); } in __base()
78 __unsafe(const std::reverse_iterator<_Iterator>& __it)
81 return std::reverse_iterator<_UnsafeType>(__unsafe(__it.base()));
86 __unsafe(const std::reverse_iterator<_Iterator>& __it)
87 -> decltype(std::__make_reverse_iterator(__unsafe(__it.base())))
[all …]
H A Dfunctions.h72 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux4() argument
82 const _Sequence* __seq = __it._M_get_sequence(); in __foreign_iterator_aux4()
102 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux3() argument
108 if (__it._M_get_sequence()->empty()) in __foreign_iterator_aux3()
110 return __foreign_iterator_aux4(__it, std::__addressof(*__other)); in __foreign_iterator_aux3()
128 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux2() argument
131 { return __it._M_get_sequence() != __other._M_get_sequence(); } in __foreign_iterator_aux2()
151 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux2() argument
164 return __foreign_iterator_aux3(__it, __other, __other_end, __tag()); in __foreign_iterator_aux2()
181 const _Safe_iterator<_Iterator, _Sequence, _Category>& __it, in __foreign_iterator_aux() argument
[all …]
H A Dforward_list76 this->_M_invalidate_if([this](_Base_const_iterator __it)
78 return __it != _M_this()._M_base().cbefore_begin()
79 && __it != _M_this()._M_base().cend(); });
381 this->_M_invalidate_if([this](_Base_const_iterator __it)
382 { return __it == this->_M_base().cbegin(); });
450 this->_M_invalidate_if([__next](_Base_const_iterator __it)
451 { return __it == __next; });
474 this->_M_invalidate_if([__victim](_Base_const_iterator __it)
475 { return __it == __victim; });
502 this->_M_invalidate_if([__victim](_Base_const_iterator __it)
[all …]
H A Dunordered_map320 auto __it = _Base::emplace_hint(__hint.base(),
323 return { __it, this };
363 auto __it = _Base::insert(__hint.base(), __obj);
365 return { __it, this };
375 auto __it = _Base::insert(__hint.base(), std::move(__x));
377 return { __it, this };
388 auto __it = _Base::insert(__hint.base(), std::forward<_Pair>(__obj));
390 return { __it, this };
572 erase(const_iterator __it)
574 __glibcxx_check_erase(__it);
[all …]
H A Dsafe_unordered_container.h71 [__local_end](__decltype(__local_end) __it) in _M_invalidate_locals()
72 { return __it != __local_end; }); in _M_invalidate_locals()
79 this->_M_invalidate_if([__end](__decltype(__end) __it) in _M_invalidate_all()
80 { return __it != __end; }); in _M_invalidate_all()
H A Dunordered_set314 auto __it = _Base::emplace_hint(__hint.base(),
317 return { __it, this };
334 auto __it = _Base::insert(__hint.base(), __obj);
336 return { __it, this };
353 auto __it = _Base::insert(__hint.base(), std::move(__obj));
355 return { __it, this };
457 erase(const_iterator __it)
459 __glibcxx_check_erase(__it);
460 return { _M_erase(__it.base()), this };
464 erase(iterator __it)
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/
H A Dpredefined_ops.h66 operator()(_Iterator __it, _Value& __val) const in operator()
67 { return *__it < __val; } in operator()
95 operator()(_Value& __val, _Iterator __it) const in operator()
96 { return __val < *__it; } in operator()
128 operator()(_Iterator __it, _Value& __val) const in operator()
129 { return *__it == __val; } in operator()
193 operator()(_Iterator __it, _Value& __val) in operator()
194 { return bool(_M_comp(*__it, __val)); } in operator()
237 operator()(_Value& __val, _Iterator __it) in operator()
238 { return bool(_M_comp(__val, *__it)); } in operator()
[all …]
H A Dregex_automaton.tcc165 for (auto __it : this->_M_paren_stack) in _M_insert_backref()
166 if (__index == __it) in _M_insert_backref()
180 for (auto& __it : *this) in _M_eliminate_dummy()
182 while (__it._M_next >= 0 && (*this)[__it._M_next]._M_opcode() in _M_eliminate_dummy()
184 __it._M_next = (*this)[__it._M_next]._M_next; in _M_eliminate_dummy()
185 if (__it._M_has_alt()) in _M_eliminate_dummy()
186 while (__it._M_alt >= 0 && (*this)[__it._M_alt]._M_opcode() in _M_eliminate_dummy()
188 __it._M_alt = (*this)[__it._M_alt]._M_next; in _M_eliminate_dummy()
218 for (auto __it : __m) in _M_clone() local
220 auto __v = __it.second; in _M_clone()
H A Dregex.tcc86 for (auto& __it : __res) in __regex_algo_impl() local
87 if (!__it.matched) in __regex_algo_impl()
88 __it.first = __it.second = __e; in __regex_algo_impl()
266 for (const auto& __it : __collatenames) in lookup_collatename() local
267 if (__s == __it) in lookup_collatename()
269 static_cast<char>(&__it - __collatenames))); in lookup_collatename()
310 for (const auto& __it : __classnames) in lookup_classname() local
311 if (__s == __it.first) in lookup_classname()
314 && ((__it.second in lookup_classname()
317 return __it.second; in lookup_classname()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/
H A Dpredefined_ops.h66 operator()(_Iterator __it, _Value& __val) const in operator()
67 { return *__it < __val; } in operator()
95 operator()(_Value& __val, _Iterator __it) const in operator()
96 { return __val < *__it; } in operator()
128 operator()(_Iterator __it, _Value& __val) const in operator()
129 { return *__it == __val; } in operator()
193 operator()(_Iterator __it, _Value& __val) in operator()
194 { return bool(_M_comp(*__it, __val)); } in operator()
237 operator()(_Value& __val, _Iterator __it) in operator()
238 { return bool(_M_comp(__val, *__it)); } in operator()
[all …]
H A Dregex_automaton.tcc165 for (auto __it : this->_M_paren_stack) in _M_insert_backref()
166 if (__index == __it) in _M_insert_backref()
180 for (auto& __it : *this) in _M_eliminate_dummy()
182 while (__it._M_next >= 0 && (*this)[__it._M_next]._M_opcode() in _M_eliminate_dummy()
184 __it._M_next = (*this)[__it._M_next]._M_next; in _M_eliminate_dummy()
185 if (__it._M_has_alt()) in _M_eliminate_dummy()
186 while (__it._M_alt >= 0 && (*this)[__it._M_alt]._M_opcode() in _M_eliminate_dummy()
188 __it._M_alt = (*this)[__it._M_alt]._M_next; in _M_eliminate_dummy()
218 for (auto __it : __m) in _M_clone() local
220 auto __v = __it.second; in _M_clone()
H A Dregex.tcc86 for (auto& __it : __res) in __regex_algo_impl() local
87 if (!__it.matched) in __regex_algo_impl()
88 __it.first = __it.second = __e; in __regex_algo_impl()
266 for (const auto& __it : __collatenames) in lookup_collatename() local
267 if (__s == __it) in lookup_collatename()
269 static_cast<char>(&__it - __collatenames))); in lookup_collatename()
310 for (const auto& __it : __classnames) in lookup_classname() local
311 if (__s == __it.first) in lookup_classname()
314 && ((__it.second in lookup_classname()
317 return __it.second; in lookup_classname()
[all …]
H A Diterator_concepts.h292 concept __cpp17_iterator = requires(_Iter __it) in _GLIBCXX_VISIBILITY()
294 { *__it } -> __can_reference; in _GLIBCXX_VISIBILITY()
295 { ++__it } -> same_as<_Iter&>; in _GLIBCXX_VISIBILITY()
296 { *__it++ } -> __can_reference; in _GLIBCXX_VISIBILITY()
302 && requires(_Iter __it) in _GLIBCXX_VISIBILITY()
308 typename common_reference_t<decltype(*__it++)&&, in _GLIBCXX_VISIBILITY()
320 && requires(_Iter __it) in _GLIBCXX_VISIBILITY()
322 { __it++ } -> convertible_to<const _Iter&>; in _GLIBCXX_VISIBILITY()
323 { *__it++ } -> same_as<iter_reference_t<_Iter>>; in _GLIBCXX_VISIBILITY()
328 && requires(_Iter __it) in _GLIBCXX_VISIBILITY()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/parallel/
H A Dlist_partition.h117 _IIter __prev = __begin, __it = __begin; variable
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;
133 __os_starts[__cur] = __it;
138 if (__it == __end)
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/parallel/
H A Dlist_partition.h117 _IIter __prev = __begin, __it = __begin; variable
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;
133 __os_starts[__cur] = __it;
138 if (__it == __end)
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/experimental/
H A Dio_context311 for (auto __it = _M_queue.begin(), __end = __last; __it != __end;
312 ++__it)
314 if (__it->_M_key == __t._M_key.get())
316 __it->cancel();
317 __last = __it;
333 for (auto __it = _M_queue.begin(); __it != __end; ++__it)
334 if (__it->_M_key == __t._M_key.get())
335 if (__oldest == __end || __it->_M_id < __oldest->_M_id)
336 __oldest = __it;
423 iterator erase(iterator __it) { return this->c.erase(__it); }
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/experimental/
H A Dio_context311 for (auto __it = _M_queue.begin(), __end = __last; __it != __end;
312 ++__it)
314 if (__it->_M_key == __t._M_key.get())
316 __it->cancel();
317 __last = __it;
333 for (auto __it = _M_queue.begin(); __it != __end; ++__it)
334 if (__it->_M_key == __t._M_key.get())
335 if (__oldest == __end || __it->_M_id < __oldest->_M_id)
336 __oldest = __it;
423 iterator erase(iterator __it) { return this->c.erase(__it); }
[all …]

12345