This functionality is only available in the C++ toolkits. For other languages, we recommend using language-specific functionality instead.
First-in-first-out (FIFO) queue that only allows for any number of items to be stored in the buffer, hence, “unbounded”. It is not inherently thread safe by itself. Use this in conjunction with a OEProtectedBuffer to make a thread-safe queue.
The constructor argument is unused and reserved for future use. It is only there to comply with the OEBoundedBuffer constructor interface.
bool Empty() const
Returns whether the queue contains any items.
bool Full() const
true if the queue contains
Pops the next item off of the queue.
Returns the item that will be returned by the next call to
OEBoundedBuffer.Get, but does not remove
it from the queue.
void Put(T obj)
Pushes an item into the queue.
oesize_t Size() const
Returns the current number of items in the queue.