1 ///////////////////////////////////////////////////////////////////////////////
4 // Copyright 2008 Eric Niebler. Distributed under the Boost
5 // Software License, Version 1.0. (See accompanying file
6 // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
8 #ifndef BOOST_XPRESSIVE_DETAIL_CORE_SUB_MATCH_IMPL_HPP_EAN_10_04_2005
9 #define BOOST_XPRESSIVE_DETAIL_CORE_SUB_MATCH_IMPL_HPP_EAN_10_04_2005
11 // MS compatible compilers support #pragma once
16 #include <boost/xpressive/sub_match.hpp>
18 namespace boost { namespace xpressive { namespace detail
21 // TODO: sub_match_impl is a POD IFF BidiIter is POD. Pool allocation
22 // of them can be made more efficient if they are. Or maybe all they
23 // need is trivial constructor/destructor. (???)
25 ///////////////////////////////////////////////////////////////////////////////
28 template<typename BidiIter>
32 unsigned int repeat_count_;
36 sub_match_impl(BidiIter const &begin)
37 : sub_match<BidiIter>(begin, begin)
45 }}} // namespace boost::xpressive::detail