2
0
mirror of https://github.com/boostorg/bloom.git synced 2026-01-19 16:12:10 +00:00
Files
bloom/test/test_array.cpp
joaquintides e9cfb2318c added array (#4)
* added data

* stylistic

* replaced data() with span-returning array()

* removed pass:[...] in listing

* editorial/typos
2025-04-08 16:47:59 +02:00

66 lines
1.6 KiB
C++

/* 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 <boost/core/lightweight_test.hpp>
#include <boost/mp11/algorithm.hpp>
#include <climits>
#include <cstring>
#include "test_types.hpp"
#include "test_utilities.hpp"
using namespace test_utilities;
template<typename Filter,typename ValueFactory>
void test_array()
{
using filter=Filter;
ValueFactory fac;
{
filter f;
const filter& cf=f;
BOOST_TEST_EQ(f.array().size(),0);
BOOST_TEST_EQ(f.array().data(),cf.array().data());
BOOST_TEST_EQ(f.array().size(),cf.array().size());
}
{
filter f(1000);
const filter& cf=f;
BOOST_TEST_NE(f.array().data(),nullptr);
BOOST_TEST_EQ(f.array().size(),f.capacity()/CHAR_BIT);
BOOST_TEST_EQ(f.array().data(),cf.array().data());
BOOST_TEST_EQ(f.array().size(),cf.array().size());
}
{
filter f1(1000),f2(1000);
for(int i=0;i<10;++i)f1.insert(fac());
std::memcpy(f2.array().data(),f1.array().data(),f1.array().size());
BOOST_TEST_NE(f1.array().data(),f2.array().data());
BOOST_TEST(f1==f2);
}
}
struct lambda
{
template<typename T>
void operator()(T)
{
using filter=typename T::type;
using value_type=typename filter::value_type;
test_array<filter,value_factory<value_type>>();
}
};
int main()
{
boost::mp11::mp_for_each<identity_test_types>(lambda{});
return boost::report_errors();
}