src/unittest/rangemaptest.cc

   1 /*
   2  * Copyright (c) 2006 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: Ali Saidi
  29  */
  30
  31 #include <iostream>
  32 #include <cassert>
  33
  34 #include "base/range_map.hh"
  35 #include "base/types.hh"
  36
  37 using namespace std;
  38
  39 int
  40 main()
  41 {
  42     range_map<Addr,int> r;
  43
  44     range_map<Addr,int>::iterator i;
  45
  46     i = r.insert(RangeIn<Addr>(10,40),5);
  47     assert(i != r.end());
  48     i = r.insert(RangeIn<Addr>(60,90),3);
  49     assert(i != r.end());
  50
  51     i = r.find(RangeIn(20,30));
  52     assert(i != r.end());
  53     cout << i->first << " " << i->second << endl;
  54
  55     i = r.find(RangeIn(55,55));
  56     assert(i == r.end());
  57
  58     i = r.insert(RangeIn<Addr>(0,12),1);
  59     assert(i == r.end());
  60
  61     i = r.insert(RangeIn<Addr>(0,9),1);
  62     assert(i != r.end());
  63
  64     i = r.find(RangeIn(20,30));
  65     assert(i != r.end());
  66     cout << i->first << " " << i->second << endl;
  67
  68 }
  69
  70
  71
  72
  73
  74
  75
  76