Home
last modified time | relevance | path

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

/llvm-project-15.0.7/libcxx/include/__ranges/
H A Dcounted.h41 static constexpr auto __go(_It __it, iter_difference_t<_It> __count) in __go()
42 noexcept(noexcept(span(std::to_address(__it), static_cast<size_t>(__count)))) in __go()
44 { return span(std::to_address(__it), static_cast<size_t>(__count)); } in __go()
48 static constexpr auto __go(_It __it, iter_difference_t<_It> __count)
49 noexcept(noexcept(subrange(__it, __it + __count)))
50 -> decltype( subrange(__it, __it + __count))
51 { return subrange(__it, __it + __count); }
55 static constexpr auto __go(_It __it, iter_difference_t<_It> __count)
63 constexpr auto operator()(_It&& __it, _Diff&& __count) const
64 noexcept(noexcept(__go(std::forward<_It>(__it), std::forward<_Diff>(__count))))
[all …]
H A Dfilter_view.h191 friend constexpr range_rvalue_reference_t<_View> iter_move(__iterator const& __it)
192 noexcept(noexcept(ranges::iter_move(__it.__current_)))
194 return ranges::iter_move(__it.__current_);
H A Dzip_view.h435 __iter_current(zip_view<_Views...>::__iterator<_OtherConst> const& __it) {
436 return (__it.__current_);
/llvm-project-15.0.7/libcxx/include/__filesystem/
H A Dpath_iterator.h81 iterator __it(*this);
83 return __it;
97 iterator __it(*this);
99 return __it;
/llvm-project-15.0.7/libcxx/include/__format/
H A Dparser_std_format_spec.h859 const _CharT* __it = __str.begin(); in __estimate_column_width() local
860 if (__is_ascii(*__it)) { in __estimate_column_width()
863 ++__it; in __estimate_column_width()
864 if (__it == __str.end()) in __estimate_column_width()
868 if (__is_ascii(*__it)) in __estimate_column_width()
869 return {static_cast<size_t>(__it - __str.begin()), __it}; in __estimate_column_width()
873 } while (__is_ascii(*__it)); in __estimate_column_width()
874 --__it; in __estimate_column_width()
878 ptrdiff_t __ascii_size = __it - __str.begin(); in __estimate_column_width()
880 … __detail::__estimate_column_width_grapheme_clustering(__it, __str.end(), __maximum, __rounding); in __estimate_column_width()
H A Dformat_parse_context.h51 _LIBCPP_HIDE_FROM_ABI constexpr void advance_to(const_iterator __it) { in advance_to() argument
52 __begin_ = __it; in advance_to()
H A Dformat_context.h105 _LIBCPP_HIDE_FROM_ABI void advance_to(iterator __it) { __out_it_ = __it; } in _LIBCPP_PREFERRED_NAME()
/llvm-project-15.0.7/libcxx/include/__memory/
H A Duninitialized_algorithms.h469 constexpr void __uninitialized_allocator_fill_n(_Alloc& __alloc, _BidirIter __it, _Size __n, _Tp co… in __uninitialized_allocator_fill_n() argument
472 _BidirIter __begin = __it; in __uninitialized_allocator_fill_n()
475 …action __guard([&]() { std::__allocator_destroy_multidimensional(__value_alloc, __begin, __it); }); in __uninitialized_allocator_fill_n()
476 for (; __n != 0; --__n, ++__it) { in __uninitialized_allocator_fill_n()
477 std::__allocator_construct_at(__value_alloc, std::addressof(*__it), __value); in __uninitialized_allocator_fill_n()
486 constexpr void __uninitialized_allocator_value_construct_n(_Alloc& __alloc, _BidirIter __it, _Size … in __uninitialized_allocator_value_construct_n() argument
489 _BidirIter __begin = __it; in __uninitialized_allocator_value_construct_n()
492 …action __guard([&]() { std::__allocator_destroy_multidimensional(__value_alloc, __begin, __it); }); in __uninitialized_allocator_value_construct_n()
493 for (; __n != 0; --__n, ++__it) { in __uninitialized_allocator_value_construct_n()
494 std::__allocator_construct_at(__value_alloc, std::addressof(*__it)); in __uninitialized_allocator_value_construct_n()
/llvm-project-15.0.7/libcxx/include/__iterator/
H A Dbounded_iter.h207 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR __bounded_iter<_It> __make_bounded_iter(_It __it, _It __beg… in __make_bounded_iter() argument
208 return __bounded_iter<_It>(std::move(__it), std::move(__begin), std::move(__end)); in __make_bounded_iter()
222 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR static element_type* to_address(pointer __it) _NOEXCEPT {
223 return std::__to_address(__it.__current_);
H A Dconcepts.h129 requires (_Ip __it, _Tp&& __t) { in requires() argument
130 *__it++ = _VSTD::forward<_Tp>(__t); // not required to be equality-preserving in requires()
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Diterator_operations.h150 __uncvref_t<_Iter> next(_Iter&& __it,
152 return std::next(std::forward<_Iter>(__it), __n);
/llvm-project-15.0.7/libcxx/include/__functional/
H A Dboyer_moore_searcher.h66 auto __it = __table_.find(__key);
67 return __it == __table_.end() ? __default_value_ : __it->second;
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dunseq_backend_simd.h816 …__first, _DifferencType(0), __n1, [__s_first, &__pred](_ForwardIterator1 __it, _DifferencType __i)… in __simd_find_first_of()
817 return __pred(__it[__i], *__s_first); in __simd_find_first_of()
835 [&__pred](_RandomAccessIterator __it, _DifferenceType __i) { return __pred(__it[__i]); }); in __simd_remove_if()
H A Dalgorithm_impl.h164 … [&__f](_ForwardIterator __it) { __f(*__it); }); // calling serial version in __brick_walk1_n()
534 [&__pred](_RandomAccessIterator __it, _SizeType __i) { return __pred(__it[__i]); }); in __brick_find_if()
1340 [&__pred](bool* __b, bool* __e, _RandomAccessIterator __it) in __pattern_unique()
1343 __b, __e, __it - 1, __it, in __pattern_unique()
1792 [&__pred](_RandomAccessIterator __it, _SizeType __i) { return !__pred(__it[__i]); }); in __brick_is_partitioned()
2333 _RandomAccessIterator1 __it = __first + (__i - __r); in __pattern_partial_sort_copy()
2336 for (_T1* __k = __i; __k != __j; ++__k, ++__it) in __pattern_partial_sort_copy()
2338 ::new (__k) _T2(*__it); in __pattern_partial_sort_copy()
2691 [&__pred](bool* __b, bool* __e, _RandomAccessIterator __it) in __pattern_remove_if()
3456 …[&__comp](_RandomAccessIterator __it, _SizeType __i) { return __comp(__it[(__i - 1) / 2], __it[__i… in __brick_is_heap_until()
[all …]
/llvm-project-15.0.7/libcxx/include/experimental/
H A Dfunctional151 auto __it = __table.find (__key);
152 return __it == __table.end() ? __default_value_ : __it->second;
/llvm-project-15.0.7/libcxx/include/
H A D__bit_reference1148 __bit_iterator(const __bit_iterator<_Cp, false>& __it) _NOEXCEPT
1149 : __seg_(__it.__seg_), __ctz_(__it.__ctz_) {}
1157 __bit_iterator& operator=(const _If<_IsConst, struct __private_nat, __bit_iterator>& __it) {
1158 __seg_ = __it.__seg_;
1159 __ctz_ = __it.__ctz_;
1238 …friend __bit_iterator operator+(difference_type __n, const __bit_iterator& __it) {return __it + __…
H A D__hash_table1146 _NodeHandle __node_handle_extract(const_iterator __it);
2150 for (typename _Table::iterator __it = __source.begin();
2151 __it != __source.end();)
2153 __node_pointer __src_ptr = __it.__node_->__upcast();
2157 auto __prev_iter = __it++;
2204 for (typename _Table::iterator __it = __source.begin();
2205 __it != __source.end();)
2207 __node_pointer __src_ptr = __it.__node_->__upcast();
2211 (void)__source.remove(__it++).release();
H A Dset791 node_type extract(const_iterator __it)
793 return __tree_.template __node_handle_extract<node_type>(__it);
1322 node_type extract(const_iterator __it)
1324 return __tree_.template __node_handle_extract<node_type>(__it);
H A Dmap1407 node_type extract(const_iterator __it)
1409 return __tree_.template __node_handle_extract<node_type>(__it.__i_);
2075 node_type extract(const_iterator __it)
2078 __it.__i_);
H A Ddeque351 __deque_iterator(const __deque_iterator<value_type, _Pp, _Rp, _MP, difference_type, _BS>& __it,
353 : __m_iter_(__it.__m_iter_), __ptr_(__it.__ptr_) {}
433 friend __deque_iterator operator+(difference_type __n, const __deque_iterator& __it)
434 {return __it + __n;}
H A Dunordered_map1390 node_type extract(const_iterator __it)
1393 __it.__i_);
2173 node_type extract(const_iterator __it)
2176 __it.__i_);
H A D__tree2313 iterator __it = find(__key);
2314 if (__it == end())
2316 return __node_handle_extract<_NodeHandle>(__it);
H A Dunordered_set735 node_type extract(const_iterator __it)
737 return __table_.template __node_handle_extract<node_type>(__it);
H A Dlist1955 bool __iterator_in_range(_Iterator __first, _Iterator __last, _Iterator __it) {
1957 if (__p == __it) {