/usr/include/boost/xpressive/regex_iterator.hpp is in libboost1.55-dev 1.55.0+dfsg-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 | ///////////////////////////////////////////////////////////////////////////////
/// \file regex_iterator.hpp
/// Contains the definition of the regex_iterator type, an STL-compatible iterator
/// for stepping through all the matches in a sequence.
//
// Copyright 2008 Eric Niebler. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_XPRESSIVE_REGEX_ITERATOR_HPP_EAN_10_04_2005
#define BOOST_XPRESSIVE_REGEX_ITERATOR_HPP_EAN_10_04_2005
// MS compatible compilers support #pragma once
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
# pragma once
#endif
#include <boost/noncopyable.hpp>
#include <boost/intrusive_ptr.hpp>
#include <boost/iterator/iterator_traits.hpp>
#include <boost/xpressive/detail/detail_fwd.hpp>
#include <boost/xpressive/detail/core/access.hpp>
#include <boost/xpressive/detail/utility/counted_base.hpp>
namespace boost { namespace xpressive { namespace detail
{
//////////////////////////////////////////////////////////////////////////
// regex_iterator_impl
//
template<typename BidiIter>
struct regex_iterator_impl
: counted_base<regex_iterator_impl<BidiIter> >
{
typedef detail::core_access<BidiIter> access;
regex_iterator_impl
(
BidiIter begin
, BidiIter cur
, BidiIter end
, BidiIter next_search
, basic_regex<BidiIter> const &rex
, regex_constants::match_flag_type flags
, bool not_null = false
)
: rex_(rex)
, what_()
, state_(begin, end, what_, *access::get_regex_impl(rex_), flags)
, flags_(flags)
, not_null_(not_null)
{
this->state_.cur_ = cur;
this->state_.next_search_ = next_search;
}
bool next()
{
this->state_.reset(this->what_, *access::get_regex_impl(this->rex_));
if(!regex_search_impl(this->state_, this->rex_, this->not_null_))
{
return false;
}
// Report position() correctly by setting the base different from prefix().first
access::set_base(this->what_, this->state_.begin_);
this->state_.cur_ = this->state_.next_search_ = this->what_[0].second;
this->not_null_ = (0 == this->what_.length());
return true;
}
bool equal_to(regex_iterator_impl<BidiIter> const &that) const
{
return this->rex_.regex_id() == that.rex_.regex_id()
&& this->state_.begin_ == that.state_.begin_
&& this->state_.cur_ == that.state_.cur_
&& this->state_.end_ == that.state_.end_
&& this->flags_ == that.flags_
;
}
basic_regex<BidiIter> rex_;
match_results<BidiIter> what_;
match_state<BidiIter> state_;
regex_constants::match_flag_type const flags_;
bool not_null_;
};
} // namespace detail
//////////////////////////////////////////////////////////////////////////
// regex_iterator
//
template<typename BidiIter>
struct regex_iterator
{
typedef basic_regex<BidiIter> regex_type;
typedef match_results<BidiIter> value_type;
typedef typename iterator_difference<BidiIter>::type difference_type;
typedef value_type const *pointer;
typedef value_type const &reference;
typedef std::forward_iterator_tag iterator_category;
/// INTERNAL ONLY
typedef detail::regex_iterator_impl<BidiIter> impl_type_;
regex_iterator()
: impl_()
{
}
regex_iterator
(
BidiIter begin
, BidiIter end
, basic_regex<BidiIter> const &rex
, regex_constants::match_flag_type flags = regex_constants::match_default
)
: impl_()
{
if(0 != rex.regex_id()) // Empty regexes are guaranteed to match nothing
{
this->impl_ = new impl_type_(begin, begin, end, begin, rex, flags);
this->next_();
}
}
template<typename LetExpr>
regex_iterator
(
BidiIter begin
, BidiIter end
, basic_regex<BidiIter> const &rex
, detail::let_<LetExpr> const &args
, regex_constants::match_flag_type flags = regex_constants::match_default
)
: impl_()
{
if(0 != rex.regex_id()) // Empty regexes are guaranteed to match nothing
{
this->impl_ = new impl_type_(begin, begin, end, begin, rex, flags);
detail::bind_args(args, this->impl_->what_);
this->next_();
}
}
regex_iterator(regex_iterator<BidiIter> const &that)
: impl_(that.impl_) // COW
{
}
regex_iterator<BidiIter> &operator =(regex_iterator<BidiIter> const &that)
{
this->impl_ = that.impl_; // COW
return *this;
}
friend bool operator ==(regex_iterator<BidiIter> const &left, regex_iterator<BidiIter> const &right)
{
if(!left.impl_ || !right.impl_)
{
return !left.impl_ && !right.impl_;
}
return left.impl_->equal_to(*right.impl_);
}
friend bool operator !=(regex_iterator<BidiIter> const &left, regex_iterator<BidiIter> const &right)
{
return !(left == right);
}
value_type const &operator *() const
{
return this->impl_->what_;
}
value_type const *operator ->() const
{
return &this->impl_->what_;
}
/// If what.prefix().first != what[0].second and if the element match_prev_avail is not set in
/// flags then sets it. Then behaves as if by calling regex_search(what[0].second, end, what, *pre, flags),
/// with the following variation: in the event that the previous match found was of zero length
/// (what[0].length() == 0) then attempts to find a non-zero length match starting at what[0].second,
/// only if that fails and provided what[0].second != suffix().second does it look for a (possibly
/// zero length) match starting from what[0].second + 1. If no further match is found then sets
/// *this equal to the end of sequence iterator.
/// \post (*this)-\>size() == pre-\>mark_count() + 1
/// \post (*this)-\>empty() == false
/// \post (*this)-\>prefix().first == An iterator denoting the end point of the previous match found
/// \post (*this)-\>prefix().last == (**this)[0].first
/// \post (*this)-\>prefix().matched == (*this)-\>prefix().first != (*this)-\>prefix().second
/// \post (*this)-\>suffix().first == (**this)[0].second
/// \post (*this)-\>suffix().last == end
/// \post (*this)-\>suffix().matched == (*this)-\>suffix().first != (*this)-\>suffix().second
/// \post (**this)[0].first == The starting iterator for this match.
/// \post (**this)[0].second == The ending iterator for this match.
/// \post (**this)[0].matched == true if a full match was found, and false if it was a partial match (found as a result of the match_partial flag being set).
/// \post (**this)[n].first == For all integers n \< (*this)-\>size(), the start of the sequence that matched sub-expression n. Alternatively, if sub-expression n did not participate in the match, then end.
/// \post (**this)[n].second == For all integers n \< (*this)-\>size(), the end of the sequence that matched sub-expression n. Alternatively, if sub-expression n did not participate in the match, then end.
/// \post (**this)[n].matched == For all integers n \< (*this)-\>size(), true if sub-expression n participated in the match, false otherwise.
/// \post (*this)-\>position() == The distance from the start of the original sequence being iterated, to the start of this match.
regex_iterator<BidiIter> &operator ++()
{
this->fork_(); // un-share the implementation
this->next_();
return *this;
}
regex_iterator<BidiIter> operator ++(int)
{
regex_iterator<BidiIter> tmp(*this);
++*this;
return tmp;
}
private:
/// INTERNAL ONLY
void fork_()
{
if(1 != this->impl_->use_count())
{
// This is OK, the use_count is > 1
impl_type_ *that = this->impl_.get();
this->impl_ = new impl_type_
(
that->state_.begin_
, that->state_.cur_
, that->state_.end_
, that->state_.next_search_
, that->rex_
, that->flags_
, that->not_null_
);
detail::core_access<BidiIter>::get_action_args(this->impl_->what_)
= detail::core_access<BidiIter>::get_action_args(that->what_);
}
}
/// INTERNAL ONLY
void next_()
{
BOOST_ASSERT(this->impl_ && 1 == this->impl_->use_count());
if(!this->impl_->next())
{
this->impl_ = 0;
}
}
intrusive_ptr<impl_type_> impl_;
};
}} // namespace boost::xpressive
#endif
|