31 #ifndef AIPS_USE_DEPRECATED 32 #error "Queue.h is deprecated; use -DBUILD_DEPRECATED=ON to use it" 35 #include <casacore/casa/aips.h> 36 #include <casacore/casa/Containers/Block.h> 146 #ifndef CASACORE_NO_AUTO_TEMPLATES 147 #include <casacore/casa/Containers/Queue.tcc> 148 #endif //# CASACORE_NO_AUTO_TEMPLATES
void dequeue(T &value)
Remove an element from the head of the queue and decrease nelements() by one.
void enqueue(const T &value)
Place an element in the queue.
uInt nelements() const
How many elements are in the queue?
T operator()()
Short-hand for dequeue.
void compress()
Leave this queue logically unchanged, but remove unused storage.
void clear()
Delete all the elements from the queue, and free up any resources.
A First-In-First-Out (FIFO) data structure.
Queue()
Create a Queue with no elements.
this file contains all the compiler specific defines
LatticeExprNode value(const LatticeExprNode &expr)
This function returns the value of the expression without a mask.
Queue< T > & operator=(const Queue< T > &other)
Create a queue which is a copy of other.