|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <iostream>#include <string>#include <cstdlib>#include <cerrno>#include <climits>#include <stdexcept>#include <tpl_arrayQueue.H>Go to the source code of this file.
Classes | |
| struct | Foo |
Functions | |
| template<typename T > | |
| void | print (const ArrayQueue< T > &q) |
| template<typename T > | |
| ArrayQueue< T > | create_queue (int n) |
| int | main (int argc, char *argv[]) |
Variables | |
| int | g_count = -1 |
| ArrayQueue< T > create_queue | ( | int | n | ) |
Definition at line 141 of file testQueue.C.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::ArrayQueue< T >::put().
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 152 of file testQueue.C.
References Aleph::divide_and_conquer_partition_dp(), Aleph::ArrayQueue< T >::get(), Aleph::ArrayQueue< T >::getn(), m, print(), Aleph::ArrayQueue< T >::put(), and Aleph::ArrayQueue< T >::rear().
| void print | ( | const ArrayQueue< T > & | q | ) |
Definition at line 125 of file testQueue.C.
References Aleph::MemArray< T >::capacity(), Aleph::divide_and_conquer_partition_dp(), Aleph::ArrayQueue< T >::front(), Aleph::ArrayQueue< T >::rear(), and Aleph::MemArray< T >::size().
Referenced by main().
| int g_count = -1 |
Definition at line 38 of file testQueue.C.