blob: b220e1775d6d712b7383f9fb2e301927cce0b664 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
|
//===----------------------------------------------------------------------===//
//
// ÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊThe LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <forward_list>
// template <class Compare> void sort(Compare comp);
#include <forward_list>
#include <iterator>
#include <algorithm>
#include <vector>
#include <functional>
#include <cassert>
void test(int N)
{
typedef int T;
typedef std::forward_list<T> C;
typedef std::vector<T> V;
V v;
for (int i = 0; i < N; ++i)
v.push_back(i);
std::random_shuffle(v.begin(), v.end());
C c(v.begin(), v.end());
c.sort(std::greater<T>());
assert(distance(c.begin(), c.end()) == N);
C::const_iterator j = c.begin();
for (int i = 0; i < N; ++i, ++j)
assert(*j == N-1-i);
}
int main()
{
for (int i = 0; i < 40; ++i)
test(i);
}
|
