2006-11-23 07:42:57 +01:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006 The Regents of The University of Michigan
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are
|
|
|
|
* met: redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer;
|
|
|
|
* redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* Authors: Ali Saidi
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __BASE_RANGE_MAP_HH__
|
|
|
|
#define __BASE_RANGE_MAP_HH__
|
|
|
|
|
|
|
|
#include <map>
|
|
|
|
|
2011-04-15 19:44:06 +02:00
|
|
|
#include "base/range.hh"
|
|
|
|
|
2006-11-23 07:42:57 +01:00
|
|
|
template <class T,class V>
|
|
|
|
class range_map
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
typedef std::map<Range<T>,V> RangeMap;
|
|
|
|
RangeMap tree;
|
|
|
|
|
|
|
|
public:
|
|
|
|
typedef typename RangeMap::iterator iterator;
|
|
|
|
|
|
|
|
template <class U>
|
2008-10-09 18:25:41 +02:00
|
|
|
const iterator
|
|
|
|
find(const Range<U> &r)
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
iterator i;
|
|
|
|
|
|
|
|
i = tree.upper_bound(r);
|
|
|
|
|
2006-12-12 23:55:27 +01:00
|
|
|
if (i == tree.begin()) {
|
|
|
|
if (i->first.start <= r.end && i->first.end >= r.start)
|
|
|
|
return i;
|
|
|
|
else
|
|
|
|
// Nothing could match, so return end()
|
|
|
|
return tree.end();
|
|
|
|
}
|
2006-11-23 07:42:57 +01:00
|
|
|
|
|
|
|
i--;
|
|
|
|
|
|
|
|
if (i->first.start <= r.end && i->first.end >= r.start)
|
|
|
|
return i;
|
|
|
|
|
|
|
|
return tree.end();
|
|
|
|
}
|
|
|
|
|
2008-10-10 07:19:38 +02:00
|
|
|
template <class U>
|
|
|
|
const iterator
|
|
|
|
find(const U &r)
|
|
|
|
{
|
|
|
|
return find(RangeSize(r, 1));
|
|
|
|
}
|
|
|
|
|
2006-11-23 07:42:57 +01:00
|
|
|
template <class U>
|
2008-10-09 18:25:41 +02:00
|
|
|
bool
|
|
|
|
intersect(const Range<U> &r)
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
iterator i;
|
|
|
|
i = find(r);
|
|
|
|
if (i != tree.end())
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <class U,class W>
|
2008-10-09 18:25:41 +02:00
|
|
|
iterator
|
|
|
|
insert(const Range<U> &r, const W d)
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
if (intersect(r))
|
|
|
|
return tree.end();
|
|
|
|
|
|
|
|
return tree.insert(std::make_pair<Range<T>,V>(r, d)).first;
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
size_t
|
|
|
|
erase(T k)
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
return tree.erase(k);
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
void
|
|
|
|
erase(iterator p)
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
tree.erase(p);
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
void
|
|
|
|
erase(iterator p, iterator q)
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
tree.erase(p,q);
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
void
|
|
|
|
clear()
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
tree.erase(tree.begin(), tree.end());
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
iterator
|
|
|
|
begin()
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
return tree.begin();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
iterator
|
|
|
|
end()
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
return tree.end();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
size_t
|
|
|
|
size()
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
return tree.size();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
bool
|
|
|
|
empty()
|
2006-11-23 07:42:57 +01:00
|
|
|
{
|
|
|
|
return tree.empty();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2006-12-12 23:55:27 +01:00
|
|
|
template <class T,class V>
|
|
|
|
class range_multimap
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
typedef std::multimap<Range<T>,V> RangeMap;
|
|
|
|
RangeMap tree;
|
|
|
|
|
|
|
|
public:
|
|
|
|
typedef typename RangeMap::iterator iterator;
|
|
|
|
|
|
|
|
template <class U>
|
|
|
|
std::pair<iterator,iterator> find(const Range<U> &r)
|
|
|
|
{
|
|
|
|
iterator i;
|
|
|
|
iterator j;
|
|
|
|
|
|
|
|
i = tree.lower_bound(r);
|
|
|
|
|
|
|
|
if (i == tree.begin()) {
|
|
|
|
if (i->first.start <= r.end && i->first.end >= r.start)
|
|
|
|
return std::make_pair<iterator, iterator>(i,i);
|
|
|
|
else
|
|
|
|
// Nothing could match, so return end()
|
|
|
|
return std::make_pair<iterator, iterator>(tree.end(), tree.end());
|
|
|
|
}
|
|
|
|
i--;
|
|
|
|
|
|
|
|
if (i->first.start <= r.end && i->first.end >= r.start) {
|
|
|
|
// we have at least one match
|
|
|
|
j = i;
|
|
|
|
|
|
|
|
i--;
|
|
|
|
while (i->first.start <= r.end && i->first.end >=
|
|
|
|
r.start) {
|
|
|
|
if (i == tree.begin())
|
|
|
|
break;
|
|
|
|
i--;
|
|
|
|
}
|
|
|
|
if (i == tree.begin() && i->first.start <= r.end && i->first.end >=
|
|
|
|
r.start)
|
|
|
|
return std::make_pair<iterator, iterator>(i,j);
|
|
|
|
i++;
|
|
|
|
return std::make_pair<iterator, iterator>(i,j);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
return std::make_pair<iterator, iterator>(tree.end(), tree.end());
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class U>
|
2008-10-09 18:25:41 +02:00
|
|
|
bool
|
|
|
|
intersect(const Range<U> &r)
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
std::pair<iterator,iterator> p;
|
|
|
|
p = find(r);
|
|
|
|
if (p.first != tree.end())
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <class U,class W>
|
2008-10-09 18:25:41 +02:00
|
|
|
iterator
|
|
|
|
insert(const Range<U> &r, const W d)
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
std::pair<iterator,iterator> p;
|
|
|
|
p = find(r);
|
|
|
|
if (p.first->first.start == r.start && p.first->first.end == r.end ||
|
|
|
|
p.first == tree.end())
|
|
|
|
return tree.insert(std::make_pair<Range<T>,V>(r, d));
|
|
|
|
else
|
|
|
|
return tree.end();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
size_t
|
|
|
|
erase(T k)
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
return tree.erase(k);
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
void
|
|
|
|
erase(iterator p)
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
tree.erase(p);
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
void
|
|
|
|
erase(iterator p, iterator q)
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
tree.erase(p,q);
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
void
|
|
|
|
clear()
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
tree.erase(tree.begin(), tree.end());
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
iterator
|
|
|
|
begin()
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
return tree.begin();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
iterator
|
|
|
|
end()
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
return tree.end();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
size_t
|
|
|
|
size()
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
return tree.size();
|
|
|
|
}
|
|
|
|
|
2008-10-09 18:25:41 +02:00
|
|
|
bool
|
|
|
|
empty()
|
2006-12-12 23:55:27 +01:00
|
|
|
{
|
|
|
|
return tree.empty();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2006-11-23 07:42:57 +01:00
|
|
|
#endif //__BASE_RANGE_MAP_HH__
|