summaryrefslogtreecommitdiffstats
path: root/libcxx/test/containers/associative/map/map.ops/lower_bound.pass.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'libcxx/test/containers/associative/map/map.ops/lower_bound.pass.cpp')
-rw-r--r--libcxx/test/containers/associative/map/map.ops/lower_bound.pass.cpp336
1 files changed, 0 insertions, 336 deletions
diff --git a/libcxx/test/containers/associative/map/map.ops/lower_bound.pass.cpp b/libcxx/test/containers/associative/map/map.ops/lower_bound.pass.cpp
deleted file mode 100644
index 87b84eef070..00000000000
--- a/libcxx/test/containers/associative/map/map.ops/lower_bound.pass.cpp
+++ /dev/null
@@ -1,336 +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 map
-
-// iterator lower_bound(const key_type& k);
-// const_iterator lower_bound(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::map<int, double> M;
- {
- typedef M::iterator R;
- V ar[] =
- {
- V(5, 5),
- V(7, 6),
- V(9, 7),
- V(11, 8),
- V(13, 9),
- V(15, 10),
- V(17, 11),
- V(19, 12)
- };
- M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.lower_bound(5);
- assert(r == m.begin());
- r = m.lower_bound(7);
- assert(r == next(m.begin()));
- r = m.lower_bound(9);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(11);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(13);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(15);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(17);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(19);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(4);
- assert(r == next(m.begin(), 0));
- r = m.lower_bound(6);
- assert(r == next(m.begin(), 1));
- r = m.lower_bound(8);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(10);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(12);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(14);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(16);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(18);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(20);
- assert(r == next(m.begin(), 8));
- }
- {
- typedef M::const_iterator R;
- V ar[] =
- {
- V(5, 5),
- V(7, 6),
- V(9, 7),
- V(11, 8),
- V(13, 9),
- V(15, 10),
- V(17, 11),
- V(19, 12)
- };
- const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.lower_bound(5);
- assert(r == m.begin());
- r = m.lower_bound(7);
- assert(r == next(m.begin()));
- r = m.lower_bound(9);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(11);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(13);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(15);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(17);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(19);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(4);
- assert(r == next(m.begin(), 0));
- r = m.lower_bound(6);
- assert(r == next(m.begin(), 1));
- r = m.lower_bound(8);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(10);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(12);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(14);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(16);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(18);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(20);
- assert(r == next(m.begin(), 8));
- }
- }
-#if __cplusplus >= 201103L
- {
- typedef std::pair<const int, double> V;
- typedef std::map<int, double, std::less<int>, min_allocator<V>> M;
- {
- typedef M::iterator R;
- V ar[] =
- {
- V(5, 5),
- V(7, 6),
- V(9, 7),
- V(11, 8),
- V(13, 9),
- V(15, 10),
- V(17, 11),
- V(19, 12)
- };
- M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.lower_bound(5);
- assert(r == m.begin());
- r = m.lower_bound(7);
- assert(r == next(m.begin()));
- r = m.lower_bound(9);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(11);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(13);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(15);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(17);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(19);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(4);
- assert(r == next(m.begin(), 0));
- r = m.lower_bound(6);
- assert(r == next(m.begin(), 1));
- r = m.lower_bound(8);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(10);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(12);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(14);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(16);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(18);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(20);
- assert(r == next(m.begin(), 8));
- }
- {
- typedef M::const_iterator R;
- V ar[] =
- {
- V(5, 5),
- V(7, 6),
- V(9, 7),
- V(11, 8),
- V(13, 9),
- V(15, 10),
- V(17, 11),
- V(19, 12)
- };
- const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.lower_bound(5);
- assert(r == m.begin());
- r = m.lower_bound(7);
- assert(r == next(m.begin()));
- r = m.lower_bound(9);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(11);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(13);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(15);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(17);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(19);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(4);
- assert(r == next(m.begin(), 0));
- r = m.lower_bound(6);
- assert(r == next(m.begin(), 1));
- r = m.lower_bound(8);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(10);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(12);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(14);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(16);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(18);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(20);
- assert(r == next(m.begin(), 8));
- }
- }
-#endif
-#if _LIBCPP_STD_VER > 11
- {
- typedef std::pair<const int, double> V;
- typedef std::map<int, double, std::less <>> M;
- typedef M::iterator R;
-
- V ar[] =
- {
- V(5, 5),
- V(7, 6),
- V(9, 7),
- V(11, 8),
- V(13, 9),
- V(15, 10),
- V(17, 11),
- V(19, 12)
- };
- M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
- R r = m.lower_bound(5);
- assert(r == m.begin());
- r = m.lower_bound(7);
- assert(r == next(m.begin()));
- r = m.lower_bound(9);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(11);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(13);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(15);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(17);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(19);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(4);
- assert(r == next(m.begin(), 0));
- r = m.lower_bound(6);
- assert(r == next(m.begin(), 1));
- r = m.lower_bound(8);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(10);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(12);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(14);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(16);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(18);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(20);
- assert(r == next(m.begin(), 8));
- }
-
- {
- typedef PrivateConstructor PC;
- typedef std::map<PC, double, std::less<>> M;
- typedef M::iterator R;
-
- M m;
- m [ PC::make(5) ] = 5;
- m [ PC::make(7) ] = 6;
- m [ PC::make(9) ] = 7;
- m [ PC::make(11) ] = 8;
- m [ PC::make(13) ] = 9;
- m [ PC::make(15) ] = 10;
- m [ PC::make(17) ] = 11;
- m [ PC::make(19) ] = 12;
-
- R r = m.lower_bound(5);
- assert(r == m.begin());
- r = m.lower_bound(7);
- assert(r == next(m.begin()));
- r = m.lower_bound(9);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(11);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(13);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(15);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(17);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(19);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(4);
- assert(r == next(m.begin(), 0));
- r = m.lower_bound(6);
- assert(r == next(m.begin(), 1));
- r = m.lower_bound(8);
- assert(r == next(m.begin(), 2));
- r = m.lower_bound(10);
- assert(r == next(m.begin(), 3));
- r = m.lower_bound(12);
- assert(r == next(m.begin(), 4));
- r = m.lower_bound(14);
- assert(r == next(m.begin(), 5));
- r = m.lower_bound(16);
- assert(r == next(m.begin(), 6));
- r = m.lower_bound(18);
- assert(r == next(m.begin(), 7));
- r = m.lower_bound(20);
- assert(r == next(m.begin(), 8));
- }
-#endif
-}
OpenPOWER on IntegriCloud