File: erase_iter_iter.pass.cpp

package info (click to toggle)
llvm-toolchain-21 1%3A21.1.7-1
  • links: PTS, VCS
  • area: main
  • in suites: forky
  • size: 2,245,064 kB
  • sloc: cpp: 7,619,731; ansic: 1,434,018; asm: 1,058,748; python: 252,740; f90: 94,671; objc: 70,685; lisp: 42,813; pascal: 18,401; sh: 8,601; ml: 5,111; perl: 4,720; makefile: 3,676; awk: 3,523; javascript: 2,409; xml: 892; fortran: 770
file content (122 lines) | stat: -rw-r--r-- 4,146 bytes parent folder | download | duplicates (3)
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
//===----------------------------------------------------------------------===//
//
// 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

// iterator erase(const_iterator first, const_iterator last);

#include <set>
#include <cassert>

#include "test_macros.h"
#include "min_allocator.h"

int main(int, char**) {
  {
    typedef std::set<int> M;
    typedef int V;
    typedef M::iterator I;
    V ar[] = {1, 2, 3, 4, 5, 6, 7, 8};
    M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
    assert(m.size() == 8);
    I i = m.erase(std::next(m.cbegin(), 5), std::next(m.cbegin(), 5));
    assert(m.size() == 8);
    assert(i == std::next(m.begin(), 5));
    assert(*std::next(m.begin(), 0) == 1);
    assert(*std::next(m.begin(), 1) == 2);
    assert(*std::next(m.begin(), 2) == 3);
    assert(*std::next(m.begin(), 3) == 4);
    assert(*std::next(m.begin(), 4) == 5);
    assert(*std::next(m.begin(), 5) == 6);
    assert(*std::next(m.begin(), 6) == 7);
    assert(*std::next(m.begin(), 7) == 8);

    i = m.erase(std::next(m.cbegin(), 3), std::next(m.cbegin(), 4));
    assert(m.size() == 7);
    assert(i == std::next(m.begin(), 3));
    assert(*std::next(m.begin(), 0) == 1);
    assert(*std::next(m.begin(), 1) == 2);
    assert(*std::next(m.begin(), 2) == 3);
    assert(*std::next(m.begin(), 3) == 5);
    assert(*std::next(m.begin(), 4) == 6);
    assert(*std::next(m.begin(), 5) == 7);
    assert(*std::next(m.begin(), 6) == 8);

    i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 5));
    assert(m.size() == 4);
    assert(i == std::next(m.begin(), 2));
    assert(*std::next(m.begin(), 0) == 1);
    assert(*std::next(m.begin(), 1) == 2);
    assert(*std::next(m.begin(), 2) == 7);
    assert(*std::next(m.begin(), 3) == 8);

    i = m.erase(std::next(m.cbegin(), 0), std::next(m.cbegin(), 2));
    assert(m.size() == 2);
    assert(i == std::next(m.begin(), 0));
    assert(*std::next(m.begin(), 0) == 7);
    assert(*std::next(m.begin(), 1) == 8);

    i = m.erase(m.cbegin(), m.cend());
    assert(m.size() == 0);
    assert(i == m.end());
  }
#if TEST_STD_VER >= 11
  {
    typedef std::set<int, std::less<int>, min_allocator<int>> M;
    typedef int V;
    typedef M::iterator I;
    V ar[] = {1, 2, 3, 4, 5, 6, 7, 8};
    M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
    assert(m.size() == 8);
    I i = m.erase(std::next(m.cbegin(), 5), std::next(m.cbegin(), 5));
    assert(m.size() == 8);
    assert(i == std::next(m.begin(), 5));
    assert(*std::next(m.begin(), 0) == 1);
    assert(*std::next(m.begin(), 1) == 2);
    assert(*std::next(m.begin(), 2) == 3);
    assert(*std::next(m.begin(), 3) == 4);
    assert(*std::next(m.begin(), 4) == 5);
    assert(*std::next(m.begin(), 5) == 6);
    assert(*std::next(m.begin(), 6) == 7);
    assert(*std::next(m.begin(), 7) == 8);

    i = m.erase(std::next(m.cbegin(), 3), std::next(m.cbegin(), 4));
    assert(m.size() == 7);
    assert(i == std::next(m.begin(), 3));
    assert(*std::next(m.begin(), 0) == 1);
    assert(*std::next(m.begin(), 1) == 2);
    assert(*std::next(m.begin(), 2) == 3);
    assert(*std::next(m.begin(), 3) == 5);
    assert(*std::next(m.begin(), 4) == 6);
    assert(*std::next(m.begin(), 5) == 7);
    assert(*std::next(m.begin(), 6) == 8);

    i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 5));
    assert(m.size() == 4);
    assert(i == std::next(m.begin(), 2));
    assert(*std::next(m.begin(), 0) == 1);
    assert(*std::next(m.begin(), 1) == 2);
    assert(*std::next(m.begin(), 2) == 7);
    assert(*std::next(m.begin(), 3) == 8);

    i = m.erase(std::next(m.cbegin(), 0), std::next(m.cbegin(), 2));
    assert(m.size() == 2);
    assert(i == std::next(m.begin(), 0));
    assert(*std::next(m.begin(), 0) == 7);
    assert(*std::next(m.begin(), 1) == 8);

    i = m.erase(m.cbegin(), m.cend());
    assert(m.size() == 0);
    assert(i == m.end());
  }
#endif

  return 0;
}