equal_range.pass.cpp 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // The LLVM Compiler Infrastructure
  4. //
  5. // This file is dual licensed under the MIT and the University of Illinois Open
  6. // Source Licenses. See LICENSE.TXT for details.
  7. //
  8. //===----------------------------------------------------------------------===//
  9. // <multimap>
  10. // class multimap
  11. // pair<iterator, iterator> equal_range(const key_type& k);
  12. // pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
  13. #include <map>
  14. #include <cassert>
  15. #include "test_macros.h"
  16. #include "min_allocator.h"
  17. #include "private_constructor.hpp"
  18. #include "is_transparent.h"
  19. int main()
  20. {
  21. typedef std::pair<const int, double> V;
  22. {
  23. typedef std::multimap<int, double> M;
  24. {
  25. typedef std::pair<M::iterator, M::iterator> R;
  26. V ar[] =
  27. {
  28. V(5, 1),
  29. V(5, 2),
  30. V(5, 3),
  31. V(7, 1),
  32. V(7, 2),
  33. V(7, 3),
  34. V(9, 1),
  35. V(9, 2),
  36. V(9, 3)
  37. };
  38. M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
  39. R r = m.equal_range(4);
  40. assert(r.first == m.begin());
  41. assert(r.second == m.begin());
  42. r = m.equal_range(5);
  43. assert(r.first == m.begin());
  44. assert(r.second == next(m.begin(), 3));
  45. r = m.equal_range(6);
  46. assert(r.first == next(m.begin(), 3));
  47. assert(r.second == next(m.begin(), 3));
  48. r = m.equal_range(7);
  49. assert(r.first == next(m.begin(), 3));
  50. assert(r.second == next(m.begin(), 6));
  51. r = m.equal_range(8);
  52. assert(r.first == next(m.begin(), 6));
  53. assert(r.second == next(m.begin(), 6));
  54. r = m.equal_range(9);
  55. assert(r.first == next(m.begin(), 6));
  56. assert(r.second == next(m.begin(), 9));
  57. r = m.equal_range(10);
  58. assert(r.first == m.end());
  59. assert(r.second == m.end());
  60. }
  61. {
  62. typedef std::pair<M::const_iterator, M::const_iterator> R;
  63. V ar[] =
  64. {
  65. V(5, 1),
  66. V(5, 2),
  67. V(5, 3),
  68. V(7, 1),
  69. V(7, 2),
  70. V(7, 3),
  71. V(9, 1),
  72. V(9, 2),
  73. V(9, 3)
  74. };
  75. const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
  76. R r = m.equal_range(4);
  77. assert(r.first == m.begin());
  78. assert(r.second == m.begin());
  79. r = m.equal_range(5);
  80. assert(r.first == m.begin());
  81. assert(r.second == next(m.begin(), 3));
  82. r = m.equal_range(6);
  83. assert(r.first == next(m.begin(), 3));
  84. assert(r.second == next(m.begin(), 3));
  85. r = m.equal_range(7);
  86. assert(r.first == next(m.begin(), 3));
  87. assert(r.second == next(m.begin(), 6));
  88. r = m.equal_range(8);
  89. assert(r.first == next(m.begin(), 6));
  90. assert(r.second == next(m.begin(), 6));
  91. r = m.equal_range(9);
  92. assert(r.first == next(m.begin(), 6));
  93. assert(r.second == next(m.begin(), 9));
  94. r = m.equal_range(10);
  95. assert(r.first == m.end());
  96. assert(r.second == m.end());
  97. }
  98. }
  99. #if TEST_STD_VER >= 11
  100. {
  101. typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
  102. {
  103. typedef std::pair<M::iterator, M::iterator> R;
  104. V ar[] =
  105. {
  106. V(5, 1),
  107. V(5, 2),
  108. V(5, 3),
  109. V(7, 1),
  110. V(7, 2),
  111. V(7, 3),
  112. V(9, 1),
  113. V(9, 2),
  114. V(9, 3)
  115. };
  116. M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
  117. R r = m.equal_range(4);
  118. assert(r.first == m.begin());
  119. assert(r.second == m.begin());
  120. r = m.equal_range(5);
  121. assert(r.first == m.begin());
  122. assert(r.second == next(m.begin(), 3));
  123. r = m.equal_range(6);
  124. assert(r.first == next(m.begin(), 3));
  125. assert(r.second == next(m.begin(), 3));
  126. r = m.equal_range(7);
  127. assert(r.first == next(m.begin(), 3));
  128. assert(r.second == next(m.begin(), 6));
  129. r = m.equal_range(8);
  130. assert(r.first == next(m.begin(), 6));
  131. assert(r.second == next(m.begin(), 6));
  132. r = m.equal_range(9);
  133. assert(r.first == next(m.begin(), 6));
  134. assert(r.second == next(m.begin(), 9));
  135. r = m.equal_range(10);
  136. assert(r.first == m.end());
  137. assert(r.second == m.end());
  138. }
  139. {
  140. typedef std::pair<M::const_iterator, M::const_iterator> R;
  141. V ar[] =
  142. {
  143. V(5, 1),
  144. V(5, 2),
  145. V(5, 3),
  146. V(7, 1),
  147. V(7, 2),
  148. V(7, 3),
  149. V(9, 1),
  150. V(9, 2),
  151. V(9, 3)
  152. };
  153. const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
  154. R r = m.equal_range(4);
  155. assert(r.first == m.begin());
  156. assert(r.second == m.begin());
  157. r = m.equal_range(5);
  158. assert(r.first == m.begin());
  159. assert(r.second == next(m.begin(), 3));
  160. r = m.equal_range(6);
  161. assert(r.first == next(m.begin(), 3));
  162. assert(r.second == next(m.begin(), 3));
  163. r = m.equal_range(7);
  164. assert(r.first == next(m.begin(), 3));
  165. assert(r.second == next(m.begin(), 6));
  166. r = m.equal_range(8);
  167. assert(r.first == next(m.begin(), 6));
  168. assert(r.second == next(m.begin(), 6));
  169. r = m.equal_range(9);
  170. assert(r.first == next(m.begin(), 6));
  171. assert(r.second == next(m.begin(), 9));
  172. r = m.equal_range(10);
  173. assert(r.first == m.end());
  174. assert(r.second == m.end());
  175. }
  176. }
  177. #endif
  178. #if TEST_STD_VER > 11
  179. {
  180. typedef std::multimap<int, double, std::less<>> M;
  181. typedef std::pair<M::iterator, M::iterator> R;
  182. V ar[] =
  183. {
  184. V(5, 1),
  185. V(5, 2),
  186. V(5, 3),
  187. V(7, 1),
  188. V(7, 2),
  189. V(7, 3),
  190. V(9, 1),
  191. V(9, 2),
  192. V(9, 3)
  193. };
  194. M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
  195. R r = m.equal_range(4);
  196. assert(r.first == m.begin());
  197. assert(r.second == m.begin());
  198. r = m.equal_range(5);
  199. assert(r.first == m.begin());
  200. assert(r.second == next(m.begin(), 3));
  201. r = m.equal_range(6);
  202. assert(r.first == next(m.begin(), 3));
  203. assert(r.second == next(m.begin(), 3));
  204. r = m.equal_range(7);
  205. assert(r.first == next(m.begin(), 3));
  206. assert(r.second == next(m.begin(), 6));
  207. r = m.equal_range(8);
  208. assert(r.first == next(m.begin(), 6));
  209. assert(r.second == next(m.begin(), 6));
  210. r = m.equal_range(9);
  211. assert(r.first == next(m.begin(), 6));
  212. assert(r.second == next(m.begin(), 9));
  213. r = m.equal_range(10);
  214. assert(r.first == m.end());
  215. assert(r.second == m.end());
  216. r = m.equal_range(C2Int(4));
  217. assert(r.first == m.begin());
  218. assert(r.second == m.begin());
  219. r = m.equal_range(C2Int(5));
  220. assert(r.first == m.begin());
  221. assert(r.second == next(m.begin(), 3));
  222. r = m.equal_range(C2Int(6));
  223. assert(r.first == next(m.begin(), 3));
  224. assert(r.second == next(m.begin(), 3));
  225. r = m.equal_range(C2Int(7));
  226. assert(r.first == next(m.begin(), 3));
  227. assert(r.second == next(m.begin(), 6));
  228. r = m.equal_range(C2Int(8));
  229. assert(r.first == next(m.begin(), 6));
  230. assert(r.second == next(m.begin(), 6));
  231. r = m.equal_range(C2Int(9));
  232. assert(r.first == next(m.begin(), 6));
  233. assert(r.second == next(m.begin(), 9));
  234. r = m.equal_range(C2Int(10));
  235. assert(r.first == m.end());
  236. assert(r.second == m.end());
  237. }
  238. {
  239. typedef PrivateConstructor PC;
  240. typedef std::multimap<PC, double, std::less<>> M;
  241. typedef std::pair<M::iterator, M::iterator> R;
  242. M m;
  243. m.insert ( std::make_pair<PC, double> ( PC::make(5), 1 ));
  244. m.insert ( std::make_pair<PC, double> ( PC::make(5), 2 ));
  245. m.insert ( std::make_pair<PC, double> ( PC::make(5), 3 ));
  246. m.insert ( std::make_pair<PC, double> ( PC::make(7), 1 ));
  247. m.insert ( std::make_pair<PC, double> ( PC::make(7), 2 ));
  248. m.insert ( std::make_pair<PC, double> ( PC::make(7), 3 ));
  249. m.insert ( std::make_pair<PC, double> ( PC::make(9), 1 ));
  250. m.insert ( std::make_pair<PC, double> ( PC::make(9), 2 ));
  251. m.insert ( std::make_pair<PC, double> ( PC::make(9), 3 ));
  252. // assert(m.size() == 9);
  253. R r = m.equal_range(4);
  254. assert(r.first == m.begin());
  255. assert(r.second == m.begin());
  256. r = m.equal_range(5);
  257. assert(r.first == m.begin());
  258. assert(r.second == next(m.begin(), 3));
  259. r = m.equal_range(6);
  260. assert(r.first == next(m.begin(), 3));
  261. assert(r.second == next(m.begin(), 3));
  262. r = m.equal_range(7);
  263. assert(r.first == next(m.begin(), 3));
  264. assert(r.second == next(m.begin(), 6));
  265. r = m.equal_range(8);
  266. assert(r.first == next(m.begin(), 6));
  267. assert(r.second == next(m.begin(), 6));
  268. r = m.equal_range(9);
  269. assert(r.first == next(m.begin(), 6));
  270. assert(r.second == next(m.begin(), 9));
  271. r = m.equal_range(10);
  272. assert(r.first == m.end());
  273. assert(r.second == m.end());
  274. }
  275. #endif
  276. }