]> git.ipfire.org Git - thirdparty/squid.git/blame - test-suite/StackTest.cc
Cleanup: zap CVS Id tags
[thirdparty/squid.git] / test-suite / StackTest.cc
CommitLineData
91caca83 1
2/*
262a0e14 3 * $Id$
91caca83 4 *
5 * DEBUG: section 19 Store Memory Primitives
6 * AUTHOR: Robert Collins
7 *
8 * SQUID Web Proxy Cache http://www.squid-cache.org/
9 * ----------------------------------------------------------
10 *
11 * Squid is the result of efforts by numerous individuals from
12 * the Internet community; see the CONTRIBUTORS file for full
13 * details. Many organizations have provided support for Squid's
14 * development; see the SPONSORS file for full details. Squid is
15 * Copyrighted (C) 2001 by the Regents of the University of
16 * California; see the COPYRIGHT file for full details. Squid
17 * incorporates software developed and/or copyrighted by other
18 * sources; see the CREDITS file for full details.
19 *
20 * This program is free software; you can redistribute it and/or modify
21 * it under the terms of the GNU General Public License as published by
22 * the Free Software Foundation; either version 2 of the License, or
23 * (at your option) any later version.
26ac0430 24 *
91caca83 25 * This program is distributed in the hope that it will be useful,
26 * but WITHOUT ANY WARRANTY; without even the implied warranty of
27 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
28 * GNU General Public License for more details.
26ac0430 29 *
91caca83 30 * You should have received a copy of the GNU General Public License
31 * along with this program; if not, write to the Free Software
32 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
33 *
34 * Copyright (c) 2003 Robert Collins <robertc@squid-cache.org>
35 */
36
37#include "squid.h"
38#include "Stack.h"
39
40int
b610642c 41main(int argc, char **argv)
91caca83 42{
43 Stack<int> aStack;
44 assert (aStack.size() == 0);
45 aStack.push_back(2);
46 assert (aStack.size() == 1);
47 assert (aStack.top() == 2);
48 assert (aStack.pop() == 2);
49 assert (aStack.size() == 0);
50 Stack<> oldStack;
51 assert (oldStack.size() == 0);
52 oldStack.push_back(&aStack);
53 assert (oldStack.size() == 1);
54 assert (oldStack.top() == &aStack);
55 assert (oldStack.pop() == &aStack);
56 assert (oldStack.size() == 0);
57 return 0;
58}