46
46
template <typename Type>
47
47
class ranges : private std::vector<std::pair<Type, Type> > {
49
typedef std::vector<std::pair<Type, Type> > Base;
50
typedef typename Base::value_type value_type;
51
typedef typename Base::reference reference;
52
typedef typename Base::iterator iterator;
53
typedef typename Base::const_iterator const_iterator;
54
typedef typename Base::reverse_iterator reverse_iterator;
49
typedef std::vector<std::pair<Type, Type> > base_type;
50
typedef typename base_type::value_type value_type;
51
typedef typename base_type::reference reference;
52
typedef typename base_type::iterator iterator;
53
typedef typename base_type::const_iterator const_iterator;
54
typedef typename base_type::reverse_iterator reverse_iterator;
56
using base_type::clear;
57
using base_type::size;
58
using base_type::begin;
60
using base_type::rbegin;
61
using base_type::rend;
63
using base_type::front;
64
using base_type::back;
63
66
void insert(Type first, Type last) { insert(std::make_pair(first, last)); }
64
// void erase(Type first, Type last) { erase(std::make_pair(first, last)); }
67
void erase(Type first, Type last) { erase(std::make_pair(first, last)); }
66
69
void insert(value_type r);
67
// void erase(value_type r);
70
void erase(value_type r);
69
72
// Find the first ranges that has an end greater than index.
70
73
iterator find(Type index);
88
88
if (first == end() || r.second < first->first) {
89
89
// The new range is before the first, after the last or between
91
Base::insert(first, r);
95
first->first = std::min(r.first, first->first);
96
first->second = std::max(r.second, first->second);
101
// template <typename Type>
103
// ranges<Type>::erase(value_type r) {
91
base_type::insert(first, r);
94
first->first = std::min(r.first, first->first);
95
first->second = std::max(r.second, first->second);
97
iterator last = std::find_if(first, end(), rak::less(first->second, rak::const_mem_ref(&value_type::second)));
99
if (last != end() && first->second >= last->first)
100
first->second = (last++)->second;
102
base_type::erase(first + 1, last);
106
template <typename Type>
108
ranges<Type>::erase(value_type r) {
109
if (r.first >= r.second)
112
iterator first = std::find_if(begin(), end(), rak::less(r.first, rak::const_mem_ref(&value_type::second)));
113
iterator last = std::find_if(first, end(), rak::less(r.second, rak::const_mem_ref(&value_type::second)));
120
if (r.first > first->first) {
121
std::swap(first->first, r.second);
122
base_type::insert(first, value_type(r.second, r.first));
124
} else if (r.second > first->first) {
125
first->first = r.second;
130
if (r.first > first->first)
131
(first++)->second = r.first;
133
if (last != end() && r.second > last->first)
134
last->first = r.second;
136
base_type::erase(first, last);
106
140
// Find the first ranges that has an end greater than index.
107
141
template <typename Type>
119
153
// Use find with no closest match.
120
154
template <typename Type>
122
156
ranges<Type>::has(Type index) const {
123
157
const_iterator itr = find(index);
125
159
return itr != end() && index >= itr->first;
128
template <typename Type>
130
ranges<Type>::unify(iterator first) {
131
iterator last = std::find_if((first + 1), end(), rak::less(first->second, rak::const_mem_ref(&value_type::first)));
133
first->second = std::max(first->second, (last - 1)->second);
134
Base::erase((first + 1), last);