Searched refs:permuted (Results 1 – 8 of 8) sorted by relevance
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
| H A D | ranges.prev_permutation.pass.cpp | 60 constexpr bool run_prev_permutation(Func call_prev_permutation, Range permuted, Range previous) { in run_prev_permutation() argument
63 std::same_as<Result> decltype(auto) ret = call_prev_permutation(permuted); in run_prev_permutation()
64 assert(ret.in == permuted.end()); in run_prev_permutation()
67 if (std::ranges::distance(permuted) > 1) { in run_prev_permutation()
69 assert(std::ranges::lexicographical_compare(permuted, previous)); in run_prev_permutation()
71 assert(std::ranges::lexicographical_compare(previous, permuted)); in run_prev_permutation()
72 assert(std::ranges::is_sorted(permuted, std::ranges::greater{})); in run_prev_permutation()
|
| H A D | ranges.next_permutation.pass.cpp | 60 constexpr bool run_next_permutation(Func call_next_permutation, Range permuted, Range previous) { in run_next_permutation() argument
63 std::same_as<Result> decltype(auto) ret = call_next_permutation(permuted); in run_next_permutation()
64 assert(ret.in == permuted.end()); in run_next_permutation()
67 if (std::ranges::distance(permuted) > 1) { in run_next_permutation()
69 assert(std::ranges::lexicographical_compare(previous, permuted)); in run_next_permutation()
71 assert(std::ranges::lexicographical_compare(permuted, previous)); in run_next_permutation()
72 assert(std::ranges::is_sorted(permuted)); in run_next_permutation()
|
| /llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/ |
| H A D | IntegerPolyhedronTest.cpp | 112 SmallVector<int64_t, 4> permuted; in checkPermutationsSample() local
114 permuted.push_back(coeffs[id]); in checkPermutationsSample()
115 permuted.push_back(coeffs.back()); in checkPermutationsSample()
116 return permuted; in checkPermutationsSample()
|
| /llvm-project-15.0.7/polly/test/ScheduleOptimizer/ |
| H A D | pattern-matching-based-opts_4.ll | 15 ; dimensions of band nodes can be implicitly permuted by the algorithm
|
| /llvm-project-15.0.7/mlir/test/Dialect/Linalg/ |
| H A D | bufferize.mlir | 98 // operands. The permuted indexing maps translate to different output shapes.
|
| /llvm-project-15.0.7/mlir/test/Dialect/SparseTensor/ |
| H A D | conversion.mlir | 52 // permuted into querying for dimension 2 in the stored sparse
|
| /llvm-project-15.0.7/mlir/docs/Dialects/ |
| H A D | Vector.md | 146 permuted loops over scalar load/stores. This should evolve to loops over
|
| /llvm-project-15.0.7/mlir/test/Dialect/Vector/ |
| H A D | canonicalize.mlir | 502 // Not a minor identity map so intra-vector level has been permuted
|