Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/container/set/equal range"

From cppreference.com
< cpp‎ | container‎ | set
(subst:)
m (langlinks)
 
(3 intermediate revisions by one user not shown)
Line 1: Line 1:
{{cpp/container/set/title | equal_range}}
+
{{include page|cpp/container/equal_range_ord|set}}
{{cpp/container/set/navbar}}
+
{{dcl begin}}
+
{{dcl |num=1|
+
std::pair<iterator,iterator> equal_range( const Key& key );
+
}}
+
{{dcl |num=2|
+
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const;
+
}}
+
{{cpp/container/if ord | set
+
|{{dcl | num=3 | since=c++14 |
+
template< class K >
+
std::pair<iterator,iterator> equal_range( const K& x );
+
}}
+
{{dcl | num=4 | since=c++14 |
+
template< class K >
+
std::pair<const_iterator,const_iterator> equal_range( const K& x ) const;
+
}}
+
}}
+
{{dcl end}}
+
  
@1,2@ Returns a range containing all elements with key {{tt|key}} in the container. {{cpp/container/if ord|set
+
{{langlinks|de|es|fr|it|ja|pt|ru|zh}}
|The range is defined by two iterators, one pointing to the first element that is ''not less'' than {{tt|key}} and another pointing to the first element ''greater'' than {{tt|key}}. The first iterator may be alternatively obtained with {{lc|lower_bound()}}, the second - with {{lc|upper_bound()}}.
+
|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.
+
}}
+
 
+
{{cpp/container/if ord | set
+
|@3,4@ Same as {{v|1,2}}, but compares the keys to the value {{tt|x}}. These templates only participate in overload resolution if the type {{c|Compare::is_transparent}} exists. They allow calling this function without constructing an instance of {{tt|Key}}.
+
}}
+
 
+
===Parameters===
+
{{par begin}}
+
{{par | key | key value to compare the elements to}}
+
{{cpp/container/if assoc | set |
+
{{par | x | alternative value that can be compared to {{tt|Key}} }}
+
}}
+
{{par end}}
+
 
+
===Return value===
+
{{cpp/container/if ord|set
+
|{{lc|std::pair}} containing a pair of iterators defining the wanted range: the first pointing to the first element that is not ''less'' than {{tt|key}} and the second pointing to the first element ''greater'' than {{tt|key}}.
+
 
+
If there are no elements ''not less'' than {{tt|key}}, past-the-end (see {{lc|end()}}) iterator is returned as the first element. Similarly if there are no elements ''greater'' than {{tt|key}}, past-the-end iterator is returned as the second element.
+
|{{lc|std::pair}} containing a pair of iterators defining the wanted range. If there are no such elements, past-the-end (see {{lc|end()}}) iterators are returned as both elements of the pair.
+
}}
+
 
+
===Complexity===
+
{{cpp/container/if ord|set
+
|Logarithmic in the size of the container.
+
|Average case constant, worst case linear in the size of the container.
+
}}
+
 
+
===See also===
+
{{dsc begin}}
+
{{dsc inc | cpp/container/dsc find |set}}
+
{{cpp/container/if ord|set
+
|{{dsc inc | cpp/container/dsc upper_bound |set}}
+
{{dsc inc | cpp/container/dsc lower_bound |set}}
+
}}
+
{{dsc end}}
+
 
+
[[de:cpp/container/set/equal range]]
+
[[es:cpp/container/set/equal range]]
+
[[fr:cpp/container/set/equal range]]
+
[[it:cpp/container/set/equal range]]
+
[[ja:cpp/container/set/equal range]]
+
[[pt:cpp/container/set/equal range]]
+
[[ru:cpp/container/set/equal range]]
+
[[zh:cpp/container/set/equal range]]
+

Latest revision as of 18:41, 20 November 2021

 
 
 
 
std::pair<iterator, iterator> equal_range( const Key& key );
(1)
std::pair<const_iterator, const_iterator> equal_range( const Key& key ) const;
(2)
template< class K >
std::pair<iterator, iterator> equal_range( const K& x );
(3) (since C++14)
template< class K >
std::pair<const_iterator, const_iterator> equal_range( const K& x ) const;
(4) (since C++14)

Returns a range containing all elements with the given key in the container. The range is defined by two iterators, one pointing to the first element that is not less than key and another pointing to the first element greater than key. Alternatively, the first iterator may be obtained with lower_bound(), and the second with upper_bound().

1,2) Compares the keys to key.
3,4) Compares the keys to the value x. This overload participates in overload resolution only if the qualified-id Compare::is_transparent is valid and denotes a type. It allows calling this function without constructing an instance of Key.

Contents

[edit] Parameters

key - key value to compare the elements to
x - alternative value that can be compared to Key

[edit] Return value

std::pair containing a pair of iterators defining the wanted range: the first pointing to the first element that is not less than key and the second pointing to the first element greater than key.

If there are no elements not less than key, past-the-end (see end()) iterator is returned as the first element. Similarly if there are no elements greater than key, past-the-end iterator is returned as the second element.

[edit] Complexity

Logarithmic in the size of the container.

Notes

Feature-test macro Value Std Feature
__cpp_lib_generic_associative_lookup 201304L (C++14) Heterogeneous comparison lookup in associative containers, for overloads (3,4)

[edit] Example

#include <set>
#include <functional>
#include <print>
#include <ranges>
#include <string>
#include <string_view>
#include <tuple>
 
struct Names
{
    std::string forename, surname;
    friend auto operator<(const Names& lhs, const Names& rhs)
    {
        return std::tie(lhs.surname, lhs.forename) < std::tie(rhs.surname, rhs.forename);
    }
};
 
struct SurnameCompare
{
    std::string_view surname;
 
    friend bool operator<(const Names& lhs, const SurnameCompare& rhs)
    {
        return lhs.surname < rhs.surname;
    }
 
    friend bool operator<(const SurnameCompare& lhs, const Names& rhs)
    {
        return lhs.surname < rhs.surname;
    }
}; 
 
std::set<Names, std::less<>> characters
{
    {"Homer", "Simpson"},
    {"Marge", "Simpson"},
    {"Lisa", "Simpson"},
    {"Ned", "Flanders"},
    {"Joe", "Quimby"}
};
 
void print_unique(const Names& names)
{
    auto [begin, end] = characters.equal_range(names);
    std::print(
        "Found {} characters with name \"{} {}\"\n", 
        std::distance(begin, end), 
        names.forename, names.surname
    );
}
 
void print_by_surname(std::string_view surname)
{
    auto [begin, end] = characters.equal_range(SurnameCompare{surname});
    std::print("Found {} characters with surname \"{}\":\n", std::distance(begin, end), surname);
    for (const Names& names : std::ranges::subrange(begin, end))
        std::print("    {} {}\n", names.forename, names.surname);
}
 
int main()
{
    print_unique({"Maude", "Flanders"});
    print_unique({"Lisa", "Simpson"});
    print_by_surname("Simpson");
}

Output:

Found 0 characters with name "Maude Flanders"
Found 1 characters with name "Lisa Simpson"
Found 3 characters with surname "Simpson":
    Homer Simpson
    Lisa Simpson
    Marge Simpson

[edit] See also

finds element with specific key
(public member function) [edit]
(C++20)
checks if the container contains element with specific key
(public member function) [edit]
returns the number of elements matching specific key
(public member function) [edit]
returns an iterator to the first element greater than the given key
(public member function) [edit]
returns an iterator to the first element not less than the given key
(public member function) [edit]
returns range of elements matching a specific key
(function template) [edit]