This example code is explained in the STXXL Priority Queue section
#include <iostream>
#include <limits>
struct ComparatorGreater
{
bool operator () (const int& a, const int& b) const
{ return (a > b); }
int min_value() const
};
int main()
{
typedef pqueue_type::block_type block_type;
const unsigned int mem_for_pools = 32 * 1024 * 1024;
pqueue_type my_pqueue(pool);
my_pqueue.push(5);
my_pqueue.push(4);
my_pqueue.push(19);
my_pqueue.push(1);
assert(my_pqueue.size() == 4);
assert(my_pqueue.top() == 1);
STXXL_MSG(
"Smallest inserted value in my: " << my_pqueue.top());
my_pqueue.pop();
assert(my_pqueue.top() == 4);
STXXL_MSG(
"Smallest value after 1 pop(): " << my_pqueue.top());
return 0;
}