icy::Queue — icey

Queue

#include <icy/queue.h>

Subclassed by: RunnableQueue< IPacket >, RunnableQueue< PacketT >, PlanarAudioPacket >, RunnableQueue< VisionFramePacket >

Thread-safe queue container.

Return	Name	Description
`void`	`push` `inline`	Appends an item to the back of the queue (thread-safe).
`void`	`push` `inline`	Appends an item to the back of the queue by move (thread-safe).
`bool`	`empty` `const` `inline`	#### Returns
`T`	`front` `const` `inline`	#### Returns
`T`	`back` `const` `inline`	#### Returns
`void`	`pop` `inline`	Removes the front item from the queue (thread-safe).
`void`	`sort` `inline`	Sorts all queued items using the given comparator (thread-safe).
`size_t`	`size` `const` `inline`	#### Returns
`std::deque< T >`	`queue` `const` `inline`	#### Returns

inline

inline void push(const T & data)

Appends an item to the back of the queue (thread-safe).

inline

inline void push(T && data)

Appends an item to the back of the queue by move (thread-safe).

const inline

inline bool empty() const

True if the queue contains no items.

const inline

inline T front() const

Copy of the front item.

const inline

inline T back() const

Copy of the back item.

inline

inline void pop()

Removes the front item from the queue (thread-safe).

inline

template<typename Compare> inline void sort()

Sorts all queued items using the given comparator (thread-safe).

const inline

inline size_t size() const

Number of items currently in the queue (thread-safe).

const inline

inline std::deque< T > queue() const

Copy of the underlying deque.

Return	Name	Description
`std::deque< T >`	`_queue`
`std::mutex`	`_mutex`

std::deque< T > _queue

std::mutex _mutex