| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | StatisticTest.cpp | 87 const auto Range1 = GetStatistics(); in TEST() local
88 EXPECT_NE(Range1.begin(), Range1.end()); in TEST()
89 EXPECT_EQ(Range1.begin() + 1, Range1.end()); in TEST()
93 extractCounters(Range1, S1, S2); in TEST()
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.req/range.refinements/ |
| H A D | common_range.compile.pass.cpp | 49 struct Range1 { struct
54 static_assert(!std::ranges::common_range<Range1>);
55 static_assert( std::ranges::common_range<Range1 const>);
|
| /llvm-project-15.0.7/clang-tools-extra/clang-tidy/bugprone/ |
| H A D | SuspiciousEnumUsageCheck.cpp | 59 ValueRange Range1(Enum1), Range2(Enum2); in hasDisjointValueRange() local
60 return llvm::APSInt::compareValues(Range1.MaxVal, Range2.MinVal) < 0 || in hasDisjointValueRange()
61 llvm::APSInt::compareValues(Range2.MaxVal, Range1.MinVal) < 0; in hasDisjointValueRange()
|
| /llvm-project-15.0.7/llvm/unittests/IR/ |
| H A D | BasicBlockTest.cpp | 94 #define CHECK_ITERATORS(Range1, Range2) \ argument
95 EXPECT_EQ(std::distance(Range1.begin(), Range1.end()), \
97 for (auto Pair : zip(Range1, Range2)) \
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| H A D | ranges_includes.pass.cpp | 77 class Range1,
83 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 D | ranges_partial_sort_copy.pass.cpp | 94 template <class Range1 = R<int*>, class Range2 = R<int*>, class Comp = std::ranges::less>
96 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.lex.comparison/ |
| H A D | ranges.lexicographical_compare.pass.cpp | 43 template <class Range1, class Range2 = UncheckedRange<int*>>
44 concept HasLexicographicalCompareR = requires(Range1 range1, Range2 range2) {
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | ranges.is_permutation.pass.cpp | 45 template <class Range1, class Range2 = UncheckedRange<int*>>
46 concept HasIsPermutationR = requires(Range1 range1, Range2 range2) {
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| H A D | ranges.find_first_of.pass.cpp | 54 template <class Range1, class Range2 = UncheckedRange<int*>>
55 concept HasFindFirstOfR = requires(Range1 range1, Range2 range2) {
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| H A D | ranges_set_symmetric_difference.pass.cpp | 74 template <class Range1, class Range2, class OutIter>
76 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 D | ranges_set_union.pass.cpp | 77 template <class Range1, class Range2, class OutIter>
79 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/ |
| H A D | ranges_robust_against_proxy_iterators.pass.cpp | 38 template <class Func, std::ranges::range Range1, std::ranges::range Range2, class ...Args>
39 constexpr void test(Func&& func, Range1& r1, Range2& r2, Args&& ...args) { in test()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| H A D | ranges.search_n.pass.cpp | 46 template <class Range1, class Range2 = UncheckedRange<int*>>
47 concept HasSearchNR = requires (Range1 range) {
|
| H A D | ranges.search.pass.cpp | 51 template <class Range1, class Range2 = UncheckedRange<int*>>
52 concept HasSearchR = requires (Range1 range1, Range2 range2) {
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| H A D | ranges_set_difference.pass.cpp | 80 template <class Range1, class Range2, class OutIter>
82 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 D | ranges_set_intersection.pass.cpp | 74 template <class Range1, class Range2, class OutIter>
76 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.nonmodifying/alg.equal/ |
| H A D | ranges.equal.pass.cpp | 54 template <class Range1, class Range2>
55 concept HasEqualR = requires (Range1 range1, Range2 range2) {
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| H A D | ranges_merge.pass.cpp | 79 template <class Range1, class Range2, class OutIter>
81 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/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| H A D | ranges.find_end.pass.cpp | 50 template <class Range1, class Range2 = UncheckedRange<int*>>
51 concept HasFindEndR = requires (Range1 range1, Range2 range2) {
|
| /llvm-project-15.0.7/llvm/unittests/Transforms/Vectorize/ |
| H A D | VPlanTest.cpp | 22 #define CHECK_ITERATOR(Range1, ...) \ argument
25 EXPECT_EQ((size_t)std::distance(Range1.begin(), Range1.end()), \
27 for (auto Pair : zip(Range1, make_range(Tmp.begin(), Tmp.end()))) \
|
| /llvm-project-15.0.7/llvm/test/DebugInfo/X86/ |
| H A D | dwarfdump-rnglists.s | 179 Range1_start: # Range1: 0x2a - 0x34
|
| H A D | dwarfdump-rnglists-dwarf64.s | 185 Range1_start: # Range1: 0x2a - 0x34
|
| /llvm-project-15.0.7/llvm/unittests/DebugInfo/GSYM/ |
| H A D | GSYMTest.cpp | 619 const AddressRange Range1(0x1000, 0x1010); in TEST() local
621 encodeRange(Range1, FW, BaseAddr); in TEST()
631 EXPECT_EQ(Range1, DecodedRange1); in TEST()
|
| /llvm-project-15.0.7/llvm/utils/TableGen/ |
| H A D | CodeGenSchedule.cpp | 140 auto Range1 = in apply() local
154 std::for_each(Range1.first, Range1.second, HandleNonGeneric); in apply()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | BasicAliasAnalysis.cpp | 1262 ConstantRange Range1 = OffsetRange.add( in aliasGEP() local
1266 if (Range1.intersectWith(Range2).isEmptySet()) in aliasGEP()
|