/usr/include/boost/xpressive/detail/core/regex_impl.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 | ///////////////////////////////////////////////////////////////////////////////
// regex_impl.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_REGEX_IMPL_HPP_EAN_10_04_2005
#define BOOST_XPRESSIVE_DETAIL_CORE_REGEX_IMPL_HPP_EAN_10_04_2005
// MS compatible compilers support #pragma once
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
# pragma once
#endif
#include <vector>
#include <boost/intrusive_ptr.hpp>
#include <boost/xpressive/regex_traits.hpp>
#include <boost/xpressive/detail/detail_fwd.hpp>
#include <boost/xpressive/detail/dynamic/matchable.hpp>
#include <boost/xpressive/detail/utility/tracking_ptr.hpp>
#include <boost/xpressive/detail/utility/counted_base.hpp>
namespace boost { namespace xpressive { namespace detail
{
///////////////////////////////////////////////////////////////////////////////
// finder
template<typename BidiIter>
struct finder
: counted_base<finder<BidiIter> >
{
virtual ~finder() {}
virtual bool ok_for_partial_matches() const { return true; }
virtual bool operator ()(match_state<BidiIter> &state) const = 0;
};
///////////////////////////////////////////////////////////////////////////////
// traits
template<typename Char>
struct traits
: counted_base<traits<Char> >
{
virtual ~traits() {}
virtual Char tolower(Char ch) const = 0;
virtual Char toupper(Char ch) const = 0;
virtual bool in_range(Char from, Char to, Char ch) const = 0;
virtual int value(Char ch, int radix) const = 0;
};
///////////////////////////////////////////////////////////////////////////////
// named_mark
template<typename Char>
struct named_mark
{
typedef typename detail::string_type<Char>::type string_type;
named_mark(string_type name, std::size_t mark_nbr)
: name_(name)
, mark_nbr_(mark_nbr)
{}
string_type name_;
std::size_t mark_nbr_;
};
///////////////////////////////////////////////////////////////////////////////
// traits_holder
template<typename Traits>
struct traits_holder
: traits<typename Traits::char_type>
{
typedef typename Traits::char_type char_type;
explicit traits_holder(Traits const &tr)
: traits_(tr)
{
}
Traits const &traits() const
{
return this->traits_;
}
char_type tolower(char_type ch) const
{
return this->tolower_(ch, typename Traits::version_tag());
}
char_type toupper(char_type ch) const
{
return this->toupper_(ch, typename Traits::version_tag());
}
int value(char_type ch, int radix) const
{
return this->traits_.value(ch, radix);
}
bool in_range(char_type from, char_type to, char_type ch) const
{
return this->traits_.in_range(from, to, ch);
}
private:
char_type tolower_(char_type ch, regex_traits_version_1_tag) const
{
return ch;
}
char_type toupper_(char_type ch, regex_traits_version_1_tag) const
{
return ch;
}
char_type tolower_(char_type ch, regex_traits_version_2_tag) const
{
return this->traits_.tolower(ch);
}
char_type toupper_(char_type ch, regex_traits_version_2_tag) const
{
return this->traits_.toupper(ch);
}
Traits traits_;
};
///////////////////////////////////////////////////////////////////////////////
// regex_impl
//
template<typename BidiIter>
struct regex_impl
: enable_reference_tracking<regex_impl<BidiIter> >
{
typedef typename iterator_value<BidiIter>::type char_type;
regex_impl()
: enable_reference_tracking<regex_impl<BidiIter> >()
, xpr_()
, traits_()
, finder_()
, named_marks_()
, mark_count_(0)
, hidden_mark_count_(0)
{
#ifdef BOOST_XPRESSIVE_DEBUG_CYCLE_TEST
++instances;
#endif
}
regex_impl(regex_impl<BidiIter> const &that)
: enable_reference_tracking<regex_impl<BidiIter> >(that)
, xpr_(that.xpr_)
, traits_(that.traits_)
, finder_(that.finder_)
, named_marks_(that.named_marks_)
, mark_count_(that.mark_count_)
, hidden_mark_count_(that.hidden_mark_count_)
{
#ifdef BOOST_XPRESSIVE_DEBUG_CYCLE_TEST
++instances;
#endif
}
~regex_impl()
{
#ifdef BOOST_XPRESSIVE_DEBUG_CYCLE_TEST
--instances;
#endif
}
void swap(regex_impl<BidiIter> &that)
{
enable_reference_tracking<regex_impl<BidiIter> >::swap(that);
this->xpr_.swap(that.xpr_);
this->traits_.swap(that.traits_);
this->finder_.swap(that.finder_);
this->named_marks_.swap(that.named_marks_);
std::swap(this->mark_count_, that.mark_count_);
std::swap(this->hidden_mark_count_, that.hidden_mark_count_);
}
intrusive_ptr<matchable_ex<BidiIter> const> xpr_;
intrusive_ptr<traits<char_type> const> traits_;
intrusive_ptr<finder<BidiIter> > finder_;
std::vector<named_mark<char_type> > named_marks_;
std::size_t mark_count_;
std::size_t hidden_mark_count_;
#ifdef BOOST_XPRESSIVE_DEBUG_CYCLE_TEST
static int instances;
#endif
private:
regex_impl &operator =(regex_impl const &);
};
template<typename BidiIter>
void swap(regex_impl<BidiIter> &left, regex_impl<BidiIter> &right)
{
left.swap(right);
}
#ifdef BOOST_XPRESSIVE_DEBUG_CYCLE_TEST
template<typename BidiIter>
int regex_impl<BidiIter>::instances = 0;
#endif
}}} // namespace boost::xpressive::detail
#endif
|