detail/core/sub_match_impl.hpp

0001 ///////////////////////////////////////////////////////////////////////////////
0002 // sub_match_impl.hpp
0003 //
0004 //  Copyright 2008 Eric Niebler. Distributed under the Boost
0005 //  Software License, Version 1.0. (See accompanying file
0006 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
0007
0008 #ifndef BOOST_XPRESSIVE_DETAIL_CORE_SUB_MATCH_IMPL_HPP_EAN_10_04_2005
0009 #define BOOST_XPRESSIVE_DETAIL_CORE_SUB_MATCH_IMPL_HPP_EAN_10_04_2005
0010
0011 // MS compatible compilers support #pragma once
0012 #if defined(_MSC_VER)
0013 # pragma once
0014 #endif
0015
0016 #include <boost/xpressive/sub_match.hpp>
0017
0018 namespace boost { namespace xpressive { namespace detail
0019 {
0020
0021 // TODO: sub_match_impl is a POD IFF BidiIter is POD. Pool allocation
0022 // of them can be made more efficient if they are. Or maybe all they
0023 // need is trivial constructor/destructor. (???)
0024
0025 ///////////////////////////////////////////////////////////////////////////////
0026 // sub_match_impl
0027 //
0028 template<typename BidiIter>
0029 struct sub_match_impl
0030   : sub_match<BidiIter>
0031 {
0032     unsigned int repeat_count_;
0033     BidiIter begin_;
0034     bool zero_width_;
0035
0036     sub_match_impl(BidiIter const &begin)
0037       : sub_match<BidiIter>(begin, begin)
0038       , repeat_count_(0)
0039       , begin_(begin)
0040       , zero_width_(false)
0041     {
0042     }
0043 };
0044
0045 }}} // namespace boost::xpressive::detail
0046
0047 #endif