Home
last modified time | relevance | path

Searched refs:range1 (Results 1 – 23 of 23) sorted by relevance

/llvm-project-15.0.7/lldb/unittests/Utility/
H A DVMRangeTest.cpp42 VMRange range1(0x100, 0x200); in TEST() local
44 EXPECT_EQ(range1, range2); in TEST()
46 EXPECT_NE(VMRange(0x100, 0x1ff), range1); in TEST()
52 EXPECT_NE(range1, range2); in TEST()
113 VMRange range1(0x44, 0x200); in TEST() local
117 EXPECT_LE(range1, range1); in TEST()
118 EXPECT_GE(range1, range1); in TEST()
120 EXPECT_LT(range1, range2); in TEST()
123 EXPECT_GT(range2, range1); in TEST()
127 EXPECT_FALSE(range1 < range1); in TEST()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dranges.search.pass.cpp52 concept HasSearchR = requires (Range1 range1, Range2 range2) {
53 std::ranges::search(range1, range2);
102 auto ret = std::ranges::search(range1, range2); in test_iterators()
121 auto ret = std::ranges::search(range1, range2); in test_iterators()
140 auto ret = std::ranges::search(range1, range2); in test_iterators()
159 auto ret = std::ranges::search(range1, range2); in test_iterators()
178 auto ret = std::ranges::search(range1, range2); in test_iterators()
197 auto ret = std::ranges::search(range1, range2); in test_iterators()
216 auto ret = std::ranges::search(range1, range2); in test_iterators()
235 auto ret = std::ranges::search(range1, range2); in test_iterators()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/
H A Dranges.find_end.pass.cpp51 concept HasFindEndR = requires (Range1 range1, Range2 range2) {
52 std::ranges::find_end(range1, range2);
101 auto ret = std::ranges::find_end(range1, range2); in test_iterators()
120 auto ret = std::ranges::find_end(range1, range2); in test_iterators()
139 auto ret = std::ranges::find_end(range1, range2); in test_iterators()
158 auto ret = std::ranges::find_end(range1, range2); in test_iterators()
177 auto ret = std::ranges::find_end(range1, range2); in test_iterators()
196 auto ret = std::ranges::find_end(range1, range2); in test_iterators()
215 auto ret = std::ranges::find_end(range1, range2); in test_iterators()
234 auto ret = std::ranges::find_end(range1, range2); in test_iterators()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/
H A Dranges.equal.pass.cpp55 concept HasEqualR = requires (Range1 range1, Range2 range2) {
56 std::ranges::equal(range1, range2);
85 auto range1 = std::ranges::subrange(Iter1(a), Sent1(Iter1(a + 4))); in test_iterators() local
144 auto ret = std::ranges::equal(range1, in test_iterators()
165 auto ret = std::ranges::equal(range1, range2); in test_iterators()
182 auto ret = std::ranges::equal(range1, range2); in test_iterators()
197 auto range1 = std::ranges::subrange(Iter1(a), Sent1(Iter1(a))); in test_iterators() local
199 auto ret = std::ranges::equal(range1, range2); in test_iterators()
214 auto range1 = std::ranges::subrange(Iter1(a), Sent1(Iter1(a))); in test_iterators() local
216 auto ret = std::ranges::equal(range1, range2); in test_iterators()
[all …]
/llvm-project-15.0.7/clang/test/Driver/
H A Dcheck-time-trace-sections.py5 def is_inside(range1, range2): argument
6 a = range1["ts"]; b = a + range1["dur"]
10 def is_before(range1, range2): argument
11 b = range1["ts"] + range1["dur"]; c = range2["ts"]
/llvm-project-15.0.7/llvm/unittests/Support/
H A DIndexedAccessorTest.cpp54 ArrayIndexedAccessorRange<int32_t> range1(rawData1, /*start=*/0, in TEST() local
58 EXPECT_TRUE(range1 == range2); in TEST()
59 EXPECT_FALSE(range1 != range2); in TEST()
60 EXPECT_TRUE(range2 == range1); in TEST()
61 EXPECT_FALSE(range2 != range1); in TEST()
/llvm-project-15.0.7/libcxx/test/std/ranges/range.adaptors/range.all/range.ref.view/
H A Drange.ref.view.pass.cpp125 Range range1; in test() local
126 std::ranges::ref_view<Range> view1 = range1; in test()
144 Range range1; in test() local
145 std::ranges::ref_view<Range> view1 = range1; in test()
177 Range range1{8}; in test() local
178 std::ranges::ref_view<Range> view1 = range1; in test()
190 Range range1; in test() local
191 std::ranges::ref_view<Range> view1 = range1; in test()
/llvm-project-15.0.7/clang/test/CodeGen/
H A Dstruct.c79 range range1; member
86 range r = p.range1; in f8()
170 return f16_ext().range1; in f16()
182 return (rp = f18_ext()).range1; in f18()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/
H A Dranges.transform.pass.cpp165 auto range1 = std::ranges::subrange(In1(a), Sent1(In1(a + 5))); in test_iterators() local
169 range1, range2, Out(c), [](int i, int j) { return i + j; }); in test_iterators()
218 auto range1 = std::ranges::subrange(In1(a), Sent1(In1(a))); in test_iterators() local
249 auto range1 = std::ranges::subrange(In1(a), Sent1(In1(a + 5))); in test_iterators() local
252 auto ret = std::ranges::transform(range1, range2, Out(c), [](int i, int j) { return i + j; }); in test_iterators()
279 auto range1 = std::ranges::subrange(In1(a), Sent1(In1(a))); in test_iterators() local
282 auto ret = std::ranges::transform(range1, range2, Out(c), [](int i, int j) { return i + j; }); in test_iterators()
332 auto range1 = std::ranges::subrange(In1(a), Sent1(In1(a + 1))); in test_iterators() local
365 auto range1 = std::ranges::subrange(In1(a), Sent1(In1(a + 5))); in test_iterators() local
432 auto range1 = std::ranges::subrange(In1(a), Sent1(In1(a + 4))); in test_iterators() local
[all …]
/llvm-project-15.0.7/clang/tools/libclang/
H A DCXSourceLocation.cpp75 unsigned clang_equalRanges(CXSourceRange range1, CXSourceRange range2) { in clang_equalRanges() argument
76 return range1.ptr_data[0] == range2.ptr_data[0] in clang_equalRanges()
77 && range1.ptr_data[1] == range2.ptr_data[1] in clang_equalRanges()
78 && range1.begin_int_data == range2.begin_int_data in clang_equalRanges()
79 && range1.end_int_data == range2.end_int_data; in clang_equalRanges()
/llvm-project-15.0.7/clang/bindings/python/tests/cindex/
H A Dtest_location.py99 range1 = SourceRange.from_locations(location1, location2)
101 self.assertEqual(range1, range2)
105 self.assertNotEqual(range1, range3)
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/
H A Dranges.lexicographical_compare.pass.cpp44 concept HasLexicographicalCompareR = requires(Range1 range1, Range2 range2) {
45 std::ranges::lexicographical_compare(range1, range2);
90 …auto range1 = std::ranges::subrange(Iter1(d.input1.data()), Sent1(Iter1(d.input1.data() + d.input1… in test() local
93 std::ranges::lexicographical_compare(range1, range2); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/
H A Dranges.is_permutation.pass.cpp46 concept HasIsPermutationR = requires(Range1 range1, Range2 range2) {
47 std::ranges::is_permutation(range1, range2);
91 auto range1 = std::ranges::subrange(Iter1(d.input1.data()), Sent1(Iter1(d.input1.data() + N))); in test() local
93 std::same_as<bool> decltype(auto) ret = std::ranges::is_permutation(range1, range2); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
H A Dranges.find_first_of.pass.cpp55 concept HasFindFirstOfR = requires(Range1 range1, Range2 range2) {
56 std::ranges::find_first_of(range1, range2);
87 …auto range1 = std::ranges::subrange(Iter1(d.input1.data()), Sent1(Iter1(d.input1.data() + d.input1… in test() local
89 std::same_as<Iter1> decltype(auto) ret = std::ranges::find_first_of(range1, range2); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/
H A Dranges_includes.pass.cpp83 requires(Range1&& range1, Range2&& range2, Comp&& comp, Proj1&& proj1, Proj2&& proj2) {
85 std::forward<Range1>(range1),
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/
H A Dranges_partial_sort_copy.pass.cpp96 requires(Range1&& range1, Range2&& range2, Comp&& comp) {
97 std::ranges::partial_sort_copy(std::forward<Range1>(range1), std::forward<Range2>(range2),
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
H A Dranges_set_symmetric_difference.pass.cpp76 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) {
78 … std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIter>(outIter));
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/
H A Dranges_set_union.pass.cpp79 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) {
81 … std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIter>(outIter));
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/
H A Dranges_set_difference.pass.cpp82 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) {
84 … std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIter>(outIter));
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/
H A Dranges_set_intersection.pass.cpp76 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) {
78 … std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIter>(outIter));
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/
H A Dranges_merge.pass.cpp81 requires(Range1&& range1, Range2&& range2, OutIter&& outIter) {
82 …std::ranges::merge(std::forward<Range1>(range1), std::forward<Range2>(range2), std::forward<OutIte…
/llvm-project-15.0.7/mlir/test/Dialect/Affine/
H A Dloop-coalescing.mlir137 // CHECK: %[[range1:.*]] = arith.subi %[[orig_ub1]], %[[orig_lb1]]
139 // CHECK: %[[dividend1:.*]] = arith.addi %[[range1]], %[[orig_step1_minus_1]]
/llvm-project-15.0.7/clang/include/clang-c/
H A DIndex.h532 CINDEX_LINKAGE unsigned clang_equalRanges(CXSourceRange range1,