Dataflow Runtime API
3.1.1.0
|
LinkedList specialization for single linked list class. More...
#include <Imt.Base.Core.Util/LinkedList.h>
Public Member Functions | |
LinkedList (Allocator &listAllocator, size_t listSize) | |
constructor More... | |
LinkedListIterator< Node > | begin () |
LinkedListConstIterator< Node > | cbegin () const |
LinkedListIterator< Node > | end () |
LinkedListConstIterator< Node > | cend () const |
void | push_back (const T &e) |
Adds a new element to the back of the list. More... | |
void | pop_front () |
Removes the front element of the list. More... | |
T & | front () |
Retunrns the front element of the list. More... | |
const T & | front () const |
Retunrns the front element of the list. More... | |
size_t | size () const |
Returns the current number of elements in the linked list. More... | |
bool | empty () const |
Returns if the list is empty. More... | |
bool | full () const |
Returns if the list is full. More... | |
LinkedList specialization for single linked list class.
|
inline |
constructor
listAllocator | must pass an initialized Alloctor |
listSize | number of T that can be stored inside the Allocator |
|
inline |
|
inline |
|
inline |
|
inline |
Returns if the list is empty.
|
inline |
|
inline |
Retunrns the front element of the list.
|
inline |
Retunrns the front element of the list.
|
inline |
Returns if the list is full.
|
inline |
Removes the front element of the list.
|
inline |
Adds a new element to the back of the list.
e | The new element to copy to the list node. |
|
inline |
Returns the current number of elements in the linked list.