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
46
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <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(int, char**)
{
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);
return 0;
}
|
