x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
range_run.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\spirit\utility\impl\chset\range_run.hpp
旋转
特效
属性
历史版本
/*============================================================================= Copyright (c) 2001-2003 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) =============================================================================*/ #ifndef BOOST_SPIRIT_RANGE_RUN_HPP #define BOOST_SPIRIT_RANGE_RUN_HPP /////////////////////////////////////////////////////////////////////////////// #include
/////////////////////////////////////////////////////////////////////////////// namespace boost { namespace spirit { namespace utility { namespace impl { /////////////////////////////////////////////////////////////////////////// // // range class // // Implements a closed range of values. This class is used in // the implementation of the range_run class. // // { Low level implementation detail } // { Not to be confused with boost::spirit::range } // /////////////////////////////////////////////////////////////////////////// template
struct range { range(CharT first, CharT last); bool is_valid() const; bool includes(CharT v) const; bool includes(range const& r) const; bool overlaps(range const& r) const; void merge(range const& r); CharT first; CharT last; }; ////////////////////////////////// template
struct range_char_compare { bool operator()(range
const& x, const CharT y) const { return x.first < y; } bool operator()(const CharT x, range
const& y) const { return x < y.first; } // This additional operator is required for the checked STL shipped // with VC8 testing the ordering of the iterators passed to the // std::lower_bound algo this range_char_compare<> predicate is passed // to. bool operator()(range
const& x, range
const& y) const { return x.first < y.first; } }; ////////////////////////////////// template
struct range_compare { bool operator()(range
const& x, range
const& y) const { return x.first < y.first; } }; /////////////////////////////////////////////////////////////////////////// // // range_run // // An implementation of a sparse bit (boolean) set. The set uses // a sorted vector of disjoint ranges. This class implements the // bare minimum essentials from which the full range of set // operators can be implemented. The set is constructed from // ranges. Internally, adjacent or overlapping ranges are // coalesced. // // range_runs are very space-economical in situations where there // are lots of ranges and a few individual disjoint values. // Searching is O(log n) where n is the number of ranges. // // { Low level implementation detail } // /////////////////////////////////////////////////////////////////////////// template
class range_run { public: typedef range
range_t; typedef std::vector
run_t; typedef typename run_t::iterator iterator; typedef typename run_t::const_iterator const_iterator; void swap(range_run& rr); bool test(CharT v) const; void set(range_t const& r); void clear(range_t const& r); void clear(); const_iterator begin() const; const_iterator end() const; private: void merge(iterator iter, range_t const& r); run_t run; }; }}}} // namespace boost::spirit::utility::impl #endif #include
range_run.hpp
网页地址
文件地址
上一页
3/4
下一页
下载
( 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.