| CARVIEW |
Select Language
HTTP/1.1 301 Moved Permanently
Server: nginx
Date: Thu, 24 Jul 2025 15:52:57 GMT
Content-Type: text/html; charset=UTF-8
Transfer-Encoding: chunked
Connection: keep-alive
Location: /reference/set/multiset/equal_range/
HTTP/1.1 200 OK
Server: nginx
Date: Thu, 24 Jul 2025 15:52:58 GMT
Content-Type: text/html; charset=utf-8
Transfer-Encoding: chunked
Connection: keep-alive
ETag: W/"7dfd-hMrn2f1D9yFAj9zTNomIjvnfGvI"
Content-Encoding: gzip
Returns the bounds of a range that includes all the elements in the container that are equivalent to val.
If no matches are found, the range returned has a length of zero, with both iterators pointing to the first element that is considered to go after val according to the container's internal comparison object (key_comp).
Two elements of a multiset are considered equivalent if the container's comparison object returns false reflexively (i.e., no matter the order in which the elements are passed as arguments).
Member types iterator and const_iterator are bidirectional iterator types pointing to elements.
Concurrently accessing the elements of a multiset is safe.
Reference
C library:
- <cassert> (assert.h)
- <cctype> (ctype.h)
- <cerrno> (errno.h)
-
<cfenv> (fenv.h)C++11
- <cfloat> (float.h)
-
<cinttypes> (inttypes.h)C++11
- <ciso646> (iso646.h)
- <climits> (limits.h)
- <clocale> (locale.h)
- <cmath> (math.h)
- <csetjmp> (setjmp.h)
- <csignal> (signal.h)
- <cstdarg> (stdarg.h)
-
<cstdbool> (stdbool.h)C++11
- <cstddef> (stddef.h)
-
<cstdint> (stdint.h)C++11
- <cstdio> (stdio.h)
- <cstdlib> (stdlib.h)
- <cstring> (string.h)
-
<ctgmath> (tgmath.h)C++11
- <ctime> (time.h)
-
<cuchar> (uchar.h)C++11
- <cwchar> (wchar.h)
- <cwctype> (wctype.h)
Containers:
-
<array>C++11
- <deque>
-
<forward_list>C++11
- <list>
- <map>
- <queue>
- <set>
- <stack>
-
<unordered_map>C++11
-
<unordered_set>C++11
- <vector>
-
Input/Output:
Multi-threading:
-
<atomic>C++11
-
<condition_variable>C++11
-
<future>C++11
-
<mutex>C++11
-
<thread>C++11
-
Other:
- <algorithm>
- <bitset>
-
<chrono>C++11
-
<codecvt>C++11
- <complex>
- <exception>
- <functional>
-
<initializer_list>C++11
- <iterator>
- <limits>
- <locale>
- <memory>
- <new>
- <numeric>
-
<random>C++11
-
<ratio>C++11
-
<regex>C++11
- <stdexcept>
- <string>
-
<system_error>C++11
-
<tuple>C++11
-
<type_traits>C++11
-
<typeindex>C++11
- <typeinfo>
- <utility>
- <valarray>
multiset
- multiset::~multiset
- multiset::multiset
member functions
- multiset::begin
-
multiset::cbeginC++11
-
multiset::cendC++11
- multiset::clear
- multiset::count
-
multiset::crbeginC++11
-
multiset::crendC++11
-
multiset::emplaceC++11
-
multiset::emplace_hintC++11
- multiset::empty
- multiset::end
- multiset::equal_range
- multiset::erase
- multiset::find
- multiset::get_allocator
- multiset::insert
- multiset::key_comp
- multiset::lower_bound
- multiset::max_size
- multiset::operator=
- multiset::rbegin
- multiset::rend
- multiset::size
- multiset::swap
- multiset::upper_bound
- multiset::value_comp
non-member overloads
public member function
<set>
std::multiset::equal_range
pair<iterator,iterator> equal_range (const value_type& val) const;
pair<const_iterator,const_iterator> equal_range (const value_type& val) const;pair<iterator,iterator> equal_range (const value_type& val);
Get range of equal elements
If no matches are found, the range returned has a length of zero, with both iterators pointing to the first element that is considered to go after val according to the container's internal comparison object (key_comp).
Two elements of a multiset are considered equivalent if the container's comparison object returns false reflexively (i.e., no matter the order in which the elements are passed as arguments).
Parameters
- val
- Value to search for.
Member type value_type is the type of the elements in the container, defined in multiset as an alias of its first template parameter (T).
Return value
The function returns a pair, whose member pair::first is the lower bound of the range (the same as lower_bound), and pair::second is the upper bound (the same as upper_bound).Member types iterator and const_iterator are bidirectional iterator types pointing to elements.
Example
|
|
multiset contains: 2 16 77 |
Complexity
Logarithmic in size.Iterator validity
No changes.Data races
The container is accessed (neither the const nor the non-const versions modify the container).Concurrently accessing the elements of a multiset is safe.
Exception safety
Strong guarantee: if an exception is thrown, there are no changes in the container.See also
- multiset::count
- Count elements with a specific key (public member function)
- multiset::lower_bound
- Return iterator to lower bound (public member function)
- multiset::upper_bound
- Return iterator to upper bound (public member function)
- multiset::find
- Get iterator to element (public member function)
Home page | Privacy policy
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us