1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===//
2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//
3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant//                     The LLVM Compiler Infrastructure
4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//
5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open
6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details.
7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//
8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===//
9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant
10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <algorithm>
11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant
12eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant// template<InputIterator InIter, RandomAccessIterator RAIter>
13eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant//   requires ShuffleIterator<RAIter>
14eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant//         && OutputIterator<RAIter, InIter::reference>
15eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant//         && HasLess<InIter::value_type, RAIter::value_type>
16eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant//         && LessThanComparable<RAIter::value_type>
17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//   RAIter
18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//   partial_sort_copy(InIter first, InIter last, RAIter result_first, RAIter result_last);
19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant
20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <algorithm>
21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert>
22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant
2383e2c4d877fe2d7793868b1c6a5d9525a7c4d431Marshall Clow#include "test_iterators.h"
24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant
25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttemplate <class Iter>
26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid
27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttest_larger_sorts(unsigned N, unsigned M)
28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{
29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    int* input = new int[N];
30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    int* output = new int[M];
31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    for (int i = 0; i < N; ++i)
32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant        input[i] = i;
33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    std::random_shuffle(input, input+N);
34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    int* r = std::partial_sort_copy(Iter(input), Iter(input+N), output, output+M);
35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    int* e = output + std::min(N, M);
36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    assert(r == e);
37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    int i = 0;
38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    for (int* x = output; x < e; ++x, ++i)
39bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant        assert(*x == i);
40bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    delete [] output;
41bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    delete [] input;
42bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}
43bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant
44bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttemplate <class Iter>
45bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid
46bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttest_larger_sorts(unsigned N)
47bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{
48bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, 0);
49bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, 1);
50bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, 2);
51bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, 3);
52bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, N/2-1);
53bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, N/2);
54bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, N/2+1);
55bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, N-2);
56bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, N-1);
57bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, N);
58bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(N, N+1000);
59bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}
60bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant
61bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttemplate <class Iter>
62bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid
63bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnanttest()
64bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{
65bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(0, 100);
66bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(10);
67bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(256);
68bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(257);
69bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(499);
70bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(500);
71bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(997);
72bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(1000);
73bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test_larger_sorts<Iter>(1009);
74bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}
75bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant
76bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main()
77bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{
78bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    int i = 0;
79bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    std::partial_sort_copy(&i, &i, &i, &i+5);
80bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    assert(i == 0);
81bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test<input_iterator<const int*> >();
82bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test<forward_iterator<const int*> >();
83bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test<bidirectional_iterator<const int*> >();
84bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test<random_access_iterator<const int*> >();
85bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant    test<const int*>();
86bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant}
87