aboutsummaryrefslogtreecommitdiff
path: root/libcxx/test/std/containers/associative/set/emplace.pass.cpp
blob: e5a9f9590aad0b72b0c33b7e2dc9e5ddd944ad47 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//

// UNSUPPORTED: c++03

// <set>

// class set

// template <class... Args>
//   pair<iterator, bool> emplace(Args&&... args);

#include <cassert>
#include <set>

#include "../../Emplaceable.h"
#include "DefaultOnly.h"
#include "MoveOnly.h"
#include "min_allocator.h"

int main(int, char**) {
  {
    typedef std::set<DefaultOnly> M;
    typedef std::pair<M::iterator, bool> R;
    M m;
    assert(DefaultOnly::count == 0);
    R r = m.emplace();
    assert(r.second);
    assert(r.first == m.begin());
    assert(m.size() == 1);
    assert(*m.begin() == DefaultOnly());
    assert(DefaultOnly::count == 1);

    r = m.emplace();
    assert(!r.second);
    assert(r.first == m.begin());
    assert(m.size() == 1);
    assert(*m.begin() == DefaultOnly());
    assert(DefaultOnly::count == 1);
  }
  assert(DefaultOnly::count == 0);
  {
    typedef std::set<Emplaceable> M;
    typedef std::pair<M::iterator, bool> R;
    M m;
    R r = m.emplace();
    assert(r.second);
    assert(r.first == m.begin());
    assert(m.size() == 1);
    assert(*m.begin() == Emplaceable());
    r = m.emplace(2, 3.5);
    assert(r.second);
    assert(r.first == std::next(m.begin()));
    assert(m.size() == 2);
    assert(*r.first == Emplaceable(2, 3.5));
    r = m.emplace(2, 3.5);
    assert(!r.second);
    assert(r.first == std::next(m.begin()));
    assert(m.size() == 2);
    assert(*r.first == Emplaceable(2, 3.5));
  }
  {
    typedef std::set<int> M;
    typedef std::pair<M::iterator, bool> R;
    M m;
    R r = m.emplace(M::value_type(2));
    assert(r.second);
    assert(r.first == m.begin());
    assert(m.size() == 1);
    assert(*r.first == 2);
  }
  {
    typedef std::set<int, std::less<int>, min_allocator<int>> M;
    typedef std::pair<M::iterator, bool> R;
    M m;
    R r = m.emplace(M::value_type(2));
    assert(r.second);
    assert(r.first == m.begin());
    assert(m.size() == 1);
    assert(*r.first == 2);
  }
  { // We're unwrapping pairs for `{,multi}map`. Make sure we're not trying to do that for set.
    using Set = std::set<std::pair<MoveOnly, MoveOnly>>;
    Set set;
    auto res = set.emplace(std::pair<MoveOnly, MoveOnly>(2, 4));
    assert(std::get<1>(res));
    assert(set.begin() == std::get<0>(res));
  }

  return 0;
}