x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
subarray.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\multi_array\subarray.hpp
旋转
特效
属性
历史版本
// Copyright 2002 The Trustees of Indiana University. // 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) // Boost.MultiArray Library // Authors: Ronald Garcia // Jeremy Siek // Andrew Lumsdaine // See http://www.boost.org/libs/multi_array for documentation. #ifndef SUBARRAY_RG071801_HPP #define SUBARRAY_RG071801_HPP // // subarray.hpp - used to implement standard operator[] on // multi_arrays // #include "boost/multi_array/base.hpp" #include "boost/multi_array/concept_checks.hpp" #include "boost/limits.hpp" #include "boost/type.hpp" #include
#include
#include
namespace boost { namespace detail { namespace multi_array { // // const_sub_array // multi_array's proxy class to allow multiple overloads of // operator[] in order to provide a clean multi-dimensional array // interface. template
class const_sub_array : public boost::detail::multi_array::multi_array_impl_base
{ typedef boost::detail::multi_array::multi_array_impl_base
super_type; public: typedef typename super_type::value_type value_type; typedef typename super_type::const_reference const_reference; typedef typename super_type::const_iterator const_iterator; typedef typename super_type::const_reverse_iterator const_reverse_iterator; typedef typename super_type::element element; typedef typename super_type::size_type size_type; typedef typename super_type::difference_type difference_type; typedef typename super_type::index index; typedef typename super_type::extent_range extent_range; // template typedefs template
struct const_array_view { typedef boost::detail::multi_array::const_multi_array_view
type; }; template
struct array_view { typedef boost::detail::multi_array::multi_array_view
type; }; // Allow default copy constructor as well. template
const_sub_array (const const_sub_array
& rhs) : base_(rhs.base_), extents_(rhs.extents_), strides_(rhs.strides_), index_base_(rhs.index_base_) { } // const_sub_array always returns const types, regardless of its own // constness. const_reference operator[](index idx) const { return super_type::access(boost::type
(), idx,base_,shape(),strides(),index_bases()); } template
const element& operator()(const IndexList& indices) const { boost::function_requires< detail::multi_array::CollectionConcept
>(); return super_type::access_element(boost::type
(), indices,origin(), shape(),strides(),index_bases()); } // see generate_array_view in base.hpp #if !defined(BOOST_MSVC) || BOOST_MSVC > 1300 template
#else template
// else ICE #endif // BOOST_MSVC typename const_array_view
::type operator[](const boost::detail::multi_array:: index_gen
& indices) const { typedef typename const_array_view
::type return_type; return super_type::generate_array_view(boost::type
(), indices, shape(), strides(), index_bases(), base_); } template
bool operator<(const const_sub_array
& rhs) const { return std::lexicographical_compare(begin(),end(),rhs.begin(),rhs.end()); } template
bool operator==(const const_sub_array
& rhs) const { if(std::equal(shape(),shape()+num_dimensions(),rhs.shape())) return std::equal(begin(),end(),rhs.begin()); else return false; } template
bool operator!=(const const_sub_array
& rhs) const { return !(*this == rhs); } template
bool operator>(const const_sub_array
& rhs) const { return rhs < *this; } template
bool operator<=(const const_sub_array
& rhs) const { return !(*this > rhs); } template
bool operator>=(const const_sub_array
& rhs) const { return !(*this < rhs); } const_iterator begin() const { return const_iterator(*index_bases(),origin(), shape(),strides(),index_bases()); } const_iterator end() const { return const_iterator(*index_bases()+(index)*shape(),origin(), shape(),strides(),index_bases()); } const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); } const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } TPtr origin() const { return base_; } size_type size() const { return extents_[0]; } size_type max_size() const { return num_elements(); } bool empty() const { return size() == 0; } size_type num_dimensions() const { return NumDims; } const size_type* shape() const { return extents_; } const index* strides() const { return strides_; } const index* index_bases() const { return index_base_; } size_type num_elements() const { return std::accumulate(shape(),shape() + num_dimensions(), size_type(1), std::multiplies
()); } #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS protected: template
friend class value_accessor_n; template
friend class const_sub_array; #else public: // Should be protected #endif const_sub_array (TPtr base, const size_type* extents, const index* strides, const index* index_base) : base_(base), extents_(extents), strides_(strides), index_base_(index_base) { } TPtr base_; const size_type* extents_; const index* strides_; const index* index_base_; private: // const_sub_array cannot be assigned to (no deep copies!) const_sub_array& operator=(const const_sub_array&); }; // // sub_array // multi_array's proxy class to allow multiple overloads of // operator[] in order to provide a clean multi-dimensional array // interface. template
class sub_array : public const_sub_array
{ typedef const_sub_array
super_type; public: typedef typename super_type::element element; typedef typename super_type::reference reference; typedef typename super_type::index index; typedef typename super_type::size_type size_type; typedef typename super_type::iterator iterator; typedef typename super_type::reverse_iterator reverse_iterator; typedef typename super_type::const_reference const_reference; typedef typename super_type::const_iterator const_iterator; typedef typename super_type::const_reverse_iterator const_reverse_iterator; // template typedefs template
struct const_array_view { typedef boost::detail::multi_array::const_multi_array_view
type; }; template
struct array_view { typedef boost::detail::multi_array::multi_array_view
type; }; // Assignment from other ConstMultiArray types. template
sub_array& operator=(const ConstMultiArray& other) { function_requires< boost::detail::multi_array::ConstMultiArrayConcept< ConstMultiArray, NumDims> >(); // make sure the dimensions agree BOOST_ASSERT(other.num_dimensions() == this->num_dimensions()); BOOST_ASSERT(std::equal(other.shape(),other.shape()+this->num_dimensions(), this->shape())); // iterator-based copy std::copy(other.begin(),other.end(),begin()); return *this; } sub_array& operator=(const sub_array& other) { if (&other != this) { // make sure the dimensions agree BOOST_ASSERT(other.num_dimensions() == this->num_dimensions()); BOOST_ASSERT(std::equal(other.shape(), other.shape()+this->num_dimensions(), this->shape())); // iterator-based copy std::copy(other.begin(),other.end(),begin()); } return *this; } T* origin() { return this->base_; } const T* origin() const { return this->base_; } reference operator[](index idx) { return super_type::access(boost::type
(), idx,this->base_,this->shape(),this->strides(), this->index_bases()); } // see generate_array_view in base.hpp #if !defined(BOOST_MSVC) || BOOST_MSVC > 1300 template
#else template
// else ICE #endif // BOOST_MSVC typename array_view
::type operator[](const boost::detail::multi_array:: index_gen
& indices) { typedef typename array_view
::type return_type; return super_type::generate_array_view(boost::type
(), indices, this->shape(), this->strides(), this->index_bases(), origin()); } template
element& operator()(const IndexList& indices) { boost::function_requires< detail::multi_array::CollectionConcept
>(); return super_type::access_element(boost::type
(), indices,origin(), this->shape(),this->strides(), this->index_bases()); } iterator begin() { return iterator(*this->index_bases(),origin(), this->shape(),this->strides(),this->index_bases()); } iterator end() { return iterator(*this->index_bases()+(index)*this->shape(),origin(), this->shape(),this->strides(),this->index_bases()); } // RG - rbegin() and rend() written naively to thwart MSVC ICE. reverse_iterator rbegin() { reverse_iterator ri(end()); return ri; } reverse_iterator rend() { reverse_iterator ri(begin()); return ri; } // // proxies // template
const element& operator()(const IndexList& indices) const { boost::function_requires< detail::multi_array::CollectionConcept
>(); return super_type::operator()(indices); } const_reference operator[](index idx) const { return super_type::operator[](idx); } // see generate_array_view in base.hpp #if !defined(BOOST_MSVC) || BOOST_MSVC > 1300 template
#else template
// else ICE #endif // BOOST_MSVC typename const_array_view
::type operator[](const boost::detail::multi_array:: index_gen
& indices) const { return super_type::operator[](indices); } const_iterator begin() const { return super_type::begin(); } const_iterator end() const { return super_type::end(); } const_reverse_iterator rbegin() const { return super_type::rbegin(); } const_reverse_iterator rend() const { return super_type::rend(); } #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS private: template
friend class value_accessor_n; #else public: // should be private #endif sub_array (T* base, const size_type* extents, const index* strides, const index* index_base) : super_type(base,extents,strides,index_base) { } }; } // namespace multi_array } // namespace detail // // traits classes to get sub_array types // template
class subarray_gen { typedef typename Array::element element; public: typedef boost::detail::multi_array::sub_array
type; }; template
class const_subarray_gen { typedef typename Array::element element; public: typedef boost::detail::multi_array::const_sub_array
type; }; } // namespace boost #endif // SUBARRAY_RG071801_HPP
subarray.hpp
网页地址
文件地址
上一页
13/15
下一页
下载
( 12 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.