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
|
/* Copyright 2025 Joaquin M Lopez Munoz.
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*
* See https://www.boost.org/libs/bloom for library home page.
*/
#include <array>
#include <boost/core/lightweight_test.hpp>
#include <boost/mp11/algorithm.hpp>
#include <utility>
#include "test_types.hpp"
#include "test_utilities.hpp"
using namespace test_utilities;
template<typename T>
struct multiarg_constructed
{
multiarg_constructed()=default;
template<typename Arg1,typename Arg2,typename... Args>
multiarg_constructed(Arg1&& arg,Arg2&&,Args&&...):
x{std::forward<Arg1>(arg)}{}
multiarg_constructed(const multiarg_constructed&)=delete;
multiarg_constructed(multiarg_constructed&&)=delete;
multiarg_constructed& operator=(const multiarg_constructed&)=default;
operator const T&()const{return x;}
T x;
};
template<typename Functor>
struct transparent:Functor
{
using is_transparent=void;
using Functor::Functor;
};
template<typename Filter,typename ValueFactory>
void test_insertion()
{
using filter=rehash_filter<
revalue_filter<Filter,multiarg_constructed<typename Filter::value_type>>,
transparent<typename Filter::hasher>
>;
using value_type=typename filter::value_type;
ValueFactory fac;
{
filter f(10000);
value_type x{fac(),0};
f.insert(const_cast<value_type&>(x));
BOOST_TEST(f.may_contain(x));
}
{
filter f(10000);
value_type x{fac(),0};
f.insert(std::move(x));
BOOST_TEST(f.may_contain(x));
}
{
filter f(10000);
auto x=fac();
f.insert(x); /* transparent insert */
BOOST_TEST(f.may_contain(x));
}
{
filter f(10000);
std::array<value_type,10> input;
for(auto& x:input)x={fac(),0};
f.insert(input.begin(),input.end());
BOOST_TEST(may_contain(f,input));
}
{
filter f(10000);
std::array<decltype(fac()),10> input;
for(auto& x:input)x=fac();
f.insert(input.begin(),input.end()); /* transparent insert */
BOOST_TEST(may_contain(f,input));
}
{
filter f(10000);
std::initializer_list<value_type> il={{fac(),0},{fac(),0},{fac(),0}};
f.insert(il);
BOOST_TEST(may_contain(f,il));
}
}
struct lambda
{
template<typename T>
void operator()(T)
{
using filter=typename T::type;
using value_type=typename filter::value_type;
test_insertion<filter,value_factory<value_type>>();
}
};
int main()
{
boost::mp11::mp_for_each<identity_test_types>(lambda{});
return boost::report_errors();
}
|
