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 <cassert> 20 21 void 22 test_larger_sorts(unsigned N, unsigned M) 23 { 24 assert(N != 0); 25 int* array = new int[N]; 26 for (int i = 0; i < N; ++i) 27 array[i] = i; 28 std::random_shuffle(array, array+N); 29 std::partial_sort(array, array+M, array+N); 30 for (int i = 0; i < M; ++i) 31 assert(array[i] == i); 32 delete [] array; 33 } 34 35 void 36 test_larger_sorts(unsigned N) 37 { 38 test_larger_sorts(N, 0); 39 test_larger_sorts(N, 1); 40 test_larger_sorts(N, 2); 41 test_larger_sorts(N, 3); 42 test_larger_sorts(N, N/2-1); 43 test_larger_sorts(N, N/2); 44 test_larger_sorts(N, N/2+1); 45 test_larger_sorts(N, N-2); 46 test_larger_sorts(N, N-1); 47 test_larger_sorts(N, N); 48 } 49 50 int main() 51 { 52 int i = 0; 53 std::partial_sort(&i, &i, &i); 54 assert(i == 0); 55 test_larger_sorts(10); 56 test_larger_sorts(256); 57 test_larger_sorts(257); 58 test_larger_sorts(499); 59 test_larger_sorts(500); 60 test_larger_sorts(997); 61 test_larger_sorts(1000); 62 test_larger_sorts(1009); 63 } 64
