gatb.core-API-0.0.0
|
Bloom filter null implementation. More...
#include <Bloom.hpp>
Public Member Functions | |
virtual | ~BloomNull () |
u_int8_t *& | getArray () |
u_int64_t | getSize () |
u_int64_t | getBitSize () |
size_t | getNbHash () const |
virtual std::string | getName () const |
std::bitset< 4 > | contains4 (const Item &item, bool right) |
std::bitset< 8 > | contains8 (const Item &item) |
bool | contains (const Item &item) |
void | insert (const Item &item) |
void | flush () |
unsigned long | weight () |
Public Member Functions inherited from IBloom< Item > | |
virtual | ~IBloom () |
Public Member Functions inherited from Container< Item > | |
virtual | ~Container () |
Public Member Functions inherited from ISmartPointer | |
virtual | ~ISmartPointer () |
Public Member Functions inherited from Bag< Item > | |
virtual void | insert (const std::vector< Item > &items, size_t length=0) |
virtual void | insert (const Item *items, size_t length) |
Public Member Functions inherited from SmartPointer | |
void | use () |
void | forget () |
Additional Inherited Members | |
Protected Member Functions inherited from SmartPointer | |
SmartPointer () | |
virtual | ~SmartPointer () |
Bloom filter null implementation.
This is a "null" implementation of the IBloom interface. It means that all the contains-like requests will return false.
|
inlinevirtual |
Destructor.
|
inlinevirtual |
Tells whether an item is in the Bloom filter
[in] | item | : item to test. |
Implements IBloom< Item >.
|
inlinevirtual |
Tells whether the 4 neighbors of the given item are in the Bloom filter. The 4 neighbors are computed from the given item by adding successively nucleotides 'A', 'C', 'T' and 'G' Note: some implementation may not provide this service.
[in] | item | : starting item from which neighbors are computed. |
[in] | right | : if true, successors are computed, otherwise predecessors are computed. |
Implements IBloom< Item >.
|
inlinevirtual |
Tells whether the 8 neighbors of the given item are in the Bloom filter. A default implementation may be two calls to contains4 with right==true and right==left and by concatenating the two bitsets. Note: some implementation may not provide this service.
[in] | item | : starting item from which neighbors are computed. |
Implements IBloom< Item >.
|
inlinevirtual |
Flush the current content. May be useful for implementation that uses a cache.
Implements Bag< Item >.
|
inlinevirtual |
|
inlinevirtual |
Get the size of the Bloom filter (in bits).
Implements IBloom< Item >.
|
inlinevirtual |
|
inlinevirtual |
Get the number of hash functions used for the Bloom filter.
Implements IBloom< Item >.
|
inlinevirtual |
Get the size of the Bloom filter (in bytes).
Implements IBloom< Item >.
|
inlinevirtual |
|
inlinevirtual |
Return the number of 1's in the Bloom (nibble by nibble)
Implements IBloom< Item >.