|
FE 0.16.1
Fast, Effecient FrontEnds
|
A FIFO queue over a Vector. More...
#include <fe/worklist.h>
Public Types | |
| using | value_type = T |
Public Member Functions | |
| bool | empty () const |
| size_t | size () const |
| T & | front () |
| const T & | front () const |
| T & | back () |
| const T & | back () const |
| void | push (const T &val) |
| void | push (T &&val) |
| template<class... Args> | |
| decltype(auto) | emplace (Args &&... args) |
| void | pop () |
A FIFO queue over a Vector.
Popped elements stay in place until they make up half of the storage, so pop is amortized constant.
Definition at line 18 of file worklist.h.
| using fe::VectorQueue< T, N >::value_type = T |
Definition at line 20 of file worklist.h.
|
inline |
Definition at line 27 of file worklist.h.
|
inline |
Definition at line 28 of file worklist.h.
|
inline |
Definition at line 33 of file worklist.h.
|
inline |
Definition at line 22 of file worklist.h.
|
inline |
Definition at line 25 of file worklist.h.
|
inline |
Definition at line 26 of file worklist.h.
|
inline |
Definition at line 37 of file worklist.h.
|
inline |
Definition at line 30 of file worklist.h.
|
inline |
Definition at line 31 of file worklist.h.
|
inline |
Definition at line 23 of file worklist.h.