/usr/include/boost/xpressive/detail/core/matcher/assert_word_matcher.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 | ///////////////////////////////////////////////////////////////////////////////
// assert_word_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_ASSERT_WORD_MATCHER_HPP_EAN_10_04_2005
#define BOOST_XPRESSIVE_DETAIL_CORE_MATCHER_ASSERT_WORD_MATCHER_HPP_EAN_10_04_2005
// MS compatible compilers support #pragma once
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
# pragma once
#endif
#include <boost/assert.hpp>
#include <boost/xpressive/detail/detail_fwd.hpp>
#include <boost/xpressive/detail/core/quant_style.hpp>
#include <boost/xpressive/detail/utility/ignore_unused.hpp>
#include <boost/xpressive/detail/core/state.hpp>
namespace boost { namespace xpressive { namespace detail
{
///////////////////////////////////////////////////////////////////////////////
// word_boundary
//
template<typename IsBoundary>
struct word_boundary
{
template<typename BidiIter>
static bool eval(bool prevword, bool thisword, match_state<BidiIter> &state)
{
if((state.flags_.match_not_bow_ && state.bos()) || (state.flags_.match_not_eow_ && state.eos()))
{
return !IsBoundary::value;
}
return IsBoundary::value == (prevword != thisword);
}
};
///////////////////////////////////////////////////////////////////////////////
// word_begin
//
struct word_begin
{
template<typename BidiIter>
static bool eval(bool prevword, bool thisword, match_state<BidiIter> &state)
{
if(state.flags_.match_not_bow_ && state.bos())
{
return false;
}
return !prevword && thisword;
}
};
///////////////////////////////////////////////////////////////////////////////
// word_end
//
struct word_end
{
template<typename BidiIter>
static bool eval(bool prevword, bool thisword, match_state<BidiIter> &state)
{
if(state.flags_.match_not_eow_ && state.eos())
{
return false;
}
return prevword && !thisword;
}
};
///////////////////////////////////////////////////////////////////////////////
// assert_word_matcher
//
template<typename Cond, typename Traits>
struct assert_word_matcher
: quant_style_assertion
{
typedef typename Traits::char_type char_type;
typedef typename Traits::char_class_type char_class_type;
assert_word_matcher(Traits const &tr)
: word_(lookup_classname(tr, "w"))
{
BOOST_ASSERT(0 != this->word_);
}
assert_word_matcher(char_class_type word)
: word_(word)
{}
bool is_word(Traits const &tr, char_type ch) const
{
detail::ignore_unused(tr);
return tr.isctype(tr.translate(ch), this->word_);
}
template<typename BidiIter, typename Next>
bool match(match_state<BidiIter> &state, Next const &next) const
{
BidiIter cur = state.cur_;
bool const thisword = !state.eos() && this->is_word(traits_cast<Traits>(state), *cur);
bool const prevword = (!state.bos() || state.flags_.match_prev_avail_)
&& this->is_word(traits_cast<Traits>(state), *--cur);
return Cond::eval(prevword, thisword, state) && next.match(state);
}
char_class_type word() const
{
return this->word_;
}
private:
char_class_type word_;
};
}}}
#endif
|