| CARVIEW |
Select Language
HTTP/1.1 301 Moved Permanently
Server: nginx
Date: Sat, 19 Jul 2025 10:35:14 GMT
Content-Type: text/html; charset=UTF-8
Transfer-Encoding: chunked
Connection: keep-alive
Location: /reference/array/array/data/
HTTP/1.1 200 OK
Server: nginx
Date: Sat, 19 Jul 2025 10:35:14 GMT
Content-Type: text/html; charset=utf-8
Transfer-Encoding: chunked
Connection: keep-alive
ETag: W/"7613-GzzkrpscPozIdTW3CPzk8el/ei0"
Content-Encoding: gzip
Returns a pointer to the first element in the array object.
Because elements in the array are stored in contiguous storage locations, the pointer retrieved can be offset to access any element in the array.
If the array object is const-qualified, the function returns a pointer to
Member type value_type is the type of the elements in the container, defined in array as an alias of its first template parameter (T).
Output:
Reference
C library:
- <cassert> (assert.h)
- <cctype> (ctype.h)
- <cerrno> (errno.h)
-
<cfenv> (fenv.h)C++11
- <cfloat> (float.h)
-
<cinttypes> (inttypes.h)C++11
- <ciso646> (iso646.h)
- <climits> (limits.h)
- <clocale> (locale.h)
- <cmath> (math.h)
- <csetjmp> (setjmp.h)
- <csignal> (signal.h)
- <cstdarg> (stdarg.h)
-
<cstdbool> (stdbool.h)C++11
- <cstddef> (stddef.h)
-
<cstdint> (stdint.h)C++11
- <cstdio> (stdio.h)
- <cstdlib> (stdlib.h)
- <cstring> (string.h)
-
<ctgmath> (tgmath.h)C++11
- <ctime> (time.h)
-
<cuchar> (uchar.h)C++11
- <cwchar> (wchar.h)
- <cwctype> (wctype.h)
Containers:
-
<array>C++11
- <deque>
-
<forward_list>C++11
- <list>
- <map>
- <queue>
- <set>
- <stack>
-
<unordered_map>C++11
-
<unordered_set>C++11
- <vector>
-
Input/Output:
Multi-threading:
-
<atomic>C++11
-
<condition_variable>C++11
-
<future>C++11
-
<mutex>C++11
-
<thread>C++11
-
Other:
- <algorithm>
- <bitset>
-
<chrono>C++11
-
<codecvt>C++11
- <complex>
- <exception>
- <functional>
-
<initializer_list>C++11
- <iterator>
- <limits>
- <locale>
- <memory>
- <new>
- <numeric>
-
<random>C++11
-
<ratio>C++11
-
<regex>C++11
- <stdexcept>
- <string>
-
<system_error>C++11
-
<tuple>C++11
-
<type_traits>C++11
-
<typeindex>C++11
- <typeinfo>
- <utility>
- <valarray>
array
-
array::arrayC++11
member functions
-
array::atC++11
-
array::backC++11
-
array::beginC++11
-
array::cbeginC++11
-
array::cendC++11
-
array::crbeginC++11
-
array::crendC++11
-
array::dataC++11
-
array::emptyC++11
-
array::endC++11
-
array::fillC++11
-
array::frontC++11
-
array::max_sizeC++11
-
array::operator[]C++11
-
array::rbeginC++11
-
array::rendC++11
-
array::sizeC++11
-
array::swapC++11
-
non-member overloads
-
get (array)C++11
-
relational operators (array)C++11
-
non-member specializations
-
tuple_element<array>C++11
-
tuple_size<array>C++11
-
public member function
<array>
std::array::data
value_type* data() noexcept;const value_type* data() const noexcept;
Get pointer to data
Because elements in the array are stored in contiguous storage locations, the pointer retrieved can be offset to access any element in the array.
Parameters
noneReturn Value
Pointer to the data contained by the array object.If the array object is const-qualified, the function returns a pointer to
const value_type. Otherwise, it returns a pointer to value_type.Member type value_type is the type of the elements in the container, defined in array as an alias of its first template parameter (T).
Example
|
|
Output:
Test string |
Complexity
Constant.Iterator validity
No changes.Data races
No contained elements are directly accessed by the call, but the pointer returned can be used to access or modify elements. Concurrently accessing or modifying different elements is safe.Exception safety
No-throw guarantee: this member function never throws exceptions.See also
- array::begin
- Return iterator to beginning (public member function)
- array::front
- Access first element (public member function)
- array::operator[]
- Access element (public member function)
- array::fill
- Fill array with value (public member function)
Home page | Privacy policy
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us