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__
36 #include "base/range.hh"
38 template <class T,class V>
42 typedef std::map<Range<T>,V> RangeMap;
46 typedef typename RangeMap::iterator iterator;
50 find(const Range<U> &r)
54 i = tree.upper_bound(r);
56 if (i == tree.begin()) {
57 if (i->first.start <= r.end && i->first.end >= r.start)
60 // Nothing could match, so return end()
66 if (i->first.start <= r.end && i->first.end >= r.start)
76 return find(RangeSize(r, 1));
81 intersect(const Range<U> &r)
91 template <class U,class W>
93 insert(const Range<U> &r, const W d)
98 return tree.insert(std::make_pair<Range<T>,V>(r, d)).first;
104 return tree.erase(k);
114 erase(iterator p, iterator q)
122 tree.erase(tree.begin(), tree.end());
151 template <class T,class V>
155 typedef std::multimap<Range<T>,V> RangeMap;
159 typedef typename RangeMap::iterator iterator;
162 std::pair<iterator,iterator> find(const Range<U> &r)
167 i = tree.lower_bound(r);
169 if (i == tree.begin()) {
170 if (i->first.start <= r.end && i->first.end >= r.start)
171 return std::make_pair<iterator, iterator>(i,i);
173 // Nothing could match, so return end()
174 return std::make_pair<iterator, iterator>(tree.end(), tree.end());
178 if (i->first.start <= r.end && i->first.end >= r.start) {
179 // we have at least one match
183 while (i->first.start <= r.end && i->first.end >=
185 if (i == tree.begin())
189 if (i == tree.begin() && i->first.start <= r.end && i->first.end >=
191 return std::make_pair<iterator, iterator>(i,j);
193 return std::make_pair<iterator, iterator>(i,j);
197 return std::make_pair<iterator, iterator>(tree.end(), tree.end());
202 intersect(const Range<U> &r)
204 std::pair<iterator,iterator> p;
206 if (p.first != tree.end())
212 template <class U,class W>
214 insert(const Range<U> &r, const W d)
216 std::pair<iterator,iterator> p;
218 if (p.first->first.start == r.start && p.first->first.end == r.end ||
219 p.first == tree.end())
220 return tree.insert(std::make_pair<Range<T>,V>(r, d));
228 return tree.erase(k);
238 erase(iterator p, iterator q)
246 tree.erase(tree.begin(), tree.end());
274 #endif //__BASE_RANGE_MAP_HH__