STL-style class for fixed-size stacks whose size is known at compile time. More...
#include <rutz/staticstack.h>
Public Types | |
typedef T * | iterator |
typedef const T * | const_iterator |
Public Member Functions | |
static_stack (const static_stack &other) throw () | |
static_stack & | operator= (const static_stack &other) throw () |
unsigned int | size () const throw () |
bool | push (T p) throw () |
void | pop () throw () |
T | top () const throw () |
T | at (unsigned int i) const throw () |
T | operator[] (unsigned int i) const throw () |
iterator | begin () throw () |
iterator | end () throw () |
const_iterator | begin () const throw () |
const_iterator | end () const throw () |
Static Public Member Functions | |
static unsigned int | capacity () throw () |
STL-style class for fixed-size stacks whose size is known at compile time.
Because this class doesn't rely on dynamically-allocated memory, it can be both highly efficient and exception-safe.
Definition at line 46 of file staticstack.h.