72 …void                insert(bound_type first, bound_type last) { insert(std::make_pair(first, last)…  in insert()  argument
73 …void                erase(bound_type first, bound_type last)  { erase(std::make_pair(first, last))…  in erase()  argument
85   size_t              intersect_distance(bound_type first, bound_type last) const;
94   if (r.first >= r.second)  in insert()
97 …iterator first = std::find_if(begin(), end(), rak::less_equal(r.first, rak::const_mem_ref(&value_t…  in insert()  local
99   if (first == end() || r.second < first->first) {  in insert()
102     base_type::insert(first, r);  in insert()
105     first->first = std::min(r.first, first->first);  in insert()
106     first->second = std::max(r.second, first->second);  in insert()
108 …iterator last = std::find_if(first, end(), rak::less(first->second, rak::const_mem_ref(&value_type…  in insert()
110     if (last != end() && first->second >= last->first)  in insert()
111       first->second = (last++)->second;  in insert()
113     base_type::erase(first + 1, last);  in insert()
120   if (r.first >= r.second)  in erase()
123 …iterator first = std::find_if(begin(), end(), rak::less(r.first, rak::const_mem_ref(&value_type::s…  in erase()  local
124 …iterator last  = std::find_if(first, end(), rak::less(r.second, rak::const_mem_ref(&value_type::se…  in erase()
126   if (first == end())  in erase()
129   if (first == last) {  in erase()
131     if (r.first > first->first) {  in erase()
132       std::swap(first->first, r.second);  in erase()
133       base_type::insert(first, value_type(r.second, r.first));  in erase()
135     } else if (r.second > first->first) {  in erase()
136       first->first = r.second;  in erase()
141     if (r.first > first->first)  in erase()
142       (first++)->second = r.first;  in erase()
144     if (last != end() && r.second > last->first)  in erase()
145       last->first = r.second;  in erase()
147     base_type::erase(first, last);  in erase()
170   return itr != end() && index >= itr->first;  in has()
175 ranges<RangesType>::intersect_distance(bound_type first, bound_type last) const {  in intersect_distance()  argument
176   return intersect_distance(std::make_pair(first, last));  in intersect_distance()
183   const_iterator first = find(range.first);  in intersect_distance()  local
185   if (first == end() || range.second <= first->first)  in intersect_distance()
188   size_t dist = std::min(range.second, first->second) - std::max(range.first, first->first);  in intersect_distance()
190   while (++first != end() && range.second > first->first)  in intersect_distance()
191     dist += std::min(range.second, first->second) - first->first;  in intersect_distance()
212   if (left_itr->first < right_itr->first)  in create_union()
220     if (left_itr->first < right_itr->first)  in create_union()
225     if (next.first <= result.back().second)  in create_union()
233     if (left_itr->first <= result.back().second)  in create_union()
240     if (right_itr->first <= result.back().second)  in create_union()