std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>:: begin, std::flat_map<Key,T,Compare,KeyContainer,MappedContainer>:: cbegin
From cppreference.com
C++
Containers library
Sequence | ||||
(C++11)
|
||||
(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 begin
(
)
noexcept
;
|
(1) | (since C++23) |
const_iterator begin
(
)
const
noexcept
;
|
(2) | (since C++23) |
const_iterator cbegin
(
)
const
noexcept
;
|
(3) | (since C++23) |
Returns an iterator to the first element of the
flat_map
.
If the
flat_map
is empty, the returned iterator will be equal to
end()
.
Parameters
(none)
Return value
Iterator to the first 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 end
(public member function) |
|
(C++11)
(C++14)
|
returns an iterator to the beginning of a container or array
(function template) |
Retrieved from "
https://en.cppreference.com/mwiki/index.php?title=cpp/container/flat_map/begin&oldid=168820
"