]>
Commit | Line | Data |
---|---|---|
cb69b4c7 | 1 | /* |
262a0e14 | 2 | * $Id$ |
cb69b4c7 | 3 | * |
4 | * AUTHOR: Alex Rousskov | |
5 | * | |
2b6662ba | 6 | * SQUID Web Proxy Cache http://www.squid-cache.org/ |
7 | * ---------------------------------------------------------- | |
cb69b4c7 | 8 | * |
2b6662ba | 9 | * Squid is the result of efforts by numerous individuals from |
10 | * the Internet community; see the CONTRIBUTORS file for full | |
11 | * details. Many organizations have provided support for Squid's | |
12 | * development; see the SPONSORS file for full details. Squid is | |
13 | * Copyrighted (C) 2001 by the Regents of the University of | |
14 | * California; see the COPYRIGHT file for full details. Squid | |
15 | * incorporates software developed and/or copyrighted by other | |
16 | * sources; see the CREDITS file for full details. | |
cb69b4c7 | 17 | * |
18 | * This program is free software; you can redistribute it and/or modify | |
19 | * it under the terms of the GNU General Public License as published by | |
20 | * the Free Software Foundation; either version 2 of the License, or | |
21 | * (at your option) any later version. | |
c5dd4956 | 22 | * |
cb69b4c7 | 23 | * This program is distributed in the hope that it will be useful, |
24 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
25 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
26 | * GNU General Public License for more details. | |
c5dd4956 | 27 | * |
cb69b4c7 | 28 | * You should have received a copy of the GNU General Public License |
29 | * along with this program; if not, write to the Free Software | |
cbdec147 | 30 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. |
c5dd4956 | 31 | * |
cb69b4c7 | 32 | */ |
33 | ||
b5638623 | 34 | #ifndef SQUID_STACK_H |
35 | #define SQUID_STACK_H | |
cb69b4c7 | 36 | |
f12361a1 | 37 | #include "Array.h" |
cb69b4c7 | 38 | |
91caca83 | 39 | /* RBC: 20030714 Composition might be better long-term, but for now, |
40 | * there's no reason to do so. | |
41 | */ | |
cb69b4c7 | 42 | |
91caca83 | 43 | template <class S = void *> |
cb69b4c7 | 44 | |
91caca83 | 45 | class Stack : public Vector<S> |
732735ed | 46 | { |
91caca83 | 47 | public: |
7e6b941f | 48 | using Vector<S>::count; |
49 | using Vector<S>::items; | |
91caca83 | 50 | typedef typename Vector<S>::value_type value_type; |
51 | typedef typename Vector<S>::pointer pointer; | |
c5dd4956 | 52 | value_type pop() { |
91caca83 | 53 | if (!count) |
54 | return value_type(); | |
55 | ||
af3004ff | 56 | value_type result = items[--count]; |
91caca83 | 57 | |
7e6b941f | 58 | this->items[count] = value_type(); |
91caca83 | 59 | |
60 | return result; | |
61 | } | |
62 | ||
63 | /* todo, fatal on empty Top call */ | |
c5dd4956 | 64 | value_type top() const { |
91caca83 | 65 | return count ? items[count - 1] : value_type(); |
66 | } | |
67 | }; | |
68 | ||
b5638623 | 69 | #endif /* SQUID_STACK_H */ |