39 #ifndef ORO_LOCKED_QUEUE_HPP 40 #define ORO_LOCKED_QUEUE_HPP 43 #include "../os/Mutex.hpp" 44 #include "../os/MutexLock.hpp" 63 typedef std::deque<value_t> BufferType;
64 typedef typename BufferType::iterator Iterator;
65 typedef typename BufferType::const_iterator CIterator;
115 return data.size() == cap;
133 if (cap == data.size() )
135 data.push_back(value);
151 result = data.front();
bool enqueue(const T &value)
Enqueue an item.
size_type capacity() const
LockedQueue(unsigned int lsize)
Create a lock-based queue wich can store lsize elements.
bool isEmpty() const
Inspect if the Queue is empty.
value_t front() const
Returns the first element of the queue.
value_t back() const
Returns the last element of the queue.
bool isFull() const
Inspect if the Queue is full.
A lock-based queue implementation to enqueue or dequeue a pointer of type T.
An object oriented wrapper around a non recursive mutex.
Contains TaskContext, Activity, OperationCaller, Operation, Property, InputPort, OutputPort, Attribute.
bool dequeue(T &result)
Dequeue an item.
MutexLock is a scope based Monitor, protecting critical sections with a Mutex object through locking ...