I/O efficient queue. More...
#include <tpie/portability.h>#include <tpie/deprecated.h>#include <tpie/err.h>#include <tpie/tempname.h>#include <tpie/file_stream.h>#include <tpie/internal_queue.h>#include <limits>#include <tpie/persist.h>Go to the source code of this file.
Classes | |
| class | tpie::queue< T > |
| Basic Implementation of I/O Efficient FIFO queue. More... | |
Namespaces | |
| tpie | |
| pipelining/factory_base.h Base class of pipelining factories | |
| tpie::ami | |
| A version of sort that takes an input stream of elements of type T, and an output stream, and and uses the < operator to sort, see also Sorting in TPIE. | |
Functions | |
| tpie::ami::TPIE_DEPRECATED_CLASS_A (template< typename T > class TPIE_DEPRECATED_CLASS_B queue:public tpie::queue< T >{public:queue(){}queue(const std::string &basename):tpie::queue< T >(basename){}bool is_empty(){return this->empty();}err enqueue(const T &t){this->push(t);return NO_ERROR;}err dequeue(const T **t){try{*t=&this->pop();}catch(end_of_stream_exception e){return ami::END_OF_STREAM;}return NO_ERROR;}err peek(const T **t){*t=&this->front();return NO_ERROR;}err trim(){return NO_ERROR;}void persist(persistence){}};) | |
I/O efficient queue.
Definition in file queue.h.