GHS
Leader Election Based on GHS Minimum Spanning Tree
|
Go to the documentation of this file.
39 #ifndef STATIC_QUEUE_H
40 #define STATIC_QUEUE_H
59 template<
typename T,
unsigned int N>
85 unsigned int size()
const;
137 le::Errno at(
const unsigned int idx, T &out_item )
const;
145 unsigned int idx_front;
146 unsigned int idx_back;
Static Queue Implementation.
Errno
Definition: errno.h:49
StaticQueue()
Definition: static_queue_impl.hpp:43
a static-sized single-ended queue for use in GhsState
Definition: static_queue.h:60
le::Errno at(const unsigned int idx, T &out_item) const
Definition: static_queue_impl.hpp:126
Definition: static_queue.h:47
bool is_empty() const
Definition: static_queue_impl.hpp:59
le::Errno pop()
Definition: static_queue_impl.hpp:96
le::Errno push(const T item)
Definition: static_queue_impl.hpp:69
le::Errno front(T &out_item) const
Definition: static_queue_impl.hpp:91
bool is_full() const
Definition: static_queue_impl.hpp:54
unsigned int size() const
Definition: static_queue_impl.hpp:64
Provides error codes for all classes / functions.