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> 13 // requires ShuffleIterator<Iter> 14 // && LessThanComparable<Iter::value_type> 15 // void 16 // partial_sort(Iter first, Iter middle, Iter last); 17 18 #include <algorithm> 19 #include <random> 20 #include <cassert> 21 22 std::mt19937 randomness; 23 24 void 25 test_larger_sorts(int N, int M) 26 { 27 assert(N != 0); 28 assert(N >= M); 29 int* array = new int[N]; 30 for (int i = 0; i < N; ++i) 31 array[i] = i; 32 std::shuffle(array, array+N, randomness); 33 std::partial_sort(array, array+M, array+N); 34 for (int i = 0; i < M; ++i) 35 { 36 assert(i < N); // quiet analysis warnings 37 assert(array[i] == i); 38 } 39 delete [] array; 40 } 41 42 void 43 test_larger_sorts(int N) 44 { 45 test_larger_sorts(N, 0); 46 test_larger_sorts(N, 1); 47 test_larger_sorts(N, 2); 48 test_larger_sorts(N, 3); 49 test_larger_sorts(N, N/2-1); 50 test_larger_sorts(N, N/2); 51 test_larger_sorts(N, N/2+1); 52 test_larger_sorts(N, N-2); 53 test_larger_sorts(N, N-1); 54 test_larger_sorts(N, N); 55 } 56 57 int main() 58 { 59 int i = 0; 60 std::partial_sort(&i, &i, &i); 61 assert(i == 0); 62 test_larger_sorts(10); 63 test_larger_sorts(256); 64 test_larger_sorts(257); 65 test_larger_sorts(499); 66 test_larger_sorts(500); 67 test_larger_sorts(997); 68 test_larger_sorts(1000); 69 test_larger_sorts(1009); 70 } 71
