5ffe11a9fc
We shouldn't be calling `next` via ADL -- and neither should anybody in the wild be calling it via ADL, so it's not like we need to test this ADL ability of `next` in particular. Reviewed as part of D119860.
76 lines
1.8 KiB
C++
76 lines
1.8 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <set>
|
|
|
|
// class set
|
|
|
|
// template <class InputIterator>
|
|
// void insert(InputIterator first, InputIterator last);
|
|
|
|
#include <set>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "test_iterators.h"
|
|
#include "min_allocator.h"
|
|
|
|
int main(int, char**)
|
|
{
|
|
{
|
|
typedef std::set<int> M;
|
|
typedef int V;
|
|
V ar[] =
|
|
{
|
|
1,
|
|
1,
|
|
1,
|
|
2,
|
|
2,
|
|
2,
|
|
3,
|
|
3,
|
|
3
|
|
};
|
|
M m;
|
|
m.insert(cpp17_input_iterator<const V*>(ar),
|
|
cpp17_input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[0])));
|
|
assert(m.size() == 3);
|
|
assert(*m.begin() == 1);
|
|
assert(*std::next(m.begin()) == 2);
|
|
assert(*std::next(m.begin(), 2) == 3);
|
|
}
|
|
#if TEST_STD_VER >= 11
|
|
{
|
|
typedef std::set<int, std::less<int>, min_allocator<int>> M;
|
|
typedef int V;
|
|
V ar[] =
|
|
{
|
|
1,
|
|
1,
|
|
1,
|
|
2,
|
|
2,
|
|
2,
|
|
3,
|
|
3,
|
|
3
|
|
};
|
|
M m;
|
|
m.insert(cpp17_input_iterator<const V*>(ar),
|
|
cpp17_input_iterator<const V*>(ar + sizeof(ar)/sizeof(ar[0])));
|
|
assert(m.size() == 3);
|
|
assert(*m.begin() == 1);
|
|
assert(*std::next(m.begin()) == 2);
|
|
assert(*std::next(m.begin(), 2) == 3);
|
|
}
|
|
#endif
|
|
|
|
return 0;
|
|
}
|