aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
author251 <13120787+251Labs@users.noreply.github.com>2018-08-13 00:37:15 +0200
committer251 <13120787+251Labs@users.noreply.github.com>2018-08-13 01:24:55 +0200
commit265bd50884ac1984c08f0e5916256d5f12e655f5 (patch)
treec0605a4d89b82e0bd276013ae08eec90f7e59193
parent0df7a6c13ec484f9f31cfe3ed3039098a9bef124 (diff)
downloadbitcoin-265bd50884ac1984c08f0e5916256d5f12e655f5.tar.xz
Removes unsed `CBloomFilter` constructor.
This commit removes the `CBloomFilter::CBloomFilter(const unsigned int, const double, const unsigned int)` constructor, which became obsolete with 086ee67.
-rw-r--r--src/bloom.cpp11
-rw-r--r--src/bloom.h4
2 files changed, 0 insertions, 15 deletions
diff --git a/src/bloom.cpp b/src/bloom.cpp
index 24eebe2e3e..94aae742f1 100644
--- a/src/bloom.cpp
+++ b/src/bloom.cpp
@@ -38,17 +38,6 @@ CBloomFilter::CBloomFilter(const unsigned int nElements, const double nFPRate, c
{
}
-// Private constructor used by CRollingBloomFilter
-CBloomFilter::CBloomFilter(const unsigned int nElements, const double nFPRate, const unsigned int nTweakIn) :
- vData((unsigned int)(-1 / LN2SQUARED * nElements * log(nFPRate)) / 8),
- isFull(false),
- isEmpty(true),
- nHashFuncs((unsigned int)(vData.size() * 8 / nElements * LN2)),
- nTweak(nTweakIn),
- nFlags(BLOOM_UPDATE_NONE)
-{
-}
-
inline unsigned int CBloomFilter::Hash(unsigned int nHashNum, const std::vector<unsigned char>& vDataToHash) const
{
// 0xFBA4C795 chosen as it guarantees a reasonable bit difference between nHashNum values.
diff --git a/src/bloom.h b/src/bloom.h
index e136fcebfc..7d3aa878b0 100644
--- a/src/bloom.h
+++ b/src/bloom.h
@@ -53,10 +53,6 @@ private:
unsigned int Hash(unsigned int nHashNum, const std::vector<unsigned char>& vDataToHash) const;
- // Private constructor for CRollingBloomFilter, no restrictions on size
- CBloomFilter(const unsigned int nElements, const double nFPRate, const unsigned int nTweak);
- friend class CRollingBloomFilter;
-
public:
/**
* Creates a new bloom filter which will provide the given fp rate when filled with the given number of elements