Containers (STL-compatible) StateMachines MessageBus and more for Embedded Systems. See www.etlcpp.com
queue
A priority queue with the capacity defined at compile time, written in the STL style. More...
Data Structures | |
| class | intrusive_queue_base< TLink > |
| Base for intrusive queue. More... | |
| class | intrusive_queue< TValue, TLink > |
| An intrusive queue. More... | |
| class | priority_queue_exception |
| The base class for priority_queue exceptions. More... | |
| class | priority_queue_full |
| The exception thrown when the queue is full. More... | |
| class | priority_queue_iterator |
| The priority queue iterator exception on reversed iterators. More... | |
| class | ipriority_queue< T, TContainer, TCompare > |
| This is the base for all priority queues that contain a particular type. More... | |
| class | queue_exception |
| The base class for queue exceptions. More... | |
| class | queue_full |
| The exception thrown when the queue is full. More... | |
| class | queue_empty |
| The exception thrown when the queue is empty. More... | |
| class | queue_base |
| The base class for all queues. More... | |
| class | iqueue< T > |
| This is the base for all queues that contain a particular type. More... | |
| class | queue< T, SIZE > |
| A fixed capacity queue. More... | |
Detailed Description
A priority queue with the capacity defined at compile time, written in the STL style.
A First-in / first-out queue with the capacity defined at compile time, written in the STL style.
Generated on Tue Jul 12 2022 14:05:48 by
1.7.2