template<typename T>
class FixedSizeQueue< T >
This class implements a FIFO queue with a specified capacity. It additionally provides iteration over the entire queue. The oldest entries are overwritten if new entries are added if the maximal capacity has been reached.
- Template Parameters
-
| T | The type of elements to store. |
- Note
- This is not the most efficient implementation! For a more efficient implementation, a std::vector should be used. In that case, either an own iterator class is needed or the order of the elements is lost through the iterators.