csFIFO< T, ElementHandler, MemoryAllocator > Class Template Reference
A FIFO implemented on top of csArray<>, but faster than using just a single array. More...
#include <csutil/fifo.h>
Public Member Functions | |
csFIFO (size_t icapacity=0, size_t ithreshold=0) | |
Construct the FIFO. | |
bool | Delete (T const &what) |
Linearly search for an item and delete it. | |
void | DeleteAll () |
Delete all items. | |
size_t | Length () |
Return number of elements. | |
T | PopTop () |
Return and remove the first element. | |
void | Push (T const &what) |
Push an element onto the FIFO. |
Detailed Description
template<class T, class ElementHandler = csArrayElementHandler<T>, class MemoryAllocator = csArrayMemoryAllocator<T>>
class csFIFO< T, ElementHandler, MemoryAllocator >
A FIFO implemented on top of csArray<>, but faster than using just a single array.
Definition at line 35 of file fifo.h.
Constructor & Destructor Documentation
|
Construct the FIFO. See csArray<> documentation for meaning of parameters. |
Member Function Documentation
|
Linearly search for an item and delete it.
|
|
Delete all items.
|
|
Return number of elements.
|
|
Return and remove the first element.
Definition at line 49 of file fifo.h. References CS_ASSERT. |
|
Push an element onto the FIFO.
|
The documentation for this class was generated from the following file:
- csutil/fifo.h
Generated for Crystal Space by doxygen 1.4.6