//===----------------------------------------------------------------------===// // // 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_multimap // const_iterator find(const key_type& k) const; #include #include #include #include "test_macros.h" #include "min_allocator.h" int main(int, char**) { { typedef std::unordered_multimap C; typedef std::pair P; P a[] = { P(10, "ten"), P(20, "twenty"), P(30, "thirty"), P(40, "forty"), P(50, "fifty"), P(60, "sixty"), P(70, "seventy"), P(80, "eighty"), }; const C c(std::begin(a), std::end(a)); C::const_iterator i = c.find(30); assert(i->first == 30); assert(i->second == "thirty"); i = c.find(5); assert(i == c.cend()); } #if TEST_STD_VER >= 11 { typedef std::unordered_multimap, std::equal_to, min_allocator>> C; typedef std::pair P; P a[] = { P(10, "ten"), P(20, "twenty"), P(30, "thirty"), P(40, "forty"), P(50, "fifty"), P(60, "sixty"), P(70, "seventy"), P(80, "eighty"), }; const C c(std::begin(a), std::end(a)); C::const_iterator i = c.find(30); assert(i->first == 30); assert(i->second == "thirty"); i = c.find(5); assert(i == c.cend()); } #endif return 0; }