x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
lookahead_matcher.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\xpressive\detail\core\matcher\lookahead_matcher.hpp
旋转
特效
属性
历史版本
/////////////////////////////////////////////////////////////////////////////// // lookahead_matcher.hpp // // Copyright 2007 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_LOOKAHEAD_MATCHER_HPP_EAN_10_04_2005 #define BOOST_XPRESSIVE_DETAIL_CORE_MATCHER_LOOKAHEAD_MATCHER_HPP_EAN_10_04_2005 // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif #include
#include
#include
#include
#include
#include
#include
namespace boost { namespace xpressive { namespace detail { /////////////////////////////////////////////////////////////////////////////// // lookahead_matcher // Xpr can be either a static_xpression, or a shared_matchable // template
struct lookahead_matcher : quant_style
{ lookahead_matcher(Xpr const &xpr, bool no, bool pure = Xpr::pure) : xpr_(xpr) , not_(no) , pure_(pure) { } void inverse() { this->not_ = !this->not_; } template
bool match(match_state
&state, Next const &next) const { return Xpr::pure || this->pure_ ? this->match_(state, next, mpl::true_()) : this->match_(state, next, mpl::false_()); } template
bool match_(match_state
&state, Next const &next, mpl::true_) const { BidiIter const tmp = state.cur_; if(this->not_) { // negative look-ahead assertions do not trigger partial matches. save_restore
partial_match(state.found_partial_match_); detail::ignore_unused(partial_match); if(this->xpr_.match(state)) { state.cur_ = tmp; return false; } else if(next.match(state)) { return true; } } else { if(!this->xpr_.match(state)) { return false; } state.cur_ = tmp; if(next.match(state)) { return true; } } BOOST_ASSERT(state.cur_ == tmp); return false; } template
bool match_(match_state
&state, Next const &next, mpl::false_) const { BidiIter const tmp = state.cur_; // matching xpr could produce side-effects, save state memento
mem = save_sub_matches(state); if(this->not_) { // negative look-ahead assertions do not trigger partial matches. save_restore
partial_match(state.found_partial_match_); detail::ignore_unused(partial_match); if(this->xpr_.match(state)) { restore_sub_matches(mem, state); state.cur_ = tmp; return false; } else if(next.match(state)) { reclaim_sub_matches(mem, state, true); return true; } reclaim_sub_matches(mem, state, false); } else { if(!this->xpr_.match(state)) { reclaim_sub_matches(mem, state, false); return false; } state.cur_ = tmp; if(next.match(state)) { reclaim_sub_matches(mem, state, true); return true; } restore_sub_matches(mem, state); } BOOST_ASSERT(state.cur_ == tmp); return false; } Xpr xpr_; bool not_; bool pure_; // false if matching xpr_ could modify the sub-matches }; }}} #endif
lookahead_matcher.hpp
网页地址
文件地址
上一页
20/36
下一页
下载
( 4 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.