1
/*=============================================================================
3
Copyright (c) 2001-2003 Joel de Guzman
4
http://spirit.sourceforge.net/
6
Permission to copy, use, modify, sell and distribute this software is
7
granted provided this copyright notice appears in all copies. This
8
software is provided "as is" without express or implied warranty, and
9
with no claim as to its suitability for any purpose.
10
=============================================================================*/
11
#ifndef BOOST_SPIRIT_RANGE_RUN_IPP
12
#define BOOST_SPIRIT_RANGE_RUN_IPP
14
///////////////////////////////////////////////////////////////////////////////
15
#include <algorithm> // for std::lower_bound
16
#include <boost/spirit/core/assert.hpp> // for BOOST_SPIRIT_ASSERT
17
#include <boost/spirit/utility/impl/chset/range_run.hpp>
18
#include <boost/spirit/debug.hpp>
19
#include <boost/limits.hpp>
21
///////////////////////////////////////////////////////////////////////////////
22
namespace boost { namespace spirit {
24
namespace utility { namespace impl {
26
///////////////////////////////////////////////////////////////////////
28
// range class implementation
30
///////////////////////////////////////////////////////////////////////
31
template <typename CharT>
32
inline range<CharT>::range(CharT first_, CharT last_)
33
: first(first_), last(last_) {}
35
//////////////////////////////////
36
template <typename CharT>
38
range<CharT>::is_valid() const
39
{ return first <= last; }
41
//////////////////////////////////
42
template <typename CharT>
44
range<CharT>::includes(range const& r) const
45
{ return (first <= r.first) && (last >= r.last); }
47
//////////////////////////////////
48
template <typename CharT>
50
range<CharT>::includes(CharT v) const
51
{ return (first <= v) && (last >= v); }
53
//////////////////////////////////
54
template <typename CharT>
56
range<CharT>::overlaps(range const& r) const
59
first == std::numeric_limits<CharT>::min() ? first : first-1;
61
last == std::numeric_limits<CharT>::max() ? last : last+1;
63
return (decr_first <= r.last) && (incr_last >= r.first);
66
//////////////////////////////////
67
template <typename CharT>
69
range<CharT>::merge(range const& r)
71
first = std::min(first, r.first);
72
last = std::max(last, r.last);
75
///////////////////////////////////////////////////////////////////////
77
// range_run class implementation
79
///////////////////////////////////////////////////////////////////////
80
template <typename CharT>
82
range_run<CharT>::test(CharT v) const
88
run.begin(), run.end(), v,
89
range_char_compare<CharT>()
92
if (iter != run.end() && iter->includes(v))
94
if (iter != run.begin())
95
return (--iter)->includes(v);
100
//////////////////////////////////
101
template <typename CharT>
103
range_run<CharT>::swap(range_run& rr)
104
{ run.swap(rr.run); }
106
//////////////////////////////////
107
template <typename CharT>
109
range_run<CharT>::merge(iterator iter, range<CharT> const& r)
112
iterator i = iter + 1;
114
while (i != run.end() && iter->overlaps(*i))
117
run.erase(iter+1, i);
120
//////////////////////////////////
121
template <typename CharT>
123
range_run<CharT>::set(range<CharT> const& r)
125
BOOST_SPIRIT_ASSERT(r.is_valid());
130
run.begin(), run.end(), r,
131
range_compare<CharT>()
134
if (iter != run.end() && iter->includes(r) ||
135
((iter != run.begin()) && (iter - 1)->includes(r)))
138
if (iter != run.begin() && (iter - 1)->overlaps(r))
141
else if (iter != run.end() && iter->overlaps(r))
153
//////////////////////////////////
154
template <typename CharT>
156
range_run<CharT>::clear(range<CharT> const& r)
158
BOOST_SPIRIT_ASSERT(r.is_valid());
163
run.begin(), run.end(), r,
164
range_compare<CharT>()
169
if ((iter != run.begin()) &&
170
(left_iter = (iter - 1))->includes(r.first))
171
if (left_iter->last > r.last)
173
CharT save_last = left_iter->last;
174
left_iter->last = r.first-1;
175
run.insert(iter, range<CharT>(r.last+1, save_last));
180
left_iter->last = r.first-1;
184
while (i != run.end() && r.includes(*i))
186
if (i != run.end() && i->includes(r.last))
192
//////////////////////////////////
193
template <typename CharT>
195
range_run<CharT>::clear()
198
//////////////////////////////////
199
template <typename CharT>
200
inline typename range_run<CharT>::const_iterator
201
range_run<CharT>::begin() const
202
{ return run.begin(); }
204
//////////////////////////////////
205
template <typename CharT>
206
inline typename range_run<CharT>::const_iterator
207
range_run<CharT>::end() const
208
{ return run.end(); }
210
}} // namespace utility::impl
212
}} // namespace boost::spirit