FM / matcher

/usr/include/boost/xpressive/detail/core/matcher/

/usr/include/boost/xpressive/detail/core/matcher

Name	Size	Mode	Actions
action_matcher.hpp	16313	0644	edit dl rm
alternate_end_matcher.hpp	1437	0644	edit dl rm
alternate_matcher.hpp	4164	0644	edit dl rm
any_matcher.hpp	1368	0644	edit dl rm
assert_bol_matcher.hpp	2182	0644	edit dl rm
assert_bos_matcher.hpp	1235	0644	edit dl rm
assert_eol_matcher.hpp	2223	0644	edit dl rm
assert_eos_matcher.hpp	1229	0644	edit dl rm
assert_line_base.hpp	1394	0644	edit dl rm
assert_word_matcher.hpp	3763	0644	edit dl rm
attr_begin_matcher.hpp	1575	0644	edit dl rm
attr_end_matcher.hpp	1427	0644	edit dl rm
attr_matcher.hpp	3451	0644	edit dl rm
charset_matcher.hpp	1851	0644	edit dl rm
end_matcher.hpp	3167	0644	edit dl rm
epsilon_matcher.hpp	1162	0644	edit dl rm
keeper_matcher.hpp	3026	0644	edit dl rm
literal_matcher.hpp	1949	0644	edit dl rm
logical_newline_matcher.hpp	2385	0644	edit dl rm
lookahead_matcher.hpp	4806	0644	edit dl rm
lookbehind_matcher.hpp	5772	0644	edit dl rm
mark_begin_matcher.hpp	1619	0644	edit dl rm
mark_end_matcher.hpp	1788	0644	edit dl rm
mark_matcher.hpp	2427	0644	edit dl rm
optional_matcher.hpp	3954	0644	edit dl rm
posix_charset_matcher.hpp	2036	0644	edit dl rm
predicate_matcher.hpp	5929	0644	edit dl rm
range_matcher.hpp	2462	0644	edit dl rm
regex_byref_matcher.hpp	2760	0644	edit dl rm
regex_matcher.hpp	2299	0644	edit dl rm
repeat_begin_matcher.hpp	2162	0644	edit dl rm
repeat_end_matcher.hpp	3737	0644	edit dl rm
set_matcher.hpp	2623	0644	edit dl rm
simple_repeat_matcher.hpp	7924	0644	edit dl rm
string_matcher.hpp	2859	0644	edit dl rm
true_matcher.hpp	1103	0644	edit dl rm

Edit: /usr/include/boost/xpressive/detail/core/matcher/repeat_end_matcher.hpp (3737B)

///////////////////////////////////////////////////////////////////////////////
// repeat_end_matcher.hpp
//
//  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_DETAIL_CORE_MATCHER_REPEAT_END_MATCHER_HPP_EAN_10_04_2005
#define BOOST_XPRESSIVE_DETAIL_CORE_MATCHER_REPEAT_END_MATCHER_HPP_EAN_10_04_2005

// MS compatible compilers support #pragma once
#if defined(_MSC_VER)
# pragma once
#endif

#include <boost/mpl/bool.hpp>
#include <boost/xpressive/detail/detail_fwd.hpp>
#include <boost/xpressive/detail/core/quant_style.hpp>
#include <boost/xpressive/detail/core/state.hpp>

namespace boost { namespace xpressive { namespace detail
{

///////////////////////////////////////////////////////////////////////////////
    // repeat_end_matcher
    //
    template<typename Greedy>
    struct repeat_end_matcher
      : quant_style<quant_none, 0, false>
    {
        typedef Greedy greedy_type;
        int mark_number_;
        unsigned int min_, max_;
        mutable void const *back_;

repeat_end_matcher(int mark_nbr, unsigned int min, unsigned int max)
          : mark_number_(mark_nbr)
          , min_(min)
          , max_(max)
          , back_(0)
        {
        }

template<typename BidiIter, typename Next>
        bool match(match_state<BidiIter> &state, Next const &next) const
        {
            // prevent repeated zero-width sub-matches from causing infinite recursion
            sub_match_impl<BidiIter> &br = state.sub_match(this->mark_number_);

if(br.zero_width_ && br.begin_ == state.cur_)
            {
                return next.skip_match(state);
            }

bool old_zero_width = br.zero_width_;
            br.zero_width_ = (br.begin_ == state.cur_);

if(this->match_(state, next, greedy_type()))
            {
                return true;
            }

br.zero_width_ = old_zero_width;
            return false;
        }

// greedy, variable-width quantifier
        template<typename BidiIter, typename Next>
        bool match_(match_state<BidiIter> &state, Next const &next, mpl::true_) const
        {
            sub_match_impl<BidiIter> &br = state.sub_match(this->mark_number_);

if(this->max_ > br.repeat_count_)
            {
                ++br.repeat_count_;
                // loop back to the expression "pushed" in repeat_begin_matcher::match
                if(next.top_match(state, this->back_))
                {
                    return true;
                }
                else if(--br.repeat_count_ < this->min_)
                {
                    return false;
                }
            }

// looping finished, continue matching the rest of the pattern
            return next.skip_match(state);
        }

// non-greedy, variable-width quantifier
        template<typename BidiIter, typename Next>
        bool match_(match_state<BidiIter> &state, Next const &next, mpl::false_) const
        {
            sub_match_impl<BidiIter> &br = state.sub_match(this->mark_number_);

if(this->min_ <= br.repeat_count_)
            {
                if(next.skip_match(state))
                {
                    return true;
                }
            }

if(this->max_ > br.repeat_count_)
            {
                ++br.repeat_count_;
                if(next.top_match(state, this->back_))
                {
                    return true;
                }
                --br.repeat_count_;
            }

return false;
        }
    };

}}}

#endif

cmd: