<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>Flex Bison C++ Example: src/stack.hh Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>src/stack.hh</h1><a href="stack_8hh.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001
<a name="l00002"></a>00002 <span class="comment">/* A Bison parser, made by GNU Bison 2.4.1. */</span>
<a name="l00003"></a>00003
<a name="l00004"></a>00004 <span class="comment">/* Stack handling for Bison parsers in C++</span>
<a name="l00005"></a>00005 <span class="comment"> </span>
<a name="l00006"></a>00006 <span class="comment"> Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software</span>
<a name="l00007"></a>00007 <span class="comment"> Foundation, Inc.</span>
<a name="l00008"></a>00008 <span class="comment"> </span>
<a name="l00009"></a>00009 <span class="comment"> This program is free software: you can redistribute it and/or modify</span>
<a name="l00010"></a>00010 <span class="comment"> it under the terms of the GNU General Public License as published by</span>
<a name="l00011"></a>00011 <span class="comment"> the Free Software Foundation, either version 3 of the License, or</span>
<a name="l00012"></a>00012 <span class="comment"> (at your option) any later version.</span>
<a name="l00013"></a>00013 <span class="comment"> </span>
<a name="l00014"></a>00014 <span class="comment"> This program is distributed in the hope that it will be useful,</span>
<a name="l00015"></a>00015 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00016"></a>00016 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00017"></a>00017 <span class="comment"> GNU General Public License for more details.</span>
<a name="l00018"></a>00018 <span class="comment"> </span>
<a name="l00019"></a>00019 <span class="comment"> You should have received a copy of the GNU General Public License</span>
<a name="l00020"></a>00020 <span class="comment"> along with this program. If not, see <http://www.gnu.org/licenses/>. */</span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="comment">/* As a special exception, you may create a larger work that contains</span>
<a name="l00023"></a>00023 <span class="comment"> part or all of the Bison parser skeleton and distribute that work</span>
<a name="l00024"></a>00024 <span class="comment"> under terms of your choice, so long as that work isn't itself a</span>
<a name="l00025"></a>00025 <span class="comment"> parser generator using the skeleton or a modified version thereof</span>
<a name="l00026"></a>00026 <span class="comment"> as a parser skeleton. Alternatively, if you modify or redistribute</span>
<a name="l00027"></a>00027 <span class="comment"> the parser skeleton itself, you may (at your option) remove this</span>
<a name="l00028"></a>00028 <span class="comment"> special exception, which will cause the skeleton and the resulting</span>
<a name="l00029"></a>00029 <span class="comment"> Bison output files to be licensed under the GNU General Public</span>
<a name="l00030"></a>00030 <span class="comment"> License without this special exception.</span>
<a name="l00031"></a>00031 <span class="comment"> </span>
<a name="l00032"></a>00032 <span class="comment"> This special exception was added by the Free Software Foundation in</span>
<a name="l00033"></a>00033 <span class="comment"> version 2.2 of Bison. */</span>
<a name="l00034"></a>00034
<a name="l00035"></a>00035 <span class="preprocessor">#ifndef BISON_STACK_HH</span>
<a name="l00036"></a>00036 <span class="preprocessor"></span><span class="preprocessor"># define BISON_STACK_HH</span>
<a name="l00037"></a>00037 <span class="preprocessor"></span>
<a name="l00038"></a>00038 <span class="preprocessor">#include <deque></span>
<a name="l00039"></a>00039
<a name="l00040"></a>00040
<a name="l00041"></a>00041 <span class="comment">/* Line 1067 of lalr1.cc */</span>
<a name="l00042"></a>00042 <span class="preprocessor">#line 1 "[Bison:b4_percent_define_default]"</span>
<a name="l00043"></a>00043 <span class="preprocessor"></span>
<a name="l00044"></a>00044 <span class="keyword">namespace </span>example {
<a name="l00045"></a>00045
<a name="l00046"></a>00046 <span class="comment">/* Line 1067 of lalr1.cc */</span>
<a name="l00047"></a>00047 <span class="preprocessor">#line 48 "stack.hh"</span>
<a name="l00048"></a>00048 <span class="preprocessor"></span> <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> S = std::deque<T> >
<a name="l00049"></a><a class="code" href="classexample_1_1stack.html">00049</a> <span class="keyword">class </span><a class="code" href="classexample_1_1stack.html">stack</a>
<a name="l00050"></a>00050 {
<a name="l00051"></a>00051 <span class="keyword">public</span>:
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="comment">// Hide our reversed order.</span>
<a name="l00054"></a><a class="code" href="classexample_1_1stack.html#7e38cb81f0b32d511582ecde22acc307">00054</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> S::reverse_iterator <a class="code" href="classexample_1_1stack.html#7e38cb81f0b32d511582ecde22acc307">iterator</a>;
<a name="l00055"></a><a class="code" href="classexample_1_1stack.html#23773116d524ac57894865c0207f19b4">00055</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> S::const_reverse_iterator <a class="code" href="classexample_1_1stack.html#23773116d524ac57894865c0207f19b4">const_iterator</a>;
<a name="l00056"></a>00056
<a name="l00057"></a><a class="code" href="classexample_1_1stack.html#b740029e40afb1cdab6ed99e5e39b4ed">00057</a> <a class="code" href="classexample_1_1stack.html#b740029e40afb1cdab6ed99e5e39b4ed">stack</a> () : <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a> ()
<a name="l00058"></a>00058 {
<a name="l00059"></a>00059 }
<a name="l00060"></a>00060
<a name="l00061"></a><a class="code" href="classexample_1_1stack.html#141a5965cfd9ae5c4c57ef3012927b4c">00061</a> <a class="code" href="classexample_1_1stack.html#b740029e40afb1cdab6ed99e5e39b4ed">stack</a> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n) : <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a> (n)
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063 }
<a name="l00064"></a>00064
<a name="l00065"></a>00065 <span class="keyword">inline</span>
<a name="l00066"></a>00066 T&
<a name="l00067"></a><a class="code" href="classexample_1_1stack.html#0cefb2b98973c1cc3d3f7d3ac16148eb">00067</a> <a class="code" href="classexample_1_1stack.html#0cefb2b98973c1cc3d3f7d3ac16148eb">operator [] </a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)
<a name="l00068"></a>00068 {
<a name="l00069"></a>00069 <span class="keywordflow">return</span> <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a>[i];
<a name="l00070"></a>00070 }
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="keyword">inline</span>
<a name="l00073"></a>00073 <span class="keyword">const</span> T&
<a name="l00074"></a><a class="code" href="classexample_1_1stack.html#2961b6d7f6b65ffa36caa56502b7b7b1">00074</a> <a class="code" href="classexample_1_1stack.html#0cefb2b98973c1cc3d3f7d3ac16148eb">operator [] </a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span>
<a name="l00075"></a>00075 <span class="keyword"> </span>{
<a name="l00076"></a>00076 <span class="keywordflow">return</span> <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a>[i];
<a name="l00077"></a>00077 }
<a name="l00078"></a>00078
<a name="l00079"></a>00079 <span class="keyword">inline</span>
<a name="l00080"></a>00080 <span class="keywordtype">void</span>
<a name="l00081"></a><a class="code" href="classexample_1_1stack.html#e5c6c8054fdafb66aa9d2a62b0fc513b">00081</a> <a class="code" href="classexample_1_1stack.html#e5c6c8054fdafb66aa9d2a62b0fc513b">push</a> (<span class="keyword">const</span> T& t)
<a name="l00082"></a>00082 {
<a name="l00083"></a>00083 <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a>.push_front (t);
<a name="l00084"></a>00084 }
<a name="l00085"></a>00085
<a name="l00086"></a>00086 <span class="keyword">inline</span>
<a name="l00087"></a>00087 <span class="keywordtype">void</span>
<a name="l00088"></a><a class="code" href="classexample_1_1stack.html#80250dd3a9e837002f1541213e3dba77">00088</a> <a class="code" href="classexample_1_1stack.html#80250dd3a9e837002f1541213e3dba77">pop</a> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n = 1)
<a name="l00089"></a>00089 {
<a name="l00090"></a>00090 <span class="keywordflow">for</span> (; n; --n)
<a name="l00091"></a>00091 <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a>.pop_front ();
<a name="l00092"></a>00092 }
<a name="l00093"></a>00093
<a name="l00094"></a>00094 <span class="keyword">inline</span>
<a name="l00095"></a>00095 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>
<a name="l00096"></a><a class="code" href="classexample_1_1stack.html#382b54b4b4c64952617bce483de99131">00096</a> <a class="code" href="classexample_1_1stack.html#382b54b4b4c64952617bce483de99131">height</a> ()<span class="keyword"> const</span>
<a name="l00097"></a>00097 <span class="keyword"> </span>{
<a name="l00098"></a>00098 <span class="keywordflow">return</span> <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a>.size ();
<a name="l00099"></a>00099 }
<a name="l00100"></a>00100
<a name="l00101"></a><a class="code" href="classexample_1_1stack.html#e769c188566211e53a855f6842f7a11e">00101</a> <span class="keyword">inline</span> <a class="code" href="classexample_1_1stack.html#23773116d524ac57894865c0207f19b4">const_iterator</a> <a class="code" href="classexample_1_1stack.html#e769c188566211e53a855f6842f7a11e">begin</a> ()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a>.rbegin (); }
<a name="l00102"></a><a class="code" href="classexample_1_1stack.html#d5175888d71aff8fc28454bfdfbc1013">00102</a> <span class="keyword">inline</span> <a class="code" href="classexample_1_1stack.html#23773116d524ac57894865c0207f19b4">const_iterator</a> <a class="code" href="classexample_1_1stack.html#d5175888d71aff8fc28454bfdfbc1013">end</a> ()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a>.rend (); }
<a name="l00103"></a>00103
<a name="l00104"></a>00104 <span class="keyword">private</span>:
<a name="l00105"></a>00105
<a name="l00106"></a><a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">00106</a> S <a class="code" href="classexample_1_1stack.html#a093490c5b318dd832f93daf540727ca">seq_</a>;
<a name="l00107"></a>00107 };
<a name="l00108"></a>00108
<a name="l00110"></a>00110 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> S = stack<T> >
<a name="l00111"></a><a class="code" href="classexample_1_1slice.html">00111</a> <span class="keyword">class </span><a class="code" href="classexample_1_1slice.html" title="Present a slice of the top of a stack.">slice</a>
<a name="l00112"></a>00112 {
<a name="l00113"></a>00113 <span class="keyword">public</span>:
<a name="l00114"></a>00114
<a name="l00115"></a><a class="code" href="classexample_1_1slice.html#c63de020f940f60c8f7003a3ab9dbfc3">00115</a> <a class="code" href="classexample_1_1slice.html#c63de020f940f60c8f7003a3ab9dbfc3">slice</a> (<span class="keyword">const</span> S& <a class="code" href="classexample_1_1stack.html">stack</a>,
<a name="l00116"></a>00116 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> range) : <a class="code" href="classexample_1_1slice.html#57038e59ef1ea9892ebe896c3ab221c2">stack_</a> (stack),
<a name="l00117"></a>00117 <a class="code" href="classexample_1_1slice.html#c60f36094272b7f18e6e811849fadb6a">range_</a> (range)
<a name="l00118"></a>00118 {
<a name="l00119"></a>00119 }
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <span class="keyword">inline</span>
<a name="l00122"></a>00122 <span class="keyword">const</span> T&
<a name="l00123"></a><a class="code" href="classexample_1_1slice.html#f75fe16013aec7233fb412ce1f5601b3">00123</a> <a class="code" href="classexample_1_1slice.html#f75fe16013aec7233fb412ce1f5601b3">operator [] </a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i)<span class="keyword"> const</span>
<a name="l00124"></a>00124 <span class="keyword"> </span>{
<a name="l00125"></a>00125 <span class="keywordflow">return</span> <a class="code" href="classexample_1_1slice.html#57038e59ef1ea9892ebe896c3ab221c2">stack_</a>[<a class="code" href="classexample_1_1slice.html#c60f36094272b7f18e6e811849fadb6a">range_</a> - i];
<a name="l00126"></a>00126 }
<a name="l00127"></a>00127
<a name="l00128"></a>00128 <span class="keyword">private</span>:
<a name="l00129"></a>00129
<a name="l00130"></a><a class="code" href="classexample_1_1slice.html#57038e59ef1ea9892ebe896c3ab221c2">00130</a> <span class="keyword">const</span> S& <a class="code" href="classexample_1_1slice.html#57038e59ef1ea9892ebe896c3ab221c2">stack_</a>;
<a name="l00131"></a><a class="code" href="classexample_1_1slice.html#c60f36094272b7f18e6e811849fadb6a">00131</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classexample_1_1slice.html#c60f36094272b7f18e6e811849fadb6a">range_</a>;
<a name="l00132"></a>00132 };
<a name="l00133"></a>00133
<a name="l00134"></a>00134 <span class="comment">/* Line 1153 of lalr1.cc */</span>
<a name="l00135"></a>00135 <span class="preprocessor">#line 1 "[Bison:b4_percent_define_default]"</span>
<a name="l00136"></a>00136 <span class="preprocessor"></span>
<a name="l00137"></a>00137 } <span class="comment">// example</span>
<a name="l00138"></a>00138
<a name="l00139"></a>00139 <span class="comment">/* Line 1153 of lalr1.cc */</span>
<a name="l00140"></a>00140 <span class="preprocessor">#line 141 "stack.hh"</span>
<a name="l00141"></a>00141 <span class="preprocessor"></span>
<a name="l00142"></a>00142 <span class="preprocessor">#endif // not BISON_STACK_HH[]dnl</span>
<a name="l00143"></a>00143 <span class="preprocessor"></span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Sat Sep 5 10:26:25 2009 for Flex Bison C++ Example by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.9 </small></address>
</body>
</html>
