3b966c1fe9
We shouldn't be calling `prev` 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 `prev` in particular. Reviewed as part of D119860.
69 lines
1.5 KiB
C++
69 lines
1.5 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
|
|
|
|
// pair<iterator, bool> insert(const value_type& v);
|
|
|
|
#include <set>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "min_allocator.h"
|
|
|
|
template<class Container>
|
|
void do_insert_cv_test()
|
|
{
|
|
typedef Container M;
|
|
typedef std::pair<typename M::iterator, bool> R;
|
|
typedef typename M::value_type VT;
|
|
M m;
|
|
|
|
const VT v1(2);
|
|
R r = m.insert(v1);
|
|
assert(r.second);
|
|
assert(r.first == m.begin());
|
|
assert(m.size() == 1);
|
|
assert(*r.first == 2);
|
|
|
|
const VT v2(1);
|
|
r = m.insert(v2);
|
|
assert(r.second);
|
|
assert(r.first == m.begin());
|
|
assert(m.size() == 2);
|
|
assert(*r.first == 1);
|
|
|
|
const VT v3(3);
|
|
r = m.insert(v3);
|
|
assert(r.second);
|
|
assert(r.first == std::prev(m.end()));
|
|
assert(m.size() == 3);
|
|
assert(*r.first == 3);
|
|
|
|
r = m.insert(v3);
|
|
assert(!r.second);
|
|
assert(r.first == std::prev(m.end()));
|
|
assert(m.size() == 3);
|
|
assert(*r.first == 3);
|
|
}
|
|
|
|
int main(int, char**)
|
|
{
|
|
do_insert_cv_test<std::set<int> >();
|
|
#if TEST_STD_VER >= 11
|
|
{
|
|
typedef std::set<int, std::less<int>, min_allocator<int>> M;
|
|
do_insert_cv_test<M>();
|
|
}
|
|
#endif
|
|
|
|
return 0;
|
|
}
|