1 //===----------------------------------------------------------------------===//
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
12 // class Alloc = allocator<pair<const Key, T>>>
13 // class unordered_multimap
15 // iterator begin() {return __table_.begin();}
16 // iterator end() {return __table_.end();}
17 // const_iterator begin() const {return __table_.begin();}
18 // const_iterator end() const {return __table_.end();}
19 // const_iterator cbegin() const {return __table_.begin();}
20 // const_iterator cend() const {return __table_.end();}
22 #include <unordered_map>
26 #include "test_macros.h"
31 typedef std::unordered_multimap
<int, std::string
> C
;
32 typedef std::pair
<int, std::string
> P
;
42 C
c(a
, a
+ sizeof(a
)/sizeof(a
[0]));
43 LIBCPP_ASSERT(c
.bucket_count() == 7);
44 assert(c
.size() == 6);
45 assert(std::distance(c
.begin(), c
.end()) == c
.size());
46 assert(std::distance(c
.cbegin(), c
.cend()) == c
.size());
47 C::iterator i
= c
.begin();
49 assert(i
->second
== "ONE");
53 typedef std::unordered_multimap
<int, std::string
> C
;
54 typedef std::pair
<int, std::string
> P
;
64 const C
c(a
, a
+ sizeof(a
)/sizeof(a
[0]));
65 LIBCPP_ASSERT(c
.bucket_count() == 7);
66 assert(c
.size() == 6);
67 assert(std::distance(c
.begin(), c
.end()) == c
.size());
68 assert(std::distance(c
.cbegin(), c
.cend()) == c
.size());