x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
oarchive.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\archive\array\oarchive.hpp
旋转
特效
属性
历史版本
#ifndef BOOST_ARCHIVE_ARRAY_OARCHIVE_HPP #define BOOST_ARCHIVE_ARRAY_OARCHIVE_HPP // (C) Copyright 2005 Matthias Troyer and Dave Abrahams // 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) #include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
namespace boost { namespace archive { namespace array { // To conveniently array-optimize an output archive X: // // * Derive it from oarchive
, where Impl is an // archive implementation base class from // Boost.Serialization // // * add a member function template that implements the // procedure for serializing arrays of T (for appropriate T) // // template
// save_array(serialization::array
const &, unsigned int) // // * add a unary MPL lambda expression member called // use_array_optimization whose result is convertible to // mpl::true_ iff array elements of type T can be serialized // with the load_array member function, and to mpl::false_ if // the unoptimized procedure must be used. template
class oarchive : public archive::detail::common_oarchive
{ typedef archive::detail::common_oarchive
Base; public: oarchive(unsigned int flags) : archive::detail::common_oarchive
(flags) {} // save_override for std::vector and serialization::array dispatches to // save_optimized with an additional argument. // // If that argument is of type mpl::true_, an optimized serialization is provided // If it is false, we just forward to the default serialization in the base class //the default version dispatches to the base class template
void save_optimized(T const &t, unsigned int version, mpl::false_) { Base::save_override(t, version); } // the optimized implementation for vector uses serialization::array // template
// void save_optimized( // const std::vector
&t, unsigned int, mpl::true_) // { // const serialization::collection_size_type count(t.size()); // * this->This() << BOOST_SERIALIZATION_NVP(count); // if (!t.empty()) // * this->This() << serialization::make_array(serialization::detail::get_data(t),t.size()); // } // the optimized implementation for serialization::array uses save_array template
void save_optimized( const serialization::array
&t, unsigned int version, mpl::true_) { this->This()->save_array(t,version); } // to save a vector: // if the value type is trivially constructable or an optimized array save exists, // then we can use the optimized version // template
// void save_override(std::vector
const &x, unsigned int version) // { // typedef BOOST_DEDUCED_TYPENAME remove_const
::type value_type; // typedef typename mpl::and_< // mpl::not_
>, // mpl::apply1< // BOOST_DEDUCED_TYPENAME Archive::use_array_optimization // , value_type> // >::type use_optimized; // save_optimized(x,version,use_optimized() ); // } // dispatch saving of arrays to the optimized version where supported template
void save_override(serialization::array
const& x, unsigned int version) { typedef typename mpl::apply1< BOOST_DEDUCED_TYPENAME Archive::use_array_optimization , BOOST_DEDUCED_TYPENAME remove_const
::type >::type use_optimized; save_optimized(x,version,use_optimized()); } // Load everything else in the usual way, forwarding on to the // Base class template
void save_override(T const& x, unsigned BOOST_PFTO int version) { Base::save_override(x, static_cast
(version)); } }; } } } // end namespace boost::archive::array #endif // BOOST_ARCHIVE_ARRAY_OARCHIVE_HPP
oarchive.hpp
网页地址
文件地址
上一页
2/2 下一页
下载
( 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.