//===----------------------------------------------------------------------===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// // // template , class Pred = equal_to, // class Alloc = allocator> // class unordered_set // pair equal_range(const key_type& k) const; #include #include #include "test_macros.h" #include "min_allocator.h" int main(int, char**) { { typedef std::unordered_set C; typedef C::const_iterator I; typedef int P; P a[] = { P(10), P(20), P(30), P(40), P(50), P(50), P(50), P(60), P(70), P(80) }; const C c(std::begin(a), std::end(a)); std::pair r = c.equal_range(30); assert(std::distance(r.first, r.second) == 1); assert(*r.first == 30); r = c.equal_range(5); assert(std::distance(r.first, r.second) == 0); r = c.equal_range(50); assert(std::distance(r.first, r.second) == 1); assert(*r.first == 50); } #if TEST_STD_VER >= 11 { typedef std::unordered_set, std::equal_to, min_allocator> C; typedef C::const_iterator I; typedef int P; P a[] = { P(10), P(20), P(30), P(40), P(50), P(50), P(50), P(60), P(70), P(80) }; const C c(std::begin(a), std::end(a)); std::pair r = c.equal_range(30); assert(std::distance(r.first, r.second) == 1); assert(*r.first == 30); r = c.equal_range(5); assert(std::distance(r.first, r.second) == 0); r = c.equal_range(50); assert(std::distance(r.first, r.second) == 1); assert(*r.first == 50); } #endif return 0; }