x
Yes
No
Do you want to visit DriveHQ English website?
Inicio
Características
Precios
Prueba gratuita
Software cliente
Acerca de nosotros
Servidor de archivos
|
Solución de copias de seguridad
|
Servidor FTP
|
Servidor de correo electrónico
|
Alojamiento web
|
Software cliente
Servidor de archivos
Solución de copia de seguridad
Servidor FTP
Servidor de correo electrónico
Alojamiento web
Software cliente
view.hpp - Hosted on DriveHQ Cloud IT Platform
Arriba
Subir
Descargar
Compartir
Publicar
Nueva carpeta
Nuevo archivo
Copiar
Cortar
Eliminar
Pegar
Clasificación
Actualizar
Ruta de la carpeta: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\multi_array\view.hpp
Girar
Efecto
Propiedad
Historial
// 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 BOOST_MULTI_ARRAY_VIEW_RG071301_HPP #define BOOST_MULTI_ARRAY_VIEW_RG071301_HPP // // view.hpp - code for creating "views" of array data. // #include "boost/multi_array/base.hpp" #include "boost/multi_array/concept_checks.hpp" #include "boost/multi_array/iterator.hpp" #include "boost/multi_array/storage_order.hpp" #include "boost/multi_array/subarray.hpp" #include "boost/multi_array/algorithm.hpp" #include "boost/type_traits/is_integral.hpp" #include "boost/array.hpp" #include "boost/limits.hpp" #include
#include
#include
#include
namespace boost { namespace detail { namespace multi_array { // TPtr = const T* defaulted in base.hpp template
class const_multi_array_view : 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; }; template
const_multi_array_view(const const_multi_array_view
& other) : base_(other.base_), origin_offset_(other.origin_offset_), num_elements_(other.num_elements_), extent_list_(other.extent_list_), stride_list_(other.stride_list_), index_base_list_(other.index_base_list_) { } template
#ifdef BOOST_NO_SFINAE void #else typename disable_if
::type,void >::type #endif reindex(const BaseList& values) { boost::function_requires< detail::multi_array::CollectionConcept
>(); boost::detail::multi_array:: copy_n(values.begin(),num_dimensions(),index_base_list_.begin()); origin_offset_ = this->calculate_indexing_offset(stride_list_,index_base_list_); } void reindex(index value) { index_base_list_.assign(value); origin_offset_ = this->calculate_indexing_offset(stride_list_,index_base_list_); } size_type num_dimensions() const { return NumDims; } size_type size() const { return extent_list_.front(); } size_type max_size() const { return num_elements(); } bool empty() const { return size() == 0; } const size_type* shape() const { return extent_list_.data(); } const index* strides() const { return stride_list_.data(); } const T* origin() const { return base_+origin_offset_; } size_type num_elements() const { return num_elements_; } const index* index_bases() const { return index_base_list_.data(); } template
const element& operator()(IndexList indices) const { boost::function_requires< detail::multi_array::CollectionConcept
>(); return super_type::access_element(boost::type
(), indices,origin(), shape(),strides(),index_bases()); } // Only allow const element access const_reference operator[](index idx) const { return super_type::access(boost::type
(), idx,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(), origin()); } 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()); } template
bool operator==(const const_multi_array_view
& rhs) const { if(std::equal(extent_list_.begin(), extent_list_.end(), rhs.extent_list_.begin())) return std::equal(begin(),end(),rhs.begin()); else return false; } template
bool operator<(const const_multi_array_view
& rhs) const { return std::lexicographical_compare(begin(),end(),rhs.begin(),rhs.end()); } template
bool operator!=(const const_multi_array_view
& rhs) const { return !(*this == rhs); } template
bool operator>(const const_multi_array_view
& rhs) const { return rhs < *this; } template
bool operator<=(const const_multi_array_view
& rhs) const { return !(*this > rhs); } template
bool operator>=(const const_multi_array_view
& rhs) const { return !(*this < rhs); } #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS protected: template
friend class multi_array_impl_base; template
friend class const_multi_array_view; #else public: // should be protected #endif // This constructor is used by multi_array_impl_base::generate_array_view // to create strides template
explicit const_multi_array_view(TPtr base, const ExtentList& extents, const boost::array
& strides): base_(base), origin_offset_(0) { index_base_list_.assign(0); // Get the extents and strides boost::detail::multi_array:: copy_n(extents.begin(),NumDims,extent_list_.begin()); boost::detail::multi_array:: copy_n(strides.begin(),NumDims,stride_list_.begin()); // Calculate the array size num_elements_ = std::accumulate(extent_list_.begin(),extent_list_.end(), size_type(1),std::multiplies
()); } typedef boost::array
size_list; typedef boost::array
index_list; TPtr base_; index origin_offset_; size_type num_elements_; size_list extent_list_; index_list stride_list_; index_list index_base_list_; private: // const_multi_array_view cannot be assigned to (no deep copies!) const_multi_array_view& operator=(const const_multi_array_view& other); }; template
class multi_array_view : public const_multi_array_view
{ typedef const_multi_array_view
super_type; public: typedef typename super_type::value_type value_type; typedef typename super_type::reference reference; 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; 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; }; // Assignment from other ConstMultiArray types. template
multi_array_view& operator=(const ConstMultiArray& other) { function_requires< boost::detail::multi_array:: ConstMultiArrayConcept
>(); // 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; } multi_array_view& operator=(const multi_array_view& 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; } element* origin() { return this->base_+this->origin_offset_; } 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()); } reference operator[](index idx) { return super_type::access(boost::type
(), idx,origin(), 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()); } 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()); } reverse_iterator rbegin() { return reverse_iterator(end()); } reverse_iterator rend() { return reverse_iterator(begin()); } // Using declarations don't seem to work for g++ // These are the proxies to work around this. const element* origin() const { return super_type::origin(); } 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 multi_array_impl_base; #else public: // should be private #endif // constructor used by multi_array_impl_base::generate_array_view to // generate array views template
explicit multi_array_view(T* base, const ExtentList& extents, const boost::array
& strides) : super_type(base,extents,strides) { } }; } // namespace multi_array } // namespace detail // // traits classes to get array_view types // template
class array_view_gen { typedef typename Array::element element; public: typedef boost::detail::multi_array::multi_array_view
type; }; template
class const_array_view_gen { typedef typename Array::element element; public: typedef boost::detail::multi_array::const_multi_array_view
type; }; } // namespace boost #endif // BOOST_MULTI_ARRAY_VIEW_RG071301_HPP
view.hpp
Dirección de la página
Dirección del archivo
Anterior
15/15 Siguiente
Descargar
( 14 KB )
Comments
Total ratings:
0
Average rating:
No clasificado
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.