x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
count_if.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\fusion\algorithm\query\detail\count_if.hpp
旋转
特效
属性
历史版本
/*============================================================================= Copyright (c) 2001-2006 Joel de Guzman Copyright (c) 2007 Dan Marsden 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) ==============================================================================*/ #if !defined(BOOST_FUSION_COUNT_IF_09162005_0141) #define BOOST_FUSION_COUNT_IF_09162005_0141 #include
#include
#include
#include
#include
#include
#include
#include
#include
namespace boost { namespace fusion { struct random_access_traversal_tag; namespace detail { template
inline int linear_count_if(First const&, Last const&, F const&, mpl::true_) { return 0; } template
inline int linear_count_if(First const& first, Last const& last, F& f, mpl::false_) { int n = detail::linear_count_if( fusion::next(first) , last , f , result_of::equal_to
::type, Last>()); if (f(*first)) ++n; return n; } template
inline int count_if(Sequence const& seq, F f, Tag) { return detail::linear_count_if( fusion::begin(seq) , fusion::end(seq) , f , result_of::equal_to< typename result_of::begin
::type , typename result_of::end
::type>()); } template
struct unrolled_count_if { template
static int call(I0 const& i0, F f) { int ct = unrolled_count_if
:: call(fusion::advance_c<4>(i0), f); if(f(*i0)) ++ct; typedef typename result_of::next
::type I1; I1 i1(fusion::next(i0)); if(f(*i1)) ++ct; typedef typename result_of::next
::type I2; I2 i2(fusion::next(i1)); if(f(*i2)) ++ct; typedef typename result_of::next
::type I3; I3 i3(fusion::next(i2)); if(f(*i3)) ++ct; return ct; } }; template<> struct unrolled_count_if<3> { template
static int call(I0 const& i0, F f) { int ct = 0; if(f(*i0)) ++ct; typedef typename result_of::next
::type I1; I1 i1(fusion::next(i0)); if(f(*i1)) ++ct; typedef typename result_of::next
::type I2; I2 i2(fusion::next(i1)); if(f(*i2)) ++ct; return ct; } }; template<> struct unrolled_count_if<2> { template
static int call(I0 const& i0, F f) { int ct = 0; if(f(*i0)) ++ct; typedef typename result_of::next
::type I1; I1 i1(fusion::next(i0)); if(f(*i1)) ++ct; return ct; } }; template<> struct unrolled_count_if<1> { template
static int call(I0 const& i0, F f) { int ct = 0; if(f(*i0)) ++ct; return ct; } }; template<> struct unrolled_count_if<0> { template
static int call(I0 const&, F) { return 0; } }; template
inline int count_if(Sequence const& seq, F f, random_access_traversal_tag) { typedef typename result_of::begin
::type begin; typedef typename result_of::end
::type end; return detail::unrolled_count_if
::type::value>:: call(fusion::begin(seq), f); } }}} #endif
count_if.hpp
网页地址
文件地址
上一页
5/6
下一页
下载
( 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.