x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
scanner.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\spirit\core\scanner\scanner.hpp
旋转
特效
属性
历史版本
/*============================================================================= Copyright (c) 1998-2002 Joel de Guzman http://spirit.sourceforge.net/ Use, modification and distribution is subject to 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) =============================================================================*/ #if !defined(BOOST_SPIRIT_SCANNER_HPP) #define BOOST_SPIRIT_SCANNER_HPP #include
#include
#include
#include
#include
// for boost::detail::iterator_traits #include
namespace boost { namespace spirit { /////////////////////////////////////////////////////////////////////////// // // iteration_policy class // /////////////////////////////////////////////////////////////////////////// struct iteration_policy { template
void advance(ScannerT const& scan) const { ++scan.first; } template
bool at_end(ScannerT const& scan) const { return scan.first == scan.last; } template
T filter(T ch) const { return ch; } template
typename ScannerT::ref_t get(ScannerT const& scan) const { return *scan.first; } }; /////////////////////////////////////////////////////////////////////////// // // match_policy class // /////////////////////////////////////////////////////////////////////////// struct match_policy { template
struct result { typedef match
type; }; const match
no_match() const { return match
(); } const match
empty_match() const { return match
(0, nil_t()); } template
match
create_match( std::size_t length, AttrT const& val, IteratorT const& /*first*/, IteratorT const& /*last*/) const { return match
(length, val); } template
void group_match( MatchT& /*m*/, parser_id const& /*id*/, IteratorT const& /*first*/, IteratorT const& /*last*/) const {} template
void concat_match(Match1T& l, Match2T const& r) const { l.concat(r); } }; /////////////////////////////////////////////////////////////////////////// // // match_result class // /////////////////////////////////////////////////////////////////////////// template
struct match_result { typedef typename MatchPolicyT::template result
::type type; }; /////////////////////////////////////////////////////////////////////////// // // action_policy class // /////////////////////////////////////////////////////////////////////////// template
struct attributed_action_policy { template
static void call( ActorT const& actor, AttrT& val, IteratorT const&, IteratorT const&) { actor(val); } }; ////////////////////////////////// template <> struct attributed_action_policy
{ template
static void call( ActorT const& actor, nil_t, IteratorT const& first, IteratorT const& last) { actor(first, last); } }; ////////////////////////////////// struct action_policy { template
void do_action( ActorT const& actor, AttrT& val, IteratorT const& first, IteratorT const& last) const { attributed_action_policy
::call(actor, val, first, last); } }; /////////////////////////////////////////////////////////////////////////// // // scanner_policies class // /////////////////////////////////////////////////////////////////////////// template < typename IterationPolicyT, typename MatchPolicyT, typename ActionPolicyT> struct scanner_policies : public IterationPolicyT, public MatchPolicyT, public ActionPolicyT { typedef IterationPolicyT iteration_policy_t; typedef MatchPolicyT match_policy_t; typedef ActionPolicyT action_policy_t; scanner_policies( IterationPolicyT const& i_policy = IterationPolicyT(), MatchPolicyT const& m_policy = MatchPolicyT(), ActionPolicyT const& a_policy = ActionPolicyT()) : IterationPolicyT(i_policy) , MatchPolicyT(m_policy) , ActionPolicyT(a_policy) {} template
scanner_policies(ScannerPoliciesT const& policies) : IterationPolicyT(policies) , MatchPolicyT(policies) , ActionPolicyT(policies) {} }; /////////////////////////////////////////////////////////////////////////// // // scanner_policies_base class: the base class of all scanners // /////////////////////////////////////////////////////////////////////////// struct scanner_base {}; /////////////////////////////////////////////////////////////////////////// // // scanner class // /////////////////////////////////////////////////////////////////////////// template < typename IteratorT, typename PoliciesT> class scanner : public PoliciesT, public scanner_base { public: typedef IteratorT iterator_t; typedef PoliciesT policies_t; typedef typename boost::detail:: iterator_traits
::value_type value_t; typedef typename boost::detail:: iterator_traits
::reference ref_t; typedef typename boost:: call_traits
::param_type iter_param_t; scanner( IteratorT& first_, iter_param_t last_, PoliciesT const& policies = PoliciesT()) : PoliciesT(policies), first(first_), last(last_) { at_end(); } scanner(scanner const& other) : PoliciesT(other), first(other.first), last(other.last) {} scanner(scanner const& other, IteratorT& first_) : PoliciesT(other), first(first_), last(other.last) {} template
scanner(scanner
const& other) : PoliciesT(other), first(other.first), last(other.last) {} bool at_end() const { typedef typename PoliciesT::iteration_policy_t iteration_policy_t; return iteration_policy_t::at_end(*this); } value_t operator*() const { typedef typename PoliciesT::iteration_policy_t iteration_policy_t; return iteration_policy_t::filter(iteration_policy_t::get(*this)); } scanner const& operator++() const { typedef typename PoliciesT::iteration_policy_t iteration_policy_t; iteration_policy_t::advance(*this); return *this; } template
struct rebind_policies { typedef scanner
type; }; template
scanner
change_policies(PoliciesT2 const& policies) const { return scanner
(first, last, policies); } template
struct rebind_iterator { typedef scanner
type; }; template
scanner
change_iterator(IteratorT2 const& first_, IteratorT2 const &last_) const { return scanner
(first_, last_, *this); } IteratorT& first; IteratorT const last; private: scanner& operator=(scanner const& other); }; /////////////////////////////////////////////////////////////////////////// // // rebind_scanner_policies class // /////////////////////////////////////////////////////////////////////////// template
struct rebind_scanner_policies { typedef typename ScannerT::template rebind_policies
::type type; }; ////////////////////////////////// template
struct rebind_scanner_iterator { typedef typename ScannerT::template rebind_iterator
::type type; }; }} #endif
scanner.hpp
网页地址
文件地址
上一页 1/4
下一页
下载
( 9 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.