K - Key type.V - Value type.public interface RedisBloomFilterReactiveCommands<K,V>
| Modifier and Type | Method and Description |
|---|---|
reactor.core.publisher.Mono<Boolean> |
bfAdd(K key,
V value)
Add an item to the Bloom Filter.
|
reactor.core.publisher.Mono<Long> |
bfCard(K key)
Get the number of items added and detected as unique in the Bloom Filter.
|
reactor.core.publisher.Mono<Boolean> |
bfExists(K key,
V value)
Check if an item exists in the Bloom Filter.
|
reactor.core.publisher.Mono<BfInfoValue> |
bfInfo(K key)
Get information about the Bloom Filter.
|
reactor.core.publisher.Flux<Value<Boolean>> |
bfInsert(K key,
BfInsertArgs insertArgs,
V... values)
Add one or more items to the Bloom Filter.
|
reactor.core.publisher.Flux<Value<Boolean>> |
bfInsert(K key,
BfInsertArgs insertArgs,
V value)
Add an item to the Bloom Filter.
|
reactor.core.publisher.Flux<Value<Boolean>> |
bfInsert(K key,
V... values)
Add one or more items to the Bloom Filter.
|
reactor.core.publisher.Flux<Value<Boolean>> |
bfInsert(K key,
V value)
Add an item to the Bloom Filter.
|
reactor.core.publisher.Mono<String> |
bfLoadChunk(K key,
long iterator,
byte[] data)
Restores a Bloom filter previously saved using BF.SCANDUMP.
|
reactor.core.publisher.Flux<Value<Boolean>> |
bfMAdd(K key,
V... values)
Add one or more items to the Bloom Filter.
|
reactor.core.publisher.Flux<Boolean> |
bfMExists(K key,
V... values)
Check if one or more items exist in the filter.
|
reactor.core.publisher.Mono<String> |
bfReserve(K key,
double errorRate,
long capacity)
Creates an empty Bloom filter with a single sub-filter for the initial specified capacity and with an upper bound error
rate.
|
reactor.core.publisher.Mono<String> |
bfReserve(K key,
double errorRate,
long capacity,
BfReserveArgs reserveArgs)
Creates an empty Bloom filter with a single sub-filter for the initial specified capacity and with an upper bound error
rate.
|
reactor.core.publisher.Mono<ScanDumpValue> |
bfScanDump(K key,
long iterator)
Begins an incremental save of the Bloom filter.
|
reactor.core.publisher.Mono<Boolean> bfAdd(K key, V value)
key - the key.value - the value.true if the item was added, false if it was already in the filter.reactor.core.publisher.Mono<Long> bfCard(K key)
key - the key.reactor.core.publisher.Mono<Boolean> bfExists(K key, V value)
key - the key.value - the value.true if the item may exist in the filter, false if it definitely does not.reactor.core.publisher.Mono<BfInfoValue> bfInfo(K key)
key - the key.reactor.core.publisher.Flux<Value<Boolean>> bfInsert(K key, V value)
key - the key.value - the value.Value with where true means that the item was added; false means that there's a
probability that the item was already added to the filter or the filter is full; {Value.empty() when
filter is full and nonscaling.reactor.core.publisher.Flux<Value<Boolean>> bfInsert(K key, BfInsertArgs insertArgs, V value)
key - the key.insertArgs - the insert arguments.value - the value.Value with where true means that the item was added; false means that there's a
probability that the item was already added to the filter or the filter is full; {Value.empty() when
filter is full and nonscaling.reactor.core.publisher.Flux<Value<Boolean>> bfInsert(K key, V... values)
key - the key.values - the values.Value with where true means that the item was added; false means that there's a
probability that the item was already added to the filter or the filter is full; {Value.empty() when
filter is full and nonscaling.reactor.core.publisher.Flux<Value<Boolean>> bfInsert(K key, BfInsertArgs insertArgs, V... values)
key - the key.insertArgs - the insert arguments.values - the values.Value with where true means that the item was added; false means that there's a
probability that the item was already added to the filter or the filter is full; {Value.empty() when
filter is full and nonscaling.reactor.core.publisher.Mono<String> bfLoadChunk(K key, long iterator, byte[] data)
key - the key.iterator - the iterator.data - the data.OK if BF.LOADCHUNK was executed correctly.reactor.core.publisher.Flux<Value<Boolean>> bfMAdd(K key, V... values)
key - the key.values - the values.true or false where true means that the item was newly added and false means that
there's a probability that the item was already added to the filter; Value.empty() when filter is full
and nonscaling.reactor.core.publisher.Flux<Boolean> bfMExists(K key, V... values)
key - the key.values - the values.true or false where true means that, with high probability, the item was already added
to the filter, and false means that key does not exist or that item was definitely not added to the filter.reactor.core.publisher.Mono<String> bfReserve(K key, double errorRate, long capacity)
key - the key.errorRate - the error rate.capacity - the capacity.OK if BF.RESERVE was executed correctly.reactor.core.publisher.Mono<String> bfReserve(K key, double errorRate, long capacity, BfReserveArgs reserveArgs)
key - the key.errorRate - the error rate.capacity - the capacity.reserveArgs - the reserve arguments.OK if BF.RESERVE was executed correctly.reactor.core.publisher.Mono<ScanDumpValue> bfScanDump(K key, long iterator)
key - the key.iterator - the iterator.Copyright © 2026 lettuce.io. All rights reserved.