| /src/contrib/llvm-project/libcxx/include/__ranges/ |
| H A D | chunk_by_view.h | 79 requires bidirectional_range<_View> in __find_prev() 154 …using iterator_concept = conditional_t<bidirectional_range<_View>, bidirectional_iterator_tag, fo… 180 requires bidirectional_range<_View> 188 requires bidirectional_range<_View>
|
| H A D | join_view.h | 261 …_If< __ref_is_glvalue && bidirectional_range<_Base> && bidirectional_range<range_reference_t<_Base… 311 …requires __ref_is_glvalue && bidirectional_range<_Base> && bidirectional_range<range_reference_t<_… 327 …requires __ref_is_glvalue && bidirectional_range<_Base> && bidirectional_range<range_reference_t<_…
|
| H A D | concepts.h | 109 concept bidirectional_range = forward_range<_Tp> && bidirectional_iterator<iterator_t<_Tp>>; variable 112 concept random_access_range = bidirectional_range<_Tp> && random_access_iterator<iterator_t<_Tp>>;
|
| H A D | filter_view.h | 135 _If<bidirectional_range<_View>, 176 requires bidirectional_range<_View> 184 requires bidirectional_range<_View>
|
| H A D | view_interface.h | 137 requires bidirectional_range<_D2> && common_range<_D2> in decltype() 146 requires bidirectional_range<const _D2> && common_range<const _D2> in decltype()
|
| H A D | elements_view.h | 190 } else if constexpr (bidirectional_range<_Base>) { 236 requires bidirectional_range<_Base> 243 requires bidirectional_range<_Base>
|
| H A D | transform_view.h | 146 template <bidirectional_range _View> 235 requires bidirectional_range<_Base> 242 requires bidirectional_range<_Base>
|
| H A D | reverse_view.h | 45 requires bidirectional_range<_View>
|
| H A D | zip_view.h | 58 (!(bidirectional_range<_Ranges> && ...) && (common_range<_Ranges> && ...)) || 222 concept __zip_all_bidirectional = (bidirectional_range<__maybe_const<_Const, _Views>> && ...);
|
| /src/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | ranges_reverse.h | 62 template <bidirectional_range _Range>
|
| H A D | ranges_reverse_copy.h | 49 template <bidirectional_range _Range, weakly_incrementable _OutIter>
|
| H A D | ranges_copy_backward.h | 48 template <bidirectional_range _Range, bidirectional_iterator _Iter>
|
| H A D | ranges_prev_permutation.h | 55 template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
|
| H A D | ranges_next_permutation.h | 55 template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
|
| H A D | ranges_stable_partition.h | 69 template <bidirectional_range _Range,
|
| H A D | ranges_move_backward.h | 56 template <bidirectional_range _Range, bidirectional_iterator _Iter>
|
| H A D | ranges_inplace_merge.h | 62 template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
|
| /src/contrib/llvm-project/libcxx/include/ |
| H A D | ranges | 82 concept bidirectional_range = see below; 236 requires bidirectional_range<V>
|
| H A D | algorithm | 308 template<bidirectional_range R, bidirectional_iterator I> 404 template<bidirectional_range R> 629 template<bidirectional_range R, class Proj = identity, 708 template<bidirectional_range R, bidirectional_iterator I> 834 template<bidirectional_range R, weakly_incrementable O> 1024 template<bidirectional_range R, class Comp = ranges::less, class Proj = identity> 1135 template<bidirectional_range R, class Comp = ranges::less, 1150 template<bidirectional_range R, class Comp = ranges::less,
|
| H A D | deque | 808 if constexpr (ranges::bidirectional_range<_Range>) {
|
| /src/contrib/llvm-project/libcxx/include/__iterator/ |
| H A D | reverse_iterator.h | 319 template <ranges::bidirectional_range _Range>
|
| /src/contrib/llvm-project/libcxx/modules/std/ |
| H A D | ranges.inc | 59 using std::ranges::bidirectional_range;
|
| /src/contrib/llvm-project/clang/lib/Tooling/Inclusions/Stdlib/ |
| H A D | StdSymbolMap.inc | 3549 SYMBOL(bidirectional_range, std::ranges::, <ranges>)
|