summaryrefslogtreecommitdiffstats
path: root/test/containers/sequences/container.adaptors/queue/queue.ops/lt.pass.cpp
blob: ac2c0d4ecb7564a71d06b025d9e4cb317083c0f4 (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
43
44
45
//===----------------------------------------------------------------------===//
//
// ÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊÊThe LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//

// <queue>

// template <class T, class Container>
//   bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
// 
// template <class T, class Container>
//   bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
// 
// template <class T, class Container>
//   bool operator>=(const queue<T, Container>& x,const queue<T, Container>& y);
// 
// template <class T, class Container>
//   bool operator<=(const queue<T, Container>& x,const queue<T, Container>& y);

#include <queue>
#include <cassert>

template <class C>
C
make(int n)
{
    C c;
    for (int i = 0; i < n; ++i)
        c.push(i);
    return c;
}

int main()
{
    std::queue<int> q1 = make<std::queue<int> >(5);
    std::queue<int> q2 = make<std::queue<int> >(10);
    assert(q1 < q2);
    assert(q2 > q1);
    assert(q1 <= q2);
    assert(q2 >= q1);
}