Login Register

std::unordered_multimap::begin(int)

1	`local_iterator begin( size_type n );`

(since C++11)

1	`const_local_iterator begin( size_type n )` `const;`

(since C++11)

1	`const_local_iterator cbegin( size_type n )` `const;`

(since C++11)

Returns an iterator to the first element of the bucket with index pos.

Parameters

n

-

the index of the bucket to access

Return value

Iterator to the first element.

Complexity

Constant.

See also

end(int) cend(int)

returns an iterator to the end of the specified bucket
(public member function)

Links:

http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2

doc_CPP

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

std::unordered_multimap::begin iterator begin(); (since C++11) const_iterator begin() const; (since C++11) const_iterator cbegin() const; (since C++11) Returns

std::unordered_multimap::unordered_multimap (1) explicit unordered_multimap( size_type bucket_count = /*implementation-defined*/, const Hash& hash = Hash(),

std::unordered_multimap::end(int) local_iterator end( size_type n ); (since C++11) const_local_iterator end( size_type n ) const; (since C++11) const_local_iterator cend(

std::unordered_multimap Defined in header <unordered_map> template< class Key, class T, class Hash = std::hash<Key>, class KeyEqual =

operators (std::unordered_multimap) template< class Key, class T, class Hash, class KeyEqual, class Allocator > bool operator==( const unordered_multimap<Key,T,Hash,KeyEqual,A