2 * Copyright (c) 2006 The Regents of The University of Michigan
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.
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.
31 #ifndef __BASE_RANGE_MAP_HH__
32 #define __BASE_RANGE_MAP_HH__
37 #include "base/range.hh"
40 * The range_map uses an STL map to implement an interval tree. The
41 * type of both the key (range) and the value are template
42 * parameters. It can, for example, be used for address decoding,
43 * using a range of addresses to map to ports.
45 template <class T,class V>
49 typedef std::map<Range<T>,V> RangeMap;
53 typedef typename RangeMap::iterator iterator;
54 typedef typename RangeMap::const_iterator const_iterator;
58 find(const Range<U> &r) const
62 i = tree.upper_bound(r);
64 if (i == tree.begin()) {
65 if (i->first.start <= r.end && i->first.end >= r.start)
68 // Nothing could match, so return end()
74 if (i->first.start <= r.end && i->first.end >= r.start)
82 find(const Range<U> &r)
86 i = tree.upper_bound(r);
88 if (i == tree.begin()) {
89 if (i->first.start <= r.end && i->first.end >= r.start)
92 // Nothing could match, so return end()
98 if (i->first.start <= r.end && i->first.end >= r.start)
106 find(const U &r) const
108 return find(RangeSize(r, 1));
115 return find(RangeSize(r, 1));
120 intersect(const Range<U> &r)
129 template <class U,class W>
131 insert(const Range<U> &r, const W d)
136 return tree.insert(std::make_pair(r, d)).first;
142 return tree.erase(k);
152 erase(iterator p, iterator q)
160 tree.erase(tree.begin(), tree.end());
201 template <class T,class V>
205 typedef std::multimap<Range<T>,V> RangeMap;
209 typedef typename RangeMap::iterator iterator;
212 std::pair<iterator,iterator> find(const Range<U> &r)
217 i = tree.lower_bound(r);
219 if (i == tree.begin()) {
220 if (i->first.start <= r.end && i->first.end >= r.start)
221 return std::make_pair<iterator, iterator>(i,i);
223 // Nothing could match, so return end()
224 return std::make_pair<iterator, iterator>(tree.end(), tree.end());
228 if (i->first.start <= r.end && i->first.end >= r.start) {
229 // we have at least one match
233 while (i->first.start <= r.end && i->first.end >=
235 if (i == tree.begin())
239 if (i == tree.begin() && i->first.start <= r.end && i->first.end >=
241 return std::make_pair<iterator, iterator>(i,j);
243 return std::make_pair<iterator, iterator>(i,j);
247 return std::make_pair<iterator, iterator>(tree.end(), tree.end());
252 intersect(const Range<U> &r)
254 std::pair<iterator,iterator> p;
256 if (p.first != tree.end())
262 template <class U,class W>
264 insert(const Range<U> &r, const W d)
266 std::pair<iterator,iterator> p;
268 if ((p.first->first.start == r.start && p.first->first.end == r.end) ||
269 p.first == tree.end())
270 return tree.insert(std::make_pair<Range<T>,V>(r, d));
278 return tree.erase(k);
288 erase(iterator p, iterator q)
296 tree.erase(tree.begin(), tree.end());
324 #endif //__BASE_RANGE_MAP_HH__