Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
std::map<Key,T,Compare,Allocator>::count
From cppreference.com
| size_type count( const Key& key ) const; |
(1) | |
| template< class K > size_type count( const K& x ) const; |
(2) | (since C++14) |
Returns the number of elements with key that compares equivalent to the specified argument, which is either 1 or 0 since this container does not allow duplicates.
1) Returns the number of elements with key
key.2) Returns the number of elements with key that compares equivalent to the value
x. This overload only participates in overload resolution if the qualified-id Compare::is_transparent is valid and denotes a type. They allow calling this function without constructing an instance of Key.Contents |
[edit] Parameters
| key | - | key value of the elements to count |
| x | - | alternative value to compare to the keys |
[edit] Return value
Number of elements with key that compares equivalent to key or x, which is either 1 or 0 for (1).
[edit] Complexity
Logarithmic in the size of the container.
[edit] Example
[edit] See also
| finds element with specific key (public member function) | |
| returns range of elements matching a specific key (public member function) |
