File: count.pass.cpp

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 1,998,492 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (89 lines) | stat: -rw-r--r-- 2,120 bytes parent folder | download | duplicates (9)
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
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//

// <map>

// class map

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

#include <map>
#include <cassert>

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

#if TEST_STD_VER >= 11
template <class T>
struct FinalCompare final {
  bool operator()(const T& x, const T& y) const { return x < y; }
};
#endif

template <class Map, class ArgType = typename Map::key_type>
void test() {
  typedef typename Map::value_type V;
  typedef typename Map::size_type R;

  V ar[] = {V(5, 5), V(6, 6), V(7, 7), V(8, 8), V(9, 9), V(10, 10), V(11, 11), V(12, 12)};

  const Map m(ar, ar + sizeof(ar) / sizeof(ar[0]));

  for (int i = 0; i < 5; ++i) {
    R r = m.count(ArgType(i));
    assert(r == 0);
  }

  for (int i = 5; i < 13; ++i) {
    R r = m.count(ArgType(i));
    assert(r == 1);
  }
}

int main(int, char**) {
  test<std::map<int, double> >();
#if TEST_STD_VER >= 11
  typedef std::pair<const int, double> V;
  test<std::map<int, double, std::less<int>, min_allocator<V>>>();
  test<std::map<int, double, FinalCompare<int>>>();
#endif
#if TEST_STD_VER >= 14
  typedef std::map<int, double, std::less<>> TM;
  test<TM>();
  test<TM, C2Int>();

  {
    typedef PrivateConstructor PC;
    typedef std::map<PC, double, std::less<> > M;
    typedef M::size_type R;

    M m;
    m[PC::make(5)]  = 5;
    m[PC::make(6)]  = 6;
    m[PC::make(7)]  = 7;
    m[PC::make(8)]  = 8;
    m[PC::make(9)]  = 9;
    m[PC::make(10)] = 10;
    m[PC::make(11)] = 11;
    m[PC::make(12)] = 12;

    for (int i = 0; i < 5; ++i) {
      R r = m.count(i);
      assert(r == 0);
    }

    for (int i = 5; i < 13; ++i) {
      R r = m.count(i);
      assert(r == 1);
    }
  }
#endif // TEST_STD_VER >= 14
  return 0;
}