aboutsummaryrefslogtreecommitdiff
path: root/libcxx/test/std/containers/associative/set/iterator.pass.cpp
blob: 1a18cbc42647855d963b3ee25b7589aec3bbec5f (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
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
123
124
125
126
127
128
129
130
131
132
133
//===----------------------------------------------------------------------===//
//
// 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 begin();
// const_iterator begin() const;
//       iterator end();
// const_iterator end()   const;
//
//       reverse_iterator rbegin();
// const_reverse_iterator rbegin() const;
//       reverse_iterator rend();
// const_reverse_iterator rend()   const;
//
// const_iterator         cbegin()  const;
// const_iterator         cend()    const;
// const_reverse_iterator crbegin() const;
// const_reverse_iterator crend()   const;

#include <set>
#include <cassert>
#include <cstddef>

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

int main(int, char**) {
  {
    typedef int V;
    V ar[] = {1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8};
    std::set<int> m(ar, ar + sizeof(ar) / sizeof(ar[0]));
    assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size());
    assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size());
    std::set<int>::iterator i;
    i                               = m.begin();
    std::set<int>::const_iterator k = i;
    assert(i == k);
    for (int j = 1; j <= static_cast<int>(m.size()); ++j, ++i)
      assert(*i == j);
    assert(i == m.end());
    for (int j = static_cast<int>(m.size()); j >= 1; --j) {
      --i;
      assert(*i == j);
    }
    assert(i == m.begin());
  }
  {
    typedef int V;
    V ar[] = {1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8};
    const std::set<int> m(ar, ar + sizeof(ar) / sizeof(ar[0]));
    assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size());
    assert(static_cast<std::size_t>(std::distance(m.cbegin(), m.cend())) == m.size());
    assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size());
    assert(static_cast<std::size_t>(std::distance(m.crbegin(), m.crend())) == m.size());
    std::set<int>::const_iterator i;
    i = m.begin();
    for (int j = 1; j <= static_cast<int>(m.size()); ++j, ++i)
      assert(*i == j);
    assert(i == m.end());
    for (int j = static_cast<int>(m.size()); j >= 1; --j) {
      --i;
      assert(*i == j);
    }
    assert(i == m.begin());
  }
#if TEST_STD_VER >= 11
  {
    typedef int V;
    V ar[] = {1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8};
    std::set<int, std::less<int>, min_allocator<int>> m(ar, ar + sizeof(ar) / sizeof(ar[0]));
    assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size());
    assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size());
    std::set<int, std::less<int>, min_allocator<int>>::iterator i;
    i                                                                   = m.begin();
    std::set<int, std::less<int>, min_allocator<int>>::const_iterator k = i;
    assert(i == k);
    for (int j = 1; j <= static_cast<int>(m.size()); ++j, ++i)
      assert(*i == j);
    assert(i == m.end());
    for (int j = static_cast<int>(m.size()); j >= 1; --j) {
      --i;
      assert(*i == j);
    }
    assert(i == m.begin());
  }
  {
    typedef int V;
    V ar[] = {1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8};
    const std::set<int, std::less<int>, min_allocator<int>> m(ar, ar + sizeof(ar) / sizeof(ar[0]));
    assert(static_cast<std::size_t>(std::distance(m.begin(), m.end())) == m.size());
    assert(static_cast<std::size_t>(std::distance(m.cbegin(), m.cend())) == m.size());
    assert(static_cast<std::size_t>(std::distance(m.rbegin(), m.rend())) == m.size());
    assert(static_cast<std::size_t>(std::distance(m.crbegin(), m.crend())) == m.size());
    std::set<int, std::less<int>, min_allocator<int>>::const_iterator i;
    i = m.begin();
    for (int j = 1; j <= static_cast<int>(m.size()); ++j, ++i)
      assert(*i == j);
    assert(i == m.end());
    for (int j = static_cast<int>(m.size()); j >= 1; --j) {
      --i;
      assert(*i == j);
    }
    assert(i == m.begin());
  }
#endif
#if TEST_STD_VER > 11
  { // N3644 testing
    typedef std::set<int> C;
    C::iterator ii1{}, ii2{};
    C::iterator ii4 = ii1;
    C::const_iterator cii{};
    assert(ii1 == ii2);
    assert(ii1 == ii4);

    assert(!(ii1 != ii2));

    assert((ii1 == cii));
    assert((cii == ii1));
    assert(!(ii1 != cii));
    assert(!(cii != ii1));
  }
#endif

  return 0;
}