std::vector::data

From Cppreference

C++ Standard Library
Language 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)
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::vector
Member functions vector::vector vector::~vector vector::operator= vector::assign vector::get_allocator Element access vector::at vector::operator[] vector::front vector::back vector::data Iterators vector::begin vector::cbegin (C++11) vector::end vector::cend (C++11) vector::rbegin vector::crbegin (C++11) vector::rend vector::crend (C++11) Capacity vector::empty vector::size vector::max_size vector::reserve vector::capacity vector::shrink_to_fit (C++11) Modifiers vector::clear vector::insert vector::emplace (C++11) vector::erase vector::push_back vector::emplace_back (C++11) vector::pop_back vector::resize vector::swap

T* data();
const T* data() const;

Returns pointer to the underlying array serving as element storage. Specifically the pointer is such that range [data(); data() + size()) is a valid even when empty() returns true.

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

(none)

[edit] Return value

Pointer to the underlying element storage.

[edit] Complexity

Constant.

[edit] See also

front	access the first element (public member function)
back	access the last element (public member function)