Difference between revisions of "cpp/container/vector/front"
From cppreference.com
m (r2.7.3) (Robot: Adding it:cpp/container/vector/front, ja:cpp/container/vector/front, ru:cpp/container/vector/front) |
m (Add link to edit the included template) |
||
| Line 1: | Line 1: | ||
| − | {{cpp/container/front|vector}} | + | {{page template|cpp/container/front|vector}} |
[[it:cpp/container/vector/front]] | [[it:cpp/container/vector/front]] | ||
[[ja:cpp/container/vector/front]] | [[ja:cpp/container/vector/front]] | ||
[[ru:cpp/container/vector/front]] | [[ru:cpp/container/vector/front]] | ||
Revision as of 07:27, 14 October 2012
| reference front(); |
(1) | (constexpr since C++20) |
| const_reference front() const; |
(2) | (constexpr since C++20) |
Returns a reference to the first element in the container.
Calling front on an empty container causes undefined behavior.
Contents |
Parameters
(none)
Return value
Reference to the first element.
Complexity
Constant.
Notes
For a container c, the expression c.front() is equivalent to *c.begin().
Example
The following code uses front to display the first element of a std::vector<char>:
Run this code
#include <cassert> #include <vector> int main() { std::vector<char> letters{'a', 'b', 'c', 'd'}; assert(letters.front() == 'a'); }
See also
| access the last element (public member function) | |
| (C++11) |
returns a reverse iterator to the end (public member function) |
| (C++11) |
returns an iterator to the beginning (public member function) |
| direct access to the underlying contiguous storage (public member function) |
