std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>:: end, std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>:: cend
From cppreference.net
C++
Containers library
|
(C++17)
|
||||
| Sequence | ||||
|
(C++11)
|
||||
|
(C++26)
|
||||
|
(C++26)
|
||||
|
(C++11)
|
||||
| Associative | ||||
| Unordered associative | ||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
| Adaptors | ||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
| Views | ||||
|
(C++20)
|
||||
|
(C++23)
|
||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::flat_map
| Member types | ||||
| Member functions | ||||
| Non-member functions | ||||
| Helper classes | ||||
| Tags | ||||
| Deduction guides | ||||
|
iterator end
(
)
noexcept
;
|
(1) |
(since C++23)
(constexpr since C++26) |
|
const_iterator end
(
)
const
noexcept
;
|
(2) |
(since C++23)
(constexpr since C++26) |
|
const_iterator cend
(
)
const
noexcept
;
|
(3) |
(since C++23)
(constexpr since C++26) |
Returns an iterator past the last element of * this .
This returned iterator only acts as a sentinel. It is not guaranteed to be dereferenceable .
Contents |
Return value
Iterator past the last element.
Complexity
Constant.
Example
Run this code
#include <iostream> #include <flat_map> int main() { std::flat_map<int, double> map{{4, 4.13}, {9, 9.24}, {1, 1.09}}; for (auto it = map.cbegin(); it != map.cend(); ++it) std::cout << '[' << it->first << "] = " << it->second << '\n'; // Unlike std::map's bidirectional iterators, the std::flat_map iterators // are random-access, so they can be used with the operator[]: auto it = map.cbegin(); assert(it[0] == map[1]); assert(it[1] == map[4]); assert(it[2] == map[9]); }
Output:
[1] = 1.09 [4] = 4.13 [9] = 9.24
See also
|
returns an iterator to the beginning
(public member function) |
|
|
(C++11)
(C++14)
|
returns an iterator to the end of a container or array
(function template) |