Namespaces
Variants
Views
Actions

Difference between revisions of "Template:cpp/container/equal range unord"

From cppreference.com
m
m (fmt)
 
(16 intermediate revisions by 2 users not shown)
Line 1: Line 1:
−
{{cpp/container/{{{1|}}}/title | equal_range}}
+
{{cpp/container/{{{1|}}}/title|equal_range}}
 
{{cpp/container/{{{1|}}}/navbar}}
 
{{cpp/container/{{{1|}}}/navbar}}
 
{{dcl begin}}
 
{{dcl begin}}
−
{{dcl | num=1 | since=c++11 |
+
{{dcl|num=1|since=c++11|
−
std::pair<iterator,iterator> equal_range( const Key& key );
+
std::pair<iterator, iterator> equal_range( const Key& key );
 
}}
 
}}
−
{{dcl | num=2 | since=c++11 |
+
{{dcl|num=2|since=c++11|
−
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const;
+
std::pair<const_iterator, const_iterator> equal_range( const Key& key ) const;
 
}}
 
}}
−
{{dcl | num=3 | since=c++20 |
+
{{dcl|num=3|since=c++20|
 
template< class K >
 
template< class K >
−
std::pair<iterator,iterator> equal_range( const K& x );
+
std::pair<iterator, iterator> equal_range( const K& x );
 
}}
 
}}
−
{{dcl | num=4 | since=c++20 |
+
{{dcl|num=4|since=c++20|
 
template< class K >
 
template< class K >
−
std::pair<const_iterator,const_iterator> equal_range( const K& x ) const;
+
std::pair<const_iterator, const_iterator> equal_range( const K& x ) const;
 
}}
 
}}
 
{{dcl end}}
 
{{dcl end}}
  
−
@1,2@ Returns a range containing all elements with key {{tt|key}} in the container. The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.
+
@1,2@ Returns a range containing all elements with key {{c|key}} in the container. The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.
−
@3,4@ Returns a range containing all elements in the container with key equivalent to {{tt|x}}. {{cpp/container/unordered_heterogeneous_lookup}}
+
@3,4@ Returns a range containing all elements in the container with key equivalent to {{c|x}}. {{cpp/container/unordered_heterogeneous_lookup}}
  
 
===Parameters===
 
===Parameters===
 
{{par begin}}
 
{{par begin}}
−
{{par | key | key value to compare the elements to}}
+
{{par|key|key value to compare the elements to}}
−
{{par | x | a value of any type that can be transparently compared with a key}}
+
{{par|x|a value of any type that can be transparently compared with a key}}
−
{{par end}}  
+
{{par end}}
  
 
===Return value===
 
===Return value===
Line 31: Line 31:
  
 
===Complexity===
 
===Complexity===
−
Average case linear in the number of elements with the key {{tt|key}}, worst case linear in the size of the container.
+
Average case linear in the number of elements with the key {{c|key}}, worst case linear in the size of the container.
 +
 
 +
===Notes===
 +
{{feature test macro|__cpp_lib_generic_unordered_lookup|Heterogeneous comparison lookup in [[cpp/container#Unordered associative containers (since C++11)|unordered associative containers]], overloads {{v|3,4}}|value=201811L|std=C++20}}
  
 
===Example===
 
===Example===
−
{{cpp/container/if map| {{{1|}}} |
+
{{cpp/container/if map|{{{1|}}}|
−
{{example|code=
+
{{example
 +
|code=
 
#include <iostream>
 
#include <iostream>
 
#include <unordered_map>
 
#include <unordered_map>
 
   
 
   
 
int main()
 
int main()
−
{
+
{
−
     std::{{{1}}}<int,char> map = {{1,'a'},{1,'b'},{1,'d'},{2,'b'}};
+
     std::{{{1}}}<int,char> map = {{1, 'a'},{{cpp/container/if uniq|{{{1}}}||{1, 'b'},{1, 'd'},}}{2, 'b'}};
 
     auto range = map.equal_range(1);
 
     auto range = map.equal_range(1);
−
     for (auto it = range.first; it != range.second; ++it) {
+
     for (auto it = range.first; it != range.second; ++it)
 
         std::cout << it->first << ' ' << it->second << '\n';
 
         std::cout << it->first << ' ' << it->second << '\n';
−
    }
 
 
}
 
}
 
|output=
 
|output=
Line 54: Line 57:
 
}}
 
}}
 
}}
 
}}
−
|  
+
|<!--else unordered_*set-->
 +
{{cpp/container/if uniq|{{{1}}}|<!--unordered_set:-->
 
{{example
 
{{example
 
|code=
 
|code=
 
|output=
 
|output=
 +
}}
 +
|<!--unordered_multiset:-->
 +
{{example
 +
|Estimates the characters frequency for given string.
 +
|code=
 +
#include <iostream>
 +
#include <iterator>
 +
#include <string>
 +
#include <unordered_set>
 +
 +
int main()
 +
{
 +
    std::string sentence{"cppreference.com"};
 +
    std::cout << "The sentence: " << sentence << '\n';
 +
 +
    std::unordered_multiset<char> sequence;
 +
    for (char x : sentence)
 +
        sequence.insert(x);
 +
 +
    std::cout << "The sequence: { ";
 +
    for (char x : sequence)
 +
        std::cout << x << ' ';
 +
 +
    std::cout << "}\n" "Symbol:Frequency: ";
 +
    for (auto it = sequence.begin(); it != sequence.end();)
 +
    {
 +
        if (auto [first, last] = sequence.equal_range(*it); first != last)
 +
        {
 +
            std::cout << *first << ":" << std::distance(first, last) << "  ";
 +
            it = last;
 +
        }
 +
        else
 +
            ++it;
 +
    }
 +
}
 +
|p=true
 +
|output=
 +
The sentence: cppreference.com
 +
The sequence: { m o c c c p p r r e e e e f n . }
 +
Symbol:Frequency: m:1  o:1  c:3  p:2  r:2  e:4  f:1  n:1  .:1
 +
}}
 
}}
 
}}
 
}}
 
}}
Line 63: Line 108:
 
===See also===
 
===See also===
 
{{dsc begin}}
 
{{dsc begin}}
−
{{dsc inc | cpp/container/dsc find |{{{1|}}}}}
+
{{dsc inc|cpp/container/dsc find|{{{1|}}}}}
 +
{{dsc inc|cpp/container/dsc contains|{{{1|}}}}}
 +
{{dsc inc|cpp/container/dsc count|{{{1|}}}}}
 +
{{dsc inc|cpp/algorithm/dsc equal_range}}
 
{{dsc end}}
 
{{dsc end}}

Latest revision as of 05:21, 5 November 2023

 
C++
 
Containers library
 
std::pair<iterator, iterator> equal_range( const Key& key );
 (1) (since C++11)
std::pair<const_iterator, const_iterator> equal_range( const Key& key ) const;
 (2) (since C++11)
template< class K >
std::pair<iterator, iterator> equal_range( const K& x );
 (3) (since C++20)
template< class K >
std::pair<const_iterator, const_iterator> equal_range( const K& x ) const;
 (4) (since C++20)
1,2) Returns a range containing all elements with key key in the container. The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.
3,4) Returns a range containing all elements in the container with key equivalent to x. This overload participates in overload resolution only if Hash::is_transparent and KeyEqual::is_transparent are valid and each denotes a type. This assumes that such Hash is callable with both K and Key type, and that the KeyEqual is transparent, which, together, allows calling this function without constructing an instance of Key.

Contents

[edit] Parameters

key - key value to compare the elements to
x - a value of any type that can be transparently compared with a key

[edit] Return value

std::pair containing a pair of iterators defining the wanted range. If there are no such elements, past-the-end (see end()) iterators are returned as both elements of the pair.

[edit] Complexity

Average case linear in the number of elements with the key key, worst case linear in the size of the container.

[edit] Notes

Feature-test macro Value Std Feature
__cpp_lib_generic_unordered_lookup 201811L (C++20) Heterogeneous comparison lookup in unordered associative containers, overloads (3,4)

[edit] Example

Estimates the characters frequency for given string.

Run this code
#include <iostream>
#include <iterator>
#include <string>
#include <unordered_set>
 
int main()
{
    std::string sentence{"cppreference.com"};
    std::cout << "The sentence: " << sentence << '\n';
 
    std::unordered_multiset<char> sequence;
    for (char x : sentence)
        sequence.insert(x);
 
    std::cout << "The sequence: { ";
    for (char x : sequence)
        std::cout << x << ' ';
 
    std::cout << "}\n" "Symbol:Frequency: ";
    for (auto it = sequence.begin(); it != sequence.end();)
    {
        if (auto [first, last] = sequence.equal_range(*it); first != last)
        {
            std::cout << *first << ":" << std::distance(first, last) << "  ";
            it = last;
        }
        else
            ++it;
    }
}

Possible output: 

The sentence: cppreference.com
The sequence: { m o c c c p p r r e e e e f n . }
Symbol:Frequency: m:1  o:1  c:3  p:2  r:2  e:4  f:1  n:1  .:1

[edit] See also

 finds element with specific key
(public member function of std::{{{1}}}) [edit]
(C++20)
 checks if the container contains element with specific key
(public member function of std::{{{1}}}) [edit]
returns the number of elements matching specific key
(public member function of std::{{{1}}}) [edit]
returns range of elements matching a specific key
(function template) [edit]
Retrieved from "https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/equal_range_unord&oldid=162026"