/usr/include/boost/multi_array
NameSizeModeActions
algorithm.hpp31650644editdlrm
base.hpp169730644editdlrm
collection_concept.hpp6900644editdlrm
concept_checks.hpp70980644editdlrm
copy_array.hpp19570644editdlrm
extent_gen.hpp18310644editdlrm
extent_range.hpp12490644editdlrm
index_gen.hpp20510644editdlrm
index_range.hpp46470644editdlrm
iterator.hpp48240644editdlrm
multi_array_ref.hpp197220644editdlrm
range_list.hpp16670644editdlrm
storage_order.hpp39700644editdlrm
subarray.hpp120830644editdlrm
types.hpp8370644editdlrm
view.hpp142540644editdlrm
Edit: /usr/include/boost/multi_array/extent_range.hpp (1249B)
// 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_EXTENT_RANGE_HPP #define BOOST_MULTI_ARRAY_EXTENT_RANGE_HPP #include namespace boost { namespace detail { namespace multi_array { template class extent_range : private std::pair { typedef std::pair super_type; public: typedef Extent index; typedef SizeType size_type; extent_range(index start, index finish) : super_type(start,finish) { } extent_range(index finish) : super_type(0,finish) { } extent_range() : super_type(0,0) { } index start() const { return super_type::first; } index finish() const { return super_type::second; } size_type size() const { return super_type::second - super_type::first; } }; } // namespace multi_array } // namespace detail } // namespace boost #endif