Searched refs:bidirectional_iterator (Results 1 - 22 of 22) sorted by relevance
/openbsd-current/gnu/llvm/libcxx/include/__iterator/ |
H A D | prev.h | 45 template <bidirectional_iterator _Ip> 52 template <bidirectional_iterator _Ip> 59 template <bidirectional_iterator _Ip>
|
H A D | advance.h | 100 // 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 D | iterator_with_data.h | 66 requires bidirectional_iterator<_Iterator> 73 requires bidirectional_iterator<_Iterator>
|
H A D | counted_iterator.h | 166 requires bidirectional_iterator<_Iter> 175 requires bidirectional_iterator<_Iter>
|
H A D | concepts.h | 163 concept bidirectional_iterator = variable 173 bidirectional_iterator<_Ip> &&
|
H A D | reverse_iterator.h | 67 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 D | ranges_copy_backward.h | 38 template <bidirectional_iterator _InIter1, sentinel_for<_InIter1> _Sent1, bidirectional_iterator _InIter2> 46 template <bidirectional_range _Range, bidirectional_iterator _Iter>
|
H A D | ranges_move_backward.h | 47 template <bidirectional_iterator _InIter, sentinel_for<_InIter> _Sent, bidirectional_iterator _OutIter> 54 template <bidirectional_range _Range, bidirectional_iterator _Iter>
|
H A D | ranges_iterator_concept.h | 35 else if constexpr (bidirectional_iterator<_Iter>)
|
H A D | ranges_reverse.h | 33 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent>
|
H A D | ranges_reverse_copy.h | 40 template <bidirectional_iterator _InIter, sentinel_for<_InIter> _Sent, weakly_incrementable _OutIter>
|
H A D | ranges_rotate_copy.h | 38 template <bidirectional_iterator _InIter, sentinel_for<_InIter> _Sent, weakly_incrementable _OutIter>
|
H A D | ranges_inplace_merge.h | 52 bidirectional_iterator _Iter,
|
H A D | ranges_next_permutation.h | 43 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
|
H A D | ranges_prev_permutation.h | 44 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent,
|
H A D | ranges_stable_partition.h | 59 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity,
|
/openbsd-current/gnu/gcc/libstdc++-v3/include/backward/ |
H A D | iterator.h | 82 // 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 D | iterator.h | 82 // bidirectional_iterator, and random_access_iterator are not part of 112 struct bidirectional_iterator { struct
|
/openbsd-current/gnu/llvm/libcxx/include/__ranges/ |
H A D | rend.h | 65 { ranges::begin(__t) } -> bidirectional_iterator;
|
H A D | rbegin.h | 62 { ranges::begin(__t) } -> bidirectional_iterator;
|
H A D | concepts.h | 110 concept bidirectional_range = forward_range<_Tp> && bidirectional_iterator<iterator_t<_Tp>>;
|
H A D | subrange.h | 190 requires bidirectional_iterator<_Iter> 199 if constexpr (bidirectional_iterator<_Iter>) {
|
Completed in 202 milliseconds