2010-05-11 21:42:16 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 23:36:01 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <queue>
|
|
|
|
|
|
|
|
// priority_queue();
|
|
|
|
|
|
|
|
// template <class T, class Container, class Compare>
|
|
|
|
// void swap(priority_queue<T, Container, Compare>& x,
|
|
|
|
// priority_queue<T, Container, Compare>& y);
|
|
|
|
|
|
|
|
#include <queue>
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
|
|
|
std::priority_queue<int> q1;
|
|
|
|
std::priority_queue<int> q2;
|
|
|
|
q1.push(1);
|
|
|
|
q1.push(3);
|
|
|
|
q1.push(2);
|
|
|
|
swap(q1, q2);
|
|
|
|
assert(q1.empty());
|
|
|
|
assert(q2.size() == 3);
|
|
|
|
assert(q2.top() == 3);
|
|
|
|
}
|