Template for typesafe basic object queue container.
More...
#include <linked.h>
|
| void | add (T *object) |
| | Add an object to the end of the object queue.
|
| |
|
| objqueue () |
| | Create a new object stack.
|
| |
| T * | pop (void) |
| | Pop an object from the end of the object queue.
|
| |
| T * | pull (void) |
| | Pull an object from the start of the object queue.
|
| |
| void | push (T *object) |
| | Push an object to start of queue.
|
| |
| void | add (DLinkedObject *object) |
| | Add an object to the end of the queue.
|
| |
|
| ObjectQueue () |
| | Create an empty object queue.
|
| |
| DLinkedObject * | pop (void) |
| | Pop an object from the end of the queue.
|
| |
| DLinkedObject * | pull (void) |
| | Pull an object from the front of the queue.
|
| |
| void | push (DLinkedObject *object) |
| | Push an object to the front of the queue.
|
| |
| void | add (OrderedObject *ordered) |
| | Add an object into the ordered index.
|
| |
| LinkedObject * | begin (void) const |
| | Return first object in list for iterators.
|
| |
| unsigned | count (void) const |
| | Count of objects this list manages.
|
| |
| LinkedObject * | end (void) const |
| | Return last object in list for iterators.
|
| |
| LinkedObject * | find (unsigned offset) const |
| | Find a specific member in the ordered list.
|
| |
| LinkedObject * | get (void) |
| | Get (pull) object off the list.
|
| |
| LinkedObject * | getIndexed (unsigned index) const |
| | Get an indexed member from the ordered index.
|
| |
| LinkedObject ** | index (void) const |
| | Return a pointer to the head of the list.
|
| |
| virtual void | lock_index (void) |
| | Used to synchronize lists managed by multiple threads.
|
| |
| LinkedObject * | operator* () const |
| | Return head object pointer.
|
| |
| void | operator*= (OrderedObject *object) |
| | Add object to our list.
|
| |
| OrderedIndex & | operator= (const OrderedIndex &object) |
| | Assign ordered index.
|
| |
|
| OrderedIndex () |
| | Create and initialize an empty index.
|
| |
|
| OrderedIndex (const OrderedIndex &source) |
| |
|
void | purge (void) |
| | Purge the linked list and then set the index to empty.
|
| |
|
void | reset (void) |
| | Reset linked list to empty without purging.
|
| |
| virtual void | unlock_index (void) |
| | Used to synchronize lists managed by multiple threads.
|
| |
|
virtual | ~OrderedIndex () |
| | Destroy index.
|
| |
template<class T>
class ucommon::objqueue< T >
Template for typesafe basic object queue container.
The object type, T, that is contained in the fifo must be derived from DLinkedObject.
- Author
- David Sugar dyfet.nosp@m.@gnu.nosp@m.telep.nosp@m.hony.nosp@m..org
Definition at line 1244 of file linked.h.
Add an object to the end of the object queue.
- Parameters
-
| object | of specified type to add. |
Definition at line 1263 of file linked.h.
Pop an object from the end of the object queue.
- Returns
- object of specified type or NULL if empty.
Definition at line 1277 of file linked.h.
Pull an object from the start of the object queue.
- Returns
- object of specified type or NULL if empty.
Definition at line 1270 of file linked.h.
Push an object to start of queue.
- Parameters
-
| object | of specified type to push. |
Definition at line 1256 of file linked.h.
The documentation for this class was generated from the following file: