cxx/test/containers/container.adaptors/queue/queue.ops/lt.pass.cpp

46 lines
1.2 KiB
C++
Raw Normal View History

//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. 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);
}