1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <algorithm> 11 12 // template<RandomAccessIterator Iter, StrictWeakOrder<auto, Iter::value_type> Compare> 13 // requires ShuffleIterator<Iter> 14 // && CopyConstructible<Compare> 15 // void 16 // partial_sort(Iter first, Iter middle, Iter last, Compare comp); 17 18 #include <algorithm> 19 #include <vector> 20 #include <functional> 21 #include <random> 22 #include <cassert> 23 #include <cstddef> 24 #include <memory> 25 26 #include "test_macros.h" 27 28 struct indirect_less 29 { 30 template <class P> 31 bool operator()(const P& x, const P& y) 32 {return *x < *y;} 33 }; 34 35 std::mt19937 randomness; 36 37 void 38 test_larger_sorts(int N, int M) 39 { 40 assert(N != 0); 41 assert(N >= M); 42 int* array = new int[N]; 43 for (int i = 0; i < N; ++i) 44 array[i] = i; 45 std::shuffle(array, array+N, randomness); 46 std::partial_sort(array, array+M, array+N, std::greater<int>()); 47 for (int i = 0; i < M; ++i) 48 { 49 assert(i < N); // quiet analysis warnings 50 assert(array[i] == N-i-1); 51 } 52 delete [] array; 53 } 54 55 void 56 test_larger_sorts(int N) 57 { 58 test_larger_sorts(N, 0); 59 test_larger_sorts(N, 1); 60 test_larger_sorts(N, 2); 61 test_larger_sorts(N, 3); 62 test_larger_sorts(N, N/2-1); 63 test_larger_sorts(N, N/2); 64 test_larger_sorts(N, N/2+1); 65 test_larger_sorts(N, N-2); 66 test_larger_sorts(N, N-1); 67 test_larger_sorts(N, N); 68 } 69 70 int main() 71 { 72 { 73 int i = 0; 74 std::partial_sort(&i, &i, &i); 75 assert(i == 0); 76 test_larger_sorts(10); 77 test_larger_sorts(256); 78 test_larger_sorts(257); 79 test_larger_sorts(499); 80 test_larger_sorts(500); 81 test_larger_sorts(997); 82 test_larger_sorts(1000); 83 test_larger_sorts(1009); 84 } 85 86 #if TEST_STD_VER >= 11 87 { 88 std::vector<std::unique_ptr<int> > v(1000); 89 for (int i = 0; static_cast<std::size_t>(i) < v.size(); ++i) 90 v[i].reset(new int(i)); 91 std::partial_sort(v.begin(), v.begin() + v.size()/2, v.end(), indirect_less()); 92 for (int i = 0; static_cast<std::size_t>(i) < v.size()/2; ++i) 93 assert(*v[i] == i); 94 } 95 #endif 96 } 97
