parser/stack.hh

   1 /* A Bison parser, made by GNU Bison 2.4.3.  */
   2
   3 /* Stack handling for Bison parsers in C++
   4
   5       Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free
   6    Software Foundation, Inc.
   7
   8    This program is free software: you can redistribute it and/or modify
   9    it under the terms of the GNU General Public License as published by
  10    the Free Software Foundation, either version 3 of the License, or
  11    (at your option) any later version.
  12
  13    This program is distributed in the hope that it will be useful,
  14    but WITHOUT ANY WARRANTY; without even the implied warranty of
  15    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16    GNU General Public License for more details.
  17
  18    You should have received a copy of the GNU General Public License
  19    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
  20
  21 /* As a special exception, you may create a larger work that contains
  22    part or all of the Bison parser skeleton and distribute that work
  23    under terms of your choice, so long as that work isn't itself a
  24    parser generator using the skeleton or a modified version thereof
  25    as a parser skeleton.  Alternatively, if you modify or redistribute
  26    the parser skeleton itself, you may (at your option) remove this
  27    special exception, which will cause the skeleton and the resulting
  28    Bison output files to be licensed under the GNU General Public
  29    License without this special exception.
  30
  31    This special exception was added by the Free Software Foundation in
  32    version 2.2 of Bison.  */
  33
  34 #ifndef BISON_STACK_HH
  35 # define BISON_STACK_HH
  36
  37 #include <deque>
  38
  39
  40 namespace objectbuilder {
  41
  42 /* Line 1067 of lalr1.cc  */
  43 #line 44 "stack.hh"
  44   template <class T, class S = std::deque<T> >
  45   class stack
  46   {
  47   public:
  48
  49     // Hide our reversed order.
  50     typedef typename S::reverse_iterator iterator;
  51     typedef typename S::const_reverse_iterator const_iterator;
  52
  53     stack () : seq_ ()
  54     {
  55     }
  56
  57     stack (unsigned int n) : seq_ (n)
  58     {
  59     }
  60
  61     inline
  62     T&
  63     operator [] (unsigned int i)
  64     {
  65       return seq_[i];
  66     }
  67
  68     inline
  69     const T&
  70     operator [] (unsigned int i) const
  71     {
  72       return seq_[i];
  73     }
  74
  75     inline
  76     void
  77     push (const T& t)
  78     {
  79       seq_.push_front (t);
  80     }
  81
  82     inline
  83     void
  84     pop (unsigned int n = 1)
  85     {
  86       for (; n; --n)
  87         seq_.pop_front ();
  88     }
  89
  90     inline
  91     unsigned int
  92     height () const
  93     {
  94       return seq_.size ();
  95     }
  96
  97     inline const_iterator begin () const { return seq_.rbegin (); }
  98     inline const_iterator end () const { return seq_.rend (); }
  99
 100   private:
 101
 102     S seq_;
 103   };
 104
 105   /// Present a slice of the top of a stack.
 106   template <class T, class S = stack<T> >
 107   class slice
 108   {
 109   public:
 110
 111     slice (const S& stack,
 112            unsigned int range) : stack_ (stack),
 113                                  range_ (range)
 114     {
 115     }
 116
 117     inline
 118     const T&
 119     operator [] (unsigned int i) const
 120     {
 121       return stack_[range_ - i];
 122     }
 123
 124   private:
 125
 126     const S& stack_;
 127     unsigned int range_;
 128   };
 129
 130 } // objectbuilder
 131
 132 /* Line 1153 of lalr1.cc  */
 133 #line 134 "stack.hh"
 134
 135 #endif // not BISON_STACK_HH[]dnl
 136