Home
last modified time | relevance | path

Searched refs:NonTrivialSortable (Results 1 – 6 of 6) sorted by relevance

/llvm-project/libcxx/test/std/algorithms/alg.sorting/
H A Dsortable_helpers.h35 struct NonTrivialSortable { struct
37 TEST_CONSTEXPR NonTrivialSortable() : value(0) {} in NonTrivialSortable() function
38 TEST_CONSTEXPR NonTrivialSortable(int v) : value(v) {} in NonTrivialSortable() function
39 TEST_CONSTEXPR NonTrivialSortable(const NonTrivialSortable& rhs) : value(rhs.value) {} in NonTrivialSortable() argument
40 …TEST_CONSTEXPR_CXX14 NonTrivialSortable& operator=(const NonTrivialSortable& rhs) { value = rhs.va…
41 friend TEST_CONSTEXPR bool operator<(const NonTrivialSortable& a, const NonTrivialSortable& b) {
44 static TEST_CONSTEXPR bool less(const NonTrivialSortable& a, const NonTrivialSortable& b) { in less() argument
82 static_assert(!std::is_trivially_copyable<NonTrivialSortable>::value, "");
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.merge/
H A Dmerge.pass.cpp85 test1<NonTrivialSortable>(); in test()
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
H A Dset_symmetric_difference.pass.cpp85 test1<NonTrivialSortable>(); in test()
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/
H A Dset_intersection.pass.cpp85 test1<NonTrivialSortable>(); in test()
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/
H A Dset_difference.pass.cpp85 test1<NonTrivialSortable>(); in test()
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/
H A Dset_union.pass.cpp85 test1<NonTrivialSortable>(); in test()