Searched refs:HashBits (Results 1 – 7 of 7) sorted by relevance
| /external/llvm-project/pstl/test/std/algorithms/alg.nonmodifying/ |
| D | none_of.pass.cpp | 50 Sequence<T> in(n, [n, bits](size_t) { return T(2 * HashBits(n, bits - 1) ^ 1); }); in test()
53 T spike(2 * HashBits(n, bits - 1)); in test()
|
| D | any_of.pass.cpp | 50 Sequence<T> in(n, [n, bits](size_t) { return T(2 * HashBits(n, bits - 1) ^ 1); }); in test()
53 T spike(2 * HashBits(n, bits - 1)); in test()
|
| D | all_of.pass.cpp | 64 Sequence<T> in(n, [n, bits](size_t) { return T(2 * HashBits(n, bits - 1) ^ 1); }); in test()
67 T spike(2 * HashBits(n, bits - 1)); in test()
|
| D | find_end.pass.cpp | 73 Sequence<T> in(max_n1, [bits](std::size_t) { return T(2 * HashBits(max_n1, bits - 1) ^ 1); }); in test()
74 Sequence<T> sub(max_n2, [bits](std::size_t) { return T(2 * HashBits(max_n1, bits - 1)); }); in test()
|
| D | equal.pass.cpp | 128 Sequence<T> in(n, [bits](size_t k) { return T(2 * HashBits(k, bits - 1) ^ 1); }); in test()
|
| /external/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.min.max/ |
| D | minmax_element.pass.cpp | 84 seq.fill([](std::size_t i) -> T { return T(TestUtils::HashBits(i, bits)); }); in pattern_fill()
96 for (std::size_t i = at + 1; i < seq.size(); i += 1 + TestUtils::HashBits(i, 5)) in set_desired_value()
|
| /external/llvm-project/pstl/test/support/ |
| D | utils.h | 486 HashBits(size_t i, size_t bits) in HashBits() function
|