Home
last modified time | relevance | path

Searched refs:all_equal (Results 1 – 4 of 4) sorted by relevance

/llvm-project-15.0.7/libcxx/test/libcxx/algorithms/
H A Dsort_stability.pass.cpp50 bool all_equal = true; in test_randomization() local
53 all_equal = false; in test_randomization()
56 assert(!all_equal); in test_randomization()
72 bool all_equal = true; in test_same() local
75 all_equal = false; in test_same()
78 assert(all_equal); in test_same()
H A Dpartial_sort_stability.pass.cpp51 bool all_equal = true; in test_randomization() local
54 all_equal = false; in test_randomization()
57 assert(!all_equal); in test_randomization()
72 bool all_equal = true; in test_same() local
75 all_equal = false; in test_same()
81 assert(all_equal); in test_same()
H A Dnth_element_stability.pass.cpp50 bool all_equal = true; in test_randomization() local
53 all_equal = false; in test_randomization()
56 assert(!all_equal); in test_randomization()
71 bool all_equal = true; in test_same() local
74 all_equal = false; in test_same()
80 assert(all_equal); in test_same()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
H A Dminmax_init_list_comp.pass.cpp26 bool all_equal(int, int) { return false; } // everything is equal in all_equal() function
30 binary_counting_predicate<bool(*)(int, int), int, int> pred (all_equal); in test_all_equal()
46 assert((std::minmax({1, 2, 3}, all_equal ) == std::pair<int, int>(1, 3))); in main()