Peerplays_Blockchain/peerplays-fc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Removed unused reflection

Browse source
This commit is contained in:
Peter Conrad 2019-11-06 15:49:16 +01:00
parent 1d59bb3d47
commit cdbe881996
1 changed files with 1 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
include/fc/bloom_filter.hpp
View file

@ -28,11 +28,8 @@
#include <string> #include <string>
#include <vector> #include <vector>
#include <fc/reflect/reflect.hpp>
namespace fc { namespace fc {
static constexpr std::size_t bits_per_char = 0x08; // 8 bits in 1 char(unsigned) static constexpr std::size_t bits_per_char = 0x08; // 8 bits in 1 char(unsigned)
static const unsigned char bit_mask[bits_per_char] = { static const unsigned char bit_mask[bits_per_char] = {
@ -660,15 +657,9 @@ inline bloom_filter operator ^ (const bloom_filter& a, const bloom_filter& b)
} // namespace fc } // namespace fc
FC_REFLECT( fc::bloom_filter, (salt_)(bit_table_)(salt_count_)(table_size_)(projected_element_count_)
(inserted_element_count_)(random_seed_)(desired_false_positive_probability_) )
FC_REFLECT( fc::bloom_parameters::optimal_parameters_t, (number_of_hashes)(table_size) )
FC_REFLECT( fc::bloom_parameters, (minimum_size)(maximum_size)(minimum_number_of_hashes)
(maximum_number_of_hashes)(projected_element_count)
(false_positive_probability)(random_seed)(optimal_parameters) )
#endif #endif
/* /*
Note 1: Note 1:
If it can be guaranteed that bits_per_char will be of the form 2^n then If it can be guaranteed that bits_per_char will be of the form 2^n then