aboutsummaryrefslogtreecommitdiff
path: root/libcxx/test/std/containers/associative/multiset/count.pass.cpp
blob: 6ad96b232083cab53137579680031b011e57fd76 (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
//===----------------------------------------------------------------------===//
//
// 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 multiset

// size_type count(const key_type& k) const;

#include <set>
#include <cassert>

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

int main(int, char**) {
  {
    typedef int V;
    typedef std::multiset<int> M;
    {
      typedef M::size_type R;
      V ar[] = {5, 5, 5, 5, 7, 7, 7, 9, 9};
      const M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
      R r = m.count(4);
      assert(r == 0);
      r = m.count(5);
      assert(r == 4);
      r = m.count(6);
      assert(r == 0);
      r = m.count(7);
      assert(r == 3);
      r = m.count(8);
      assert(r == 0);
      r = m.count(9);
      assert(r == 2);
      r = m.count(10);
      assert(r == 0);
    }
  }
#if TEST_STD_VER >= 11
  {
    typedef int V;
    typedef std::multiset<int, std::less<int>, min_allocator<int>> M;
    {
      typedef M::size_type R;
      V ar[] = {5, 5, 5, 5, 7, 7, 7, 9, 9};
      const M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
      R r = m.count(4);
      assert(r == 0);
      r = m.count(5);
      assert(r == 4);
      r = m.count(6);
      assert(r == 0);
      r = m.count(7);
      assert(r == 3);
      r = m.count(8);
      assert(r == 0);
      r = m.count(9);
      assert(r == 2);
      r = m.count(10);
      assert(r == 0);
    }
  }
#endif
#if TEST_STD_VER > 11
  {
    typedef int V;
    typedef std::multiset<int, std::less<>> M;
    typedef M::size_type R;
    V ar[] = {5, 5, 5, 5, 7, 7, 7, 9, 9};
    const M m(ar, ar + sizeof(ar) / sizeof(ar[0]));
    R r = m.count(4);
    assert(r == 0);
    r = m.count(5);
    assert(r == 4);
    r = m.count(6);
    assert(r == 0);
    r = m.count(7);
    assert(r == 3);
    r = m.count(8);
    assert(r == 0);
    r = m.count(9);
    assert(r == 2);
    r = m.count(10);
    assert(r == 0);
  }

  {
    typedef PrivateConstructor V;
    typedef std::multiset<V, std::less<>> M;
    typedef M::size_type R;

    M m;
    m.insert(V::make(5));
    m.insert(V::make(5));
    m.insert(V::make(5));
    m.insert(V::make(5));
    m.insert(V::make(7));
    m.insert(V::make(7));
    m.insert(V::make(7));
    m.insert(V::make(9));
    m.insert(V::make(9));

    R r = m.count(4);
    assert(r == 0);
    r = m.count(5);
    assert(r == 4);
    r = m.count(6);
    assert(r == 0);
    r = m.count(7);
    assert(r == 3);
    r = m.count(8);
    assert(r == 0);
    r = m.count(9);
    assert(r == 2);
    r = m.count(10);
    assert(r == 0);
  }
#endif

  return 0;
}