std::array<T,N>::data

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Technical specifications

Symbols index

External libraries

 

Containers library

Sequence

array (C++11)

vector

vector<bool>

deque

forward_list (C++11)

list

Associative

set

multiset

map

multimap

Unordered associative

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

Adaptors

stack

queue

priority_queue

flat_set (C++23)

flat_multiset (C++23)

flat_map (C++23)

flat_multimap (C++23)

Views

span (C++20)

mdspan (C++23)

Iterator invalidation

Member function table

Non-member function table

 

std::array

Member types

Member functions

Element access

array::at

array::operator[]

array::front

array::back

array::data

Iterators

array::beginarray::cbegin

array::endarray::cend

array::rbeginarray::crbegin

array::rendarray::crend

Capacity

array::empty

array::size

array::max_size

Modifiers

array::fill

array::swap

Non-member functions

get

std::swap

to_array (C++20)

operator==operator!=operator<operator>operator<=operator>=operator<=> (until C++20)(until C++20)(until C++20)(until C++20)(until C++20)(C++20)

Helper classes

tuple_size

tuple_element

Deduction guides(C++17)

 

	(1)
T* data() noexcept;			(since C++11) (until C++17)
constexpr T* data() noexcept;			(since C++17)
		(2)
const T* data() const noexcept;				(since C++11) (until C++17)
constexpr const T* data() const noexcept;				(since C++17)

Returns pointer to the underlying array serving as element storage. The pointer is such that range [data(), data() + size()) is always a valid range, even if the container is empty (data() is not dereferenceable in that case).

Parameters

(none)

Return value

Pointer to the underlying element storage. For non-empty containers, the returned pointer compares equal to the address of the first element.

Complexity

Constant.

Notes

If size() is ​0​, data() may or may not return a null pointer.

Example

Run this code

#include <cstddef>
#include <iostream>
#include <span>
#include <array>
 
void pointer_func(const int* p, std::size_t size)
{
    std::cout << "data = ";
    for (std::size_t i = 0; i < size; ++i)
        std::cout << p[i] << ' ';
    std::cout << '\n';
}
 
void span_func(std::span<const int> data) // since C++20
{
    std::cout << "data = ";
    for (const int e : data)
        std::cout << e << ' ';
    std::cout << '\n';
}
 
int main()
{
    std::array<int, 4> container{1, 2, 3, 4};
 
    // Prefer container.data() over &container[0]
    pointer_func(container.data(), container.size());
 
    // std::span (C++20) is a safer alternative to separated pointer/size.
    span_func({container.data(), container.size()});
}

Output:

data = 1 2 3 4 
data = 1 2 3 4

See also

front (C++11)	access the first element (public member function)
back (C++11)	access the last element (public member function)
size (C++11)	returns the number of elements (public member function)
span (C++20)	a non-owning view over a contiguous sequence of objects (class template)
data (C++17)	obtains the pointer to the underlying array (function template)