| /external/cronet/buildtools/third_party/libc++/trunk/test/libcxx/diagnostics/ |
| D | ranges.nodiscard_extensions.compile.pass.cpp | 9 // Check that ranges algorithms aren't marked [[nodiscard]] when
22 std::ranges::adjacent_find(range); in test()
23 std::ranges::adjacent_find(iter, iter); in test()
24 std::ranges::all_of(range, pred); in test()
25 std::ranges::all_of(iter, iter, pred); in test()
26 std::ranges::any_of(range, pred); in test()
27 std::ranges::any_of(iter, iter, pred); in test()
28 std::ranges::binary_search(range, 1); in test()
29 std::ranges::binary_search(iter, iter, 1); in test()
30 std::ranges::clamp(1, 2, 3); in test()
[all …]
|
| D | ranges.nodiscard_extensions.verify.cpp | 9 // Check that ranges algorithms are marked [[nodiscard]] as a conforming extension
19 …std::ranges::adjacent_find(range); // expected-warning {{ignoring return value of function declare… in test()
20 …std::ranges::adjacent_find(iter, iter); // expected-warning {{ignoring return value of function de… in test()
21 …std::ranges::all_of(range, pred); // expected-warning {{ignoring return value of function declared… in test()
22 …std::ranges::all_of(iter, iter, pred); // expected-warning {{ignoring return value of function dec… in test()
23 …std::ranges::any_of(range, pred); // expected-warning {{ignoring return value of function declared… in test()
24 …std::ranges::any_of(iter, iter, pred); // expected-warning {{ignoring return value of function dec… in test()
25 …std::ranges::binary_search(range, 1); // expected-warning {{ignoring return value of function decl… in test()
26 …std::ranges::binary_search(iter, iter, 1); // expected-warning {{ignoring return value of function… in test()
27 …std::ranges::clamp(1, 2, 3); // expected-warning {{ignoring return value of function declared with… in test()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/library/description/conventions/customization.point.object/ |
| D | niebloid.compile.pass.cpp | 20 #include <ranges>
62 static_assert(test(std::ranges::adjacent_find, a));
63 static_assert(test(std::ranges::all_of, a, odd));
64 static_assert(test(std::ranges::any_of, a, odd));
65 static_assert(test(std::ranges::binary_search, a, 42));
66 static_assert(test(std::ranges::clamp, 42, 42, 42));
67 static_assert(test(std::ranges::copy, a, a));
68 static_assert(test(std::ranges::copy_backward, a, a));
69 static_assert(test(std::ranges::copy_if, a, a, odd));
70 static_assert(test(std::ranges::copy_n, a, 10, a));
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/ |
| D | ranges_robust_against_dangling.pass.cpp | 13 // Range algorithms should return `std::ranges::dangling` when given a dangling range.
21 #include <ranges>
44 template <class ExpectedT = std::ranges::dangling, class Func, std::ranges::range Input, class ...A…
51 template <class ExpectedT = std::ranges::dangling, class Func, std::ranges::range Input, class ...A…
58 template <class ExpectedT = std::ranges::dangling, class Func, std::ranges::range Input, class ...A…
68 using std::ranges::dangling; in test_all()
70 using std::ranges::binary_transform_result; in test_all()
71 using std::ranges::copy_result; in test_all()
72 using std::ranges::copy_backward_result; in test_all()
73 using std::ranges::copy_if_result; in test_all()
[all …]
|
| D | ranges_robust_against_proxy_iterators.pass.cpp | 24 #include <ranges>
30 template <class Func, std::ranges::range Input, class ...Args>
37 template <class Func, std::ranges::range Range1, std::ranges::range Range2, class ...Args>
44 template <class Func, std::ranges::range Input, class ...Args>
45 constexpr void test_mid(Func&& func, Input& in, std::ranges::iterator_t<Input> mid, Args&& ...args)… in test_mid()
74 test(std::ranges::any_of, in, unary_pred); in run_tests()
75 test(std::ranges::all_of, in, unary_pred); in run_tests()
76 test(std::ranges::none_of, in, unary_pred); in run_tests()
77 test(std::ranges::find, in, x); in run_tests()
78 test(std::ranges::find_if, in, unary_pred); in run_tests()
[all …]
|
| D | ranges_robust_against_nonbool_predicates.pass.cpp | 22 #include <ranges>
37 template <class Func, std::ranges::range Input, class... Args>
44 template <class Func, std::ranges::range Input, class... Args>
51 template <class Func, std::ranges::range Input, class... Args>
52 constexpr void test_mid(Func&& func, Input& in, std::ranges::iterator_t<Input> mid, Args&&... args)… in test_mid()
69 test(std::ranges::any_of, in, unary_pred); in test_all()
70 test(std::ranges::all_of, in, unary_pred); in test_all()
71 test(std::ranges::none_of, in, unary_pred); in test_all()
72 test(std::ranges::find_if, in, unary_pred); in test_all()
73 test(std::ranges::find_if_not, in, unary_pred); in test_all()
[all …]
|
| D | ranges_robust_against_omitting_invoke.pass.cpp | 21 #include <ranges>
38 template <class Func, std::ranges::range Input, class... Args>
45 template <class Func, std::ranges::range Input, class... Args>
52 template <class Func, std::ranges::range Input, class... Args>
53 constexpr void test_mid(Func&& func, Input& in, std::ranges::iterator_t<Input> mid, Args&&... args)… in test_mid()
74 test(std::ranges::any_of, in, &Foo::unary_pred, &Bar::val); in test_all()
75 test(std::ranges::all_of, in, &Foo::unary_pred, &Bar::val); in test_all()
76 test(std::ranges::none_of, in, &Foo::unary_pred, &Bar::val); in test_all()
77 test(std::ranges::find, in, x, &Bar::val); in test_all()
78 test(std::ranges::find_if, in, &Foo::unary_pred, &Bar::val); in test_all()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/ranges/range.req/range.view/ |
| D | enable_view.compile.pass.cpp | 11 // <ranges>
16 #include <ranges>
22 static_assert(!std::ranges::enable_view<Empty>);
23 static_assert(!std::ranges::enable_view<Empty&>);
24 static_assert(!std::ranges::enable_view<Empty&&>);
25 static_assert(!std::ranges::enable_view<const Empty>);
26 static_assert(!std::ranges::enable_view<const Empty&>);
27 static_assert(!std::ranges::enable_view<const Empty&&>);
30 struct PrivateViewBase : private std::ranges::view_base { };
31 static_assert(!std::ranges::enable_view<PrivateViewBase>);
[all …]
|
| /external/cronet/base/ranges/ |
| D | algorithm_unittest.cc | 5 #include "base/ranges/algorithm.h"
14 #include "base/ranges/functional.h"
105 static_assert(ranges::all_of(array + 1, array + 6, is_non_zero), ""); in TEST()
106 static_assert(!ranges::all_of(array, is_non_zero), ""); in TEST()
110 ranges::all_of(values + 1, ranges::end(values), is_non_zero, &Int::value), in TEST()
112 static_assert(!ranges::all_of(values, is_non_zero, &Int::value), ""); in TEST()
118 static_assert(!ranges::any_of(array + 5, array + 6, is_even), ""); in TEST()
119 static_assert(ranges::any_of(array, is_even), ""); in TEST()
123 !ranges::any_of(values + 3, ranges::end(values), is_even, &Int::value), in TEST()
125 static_assert(ranges::any_of(values, is_even, &Int::value), ""); in TEST()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/ranges/range.adaptors/range.lazy.split/ |
| D | constraints.compile.pass.cpp | 13 // indirectly_comparable<iterator_t<V>, iterator_t<Pattern>, ranges::equal_to> &&
18 #include <ranges>
27 static_assert( std::ranges::forward_range<ForwardRange>);
31 typename std::ranges::lazy_split_view<View, Pattern>;
39 static_assert( std::ranges::forward_range<View>);
40 static_assert( std::ranges::forward_range<Pattern>);
41 static_assert( std::ranges::view<View>);
42 static_assert( std::ranges::view<Pattern>);
44 std::ranges::iterator_t<View>, std::ranges::iterator_t<Pattern>, std::ranges::equal_to>);
54 static_assert( std::ranges::input_range<View>);
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/ranges/range.req/range.refinements/ |
| D | viewable_range.compile.pass.cpp | 14 #include <ranges>
31 static_assert(!std::ranges::range<T1>);
33 static_assert(!std::ranges::viewable_range<T1>);
34 static_assert(!std::ranges::viewable_range<T1&>);
35 static_assert(!std::ranges::viewable_range<T1&&>);
36 static_assert(!std::ranges::viewable_range<T1 const>);
37 static_assert(!std::ranges::viewable_range<T1 const&>);
38 static_assert(!std::ranges::viewable_range<T1 const&&>);
41 struct T2 : test_range<cpp20_input_iterator>, std::ranges::view_base {
44 static_assert(std::ranges::range<T2>);
[all …]
|
| D | common_range.compile.pass.cpp | 14 #include <ranges>
22 static_assert(!std::ranges::common_range<Common<cpp17_input_iterator<int*>>>); // not a sentinel fo…
23 static_assert(!std::ranges::common_range<Common<cpp20_input_iterator<int*>>>); // not a sentinel fo…
24 static_assert( std::ranges::common_range<Common<forward_iterator<int*>>>);
25 static_assert( std::ranges::common_range<Common<bidirectional_iterator<int*>>>);
26 static_assert( std::ranges::common_range<Common<random_access_iterator<int*>>>);
27 static_assert( std::ranges::common_range<Common<contiguous_iterator<int*>>>);
28 static_assert( std::ranges::common_range<Common<int*>>);
30 static_assert(!std::ranges::common_range<NonCommon<cpp17_input_iterator<int*>>>);
31 static_assert(!std::ranges::common_range<NonCommon<cpp20_input_iterator<int*>>>);
[all …]
|
| D | contiguous_range.compile.pass.cpp | 14 #include <ranges>
19 namespace ranges = std::ranges;
23 constexpr bool result = ranges::contiguous_range<test_range<I> >; in check_range()
24 static_assert(ranges::contiguous_range<test_range<I> const> == result); in check_range()
25 static_assert(ranges::contiguous_range<test_non_const_common_range<I> > == result); in check_range()
26 static_assert(ranges::contiguous_range<test_non_const_range<I> > == result); in check_range()
27 static_assert(ranges::contiguous_range<test_common_range<I> > == result); in check_range()
28 static_assert(ranges::contiguous_range<test_common_range<I> const> == result); in check_range()
29 static_assert(!ranges::contiguous_range<test_non_const_common_range<I> const>); in check_range()
30 static_assert(!ranges::contiguous_range<test_non_const_range<I> const>); in check_range()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/libcxx/algorithms/ |
| D | ranges_robust_against_copying_comparators.pass.cpp | 13 // this test checks that the comparators in the ranges algorithms aren't copied/moved
92 (void)std::ranges::adjacent_find(first, last, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
93 (void)std::ranges::adjacent_find(a, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
94 (void)std::ranges::all_of(first, last, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
95 (void)std::ranges::all_of(a, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
96 (void)std::ranges::any_of(first, last, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
97 (void)std::ranges::any_of(a, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
98 (void)std::ranges::binary_search(first, last, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
99 (void)std::ranges::binary_search(a, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
100 (void)std::ranges::clamp(value, value, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| D | ranges_robust_against_copying_projections.pass.cpp | 13 // this test checks that the projections in the ranges algorithms aren't copied/moved
74 (void)std::ranges::adjacent_find(first, last, Equal(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
75 (void)std::ranges::adjacent_find(a, Equal(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
76 (void)std::ranges::all_of(first, last, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
77 (void)std::ranges::all_of(a, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
78 (void)std::ranges::any_of(first, last, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
79 (void)std::ranges::any_of(a, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
80 … (void)std::ranges::binary_search(first, last, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
81 (void)std::ranges::binary_search(a, value, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
82 (void)std::ranges::clamp(T(), T(), T(), Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | ImmutableRangeSet.java | 63 * ImmutableRangeSet}. As in {@link Builder}, overlapping ranges are not permitted and adjacent
64 * ranges will be merged.
123 * Returns an {@code ImmutableRangeSet} containing each of the specified disjoint ranges.
124 * Overlapping ranges and empty ranges are forbidden, though adjacent ranges are permitted and
127 * @throws IllegalArgumentException if any ranges overlap or are empty
130 public static <C extends Comparable<?>> ImmutableRangeSet<C> copyOf(Iterable<Range<C>> ranges) { in copyOf() argument
131 return new ImmutableRangeSet.Builder<C>().addAll(ranges).build(); in copyOf()
135 * Returns an {@code ImmutableRangeSet} representing the union of the specified ranges.
137 * <p>This is the smallest {@code RangeSet} which encloses each of the specified ranges. Duplicate
138 * or connected ranges are permitted, and will be coalesced in the result.
[all …]
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | ImmutableRangeSet.java | 110 * Returns an {@code ImmutableRangeSet} containing each of the specified disjoint ranges.
111 * Overlapping ranges and empty ranges are forbidden, though adjacent ranges are permitted and
114 * @throws IllegalArgumentException if any ranges overlap or are empty
117 public static <C extends Comparable<?>> ImmutableRangeSet<C> copyOf(Iterable<Range<C>> ranges) { in copyOf() argument
118 return new ImmutableRangeSet.Builder<C>().addAll(ranges).build(); in copyOf()
122 * Returns an {@code ImmutableRangeSet} representing the union of the specified ranges.
124 * <p>This is the smallest {@code RangeSet} which encloses each of the specified ranges. Duplicate
125 * or connected ranges are permitted, and will be coalesced in the result.
129 public static <C extends Comparable<?>> ImmutableRangeSet<C> unionOf(Iterable<Range<C>> ranges) { in unionOf() argument
130 return copyOf(TreeRangeSet.create(ranges)); in unionOf()
[all …]
|
| /external/cldr/tools/cldr-code/src/main/java/org/unicode/cldr/util/ |
| D | StringRange.java | 81 …// TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from … in compact()
83 …Relation<Integer, Ranges> lengthToArrays = Relation.of(new TreeMap<Integer, Set<Ranges>>(), TreeSe… in compact()
85 Ranges item = new Ranges(s); in compact()
89 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) { in compact()
90 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue()); in compact()
91 for (Ranges ranges : compacted) { in compact()
92 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
108 private static LinkedList<Ranges> compact(int size, Set<Ranges> inputRanges) { in compact()
109 LinkedList<Ranges> ranges = new LinkedList<>(inputRanges); in compact() local
111 Ranges last = null; in compact()
[all …]
|
| /external/rust/crates/regex-syntax/src/hir/ |
| D | interval.rs | 37 ranges: Vec<I>, field
44 /// The given ranges do not need to be in any specific order, and ranges
47 let mut set = IntervalSet { ranges: intervals.into_iter().collect() }; in new()
56 self.ranges.push(interval); in push()
64 IntervalSetIter(self.ranges.iter()) in iter()
71 &self.ranges in intervals()
77 /// ranges `a-z` and `A-Z`.
82 let len = self.ranges.len(); in case_fold_simple()
84 let range = self.ranges[i]; in case_fold_simple()
85 if let Err(err) = range.case_fold_simple(&mut self.ranges) { in case_fold_simple()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/ranges/range.adaptors/range.join.view/ |
| D | end.pass.cpp | 16 #include <ranges>
46 struct ConstNotRange : std::ranges::view_base {
59 std::ranges::join_view jv(outer); in test()
60 assert(jv.end() == std::ranges::next(jv.begin(), 16)); in test()
61 assert(std::as_const(jv).end() == std::ranges::next(std::as_const(jv).begin(), 16)); in test()
65 static_assert(std::ranges::common_range<decltype(jv)>); in test()
66 static_assert(std::ranges::common_range<const decltype(jv)>); in test()
74 std::ranges::join_view jv(outer); in test()
75 assert(jv.end() == std::ranges::next(jv.begin(), 12)); in test()
76 assert(std::as_const(jv).end() == std::ranges::next(std::as_const(jv).begin(), 12)); in test()
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/algorithms/algorithms.results/ |
| D | in_out_out_result.pass.cpp | 24 static_assert(!std::is_constructible_v<std::ranges::in_out_out_result<A, A, A>, std::ranges::in_out…
30 static_assert(std::is_constructible_v<std::ranges::in_out_out_result<B, B, B>, std::ranges::in_out_…
31 static_assert(std::is_constructible_v<std::ranges::in_out_out_result<B, B, B>, std::ranges::in_out_…
32 static_assert(std::is_constructible_v<std::ranges::in_out_out_result<B, B, B>, const std::ranges::i…
33 static_assert(std::is_constructible_v<std::ranges::in_out_out_result<B, B, B>, const std::ranges::i…
38 static_assert(!std::is_constructible_v<std::ranges::in_out_out_result<C, C, C>, std::ranges::in_out…
41 static_assert(std::is_convertible_v<std::ranges::in_out_out_result<int, int, int>&, std::ranges::in…
42 static_assert(std::is_convertible_v<const std::ranges::in_out_out_result<int, int, int>&, std::rang…
43 static_assert(std::is_convertible_v<std::ranges::in_out_out_result<int, int, int>&&, std::ranges::i…
44 static_assert(std::is_convertible_v<const std::ranges::in_out_out_result<int, int, int>&&, std::ran…
[all …]
|
| D | in_in_out_result.pass.cpp | 24 static_assert(!std::is_constructible_v<std::ranges::in_in_out_result<A, A, A>,
25 std::ranges::in_in_out_result<int, int, int>>);
31 static_assert(std::is_constructible_v<std::ranges::in_in_out_result<B, B, B>, std::ranges::in_in_ou…
32 static_assert(std::is_constructible_v<std::ranges::in_in_out_result<B, B, B>, std::ranges::in_in_ou…
33 static_assert(std::is_constructible_v<std::ranges::in_in_out_result<B, B, B>, const std::ranges::in…
34 static_assert(std::is_constructible_v<std::ranges::in_in_out_result<B, B, B>, const std::ranges::in…
39 static_assert(!std::is_constructible_v<std::ranges::in_in_out_result<C, C, C>, std::ranges::in_in_o…
42 static_assert(std::is_convertible_v<std::ranges::in_in_out_result<int, int, int>&, std::ranges::in_…
43 static_assert(std::is_convertible_v<const std::ranges::in_in_out_result<int, int, int>&, std::range…
44 static_assert(std::is_convertible_v<std::ranges::in_in_out_result<int, int, int>&&, std::ranges::in…
[all …]
|
| /external/cronet/buildtools/third_party/libc++/trunk/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.distance/ |
| D | iterator_sentinel.pass.cpp | 13 // constexpr iter_difference_t<I> ranges::distance(I first, S last);
16 // constexpr iter_difference_t<I> ranges::distance(I&& first, S last); // TODO: update when LWG36…
31 assert(std::ranges::distance(first, last) == 0); in test_unsized()
32 assert(std::ranges::distance(It(a), last) == 0); in test_unsized()
33 assert(std::ranges::distance(first, Sent(It(a))) == 0); in test_unsized()
34 assert(std::ranges::distance(It(a), Sent(It(a))) == 0); in test_unsized()
35 … ASSERT_SAME_TYPE(decltype(std::ranges::distance(It(a), Sent(It(a)))), std::iter_difference_t<It>); in test_unsized()
40 assert(std::ranges::distance(first, last) == 3); in test_unsized()
43 assert(std::ranges::distance(static_cast<It&>(first), static_cast<Sent&>(last)) == 3); in test_unsized()
44 assert(std::ranges::distance(static_cast<It&>(first), static_cast<Sent&&>(last)) == 3); in test_unsized()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | StringRange.java | 88 …// TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from … in compact()
90 …Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.… in compact()
92 Ranges item = new Ranges(s); in compact()
96 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) { in compact()
97 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue()); in compact()
98 for (Ranges ranges : compacted) { in compact()
99 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
115 private static LinkedList<Ranges> compact(int size, Set<Ranges> inputRanges) { in compact()
116 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); in compact() local
118 Ranges last = null; in compact()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | StringRange.java | 95 …// TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from … in compact()
97 …Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.… in compact()
99 Ranges item = new Ranges(s); in compact()
103 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) { in compact()
104 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue()); in compact()
105 for (Ranges ranges : compacted) { in compact()
106 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
122 private static LinkedList<Ranges> compact(int size, Set<Ranges> inputRanges) { in compact()
123 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); in compact() local
125 Ranges last = null; in compact()
[all …]
|