generic-library/cxx
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Move test into test/std subdirectory.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@224658 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Eric Fiselier
2014-12-20 01:40:03 +00:00
parent 669a8a5a19
commit a90c6dd460
4817 changed files with 13 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
test/std/containers/container.adaptors/queue/queue.ops/eq.pass.cpp Normal file
View File

@@ -0,0 +1,40 @@
//===----------------------------------------------------------------------===//
//
// 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);
#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);
std::queue<int> q1_save = q1;
std::queue<int> q2_save = q2;
assert(q1 == q1_save);
assert(q1 != q2);
assert(q2 == q2_save);
}

45
test/std/containers/container.adaptors/queue/queue.ops/lt.pass.cpp Normal file
View File

@@ -0,0 +1,45 @@
//===----------------------------------------------------------------------===//
//
// 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);
}