GHC 9.14.1 · lts/ghc-9.14.x · 7a6c33e · 2026-10-12
Modulehedis-0.16.4Haskell2010
BFInfobfInfoCapacity :: IntegerNumber of unique items that can be stored before scaling is required.
bfInfoSize :: IntegerNumber of bytes allocated for the Bloom filter.
bfInfoFilters :: IntegerNumber of sub-filters.
bfInfoItems :: IntegerNumber of unique inserted items detected by the filter.
bfInfoExpansion :: IntegerExpansion rate used when a new sub-filter is created.
BFReserveOptsbfReserveExpansion :: Maybe IntegerExpansion rate for newly created sub-filters once capacity is reached.
bfReserveNonScaling :: BoolPrevent creation of additional sub-filters when initial capacity is reached.
Eq BFReserveOptsDefined in hedis-0.16.4 · Database.Redis.ManualCommands.BFShow BFReserveOptsDefined in hedis-0.16.4 · Database.Redis.ManualCommands.BFBFInsertOptsbfInsertCapacity :: Maybe IntegerInitial capacity to use if a new filter is created.
bfInsertError :: Maybe DoubleDesired false positive probability to use if a new filter is created.
bfInsertExpansion :: Maybe IntegerExpansion rate for additional sub-filters.
bfInsertNoCreate :: BoolReturn an error instead of creating the filter when the key does not exist.
bfInsertNonScaling :: BoolPrevent creation of additional sub-filters when capacity is reached.
Eq BFInsertOptsDefined in hedis-0.16.4 · Database.Redis.ManualCommands.BFShow BFInsertOptsDefined in hedis-0.16.4 · Database.Redis.ManualCommands.BFbfadd :: RedisCtx m f=> ByteStringKey of the Bloom filter.
-> ByteStringItem to add to the Bloom filter.
-> m (f Bool)Adds an item to a Bloom filter (https://redis.io/commands/bf.add).
A filter is created automatically if the key does not exist.
O(k), where k is the number of hash functions used by the last sub-filter.
Since RedisBloom 1.0.0
Returns the cardinality of a Bloom filter (https://redis.io/commands/bf.card).
Returns 0 when the key does not exist.
O(1)
Since RedisBloom 2.4.4
bfexists :: RedisCtx m f=> ByteStringKey of the Bloom filter.
-> ByteStringItem to check.
-> m (f Bool)Determines whether an item was added to a Bloom filter (https://redis.io/commands/bf.exists).
Returns False when the key does not exist or the item was definitely not added.
O(k), where $k$ is the number of hash functions used by the last sub-filter.
Since RedisBloom 1.0.0
Returns information about a Bloom filter (https://redis.io/commands/bf.info).
O(1)
Since RedisBloom 1.0.0
Returns the configured capacity of a Bloom filter (https://redis.io/commands/bf.info).
O(1)
Since RedisBloom 1.0.0
Returns the size in bytes of a Bloom filter (https://redis.io/commands/bf.info).
O(1)
Since RedisBloom 1.0.0
Returns the number of sub-filters in a Bloom filter (https://redis.io/commands/bf.info).
O(1)
Since RedisBloom 1.0.0
Returns the number of unique inserted items detected by a Bloom filter (https://redis.io/commands/bf.info).
O(1)
Since RedisBloom 1.0.0
Returns the expansion rate of a Bloom filter (https://redis.io/commands/bf.info).
O(1)
Returns Nothing for the non scaling filters.
Since RedisBloom 1.0.0
bfinsert :: RedisCtx m f=> ByteStringKey of the Bloom filter.
-> NonEmpty ByteStringItems to add.
-> m (f [Bool])Adds one or more items to a Bloom filter, creating it when needed (https://redis.io/commands/bf.insert).
This is equivalent to inserting with default options and automatic creation enabled.
O(kn), where k is the number of hash functions and n is the number of items.
Since RedisBloom 1.0.0
bfinsertOpts :: RedisCtx m f=> ByteStringKey of the Bloom filter.
-> NonEmpty ByteStringItems to add.
-> BFInsertOptsOptional creation and scaling parameters.
-> m (f [Bool])Adds one or more items to a Bloom filter, creating it when needed (https://redis.io/commands/bf.insert).
O(kn), where k is the number of hash functions and n is the number of items.
Since RedisBloom 1.0.0
bfmadd :: RedisCtx m f=> ByteStringKey of the Bloom filter.
-> NonEmpty ByteStringItems to add.
-> m (f [Bool])Adds one or more items to a Bloom filter (https://redis.io/commands/bf.madd).
A filter is created automatically if the key does not exist.
O(kn), where k is the number of hash functions and n is the number of items.
Since RedisBloom 1.0.0
bfmexists :: RedisCtx m f=> ByteStringKey of the Bloom filter.
-> NonEmpty ByteStringItems to check.
-> m (f [Bool])Checks whether one or more items were added to a Bloom filter (https://redis.io/commands/bf.mexists).
A False result means the item is definitely absent, or the key does not exist.
O(kn), where k is the number of hash functions and n is the number of items.
Since RedisBloom 1.0.0
bfreserve :: RedisCtx m f=> ByteStringKey of the Bloom filter to create.
-> DoubleDesired false positive probability, between 0 and 1.
-> IntegerInitial capacity.
-> m (f Status)Creates an empty Bloom filter (https://redis.io/commands/bf.reserve).
The filter will fail if the key already exists.
O(1)
Since RedisBloom 1.0.0
bfreserveOpts :: RedisCtx m f=> ByteStringKey of the Bloom filter to create.
-> DoubleDesired false positive probability, between 0 and 1.
-> IntegerInitial capacity.
-> BFReserveOptsScaling options for the reserved filter.
-> m (f Status)