1 //===----------------------------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
15 // const_iterator begin() const;
17 // const_iterator end() const;
19 // reverse_iterator rbegin();
20 // const_reverse_iterator rbegin() const;
21 // reverse_iterator rend();
22 // const_reverse_iterator rend() const;
24 // const_iterator cbegin() const;
25 // const_iterator cend() const;
26 // const_reverse_iterator crbegin() const;
27 // const_reverse_iterator crend() const;
32 #include "min_allocator.h"
37 typedef std::pair<const int, double> V;
65 std::multimap<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
66 assert(std::distance(m.begin(), m.end()) == m.size());
67 assert(std::distance(m.rbegin(), m.rend()) == m.size());
68 std::multimap<int, double>::iterator i;
70 std::multimap<int, double>::const_iterator k = i;
72 for (int j = 1; j <= 8; ++j)
73 for (double d = 1; d <= 2; d += .5, ++i)
75 assert(i->first == j);
76 assert(i->second == d);
78 assert(i->second == 2.5);
82 typedef std::pair<const int, double> V;
110 const std::multimap<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
111 assert(std::distance(m.begin(), m.end()) == m.size());
112 assert(std::distance(m.cbegin(), m.cend()) == m.size());
113 assert(std::distance(m.rbegin(), m.rend()) == m.size());
114 assert(std::distance(m.crbegin(), m.crend()) == m.size());
115 std::multimap<int, double>::const_iterator i;
117 for (int j = 1; j <= 8; ++j)
118 for (double d = 1; d <= 2; d += .5, ++i)
120 assert(i->first == j);
121 assert(i->second == d);
124 #if __cplusplus >= 201103L
126 typedef std::pair<const int, double> V;
154 std::multimap<int, double, std::less<int>, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
155 assert(std::distance(m.begin(), m.end()) == m.size());
156 assert(std::distance(m.rbegin(), m.rend()) == m.size());
157 std::multimap<int, double, std::less<int>, min_allocator<V>>::iterator i;
159 std::multimap<int, double, std::less<int>, min_allocator<V>>::const_iterator k = i;
161 for (int j = 1; j <= 8; ++j)
162 for (double d = 1; d <= 2; d += .5, ++i)
164 assert(i->first == j);
165 assert(i->second == d);
167 assert(i->second == 2.5);
171 typedef std::pair<const int, double> V;
199 const std::multimap<int, double, std::less<int>, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
200 assert(std::distance(m.begin(), m.end()) == m.size());
201 assert(std::distance(m.cbegin(), m.cend()) == m.size());
202 assert(std::distance(m.rbegin(), m.rend()) == m.size());
203 assert(std::distance(m.crbegin(), m.crend()) == m.size());
204 std::multimap<int, double, std::less<int>, min_allocator<V>>::const_iterator i;
206 for (int j = 1; j <= 8; ++j)
207 for (double d = 1; d <= 2; d += .5, ++i)
209 assert(i->first == j);
210 assert(i->second == d);
214 #if _LIBCPP_STD_VER > 11
216 typedef std::multimap<int, double> C;
217 C::iterator ii1{}, ii2{};
218 C::iterator ii4 = ii1;
219 C::const_iterator cii{};
220 assert ( ii1 == ii2 );
221 assert ( ii1 == ii4 );
223 assert (!(ii1 != ii2 ));
225 assert ( (ii1 == cii ));
226 assert ( (cii == ii1 ));
227 assert (!(ii1 != cii ));
228 assert (!(cii != ii1 ));