Bounded Array Storage
Bounded Array StorageThe templated class bounded_array<T, N, ALLOC> implements a bounded storage array. The bounded array is similar to a C++ array type in that its maximum size is bounded by N and is allocated on the stack instead of the heap. Similarly a bounded_array requires no secondary storage and ALLOC is only used to specifysize_type and difference_type.
+
The templated class bounded_array<T, N, ALLOC> implements a bounded storage array. The bounded array is similar to a C++ array type in that its maximum size is bounded by N and is allocated on the stack instead of the heap. Similarly a bounded_array requires no secondary storage and ALLOC is only used to specify size_type and difference_type.
When resized bounded_array uses the same storage with the same bound!. It is therefore efficient to resize a bounded_array
When resized bounded_array never reallocated the storage. It is therefore always efficient to resize a bounded_array but the size bound N must not be exceeded.
#include <boost/numeric/ublas/storage.hpp>
@@ -55,22 +55,19 @@ int main () {
Model of
-Random Access Container.
+
Type requirements
-None, except for those imposed by the requirements of Random Access Container.
+None, except for those imposed by the requirements of Storage.
Public base classes
None.
Members
-Editor's notes:
value_typepointervalue_type*const_pointervalue_type*referencevalue_type&const_referenceconst value_type&size_typeAlloc::size_typedifference_typeAlloc::difference_typeiteratorpointerconst_iteratorconst_pointerrevere_iteratorstd::reverse_iterator<iterator>const_revere_iteratorstd::reverse_iterator<const_iterator>pointervalue_type*const_pointerconst value_type*referencevalue_type&const_referenceconst value_type&size_typeAlloc::size_typedifference_typeAlloc::difference_typeiteratorpointerconst_iteratorconst_pointerrevere_iteratorstd::reverse_iterator<iterator>const_revere_iteratorstd::reverse_iterator<const_iterator>bounded_array ()bounded_array that holds at most ZERO elements.unbounded_array that holds zero elements.explicit bounded_array (size_type size, const T& = init)bounded_array that holds at most size elements. All the elements are constructed from the init value.bounded_array (size_type size)bounded_array that holds at most size elements. All the elements are default constructed.bounded_array that holds size elements. All the elements are default constructed.bounded_array (size_type size, const T& init)bounded_array that holds at most size elements. All the elements are copy-constructed from init.bounded_array (size_type size, const T& init)bounded_array that holds size elements. All the elements are constructed from the init value.bounded_array (const bounded_array &c)void resize (size_type size)bounded_array to hold at most size elements.bounded_array to hold size elements.void resize (size_type size, const T& t)void resize (size_type size, const T& t)bounded_array to hold at most size elements.bounded_array to hold size elements.size_type size () const
Unbounded Array StorageThe templated class unbounded_array<T, ALLOC> implements a unbounded storage array using an allocator.
The unbounded array is similar to a std::vector in that in can grow in size beyond any fixed bound.
@@ -54,21 +54,17 @@ int main () {
None, except for those imposed by the requirements of Random -Access Container.
+None, except for those imposed by the requirements of Storage.
None.
value_typepointervalue_type*const_pointervalue_type*referencevalue_type&const_referenceconst value_type&size_typeAlloc::size_typedifference_typeAlloc::difference_typeiteratorpointerconst_iteratorconst_pointerrevere_iteratorstd::reverse_iterator<iterator>const_revere_iteratorstd::reverse_iterator<const_iterator>allocator_typepointervalue_type*const_pointerconst value_type*referencevalue_type&const_referenceconst value_type&size_typeAlloc::size_typedifference_typeAlloc::difference_typeiteratorpointerconst_iteratorconst_pointerrevere_iteratorstd::reverse_iterator<iterator>const_revere_iteratorstd::reverse_iterator<const_iterator>explicit unbounded_array (ALLOC &a = ALLOC())unbounded_array that holds at most zero elements, using a specified allocator.unbounded_array that holds zero elements, using a specified allocator.explicit unbounded_array (size_type size, ALLOC &a = ALLOC())unbounded_array that holds at most size elements, using a specified allocator. All the elements are constructed without an initializer. unbounded_array that holds size elements, using a specified allocator. All the elements are default constructed.explicit unbounded_array (size_type size, const T& init, ALLOC& a = ALLOC())unbounded_array (size_type size, const T& init, ALLOC& a = ALLOC())unbounded_array that holds at most size elements, using a specified allocator. All the elements are constructed from the init value.unbounded_array that holds size elements, using a specified allocator. All the elements are constructed from the init value.unbounded_array (const unbounded_array &a)unbounded_array itself.void resize (size_type n , bool preserve = true)void resize (size_type n)unbounded_array to hold at most n elements. When preserve == false the elements values after resize are undefined.unbounded_array to hold n elements. Values are uninitialised.void resize(size_type n, const T& t)void resize(size_type n, const T& t)unbounded_array to hold at most n elements.
+unbounded_array to hold n elements. Values are copies of t
size_type size () const