summaryrefslogtreecommitdiffstats
path: root/libcxx/test/containers/associative/multimap/multimap.ops/equal_range.pass.cpp
diff options
context:
space:
mode:
authorEric Fiselier <eric@efcs.ca>2014-12-20 01:40:03 +0000
committerEric Fiselier <eric@efcs.ca>2014-12-20 01:40:03 +0000
commit5a83710e371fe68a06e6e3876c6a2c8b820a8976 (patch)
treeafde4c82ad6704681781c5cd49baa3fbd05c85db /libcxx/test/containers/associative/multimap/multimap.ops/equal_range.pass.cpp
parentf11e8eab527fba316c64112f6e05de1a79693a3e (diff)
downloadbcm5719-llvm-5a83710e371fe68a06e6e3876c6a2c8b820a8976.tar.gz
bcm5719-llvm-5a83710e371fe68a06e6e3876c6a2c8b820a8976.zip
Move test into test/std subdirectory.
llvm-svn: 224658
Diffstat (limited to 'libcxx/test/containers/associative/multimap/multimap.ops/equal_range.pass.cpp')
-rw-r--r--libcxx/test/containers/associative/multimap/multimap.ops/equal_range.pass.cpp264
1 files changed, 0 insertions, 264 deletions
diff --git a/libcxx/test/containers/associative/multimap/multimap.ops/equal_range.pass.cpp b/libcxx/test/containers/associative/multimap/multimap.ops/equal_range.pass.cpp
deleted file mode 100644
index a408796d1fb..00000000000
--- a/libcxx/test/containers/associative/multimap/multimap.ops/equal_range.pass.cpp
+++ /dev/null
@@ -1,264 +0,0 @@
-//===----------------------------------------------------------------------===//
-//
-// The LLVM Compiler Infrastructure
-//
-// This file is dual licensed under the MIT and the University of Illinois Open
-// Source Licenses. See LICENSE.TXT for details.
-//
-//===----------------------------------------------------------------------===//
-
-// <map>
-
-// class multimap
-
-// pair<iterator, iterator> equal_range(const key_type& k);
-// pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
-
-#include <map>
-#include <cassert>
-
-#include "min_allocator.h"
-#include "private_constructor.hpp"
-
-int main()
-{
- typedef std::pair<const int, double> V;
- {
- typedef std::multimap<int, double> M;
- {
- typedef std::pair<M::iterator, M::iterator> R;
- V ar[] =
- {
- V(5, 1),
- V(5, 2),
- V(5, 3),
- V(7, 1),
- V(7, 2),
- V(7, 3),
- V(9, 1),
- V(9, 2),
- V(9, 3)
- };
- M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.equal_range(4);
- assert(r.first == m.begin());
- assert(r.second == m.begin());
- r = m.equal_range(5);
- assert(r.first == m.begin());
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(6);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(7);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(8);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(9);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 9));
- r = m.equal_range(10);
- assert(r.first == m.end());
- assert(r.second == m.end());
- }
- {
- typedef std::pair<M::const_iterator, M::const_iterator> R;
- V ar[] =
- {
- V(5, 1),
- V(5, 2),
- V(5, 3),
- V(7, 1),
- V(7, 2),
- V(7, 3),
- V(9, 1),
- V(9, 2),
- V(9, 3)
- };
- const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.equal_range(4);
- assert(r.first == m.begin());
- assert(r.second == m.begin());
- r = m.equal_range(5);
- assert(r.first == m.begin());
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(6);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(7);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(8);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(9);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 9));
- r = m.equal_range(10);
- assert(r.first == m.end());
- assert(r.second == m.end());
- }
- }
-#if __cplusplus >= 201103L
- {
- typedef std::multimap<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
- {
- typedef std::pair<M::iterator, M::iterator> R;
- V ar[] =
- {
- V(5, 1),
- V(5, 2),
- V(5, 3),
- V(7, 1),
- V(7, 2),
- V(7, 3),
- V(9, 1),
- V(9, 2),
- V(9, 3)
- };
- M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.equal_range(4);
- assert(r.first == m.begin());
- assert(r.second == m.begin());
- r = m.equal_range(5);
- assert(r.first == m.begin());
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(6);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(7);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(8);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(9);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 9));
- r = m.equal_range(10);
- assert(r.first == m.end());
- assert(r.second == m.end());
- }
- {
- typedef std::pair<M::const_iterator, M::const_iterator> R;
- V ar[] =
- {
- V(5, 1),
- V(5, 2),
- V(5, 3),
- V(7, 1),
- V(7, 2),
- V(7, 3),
- V(9, 1),
- V(9, 2),
- V(9, 3)
- };
- const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.equal_range(4);
- assert(r.first == m.begin());
- assert(r.second == m.begin());
- r = m.equal_range(5);
- assert(r.first == m.begin());
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(6);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(7);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(8);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(9);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 9));
- r = m.equal_range(10);
- assert(r.first == m.end());
- assert(r.second == m.end());
- }
- }
-#endif
-#if _LIBCPP_STD_VER > 11
- {
- typedef std::pair<const int, double> V;
- typedef std::multimap<int, double, std::less<>> M;
-
- typedef std::pair<M::iterator, M::iterator> R;
- V ar[] =
- {
- V(5, 1),
- V(5, 2),
- V(5, 3),
- V(7, 1),
- V(7, 2),
- V(7, 3),
- V(9, 1),
- V(9, 2),
- V(9, 3)
- };
- M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.equal_range(4);
- assert(r.first == m.begin());
- assert(r.second == m.begin());
- r = m.equal_range(5);
- assert(r.first == m.begin());
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(6);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(7);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(8);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(9);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 9));
- r = m.equal_range(10);
- assert(r.first == m.end());
- assert(r.second == m.end());
- }
-
- {
- typedef PrivateConstructor PC;
- typedef std::multimap<PC, double, std::less<>> M;
- typedef std::pair<M::iterator, M::iterator> R;
-
- M m;
- m.insert ( std::make_pair<PC, double> ( PC::make(5), 1 ));
- m.insert ( std::make_pair<PC, double> ( PC::make(5), 2 ));
- m.insert ( std::make_pair<PC, double> ( PC::make(5), 3 ));
- m.insert ( std::make_pair<PC, double> ( PC::make(7), 1 ));
- m.insert ( std::make_pair<PC, double> ( PC::make(7), 2 ));
- m.insert ( std::make_pair<PC, double> ( PC::make(7), 3 ));
- m.insert ( std::make_pair<PC, double> ( PC::make(9), 1 ));
- m.insert ( std::make_pair<PC, double> ( PC::make(9), 2 ));
- m.insert ( std::make_pair<PC, double> ( PC::make(9), 3 ));
-
-// assert(m.size() == 9);
- R r = m.equal_range(4);
- assert(r.first == m.begin());
- assert(r.second == m.begin());
- r = m.equal_range(5);
- assert(r.first == m.begin());
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(6);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 3));
- r = m.equal_range(7);
- assert(r.first == next(m.begin(), 3));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(8);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 6));
- r = m.equal_range(9);
- assert(r.first == next(m.begin(), 6));
- assert(r.second == next(m.begin(), 9));
- r = m.equal_range(10);
- assert(r.first == m.end());
- assert(r.second == m.end());
- }
-#endif
-}
OpenPOWER on IntegriCloud