minix/external/bsd/libc++/dist/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/ctor_comp.pass.cpp

28 lines
718 B
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>
// explicit priority_queue(const Compare& comp);
#include <queue>
#include <cassert>
#include "../../../stack_allocator.h"
int main()
{
std::priority_queue<int, std::vector<int, stack_allocator<int, 10> > > q((std::less<int>()));
assert(q.size() == 0);
q.push(1);
q.push(2);
assert(q.size() == 2);
assert(q.top() == 2);
}