#include <CircularQueue.hpp>
◆ OverwritingCircularQueue() [1/2]
template<typename T , uint64_t Size>
◆ OverwritingCircularQueue() [2/2]
template<typename T , uint64_t Size>
◆ clear()
template<typename T , uint64_t Size>
◆ empty()
template<typename T , uint64_t Size>
◆ full()
template<typename T , uint64_t Size>
◆ get()
template<typename T , uint64_t Size>
◆ occupied()
template<typename T , uint64_t Size>
◆ pop() [1/2]
template<typename T , uint64_t Size>
◆ pop() [2/2]
template<typename T , uint64_t Size>
◆ popWithFilter()
template<typename T , uint64_t Size>
◆ push()
template<typename T , uint64_t Size>
Pushes an item into the queue. If the queue is full, it will pop the front item and push the new one.
- Parameters
-
- Returns
- true If the queue popped some elements in order to push the new one, otherwise, false.
Reimplemented from iv::containers::CircularQueue< T, Size >.
◆ size()
template<typename T , uint64_t Size>
◆ unblockingEmpty()
template<typename T , uint64_t Size>
|
inlinenodiscardprivateinherited |
◆ unblockingFull()
template<typename T , uint64_t Size>
|
inlinenodiscardprivateinherited |
◆ unblockingPop()
template<typename T , uint64_t Size>
◆ m_cond
template<typename T , uint64_t Size>
◆ m_data
template<typename T , uint64_t Size>
◆ m_front
template<typename T , uint64_t Size>
◆ m_mutex
template<typename T , uint64_t Size>
◆ m_occupied
template<typename T , uint64_t Size>
◆ m_rear
template<typename T , uint64_t Size>
The documentation for this class was generated from the following file: