Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/libcxx/include/__ranges/
H A Dcounted.h46 __go(_It __it, in __go()
50 return span(std::to_address(__it), static_cast<size_t>(__count)); in __go()
55 __go(_It __it, iter_difference_t<_It> __count) noexcept(noexcept(subrange(__it, __it + __count)))
56 -> decltype(subrange(__it, __it + __count)) {
57 return subrange(__it, __it + __count);
62 noexcept(subrange(counted_iterator(std::move(__it), __count), default_sentinel)))
63 -> decltype(subrange(counted_iterator(std::move(__it), __count), default_sentinel)) {
64 return subrange(counted_iterator(std::move(__it), __count), default_sentinel);
70 noexcept(noexcept(__go(std::forward<_It>(__it), std::forward<_Diff>(__count))))
71 -> decltype(__go(std::forward<_It>(__it), std::forward<_Diff>(__count))) {
[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.h440 __iter_current(zip_view<_Views...>::__iterator<_OtherConst> const& __it) {
441 return (__it.__current_);
/freebsd-14.2/contrib/llvm-project/libcxx/include/__filesystem/
H A Dpath_iterator.h70 iterator __it(*this);
72 return __it;
83 iterator __it(*this);
85 return __it;
/freebsd-14.2/contrib/llvm-project/libcxx/include/__chrono/
H A Dformatter.h178 for (auto __it = __chrono_specs.begin(); __it != __chrono_specs.end(); ++__it) { in __format_chrono_using_chrono_specs() local
179 if (*__it == _CharT('%')) { in __format_chrono_using_chrono_specs()
180 auto __s = __it; in __format_chrono_using_chrono_specs()
181 ++__it; in __format_chrono_using_chrono_specs()
184 switch (*__it) { in __format_chrono_using_chrono_specs()
192 __sstr << *__it; in __format_chrono_using_chrono_specs()
243 …_sstr}, __sstr, _CharT(' '), std::addressof(__t), std::to_address(__s), std::to_address(__it + 1)); in __format_chrono_using_chrono_specs()
309 if (*(__it + 1) == 'S') { in __format_chrono_using_chrono_specs()
310 ++__it; in __format_chrono_using_chrono_specs()
319 ++__it; in __format_chrono_using_chrono_specs()
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/__format/
H A Dformat_context.h101 _LIBCPP_HIDE_FROM_ABI void advance_to(iterator __it) { __out_it_ = std::move(__it); } in _LIBCPP_PREFERRED_NAME()
193 _LIBCPP_HIDE_FROM_ABI void advance_to(iterator __it) { __out_it_ = std::move(__it); } in advance_to() argument
H A Dparser_std_format_spec.h1128 auto __it = __str.begin();
1129 if (__format_spec::__is_ascii(*__it)) {
1132 ++__it;
1133 if (__it == __str.end())
1137 if (__format_spec::__is_ascii(*__it))
1138 return {static_cast<size_t>(__it - __str.begin()), __it};
1142 } while (__format_spec::__is_ascii(*__it));
1143 --__it;
1147 ptrdiff_t __ascii_size = __it - __str.begin();
1149 … __detail::__estimate_column_width_grapheme_clustering(__it, __str.end(), __maximum, __rounding);
H A Dformat_parse_context.h46 _LIBCPP_HIDE_FROM_ABI constexpr void advance_to(const_iterator __it) { __begin_ = __it; } in advance_to() argument
/freebsd-14.2/contrib/llvm-project/libcxx/include/__iterator/
H A Dbounded_iter.h212 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR __bounded_iter<_It> __make_bounded_iter(_It __it, _It __beg… in __make_bounded_iter() argument
213 return __bounded_iter<_It>(std::move(__it), std::move(__begin), std::move(__end)); in __make_bounded_iter()
227 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR static element_type* to_address(pointer __it) _NOEXCEPT {
228 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-14.2/contrib/llvm-project/libcxx/include/
H A Dsyncstream174 auto __it = __get_it(__ptr);
175 if (__it->second.__count == 1)
176 __lut_.erase(__it);
178 --__it->second.__count;
202 auto __it = __lut_.find(reinterpret_cast<uintptr_t>(__ptr));
203 return __it != __lut_.end() ? __it->second.__count : 0;
223 auto __it = __lut_.find(reinterpret_cast<uintptr_t>(__ptr));
224 …_LIBCPP_ASSERT_INTERNAL(__it != __lut_.end(), "using a wrapped streambuf that has not been registe…
225 _LIBCPP_ASSERT_INTERNAL(__it->second.__count >= 1, "found an inactive streambuf wrapper");
226 return __it;
H A Ddeque298 : __m_iter_(__it.__m_iter_),
299 __ptr_(__it.__ptr_) {}
364 return __it + __n;
1086 for (__map_const_iterator __it = __map_.begin(); __it != __map_.end(); ++__it) {
1088 std::__to_address(*__it),
1089 std::__to_address(*__it),
1090 std::__to_address(*__it),
1108 for (__map_const_iterator __it = __map_.begin(); __it != __map_.end(); ++__it) {
1118 if (__it < __first_mp || __it > __last_mp) {
1120 std::__to_address(*__it),
[all …]
H A D__bit_reference873 …_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 __bit_iterator(const __bit_iterator<_Cp, false>& __it) _NOEXCEPT
874 : __seg_(__it.__seg_),
875 __ctz_(__it.__ctz_) {}
883 operator=(const _If<_IsConst, struct __private_nat, __bit_iterator>& __it) {
884 __seg_ = __it.__seg_;
885 __ctz_ = __it.__ctz_;
954 operator+(difference_type __n, const __bit_iterator& __it) {
955 return __it + __n;
H A D__hash_table842 _LIBCPP_HIDE_FROM_ABI _NodeHandle __node_handle_extract(const_iterator __it);
1603 for (typename _Table::iterator __it = __source.begin(); __it != __source.end();) {
1604 __node_pointer __src_ptr = __it.__node_->__upcast();
1607 auto __prev_iter = __it++;
1643 for (typename _Table::iterator __it = __source.begin(); __it != __source.end();) {
1644 __node_pointer __src_ptr = __it.__node_->__upcast();
1647 (void)__source.remove(__it++).release();
H A Dset787 _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) {
788 return __tree_.template __node_handle_extract<node_type>(__it);
1245 _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) {
1246 return __tree_.template __node_handle_extract<node_type>(__it);
H A Dmap1334 _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) {
1335 return __tree_.template __node_handle_extract<node_type>(__it.__i_);
1924 _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) {
1925 return __tree_.template __node_handle_extract<node_type>(__it.__i_);
H A Dunordered_map1347 _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) {
1348 return __table_.template __node_handle_extract<node_type>(__it.__i_);
2098 _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) {
2099 return __table_.template __node_handle_extract<node_type>(__it.__i_);
H A D__tree1968 iterator __it = find(__key);
1969 if (__it == end())
1971 return __node_handle_extract<_NodeHandle>(__it);
H A Dunordered_set802 _LIBCPP_HIDE_FROM_ABI node_type extract(const_iterator __it) {
803 return __table_.template __node_handle_extract<node_type>(__it);
/freebsd-14.2/contrib/llvm-project/libcxx/include/__memory/
H A Duninitialized_algorithms.h480 __uninitialized_allocator_fill_n_multidimensional(_Alloc& __alloc, _BidirIter __it, _Size __n, _Tp … in __uninitialized_allocator_fill_n_multidimensional() argument
483 _BidirIter __begin = __it; in __uninitialized_allocator_fill_n_multidimensional()
487 …xception_guard([&]() { std::__allocator_destroy_multidimensional(__value_alloc, __begin, __it); }); in __uninitialized_allocator_fill_n_multidimensional()
488 for (; __n != 0; --__n, ++__it) { in __uninitialized_allocator_fill_n_multidimensional()
489 std::__allocator_construct_at_multidimensional(__value_alloc, std::addressof(*__it), __value); in __uninitialized_allocator_fill_n_multidimensional()
498 __uninitialized_allocator_value_construct_n_multidimensional(_Alloc& __alloc, _BidirIter __it, _Siz… in __uninitialized_allocator_value_construct_n_multidimensional() argument
501 _BidirIter __begin = __it; in __uninitialized_allocator_value_construct_n_multidimensional()
505 …xception_guard([&]() { std::__allocator_destroy_multidimensional(__value_alloc, __begin, __it); }); in __uninitialized_allocator_value_construct_n_multidimensional()
506 for (; __n != 0; --__n, ++__it) { in __uninitialized_allocator_value_construct_n_multidimensional()
507 std::__allocator_construct_at_multidimensional(__value_alloc, std::addressof(*__it)); in __uninitialized_allocator_value_construct_n_multidimensional()
/freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/
H A Diterator_operations.h148 next(_Iter&& __it, typename iterator_traits<__remove_cvref_t<_Iter> >::difference_type __n = 1) {
149 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-14.2/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;