blob: d807a7c7e2eafc1a26d04a5a1aead817b5fbdd0f [file] [log] [blame]
Eric Fiselier80e66ac2016-11-23 01:02:51 +00001// -*- C++ -*-
2//===----------------------------------------------------------------------===//
3//
4// The LLVM Compiler Infrastructure
5//
6// This file is dual licensed under the MIT and the University of Illinois Open
7// Source Licenses. See LICENSE.TXT for details.
8//
9//===----------------------------------------------------------------------===//
10
11// UNSUPPORTED: c++98, c++03, c++11, c++14
12
13// <variant>
14
15// template <class... Types> struct hash<variant<Types...>>;
16// template <> struct hash<monostate>;
17
18#include <cassert>
19#include <type_traits>
20#include <variant>
21
22#include "test_macros.h"
23#include "variant_test_helpers.hpp"
24
25#ifndef TEST_HAS_NO_EXCEPTIONS
26namespace std {
27template <> struct hash<::MakeEmptyT> {
Eric Fiselier0d3d8de2016-12-02 23:00:05 +000028 size_t operator()(const ::MakeEmptyT &) const {
Eric Fiselier80e66ac2016-11-23 01:02:51 +000029 assert(false);
30 return 0;
31 }
32};
33}
34#endif
35
36void test_hash_variant() {
37 {
38 using V = std::variant<int, long, int>;
39 using H = std::hash<V>;
40 const V v(std::in_place_index<0>, 42);
41 const V v_copy = v;
42 V v2(std::in_place_index<0>, 100);
Eric Fiselier80e66ac2016-11-23 01:02:51 +000043 const H h{};
44 assert(h(v) == h(v));
45 assert(h(v) != h(v2));
46 assert(h(v) == h(v_copy));
47 {
48 ASSERT_SAME_TYPE(decltype(h(v)), std::size_t);
49 static_assert(std::is_copy_constructible<H>::value, "");
50 }
51 }
52 {
53 using V = std::variant<std::monostate, int, long, const char *>;
54 using H = std::hash<V>;
55 const char *str = "hello";
56 const V v0;
57 const V v0_other;
58 const V v1(42);
59 const V v1_other(100);
60 V v2(100l);
61 V v2_other(999l);
62 V v3(str);
63 V v3_other("not hello");
64 const H h{};
65 assert(h(v0) == h(v0));
66 assert(h(v0) == h(v0_other));
67 assert(h(v1) == h(v1));
68 assert(h(v1) != h(v1_other));
69 assert(h(v2) == h(v2));
70 assert(h(v2) != h(v2_other));
71 assert(h(v3) == h(v3));
72 assert(h(v3) != h(v3_other));
73 assert(h(v0) != h(v1));
74 assert(h(v0) != h(v2));
75 assert(h(v0) != h(v3));
76 assert(h(v1) != h(v2));
77 assert(h(v1) != h(v3));
78 assert(h(v2) != h(v3));
79 }
80#ifndef TEST_HAS_NO_EXCEPTIONS
81 {
82 using V = std::variant<int, MakeEmptyT>;
83 using H = std::hash<V>;
84 V v;
85 makeEmpty(v);
86 V v2;
87 makeEmpty(v2);
88 const H h{};
89 assert(h(v) == h(v2));
90 }
91#endif
92}
93
94void test_hash_monostate() {
95 using H = std::hash<std::monostate>;
96 const H h{};
97 std::monostate m1{};
98 const std::monostate m2{};
99 assert(h(m1) == h(m1));
100 assert(h(m2) == h(m2));
101 assert(h(m1) == h(m2));
102 {
103 ASSERT_SAME_TYPE(decltype(h(m1)), std::size_t);
104 static_assert(std::is_copy_constructible<H>::value, "");
105 }
106}
107
Eric Fiselier918f32f2016-12-02 23:38:31 +0000108void test_hash_variant_duplicate_elements() {
109 // Test that the index of the alternative participates in the hash value.
110 using V = std::variant<std::monostate, std::monostate>;
111 using H = std::hash<V>;
112 H h{};
113 const V v1(std::in_place_index<0>);
114 const V v2(std::in_place_index<1>);
115 assert(h(v1) == h(v1));
116 assert(h(v2) == h(v2));
117 LIBCPP_ASSERT(h(v1) != h(v2));
118}
119
Eric Fiselier80e66ac2016-11-23 01:02:51 +0000120int main() {
121 test_hash_variant();
Eric Fiselier918f32f2016-12-02 23:38:31 +0000122 test_hash_variant_duplicate_elements();
Eric Fiselier80e66ac2016-11-23 01:02:51 +0000123 test_hash_monostate();
124}