| 46 | } |
| 47 | |
| 48 | void CBloomFilter::insert(const vector<unsigned char>& vKey) |
| 49 | { |
| 50 | if (isFull) |
| 51 | return; |
| 52 | for (unsigned int i = 0; i < nHashFuncs; i++) { |
| 53 | unsigned int nIndex = Hash(i, vKey); |
| 54 | // Sets bit nIndex of vData |
| 55 | vData[nIndex >> 3] |= (1 << (7 & nIndex)); |
| 56 | } |
| 57 | isEmpty = false; |
| 58 | } |
| 59 | |
| 60 | void CBloomFilter::insert(const COutPoint& outpoint) |
| 61 | { |
no test coverage detected