forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
338 lines
9.3 KiB
C++
338 lines
9.3 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <set>
|
|
|
|
// class set
|
|
|
|
// iterator upper_bound(const key_type& k);
|
|
// const_iterator upper_bound(const key_type& k) const;
|
|
|
|
#include <set>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "min_allocator.h"
|
|
#include "private_constructor.hpp"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
typedef int V;
|
|
typedef std::set<int> M;
|
|
{
|
|
typedef M::iterator R;
|
|
V ar[] =
|
|
{
|
|
5,
|
|
7,
|
|
9,
|
|
11,
|
|
13,
|
|
15,
|
|
17,
|
|
19
|
|
};
|
|
M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
R r = m.upper_bound(5);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(7);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(9);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(11);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(13);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(15);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(17);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(19);
|
|
assert(r == next(m.begin(), 8));
|
|
r = m.upper_bound(4);
|
|
assert(r == next(m.begin(), 0));
|
|
r = m.upper_bound(6);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(8);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(10);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(12);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(14);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(16);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(18);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(20);
|
|
assert(r == next(m.begin(), 8));
|
|
}
|
|
{
|
|
typedef M::const_iterator R;
|
|
V ar[] =
|
|
{
|
|
5,
|
|
7,
|
|
9,
|
|
11,
|
|
13,
|
|
15,
|
|
17,
|
|
19
|
|
};
|
|
const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
R r = m.upper_bound(5);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(7);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(9);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(11);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(13);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(15);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(17);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(19);
|
|
assert(r == next(m.begin(), 8));
|
|
r = m.upper_bound(4);
|
|
assert(r == next(m.begin(), 0));
|
|
r = m.upper_bound(6);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(8);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(10);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(12);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(14);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(16);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(18);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(20);
|
|
assert(r == next(m.begin(), 8));
|
|
}
|
|
}
|
|
#if TEST_STD_VER >= 11
|
|
{
|
|
typedef int V;
|
|
typedef std::set<int, std::less<int>, min_allocator<int>> M;
|
|
{
|
|
typedef M::iterator R;
|
|
V ar[] =
|
|
{
|
|
5,
|
|
7,
|
|
9,
|
|
11,
|
|
13,
|
|
15,
|
|
17,
|
|
19
|
|
};
|
|
M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
R r = m.upper_bound(5);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(7);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(9);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(11);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(13);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(15);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(17);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(19);
|
|
assert(r == next(m.begin(), 8));
|
|
r = m.upper_bound(4);
|
|
assert(r == next(m.begin(), 0));
|
|
r = m.upper_bound(6);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(8);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(10);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(12);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(14);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(16);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(18);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(20);
|
|
assert(r == next(m.begin(), 8));
|
|
}
|
|
{
|
|
typedef M::const_iterator R;
|
|
V ar[] =
|
|
{
|
|
5,
|
|
7,
|
|
9,
|
|
11,
|
|
13,
|
|
15,
|
|
17,
|
|
19
|
|
};
|
|
const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
R r = m.upper_bound(5);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(7);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(9);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(11);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(13);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(15);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(17);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(19);
|
|
assert(r == next(m.begin(), 8));
|
|
r = m.upper_bound(4);
|
|
assert(r == next(m.begin(), 0));
|
|
r = m.upper_bound(6);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(8);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(10);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(12);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(14);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(16);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(18);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(20);
|
|
assert(r == next(m.begin(), 8));
|
|
}
|
|
}
|
|
#endif
|
|
#if TEST_STD_VER > 11
|
|
{
|
|
typedef int V;
|
|
typedef std::set<V, std::less<>> M;
|
|
typedef M::iterator R;
|
|
|
|
V ar[] =
|
|
{
|
|
5,
|
|
7,
|
|
9,
|
|
11,
|
|
13,
|
|
15,
|
|
17,
|
|
19
|
|
};
|
|
M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
R r = m.upper_bound(5);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(7);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(9);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(11);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(13);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(15);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(17);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(19);
|
|
assert(r == next(m.begin(), 8));
|
|
r = m.upper_bound(4);
|
|
assert(r == next(m.begin(), 0));
|
|
r = m.upper_bound(6);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(8);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(10);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(12);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(14);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(16);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(18);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(20);
|
|
assert(r == next(m.begin(), 8));
|
|
}
|
|
|
|
{
|
|
typedef PrivateConstructor V;
|
|
typedef std::set<V, std::less<>> M;
|
|
typedef M::iterator R;
|
|
|
|
M m;
|
|
m.insert ( V::make ( 5 ));
|
|
m.insert ( V::make ( 7 ));
|
|
m.insert ( V::make ( 9 ));
|
|
m.insert ( V::make ( 11 ));
|
|
m.insert ( V::make ( 13 ));
|
|
m.insert ( V::make ( 15 ));
|
|
m.insert ( V::make ( 17 ));
|
|
m.insert ( V::make ( 19 ));
|
|
|
|
R r = m.upper_bound(5);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(7);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(9);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(11);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(13);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(15);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(17);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(19);
|
|
assert(r == next(m.begin(), 8));
|
|
r = m.upper_bound(4);
|
|
assert(r == next(m.begin(), 0));
|
|
r = m.upper_bound(6);
|
|
assert(r == next(m.begin(), 1));
|
|
r = m.upper_bound(8);
|
|
assert(r == next(m.begin(), 2));
|
|
r = m.upper_bound(10);
|
|
assert(r == next(m.begin(), 3));
|
|
r = m.upper_bound(12);
|
|
assert(r == next(m.begin(), 4));
|
|
r = m.upper_bound(14);
|
|
assert(r == next(m.begin(), 5));
|
|
r = m.upper_bound(16);
|
|
assert(r == next(m.begin(), 6));
|
|
r = m.upper_bound(18);
|
|
assert(r == next(m.begin(), 7));
|
|
r = m.upper_bound(20);
|
|
assert(r == next(m.begin(), 8));
|
|
}
|
|
#endif
|
|
}
|