39 #ifndef ORO_CORELIB_ATOMIC_QUEUE_HPP 40 #define ORO_CORELIB_ATOMIC_QUEUE_HPP 68 virtual bool isFull()
const = 0;
74 virtual bool isEmpty()
const = 0;
79 virtual size_type
capacity()
const = 0;
86 virtual size_type
size()
const = 0;
93 virtual bool enqueue(
const T& value) = 0;
100 virtual bool dequeue( T& result ) = 0;
105 virtual const T
front()
const = 0;
110 virtual void clear() = 0;
An atomic, non-blocking single ended queue (FIFO) for storing a pointer to T.
virtual size_type capacity() const =0
Return the maximum number of items this queue can contain.
virtual void clear()=0
Clear all contents of the Queue and thus make it empty.
virtual bool isEmpty() const =0
Inspect if the Queue is empty.
virtual bool dequeue(T &result)=0
Dequeue an item.
virtual bool enqueue(const T &value)=0
Enqueue an item.
virtual const T front() const =0
Return the next to be read value.
virtual size_type size() const =0
Return the exact number of elements in the queue.
Contains TaskContext, Activity, OperationCaller, Operation, Property, InputPort, OutputPort, Attribute.
virtual bool isFull() const =0
Inspect if the Queue is full.