File: test_transparent_unordered.h

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-6~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 1,418,812 kB
  • sloc: cpp: 5,290,827; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,900; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,892; xml: 953; cs: 573; fortran: 539
file content (136 lines) | stat: -rw-r--r-- 4,837 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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//

#ifndef TEST_TRANSPARENT_UNORDERED_H
#define TEST_TRANSPARENT_UNORDERED_H

#include "test_macros.h"
#include "is_transparent.h"

#include <cassert>

// testing transparent unordered containers
#if TEST_STD_VER > 17

template <template <typename...> class UnorderedSet, typename Hash,
          typename Equal>
using unord_set_type = UnorderedSet<StoredType<int>, Hash, Equal>;

template <template <typename...> class UnorderedMap, typename Hash,
          typename Equal>
using unord_map_type = UnorderedMap<StoredType<int>, int, Hash, Equal>;

template <typename Container, typename... Args>
void test_transparent_find(Args&&... args) {
  Container c{std::forward<Args>(args)...};
  int conversions = 0;
  assert(c.find(SearchedType<int>(1, &conversions)) != c.end());
  assert(c.find(SearchedType<int>(2, &conversions)) != c.end());
  assert(conversions == 0);
  assert(c.find(SearchedType<int>(3, &conversions)) == c.end());
  assert(conversions == 0);
}

template <typename Container, typename... Args>
void test_non_transparent_find(Args&&... args) {
  Container c{std::forward<Args>(args)...};
  int conversions = 0;
  assert(c.find(SearchedType<int>(1, &conversions)) != c.end());
  assert(conversions > 0);
  conversions = 0;
  assert(c.find(SearchedType<int>(2, &conversions)) != c.end());
  assert(conversions > 0);
  conversions = 0;
  assert(c.find(SearchedType<int>(3, &conversions)) == c.end());
  assert(conversions > 0);
}

template <typename Container, typename... Args>
void test_transparent_count(Args&&... args) {
  Container c{std::forward<Args>(args)...};
  int conversions = 0;
  assert(c.count(SearchedType<int>(1, &conversions)) > 0);
  assert(c.count(SearchedType<int>(2, &conversions)) > 0);
  assert(conversions == 0);
  assert(c.count(SearchedType<int>(3, &conversions)) == 0);
  assert(conversions == 0);
}

template <typename Container, typename... Args>
void test_non_transparent_count(Args&&... args) {
  Container c{std::forward<Args>(args)...};
  int conversions = 0;
  assert(c.count(SearchedType<int>(1, &conversions)) > 0);
  assert(conversions > 0);
  conversions = 0;
  assert(c.count(SearchedType<int>(2, &conversions)) > 0);
  assert(conversions > 0);
  conversions = 0;
  assert(c.count(SearchedType<int>(3, &conversions)) == 0);
  assert(conversions > 0);
}

template <typename Container, typename... Args>
void test_transparent_contains(Args&&... args) {
  Container c{std::forward<Args>(args)...};
  int conversions = 0;
  assert(c.contains(SearchedType<int>(1, &conversions)));
  assert(c.contains(SearchedType<int>(2, &conversions)));
  assert(conversions == 0);
  assert(!c.contains(SearchedType<int>(3, &conversions)));
  assert(conversions == 0);
}

template <typename Container, typename... Args>
void test_non_transparent_contains(Args&&... args) {
  Container c{std::forward<Args>(args)...};
  int conversions = 0;
  assert(c.contains(SearchedType<int>(1, &conversions)));
  assert(conversions > 0);
  conversions = 0;
  assert(c.contains(SearchedType<int>(2, &conversions)));
  assert(conversions > 0);
  conversions = 0;
  assert(!c.contains(SearchedType<int>(3, &conversions)));
  assert(conversions > 0);
}

template <typename Container, typename... Args>
void test_transparent_equal_range(Args&&... args) {
  Container c{std::forward<Args>(args)...};
  int conversions = 0;
  auto iters = c.equal_range(SearchedType<int>(1, &conversions));
  assert(std::distance(iters.first, iters.second) > 0);
  iters = c.equal_range(SearchedType<int>(2, &conversions));
  assert(std::distance(iters.first, iters.second) > 0);
  assert(conversions == 0);
  iters = c.equal_range(SearchedType<int>(3, &conversions));
  assert(std::distance(iters.first, iters.second) == 0);
  assert(conversions == 0);
}

template <typename Container, typename... Args>
void test_non_transparent_equal_range(Args&&... args) {
  Container c{std::forward<Args>(args)...};
  int conversions = 0;
  auto iters = c.equal_range(SearchedType<int>(1, &conversions));
  assert(std::distance(iters.first, iters.second) > 0);
  assert(conversions > 0);
  conversions = 0;
  iters = c.equal_range(SearchedType<int>(2, &conversions));
  assert(std::distance(iters.first, iters.second) > 0);
  assert(conversions > 0);
  conversions = 0;
  iters = c.equal_range(SearchedType<int>(3, &conversions));
  assert(std::distance(iters.first, iters.second) == 0);
  assert(conversions > 0);
}

#endif // TEST_STD_VER > 17

#endif // TEST_TRANSPARENT_UNORDERED_H