Home
last modified time | relevance | path

Searched refs:IntAndID (Results 1 – 2 of 2) sorted by relevance

/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/
H A Dranges_merge.pass.cpp287 struct IntAndID { in test() struct
291 constexpr auto operator==(const IntAndID& o) const { return data == o.data; } in test() argument
292 constexpr auto operator<=>(const IntAndID& o) const { return data <=> o.data; } in test() argument
297 std::array<IntAndID, 3> r1{{{0, 0}, {0, 1}, {0, 2}}}; in test()
298 std::array<IntAndID, 3> r2{{{1, 0}, {1, 1}, {1, 2}}}; in test()
302 std::array<IntAndID, 6> out; in test()
312 std::array<IntAndID, 6> out; in test()
323 std::array<IntAndID, 3> r1{{{0, 1}, {1, 1}, {2, 1}}}; in test()
324 std::array<IntAndID, 3> r2{{{0, 2}, {1, 2}, {2, 2}}}; in test()
328 std::array<IntAndID, 6> out; in test()
[all …]
H A Dranges_inplace_merge.pass.cpp262 struct IntAndID { in test() struct
265 constexpr auto operator<=>(const IntAndID& rhs) const { return data <=> rhs.data; } in test() argument
266 constexpr auto operator==(const IntAndID& rhs) const { return data == rhs.data; } in test() argument
268 std::array<IntAndID, 6> input{{{0, 0}, {1, 0}, {2, 0}, {0, 1}, {1, 1}, {2, 1}}}; in test()
274 assert(std::ranges::equal(in, std::array{0, 0, 1, 1, 2, 2}, {}, &IntAndID::data)); in test()
275 assert(std::ranges::equal(in, std::array{0, 1, 0, 1, 0, 1}, {}, &IntAndID::id)); in test()
283 assert(std::ranges::equal(in, std::array{0, 0, 1, 1, 2, 2}, {}, &IntAndID::data)); in test()
284 assert(std::ranges::equal(in, std::array{0, 1, 0, 1, 0, 1}, {}, &IntAndID::id)); in test()