public member function
<unordered_set>
std::unordered_set::cbegin container iterator (1)const_iterator cbegin() const noexcept;bucket iterator (2)
const_local_iterator cbegin ( size_type n ) const;
Return const_iterator to beginning
Returns a const_iterator pointing to the first element in the unordered_set container (1) or in one of its buckets (2).A const_iterator is an iterator that points to const content. This iterator can be increased and decreased (unless it is itself also const), but it cannot be used to modify the contents it points to.
Both const_iterator and const_local_iterator are member types. In the unordered_set class template, these are forward iterator types.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
// unordered_set::cbegin/cend example
#include <iostream>
#include <string>
#include <unordered_set>
int main ()
{
std::unordered_set<std::string> myset =
{"Mercury","Venus","Earth","Mars","Jupiter","Saturn","Uranus","Neptune"};
std::cout << "myset contains:";
for ( auto it = myset.cbegin(); it != myset.cend(); ++it )
std::cout << " " << *it; // cannot modify *it
std::cout << std::endl;
std::cout << "myset's buckets contain:\n";
for ( unsigned i = 0; i < myset.bucket_count(); ++i) {
std::cout << "bucket #" << i << " contains:";
for ( auto local_it = myset.cbegin(i); local_it!= myset.cend(i); ++local_it )
std::cout << " " << *local_it;
std::cout << std::endl;
}
return 0;
}
myset contains: Venus Jupiter Neptune Mercury Earth Uranus Saturn Mars myset's buckets contain: bucket #0 contains: bucket #1 contains: Venus bucket #2 contains: Jupiter bucket #3 contains: bucket #4 contains: Neptune Mercury bucket #5 contains: bucket #6 contains: Earth bucket #7 contains: Uranus Saturn bucket #8 contains: Mars bucket #9 contains: bucket #10 contains:
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4