41 lines
1012 B
C++
41 lines
1012 B
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
|
//
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>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);
|
|||
|
|
|
|||
|
|
#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);
|
|||
|
|
}
|