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>
27 #include "test_macros.h"
28 #include "min_allocator.h"
33 typedef std::unordered_multimap
<int, std::string
> C
;
34 typedef std::pair
<int, std::string
> P
;
44 C
c(a
, a
+ sizeof(a
)/sizeof(a
[0]));
45 assert(c
.bucket_count() >= 7);
46 assert(c
.size() == 6);
47 assert(static_cast<std::size_t>(std::distance(c
.begin(), c
.end())) == c
.size());
48 assert(static_cast<std::size_t>(std::distance(c
.cbegin(), c
.cend())) == c
.size());
52 assert(i
->second
== "ONE");
55 typedef std::unordered_multimap
<int, std::string
> C
;
56 typedef std::pair
<int, std::string
> P
;
66 const C
c(a
, a
+ sizeof(a
)/sizeof(a
[0]));
67 assert(c
.bucket_count() >= 7);
68 assert(c
.size() == 6);
69 assert(static_cast<std::size_t>(std::distance(c
.begin(), c
.end())) == c
.size());
70 assert(static_cast<std::size_t>(std::distance(c
.cbegin(), c
.cend())) == c
.size());
73 #if TEST_STD_VER >= 11
75 typedef std::unordered_multimap
<int, std::string
, std::hash
<int>, std::equal_to
<int>,
76 min_allocator
<std::pair
<const int, std::string
>>> C
;
77 typedef std::pair
<int, std::string
> P
;
87 C
c(a
, a
+ sizeof(a
)/sizeof(a
[0]));
88 assert(c
.bucket_count() >= 7);
89 assert(c
.size() == 6);
90 assert(static_cast<std::size_t>(std::distance(c
.begin(), c
.end())) == c
.size());
91 assert(static_cast<std::size_t>(std::distance(c
.cbegin(), c
.cend())) == c
.size());
95 assert(i
->second
== "ONE");
98 typedef std::unordered_multimap
<int, std::string
, std::hash
<int>, std::equal_to
<int>,
99 min_allocator
<std::pair
<const int, std::string
>>> C
;
100 typedef std::pair
<int, std::string
> P
;
110 const C
c(a
, a
+ sizeof(a
)/sizeof(a
[0]));
111 assert(c
.bucket_count() >= 7);
112 assert(c
.size() == 6);
113 assert(static_cast<std::size_t>(std::distance(c
.begin(), c
.end())) == c
.size());
114 assert(static_cast<std::size_t>(std::distance(c
.cbegin(), c
.cend())) == c
.size());
118 #if TEST_STD_VER > 11
120 typedef std::unordered_multimap
<int,double> C
;
121 C::iterator ii1
{}, ii2
{};
122 C::iterator ii4
= ii1
;
123 C::const_iterator cii
{};
124 assert ( ii1
== ii2
);
125 assert ( ii1
== ii4
);
127 assert (!(ii1
!= ii2
));
129 assert ( (ii1
== cii
));
130 assert ( (cii
== ii1
));
131 assert (!(ii1
!= cii
));
132 assert (!(cii
!= ii1
));