std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>:: begin, std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>:: cbegin
From cppreference.com
<
cpp
|
container
|
flat multimap
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_multimap
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_multimap
.
If the
flat_multimap
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_multimap<int, int> map{{4, 13}, {9, 94}, {1, 19}, {4, 42}}; for (auto it = map.cbegin(); it != map.cend(); ++it) std::cout << '[' << it->first << "] = " << it->second << '\n'; // Unlike std::multimap's bidirectional iterators, the std::flat_multimap // iterators are random-access, so they can be used with the operator[]: auto it = map.cbegin(); assert(it[1] == 19); assert(it[4] == 13); assert(it[4] == 42); assert(it[9] == 94); }
Output:
[1] = 19 [4] = 13 [4] = 42 [9] = 94
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_multimap/begin&oldid=168821
"