Merge ktlim@zizzer.eecs.umich.edu:/bk/m5
[gem5.git] / test / sized_test.cc
1 /*
2 * Copyright (c) 2002-2003 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29 #include <iostream>
30 #include <algorithm>
31
32 #include "sized.hh"
33 #include <queue>
34 #include <typeinfo>
35
36 template<typename C>
37 void print(C &cont)
38 {
39 std::cout << std::endl;
40 std::cout << "Printing " << typeid(cont).name() << std::endl;
41 while (!cont.empty()) {
42 std::cout << cont.front() << " ";
43 cont.pop();
44 }
45 std::cout << std::endl;
46 }
47
48 int main(void)
49 {
50 sized<std::queue<int>, sized_error_policy<std::queue<int> > >
51 error_queue(10);
52 sized<std::queue<int>, sized_drop_policy<std::queue<int> > >
53 drop_queue(5);
54
55 for (int i = 0; i < 10; ++i) {
56 error_queue.push(i);
57 }
58
59 for (int i = 0; i < 3; ++i) {
60 drop_queue.push(i);
61 }
62
63 print(error_queue);
64 print(drop_queue);
65
66 return(0);
67 }