src/base/range_map.hh

   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 #ifndef __BASE_RANGE_MAP_HH__
  32 #define __BASE_RANGE_MAP_HH__
  33
  34 #include "base/range.hh"
  35
  36 #include <map>
  37
  38 template <class T,class V>
  39 class range_map
  40 {
  41   private:
  42     typedef std::map<Range<T>,V> RangeMap;
  43     RangeMap tree;
  44
  45   public:
  46     typedef typename RangeMap::iterator iterator;
  47
  48     template <class U>
  49     const iterator find(const Range<U> &r)
  50     {
  51         iterator i;
  52
  53         i = tree.upper_bound(r);
  54
  55         if (i == tree.begin())
  56             // Nothing could match, so return end()
  57             return tree.end();
  58
  59         i--;
  60
  61         if (i->first.start <= r.end && i->first.end >= r.start)
  62             return i;
  63
  64         return tree.end();
  65     }
  66
  67     template <class U>
  68     bool intersect(const Range<U> &r)
  69     {
  70         iterator i;
  71         i = find(r);
  72         if (i != tree.end())
  73             return true;
  74         return false;
  75     }
  76
  77
  78     template <class U,class W>
  79     iterator insert(const Range<U> &r, const W d)
  80     {
  81         if (intersect(r))
  82             return tree.end();
  83
  84         return tree.insert(std::make_pair<Range<T>,V>(r, d)).first;
  85     }
  86
  87     size_t erase(T k)
  88     {
  89         return tree.erase(k);
  90     }
  91
  92     void erase(iterator p)
  93     {
  94         tree.erase(p);
  95     }
  96
  97     void erase(iterator p, iterator q)
  98     {
  99         tree.erase(p,q);
 100     }
 101
 102     void clear()
 103     {
 104         tree.erase(tree.begin(), tree.end());
 105     }
 106
 107     iterator begin()
 108     {
 109         return tree.begin();
 110     }
 111
 112     iterator end()
 113     {
 114         return tree.end();
 115     }
 116
 117     size_t size()
 118     {
 119         return tree.size();
 120     }
 121
 122     bool empty()
 123     {
 124         return tree.empty();
 125     }
 126 };
 127
 128
 129 #endif //__BASE_RANGE_MAP_HH__