38 #ifndef YY_HOAYY_STACK_HH_INCLUDED
39 # define YY_HOAYY_STACK_HH_INCLUDED
45 #line 46 "stack.hh" // stack.hh:133
46 template <
class T,
class S = std::vector<T> >
51 typedef typename S::reverse_iterator iterator;
52 typedef typename S::const_reverse_iterator const_iterator;
59 stack (
unsigned int n)
66 operator[] (
unsigned int i)
68 return seq_[seq_.size () - 1 - i];
73 operator[] (
unsigned int i)
const
75 return seq_[seq_.size () - 1 - i];
86 operator[](0).move (t);
91 pop (
unsigned int n = 1)
104 typename S::size_type
114 return seq_.rbegin ();
125 stack (
const stack&);
126 stack& operator= (
const stack&);
132 template <
class T,
class S = stack<T> >
144 operator [] (
unsigned int i)
const
146 return stack_[range_ - i];
156 #line 157 "stack.hh" // stack.hh:133
158 #endif // !YY_HOAYY_STACK_HH_INCLUDED
Present a slice of the top of a stack.
Definition: stack.hh:133
Definition: parseaut.hh:261
void push(T &t)
Definition: stack.hh:83