Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dcounted.h46 __go(_It __it, in __go()
47 …iter_difference_t<_It> __count) noexcept(noexcept(span(std::to_address(__it), static_cast<size_t>(… in __go()
50 return span(std::to_address(__it), static_cast<size_t>(__count)); in __go()
54 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_It __it, iter_difference_t<_It> __count) noexcep…
55 noexcept(subrange(__it, __it + __count))) -> decltype(subrange(__it, __it + __count)) {
56 return subrange(__it, __it + __count);
60 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_It __it, iter_difference_t<_It> __count) noexcep…
61 noexcept(subrange(counted_iterator(std::move(__it), __count), default_sentinel)))
62 -> decltype(subrange(counted_iterator(std::move(__it), __count), default_sentinel)) {
63 return subrange(counted_iterator(std::move(__it), __count), default_sentinel);
[all …]
H A Dfilter_view.h198 iter_move(__iterator const& __it) noexcept(noexcept(ranges::iter_move(__it.__current_))) {
199 return ranges::iter_move(__it.__current_);
H A Dsplit_view.h67 _LIBCPP_HIDE_FROM_ABI constexpr subrange<iterator_t<_View>> __find_next(iterator_t<_View> __it) { in __find_next() argument
68 auto [__begin, __end] = ranges::search(subrange(__it, ranges::end(__base_)), __pattern_); in __find_next()
H A Dzip_view.h441 __iter_current(zip_view<_Views...>::__iterator<_OtherConst> const& __it) {
442 return (__it.__current_);
/freebsd/contrib/llvm-project/libcxx/include/__chrono/
H A Dtzdb.h52 if (auto __it = ranges::lower_bound(links, __name, {}, &time_zone_link::name); in __locate_zone() local
53 __it != links.end() && __it->name() == __name) in __locate_zone()
54 if (const time_zone* __result = __find_in_zone(__it->target())) in __locate_zone()
73 if (auto __it = ranges::lower_bound(zones, __name, {}, &time_zone::name); in __find_in_zone() local
74 __it != zones.end() && __it->name() == __name) in __find_in_zone()
75 return std::addressof(*__it); in __find_in_zone()
H A Dformatter.h247 for (auto __it = __chrono_specs.begin(); __it != __chrono_specs.end(); ++__it) { in __format_chrono_using_chrono_specs() local
248 if (*__it == _CharT('%')) { in __format_chrono_using_chrono_specs()
249 auto __s = __it; in __format_chrono_using_chrono_specs()
250 ++__it; in __format_chrono_using_chrono_specs()
253 switch (*__it) { in __format_chrono_using_chrono_specs()
261 __sstr << *__it; in __format_chrono_using_chrono_specs()
271 …_sstr}, __sstr, _CharT(' '), std::addressof(__t), std::to_address(__s), std::to_address(__it + 1)); in __format_chrono_using_chrono_specs()
283 …_sstr}, __sstr, _CharT(' '), std::addressof(__t), std::to_address(__s), std::to_address(__it + 1)); in __format_chrono_using_chrono_specs()
312 …_sstr}, __sstr, _CharT(' '), std::addressof(__t), std::to_address(__s), std::to_address(__it + 1)); in __format_chrono_using_chrono_specs()
380 if (*(__it + 1) == 'S') { in __format_chrono_using_chrono_specs()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dlower_bound.h69 auto __it = __first; in __lower_bound_onesided() local
70 auto __dist = __step - _IterOps<_AlgPolicy>::__advance_to(__it, __step, __last); in __lower_bound_onesided()
73 if (__it == __last || !std::__invoke(__comp, std::__invoke(__proj, *__it), __value)) { in __lower_bound_onesided()
77 return __it; in __lower_bound_onesided()
81 __first = __it; in __lower_bound_onesided()
H A Dranges_find_last.h48 for (auto __it = ranges::prev(__last_it); __it != __first; --__it) { in __find_last_impl() local
49 if (__pred(std::invoke(__proj, *__it))) { in __find_last_impl()
50 return subrange<_Iter>(std::move(__it), std::move(__last_it)); in __find_last_impl()
H A Diterator_operations.h149 next(_Iter&& __it, typename iterator_traits<__remove_cvref_t<_Iter> >::difference_type __n = 1) {
150 return std::next(std::forward<_Iter>(__it), __n);
H A Dsort.h503 _RandomAccessIterator __it = __first + __tz_left;
504 if (__it != __lm1) {
505 _Ops::iter_swap(__it, __lm1);
516 _RandomAccessIterator __it = __lm1 - __tz_right;
517 if (__it != __first) {
518 _Ops::iter_swap(__it, __first);
/freebsd/contrib/llvm-project/libcxx/src/experimental/
H A Dtime_zone.cpp437 for (auto __it = __rules.begin(); __it != __rules.end(); ++__it) { in __next_rule() local
438 for (year __y = __it->__from; __y <= __it->__to; ++__y) { in __next_rule()
441 if (__y == __year && __it == __current) in __next_rule()
444 sys_seconds __t = chrono::__rule_to_sys_seconds(__stdoff, __save, *__it, __y); in __next_rule()
449 __candidates[__t] = __it; in __next_rule()
455 auto __it = __candidates.begin(); in __next_rule() local
460 return *__it; in __next_rule()
471 while (__it != __candidates.end()) { in __next_rule()
472 …if (__current->__save.__time != __it->second->__save.__time || __current->__letters != __it->secon… in __next_rule()
473 return *__it; in __next_rule()
[all …]
H A Dtzdb.cpp528 if (auto __it = ranges::find(__rules, __name, [](const auto& __r) { return __r.first; }); in __create_entry() local
529 __it != ranges::end(__rules)) in __create_entry()
530 return __it->second.emplace_back(); in __create_entry()
/freebsd/contrib/llvm-project/libcxx/include/__filesystem/
H A Dpath_iterator.h69 iterator __it(*this);
71 return __it;
82 iterator __it(*this);
84 return __it;
/freebsd/contrib/llvm-project/libcxx/include/__format/
H A Dparser_std_format_spec.h1125 auto __it = __str.begin();
1126 if (__format_spec::__is_ascii(*__it)) {
1129 ++__it;
1130 if (__it == __str.end())
1134 if (__format_spec::__is_ascii(*__it))
1135 return {static_cast<size_t>(__it - __str.begin()), __it};
1139 } while (__format_spec::__is_ascii(*__it));
1140 --__it;
1144 ptrdiff_t __ascii_size = __it - __str.begin();
1146 … __detail::__estimate_column_width_grapheme_clustering(__it, __str.end(), __maximum, __rounding);
H A Dformat_context.h100 _LIBCPP_HIDE_FROM_ABI void advance_to(iterator __it) { __out_it_ = std::move(__it); } in _LIBCPP_PREFERRED_NAME()
200 _LIBCPP_HIDE_FROM_ABI void advance_to(iterator __it) { __out_it_ = std::move(__it); } in advance_to() argument
H A Dformat_parse_context.h46 _LIBCPP_HIDE_FROM_ABI constexpr void advance_to(const_iterator __it) { __begin_ = __it; } in begin()
52 advance_to(const_iterator __it) advance_to() argument
/freebsd/contrib/llvm-project/libcxx/include/
H A Dsyncstream176 auto __it = __get_it(__ptr);
177 if (__it->second.__count == 1)
178 __lut_.erase(__it);
180 --__it->second.__count;
204 auto __it = __lut_.find(reinterpret_cast<uintptr_t>(__ptr));
205 return __it != __lut_.end() ? __it->second.__count : 0;
225 auto __it = __lut_.find(reinterpret_cast<uintptr_t>(__ptr));
226 …_LIBCPP_ASSERT_INTERNAL(__it != __lut_.end(), "using a wrapped streambuf that has not been registe…
227 _LIBCPP_ASSERT_INTERNAL(__it->second.__count >= 1, "found an inactive streambuf wrapper");
228 return __it;
H A Ddeque296 …__deque_iterator(const __deque_iterator<value_type, _Pp, _Rp, _MP, difference_type, _BS>& __it) _N…
297 : __m_iter_(__it.__m_iter_),
298 __ptr_(__it.__ptr_) {}
362 …IDE_FROM_ABI friend __deque_iterator operator+(difference_type __n, const __deque_iterator& __it) {
363 return __it + __n;
1088 for (__map_const_iterator __it = __map_.begin(); __it != __map_.end(); ++__it) {
1090 std::__to_address(*__it),
1091 std::__to_address(*__it),
1092 std::__to_address(*__it),
1093 std::__to_address(*__it + __block_size)))
[all …]
H A D__bit_reference818 …_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator(const __bit_iterator<_Cp, false>& __it) _NOEXCEPT
819 : __seg_(__it.__seg_),
820 __ctz_(__it.__ctz_) {}
828 operator=(const _If<_IsConst, struct __private_nat, __bit_iterator>& __it) {
829 __seg_ = __it.__seg_;
830 __ctz_ = __it.__ctz_;
899 operator+(difference_type __n, const __bit_iterator& __it) {
900 return __it + __n;
/freebsd/contrib/llvm-project/libcxx/include/__memory/
H A Duninitialized_algorithms.h479 __uninitialized_allocator_fill_n_multidimensional(_Alloc& __alloc, _BidirIter __it, _Size __n, _Tp … in __uninitialized_allocator_fill_n_multidimensional() argument
482 _BidirIter __begin = __it; in __uninitialized_allocator_fill_n_multidimensional()
486 …xception_guard([&]() { std::__allocator_destroy_multidimensional(__value_alloc, __begin, __it); }); in __uninitialized_allocator_fill_n_multidimensional()
487 for (; __n != 0; --__n, ++__it) { in __uninitialized_allocator_fill_n_multidimensional()
488 std::__allocator_construct_at_multidimensional(__value_alloc, std::addressof(*__it), __value); in __uninitialized_allocator_fill_n_multidimensional()
497 __uninitialized_allocator_value_construct_n_multidimensional(_Alloc& __alloc, _BidirIter __it, _Siz… in __uninitialized_allocator_value_construct_n_multidimensional() argument
500 _BidirIter __begin = __it; in __uninitialized_allocator_value_construct_n_multidimensional()
504 …xception_guard([&]() { std::__allocator_destroy_multidimensional(__value_alloc, __begin, __it); }); in __uninitialized_allocator_value_construct_n_multidimensional()
505 for (; __n != 0; --__n, ++__it) { in __uninitialized_allocator_value_construct_n_multidimensional()
506 std::__allocator_construct_at_multidimensional(__value_alloc, std::addressof(*__it)); in __uninitialized_allocator_value_construct_n_multidimensional()
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Dbounded_iter.h259 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR __bounded_iter<_It> __make_bounded_iter(_It __it, _It __beg… in __make_bounded_iter() argument
260 return __bounded_iter<_It>(std::move(__it), std::move(__begin), std::move(__end)); in __make_bounded_iter()
274 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR static element_type* to_address(pointer __it) _NOEXCEPT {
275 return std::__to_address(__it.__current_);
H A Dconcepts.h134 … input_or_output_iterator<_Ip> && indirectly_writable<_Ip, _Tp> && requires(_Ip __it, _Tp&& __t) { in requires() argument
135 *__it++ = std::forward<_Tp>(__t); // not required to be equality-preserving in requires()
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h57 auto __it = __table_.find(__key);
58 return __it == __table_.end() ? __default_value_ : __it->second; in _BMSkipTable()
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dunseq_backend_simd.h
H A Dalgorithm_impl.h

12