📄 fixed_array.hpp
字号:
* \ingroup group__library__containers
*
* \param T The value type
* \param A The allocator type
* \param P The construction policy type
*/
template< ss_typename_param_k T
#ifdef STLSOFT_CF_TEMPLATE_CLASS_DEFAULT_CLASS_ARGUMENT_SUPPORT
, ss_typename_param_k A = ss_typename_type_def_k allocator_selector<T>::allocator_type
, ss_typename_param_k P = do_construction<T>
, ss_bool_t R = true
#else /* ? STLSOFT_CF_TEMPLATE_CLASS_DEFAULT_CLASS_ARGUMENT_SUPPORT */
, ss_typename_param_k A
, ss_typename_param_k P
, ss_bool_t R
#endif /* STLSOFT_CF_TEMPLATE_CLASS_DEFAULT_CLASS_ARGUMENT_SUPPORT */
>
// class fixed_array_2d
class fixed_array_2d
: protected A
, public stl_collection_tag
{
public:
typedef fixed_array_2d<T, A, P, R> class_type;
typedef fixed_array_1d<T, A, P, false> dimension_element_type;
typedef A allocator_type;
typedef T value_type;
typedef value_type &reference;
typedef value_type const &const_reference;
typedef value_type *pointer;
typedef value_type const *const_pointer;
typedef ss_size_t size_type;
typedef ss_size_t index_type;
typedef ss_ptrdiff_t difference_type;
typedef
#if !defined(STLSOFT_COMPILER_IS_BORLAND)
ss_typename_type_k
#endif /* compiler */
pointer_iterator < value_type
, pointer
, reference
>::type iterator;
typedef
#if !defined(STLSOFT_COMPILER_IS_BORLAND)
ss_typename_type_k
#endif /* compiler */
pointer_iterator < value_type const
, const_pointer
, const_reference
>::type const_iterator;
#if defined(STLSOFT_CF_BIDIRECTIONAL_ITERATOR_SUPPORT)
typedef reverse_iterator_base < iterator
, value_type
, reference
, pointer
, difference_type
> reverse_iterator;
typedef const_reverse_iterator_base < const_iterator
, value_type const
, const_reference
, const_pointer
, difference_type
> const_reverse_iterator;
#endif /* STLSOFT_CF_BIDIRECTIONAL_ITERATOR_SUPPORT */
// Construction
private:
fixed_array_2d(T *data, index_type d0, index_type d1);
public:
fixed_array_2d(index_type d0, index_type d1);
fixed_array_2d(index_type d0, index_type d1, value_type const& t);
fixed_array_2d(class_type const& rhs);
~fixed_array_2d() stlsoft_throw_0();
// Access
public:
reference at(index_type i0, index_type i1);
const_reference at(index_type i0, index_type i1) const;
reference at_unchecked(index_type i0, index_type i1);
const_reference at_unchecked(index_type i0, index_type i1) const;
#ifndef STLSOFT_FIXED_ARRAY_NO_FUNCTION_OP
reference operator ()(index_type i0, index_type i1);
const_reference operator ()(index_type i0, index_type i1) const;
#endif /* !STLSOFT_FIXED_ARRAY_NO_FUNCTION_OP */
dimension_element_type at(index_type i0);
const dimension_element_type at(index_type i0) const;
dimension_element_type at_unchecked(index_type i0);
const dimension_element_type at_unchecked(index_type i0) const;
dimension_element_type operator [](index_type i0);
const dimension_element_type operator [](index_type i0) const;
/// A reference to the first element in the array
reference front();
reference back();
const_reference front() const;
const_reference back() const;
// State
public:
index_type dimension0() const;
index_type dimension1() const;
index_type size() const;
ss_bool_t empty() const;
static size_type max_size();
// Iteration
public:
iterator begin();
iterator end();
const_iterator begin() const;
const_iterator end() const;
#if defined(STLSOFT_CF_BIDIRECTIONAL_ITERATOR_SUPPORT)
reverse_iterator rbegin();
reverse_iterator rend();
const_reverse_iterator rbegin() const;
const_reverse_iterator rend() const;
#endif /* STLSOFT_CF_BIDIRECTIONAL_ITERATOR_SUPPORT */
// Access
public:
value_type const *data() const;
// Implementation
private:
pointer allocate_(size_type n);
void deallocate_(pointer p, size_type n);
pointer data_();
index_type calc_index_(index_type i0, index_type i1) const;
void range_check_(index_type i0, index_type i1) const stlsoft_throw_1(stlsoft_ns_qual_std(out_of_range) );
void range_check_(index_type i0) const stlsoft_throw_1(stlsoft_ns_qual_std(out_of_range) );
// Members
private:
T * const m_data;
const index_type m_d0;
const index_type m_d1;
const size_type m_size;
friend class fixed_array_3d<T, A, P, true>;
friend class fixed_array_3d<T, A, P, false>;
// Not to be implemented
private:
class_type const& operator =(class_type const& rhs);
};
/** \brief 3 dimensional fixed array
*
* \ingroup group__library__containers
*
* \param T The value type
* \param A The allocator type
* \param P The construction policy type
*/
template< ss_typename_param_k T
#ifdef STLSOFT_CF_TEMPLATE_CLASS_DEFAULT_CLASS_ARGUMENT_SUPPORT
, ss_typename_param_k A = ss_typename_type_def_k allocator_selector<T>::allocator_type
, ss_typename_param_k P = do_construction<T>
, ss_bool_t R = true
#else /* ? STLSOFT_CF_TEMPLATE_CLASS_DEFAULT_CLASS_ARGUMENT_SUPPORT */
, ss_typename_param_k A
, ss_typename_param_k P
, ss_bool_t R
#endif /* STLSOFT_CF_TEMPLATE_CLASS_DEFAULT_CLASS_ARGUMENT_SUPPORT */
>
// class fixed_array_3d
class fixed_array_3d
: protected A
, public stl_collection_tag
{
public:
typedef fixed_array_3d<T, A, P, R> class_type;
typedef fixed_array_2d<T, A, P, false> dimension_element_type;
typedef A allocator_type;
typedef T value_type;
typedef value_type &reference;
typedef value_type const &const_reference;
typedef value_type *pointer;
typedef value_type const *const_pointer;
typedef ss_size_t size_type;
typedef ss_size_t index_type;
typedef ss_ptrdiff_t difference_type;
typedef
#if !defined(STLSOFT_COMPILER_IS_BORLAND)
ss_typename_type_k
#endif /* compiler */
pointer_iterator < value_type
, pointer
, reference
>::type iterator;
typedef
#if !defined(STLSOFT_COMPILER_IS_BORLAND)
ss_typename_type_k
#endif /* compiler */
pointer_iterator < value_type const
, const_pointer
, const_reference
>::type const_iterator;
#if defined(STLSOFT_CF_BIDIRECTIONAL_ITERATOR_SUPPORT)
typedef reverse_iterator_base < iterator
, value_type
, reference
, pointer
, difference_type
> reverse_iterator;
typedef const_reverse_iterator_base < const_iterator
, value_type const
, const_reference
, const_pointer
, difference_type
> const_reverse_iterator;
#endif /* STLSOFT_CF_BIDIRECTIONAL_ITERATOR_SUPPORT */
// Construction
private:
fixed_array_3d(pointer data, index_type d0, index_type d1, index_type d2);
public:
fixed_array_3d(index_type d0, index_type d1, index_type d2);
fixed_array_3d(index_type d0, index_type d1, index_type d2, value_type const& t);
fixed_array_3d(class_type const& rhs);
~fixed_array_3d() stlsoft_throw_0();
// Access
public:
reference at(index_type i0, index_type i1, index_type i2);
const_reference at(index_type i0, index_type i1, index_type i3) const;
reference at_unchecked(index_type i0, index_type i1, index_type i2);
const_reference at_unchecked(index_type i0, index_type i1, index_type i2) const;
#ifndef STLSOFT_FIXED_ARRAY_NO_FUNCTION_OP
reference operator ()(index_type i0, index_type i1, index_type i2);
const_reference operator ()(index_type i0, index_type i1, index_type i2) const;
#endif /* !STLSOFT_FIXED_ARRAY_NO_FUNCTION_OP */
dimension_element_type at(index_type i0);
const dimension_element_type at(index_type i0) const;
dimension_element_type at_unchecked(index_type i0);
const dimension_element_type at_unchecked(index_type i0) const;
dimension_element_type operator [](index_type i0);
const dimension_element_type operator [](index_type i0) const;
reference front();
reference back();
const_reference front() const;
const_reference back() const;
// State
public:
index_type dimension0() const;
index_type dimension1() const;
index_type dimension2() const;
index_type size() const;
ss_bool_t empty() const;
static size_type max_size();
// Iteration
public:
iterator begin();
iterator end();
const_iterator begin() const;
const_iterator end() const;
#if defined(STLSOFT_CF_BIDIRECTIONAL_ITERATOR_SUPPORT)
reverse_iterator rbegin();
reverse_iterator rend();
const_reverse_iterator rbegin() const;
const_reverse_iterator rend() const;
#endif /* STLSOFT_CF_BIDIRECTIONAL_ITERATOR_SUPPORT */
// Access
public:
value_type const *data() const;
// Implementation
private:
pointer allocate_(size_type n);
void deallocate_(pointer p, size_type n);
pointer data_();
index_type calc_index_(index_type i0, index_type i1, index_type i2) const;
void range_check_(index_type i0, index_type i1, index_type i2) const stlsoft_throw_1(stlsoft_ns_qual_std(out_of_range) );
void range_check_(index_type i0) const stlsoft_throw_1(stlsoft_ns_qual_std(out_of_range) );
// Members
private:
T * const m_data;
const index_type m_d0;
const index_type m_d1;
const index_type m_d2;
friend class fixed_array_4d<T, A, P, true>;
friend class fixed_array_4d<T, A, P, false>;
// Not to be implemented
private:
class_type const& operator =(class_type const& rhs);
};
/** \brief 4 dimensional fixed array
*
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -