Searched refs:bidirectional_iterator (Results 1 - 22 of 22) sorted by relevance

/openbsd-current/gnu/llvm/libcxx/include/__iterator/
H A Dprev.h45 template <bidirectional_iterator _Ip>
52 template <bidirectional_iterator _Ip>
59 template <bidirectional_iterator _Ip>
H A Dadvance.h100 // Preconditions: If `I` does not model `bidirectional_iterator`, `n` is not negative.
104 _LIBCPP_ASSERT(__n >= 0 || bidirectional_iterator<_Ip>,
105 "If `n < 0`, then `bidirectional_iterator<I>` must be true.");
111 } else if constexpr (bidirectional_iterator<_Ip>) {
146 // * If `n < 0`, [bound_sentinel, i) denotes a range, `I` models `bidirectional_iterator`, and `I` and `S` model `same_as<I, S>`.
151 _LIBCPP_ASSERT((__n >= 0) || (bidirectional_iterator<_Ip> && same_as<_Ip, _Sp>),
152 "If `n < 0`, then `bidirectional_iterator<I> && same_as<I, S>` must be true.");
179 if constexpr (bidirectional_iterator<_Ip> && same_as<_Ip, _Sp>) {
H A Diterator_with_data.h66 requires bidirectional_iterator<_Iterator>
73 requires bidirectional_iterator<_Iterator>
H A Dcounted_iterator.h166 requires bidirectional_iterator<_Iter>
175 requires bidirectional_iterator<_Iter>
H A Dconcepts.h163 concept bidirectional_iterator = variable
173 bidirectional_iterator<_Ip> &&
H A Dreverse_iterator.h67 static_assert(__is_cpp17_bidirectional_iterator<_Iter>::value || bidirectional_iterator<_Iter>,
368 static_assert(__is_cpp17_bidirectional_iterator<_Iter>::value || bidirectional_iterator<_Iter>);
/openbsd-current/gnu/llvm/libcxx/include/__algorithm/
H A Dranges_copy_backward.h38 template <bidirectional_iterator _InIter1, sentinel_for<_InIter1> _Sent1, bidirectional_iterator _InIter2>
46 template <bidirectional_range _Range, bidirectional_iterator _Iter>
H A Dranges_move_backward.h47 template <bidirectional_iterator _InIter, sentinel_for<_InIter> _Sent, bidirectional_iterator _OutIter>
54 template <bidirectional_range _Range, bidirectional_iterator _Iter>
H A Dranges_iterator_concept.h35 else if constexpr (bidirectional_iterator<_Iter>)
H A Dranges_reverse.h33 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent>
H A Dranges_reverse_copy.h40 template <bidirectional_iterator _InIter, sentinel_for<_InIter> _Sent, weakly_incrementable _OutIter>
H A Dranges_rotate_copy.h38 template <bidirectional_iterator _InIter, sentinel_for<_InIter> _Sent, weakly_incrementable _OutIter>
H A Dranges_inplace_merge.h52 bidirectional_iterator _Iter,
H A Dranges_next_permutation.h43 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
H A Dranges_prev_permutation.h44 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
H A Dranges_stable_partition.h59 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
/openbsd-current/gnu/gcc/libstdc++-v3/include/backward/
H A Diterator.h82 // bidirectional_iterator, and random_access_iterator are not part of
112 struct bidirectional_iterator { struct
/openbsd-current/gnu/lib/libstdc++/libstdc++/include/backward/
H A Diterator.h82 // bidirectional_iterator, and random_access_iterator are not part of
112 struct bidirectional_iterator { struct
/openbsd-current/gnu/llvm/libcxx/include/__ranges/
H A Drend.h65 { ranges::begin(__t) } -> bidirectional_iterator;
H A Drbegin.h62 { ranges::begin(__t) } -> bidirectional_iterator;
H A Dconcepts.h110 concept bidirectional_range = forward_range<_Tp> && bidirectional_iterator<iterator_t<_Tp>>;
H A Dsubrange.h190 requires bidirectional_iterator<_Iter>
199 if constexpr (bidirectional_iterator<_Iter>) {

Completed in 202 milliseconds