sized_test.cc

来自「M5,一个功能强大的多处理器系统模拟器.很多针对处理器架构,性能的研究都使用它作」· CC 代码 · 共 72 行

/*
 * Copyright (c) 2002, 2003, 2004, 2005
 * The Regents of The University of Michigan
 * All Rights Reserved
 *
 * This code is part of the M5 simulator.
 *
 * Permission is granted to use, copy, create derivative works and
 * redistribute this software and such derivative works for any
 * purpose, so long as the copyright notice above, this grant of
 * permission, and the disclaimer below appear in all copies made; and
 * so long as the name of The University of Michigan is not used in
 * any advertising or publicity pertaining to the use or distribution
 * of this software without specific, written prior authorization.
 *
 * THIS SOFTWARE IS PROVIDED AS IS, WITHOUT REPRESENTATION FROM THE
 * UNIVERSITY OF MICHIGAN AS TO ITS FITNESS FOR ANY PURPOSE, AND
 * WITHOUT WARRANTY BY THE UNIVERSITY OF MICHIGAN OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE. THE REGENTS OF THE UNIVERSITY OF MICHIGAN SHALL NOT BE
 * LIABLE FOR ANY DAMAGES, INCLUDING DIRECT, SPECIAL, INDIRECT,
 * INCIDENTAL, OR CONSEQUENTIAL DAMAGES, WITH RESPECT TO ANY CLAIM
 * ARISING OUT OF OR IN CONNECTION WITH THE USE OF THE SOFTWARE, EVEN
 * IF IT HAS BEEN OR IS HEREAFTER ADVISED OF THE POSSIBILITY OF SUCH
 * DAMAGES.
 *
 * Authors: David A. Greene
 *          Nathan L. Binkert
 */


#include <iostream>
#include <algorithm>

#include "sized.hh"
#include <queue>
#include <typeinfo>

template<typename C>
void print(C &cont)
{
  std::cout << std::endl;
  std::cout << "Printing " << typeid(cont).name() << std::endl;
  while (!cont.empty()) {
    std::cout << cont.front() << " ";
    cont.pop();
  }
  std::cout << std::endl;
}

int main(void)
{
  sized<std::queue<int>, sized_error_policy<std::queue<int> > >
    error_queue(10);
  sized<std::queue<int>, sized_drop_policy<std::queue<int> > >
    drop_queue(5);

  for (int i = 0; i < 10; ++i) {
    error_queue.push(i);
  }

  for (int i = 0; i < 3; ++i) {
    drop_queue.push(i);
  }

  print(error_queue);
  print(drop_queue);

  return(0);
}