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"
65 std::multiset<int> 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::multiset<int>::iterator i;
70 std::multiset<int>::const_iterator k = i;
72 for (int j = 1; j <= 8; ++j)
73 for (int k = 0; k < 3; ++k, ++i)
105 const std::multiset<int> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
106 assert(std::distance(m.begin(), m.end()) == m.size());
107 assert(std::distance(m.cbegin(), m.cend()) == m.size());
108 assert(std::distance(m.rbegin(), m.rend()) == m.size());
109 assert(std::distance(m.crbegin(), m.crend()) == m.size());
110 std::multiset<int>::const_iterator i;
112 for (int j = 1; j <= 8; ++j)
113 for (int k = 0; k < 3; ++k, ++i)
116 #if __cplusplus >= 201103L
146 std::multiset<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
147 assert(std::distance(m.begin(), m.end()) == m.size());
148 assert(std::distance(m.rbegin(), m.rend()) == m.size());
149 std::multiset<int, std::less<int>, min_allocator<int>>::iterator i;
151 std::multiset<int, std::less<int>, min_allocator<int>>::const_iterator k = i;
153 for (int j = 1; j <= 8; ++j)
154 for (int k = 0; k < 3; ++k, ++i)
186 const std::multiset<int, std::less<int>, min_allocator<int>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
187 assert(std::distance(m.begin(), m.end()) == m.size());
188 assert(std::distance(m.cbegin(), m.cend()) == m.size());
189 assert(std::distance(m.rbegin(), m.rend()) == m.size());
190 assert(std::distance(m.crbegin(), m.crend()) == m.size());
191 std::multiset<int, std::less<int>, min_allocator<int>>::const_iterator i;
193 for (int j = 1; j <= 8; ++j)
194 for (int k = 0; k < 3; ++k, ++i)
198 #if _LIBCPP_STD_VER > 11
200 typedef std::multiset<int> C;
201 C::iterator ii1{}, ii2{};
202 C::iterator ii4 = ii1;
203 C::const_iterator cii{};
204 assert ( ii1 == ii2 );
205 assert ( ii1 == ii4 );
206 assert ( ii1 == cii );
208 assert ( !(ii1 != ii2 ));
209 assert ( !(ii1 != cii ));