std::experimental::dynarray

 

C++

Language

Standard library headers

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

Technical Specifications

 

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

std::dynarray

Member functions

dynarray::dynarray

dynarray::~dynarray

Element access

dynarray::at

dynarray::operator[]

dynarray::front

dynarray::back

dynarray::data

Iterators

dynarray::begindynarray::cbegin

dynarray::enddynarray::cend

dynarray::rbegindynarray::crbegin

dynarray::renddynarray::crend

Capacity

dynarray::empty

dynarray::size

dynarray::max_size

Modifiers

dynarray::fill

 

Defined in header <experimental/dynarray>
template<     class T > class dynarray;

std::experimental::dynarray is a sequence container that encapsulates arrays with a size that is fixed at construction and does not change throughout the lifetime of the object.

The elements are stored contiguously, which means that elements can be accessed not only through iterators, but also using offsets on regular pointers to elements. This means that a pointer to an element of a dynarray may be passed to any function that expects a pointer to an element of an array.

There is a special case for a zero-length array (the number of elements was specified as zero during construction). In that case, array.begin() == array.end(), which is some unique value. The effect of calling front() or back() on a zero-sized dynarray is undefined.

Member types

Member type	Definition
value_type	T
size_type	std::size_t
difference_type	std::ptrdiff_t
reference	value_type&
const_reference	const value_type&
pointer	value_type*
const_pointer	const value_type*
iterator	RandomAccessIterator
const_iterator	Constant random access iterator
reverse_iterator	std::reverse_iterator<iterator>
const_reverse_iterator	std::reverse_iterator<const_iterator>

Member functions

(constructor)	constructs the dynarray (public member function)
(destructor)	destructs the dynarray (public member function)
operator= [deleted]	the container is neither copy-, nor move-assignable (public member function)
Element access
at	access specified element with bounds checking (public member function)
operator[]	access specified element (public member function)
front	access the first element (public member function)
back	access the last element (public member function)
data	direct access to the underlying array (public member function)
Iterators
begin cbegin	returns an iterator to the beginning (public member function)
end cend	returns an iterator to the end (public member function)
rbegin crbegin	returns a reverse iterator to the beginning (public member function)
rend crend	returns a reverse iterator to the end (public member function)
Capacity
empty	checks whether the container is empty (public member function)
size	returns the number of elements (public member function)
max_size	returns the maximum possible number of elements (public member function)
Modifiers
fill	fill the container with specified value (public member function)

Non-member functions

operator==operator!=operator<operator<=operator>operator>=

lexicographically compares the values in the dynarray (function template)

Helper classes

std::uses_allocator<std::dynarray> (C++11)

specializes the std::uses_allocator type trait (function template)