src/unittest/lru_test.cc

   1 /*
   2  * Copyright (c) 2003-2005 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  * Authors: Dave Greene
  29  *          Nathan Binkert
  30  */
  31
  32 #include <iostream>
  33 #include "bhgp.hh"
  34
  35 int main(void)
  36 {
  37   typedef AssociativeTable<unsigned int, unsigned int> tableType;
  38   tableType table(10, 4);  // 40 entry table
  39
  40   std::cout << "Initial state:" << std::endl;
  41   table.dump();
  42
  43   std::cout << "Inserting (2, 1)" << std::endl;
  44   table[2] = 1;
  45   table.dump();
  46
  47   std::cout << "Inserting (5, 2)" << std::endl;
  48   table[5] = 2;
  49   table.dump();
  50
  51   std::cout << "Inserting (10 + 2, 3)" << std::endl;
  52   table[10 + 2] = 3;
  53   table.dump();
  54
  55   tableType::const_iterator i = table.find(2);
  56   assert(i != table.end());
  57   std::cout << "Accessed 2: " << *i << std::endl;
  58   table.dump();
  59
  60   i = table.find(10 + 2);
  61   assert(i != table.end());
  62   std::cout << "Accessed 10 + 2: " << *i << std::endl;
  63   table.dump();
  64
  65   i = table.find(34);
  66   assert(i == table.end());
  67
  68   std::cout << "Inserting (2 * 10 + 2, 4)" << std::endl;
  69   table[2 * 10 + 2] = 4;
  70   table.dump();
  71
  72   std::cout << "Replacing (10 + 2) with 5" << std::endl;
  73   table[10 + 2] = 5;
  74   table.dump();
  75
  76   std::cout << "Inserting (3 * 10 + 2, 6)" << std::endl;
  77   table[3 * 10 + 2] = 6;
  78   table.dump();
  79
  80   std::cout << "Inserting (4 * 10 + 2, 7)" << std::endl;
  81   table[4 * 10 + 2] = 7;
  82   table.dump();
  83
  84   return(0);
  85 }