|
| | StaticStack (void) |
| |
| | StaticStack (const StaticStack< T, N > &s) |
| |
| void | copy (const StaticStack< T, N > &s) |
| |
| StaticStack< T, N > & | operator= (const StaticStack< T, N > &s) |
| |
| bool | isEmpty (void) const |
| |
| const T & | top (void) const |
| |
| const T & | pop (void) |
| |
| void | push (const T &v) |
| |
| void | reset (void) |
| |
| int | count (void) const |
| |
| bool | contains (const T &v) |
| |
| template<class C > |
| bool | containsAll (const C &coll) |
| |
| | operator bool (void) const |
| |
| Iter | begin (void) const |
| |
| Iter | end (void) const |
| |
| Iter | items (void) const |
| |
| Iter | operator* (void) const |
| |
| bool | equals (const StaticStack< T, N > &s) const |
| |
| bool | contains (const StaticStack< T, N > &s) const |
| |
| bool | operator== (const StaticStack< T, N > &s) const |
| |
| bool | operator!= (const StaticStack< T, N > &s) const |
| |
| bool | operator<= (const StaticStack< T, N > &s) const |
| |
| bool | operator>= (const StaticStack< T, N > &s) const |
| |
| bool | operator< (const StaticStack< T, N > &s) const |
| |
| bool | operator> (const StaticStack< T, N > &s) const |
| |
template<class T, int N>
class elm::StaticStack< T, N >
Implements a stack locally allocated, that is, whose stack data structure is allocated in system stack if the object is local, in the static memory is the object is a global variable or wherever the object is embedded. To sum up, no heap allocation is performed. This is why its size is fixed.
Implemented concepts:
Performances:
- push – O(1) (~ value copy)
- pop – O(1) (~ value copy)
- Parameters
-
| T | Type of values stored in the stack. |
| N | Size of the stack. |