io.quarkus.redis.datasource.bloom.TransactionalBloomCommands Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of quarkus-redis-client Show documentation
Connect to Redis in either imperative or reactive style
There is a newer version: 3.17.5
package io.quarkus.redis.datasource.bloom;

import io.quarkus.redis.datasource.TransactionalRedisCommands;

public interface TransactionalBloomCommands extends TransactionalRedisCommands {

    /**
     * Execute the command BF.ADD.
     * Summary: Adds the specified element to the specified Bloom filter.
     * Group: bloom
     * 
     * If the bloom filter does not exist, it creates a new one.
     *
     * @param key the key
     * @param value the value, must not be {@code null}
     **/
    void bfadd(K key, V value);

    /**
     * Execute the command BF.EXISTS.
     * Summary: Determines whether an item may exist in the Bloom Filter or not.
     * Group: bloom
     *
     * @param key the key
     * @param value the value, must not be {@code null}
     **/
    void bfexists(K key, V value);

    /**
     * Execute the command BF.MADD.
     * Summary: Adds one or more items to the Bloom Filter and creates the filter if it does not exist yet.
     * This command operates identically to BF.ADD except that it allows multiple inputs and returns multiple values.
     * Group: bloom
     * 

     *
     * @param key the key
     * @param values the values, must not be {@code null}, must not contain {@code null}, must not be empty.
     **/
    void bfmadd(K key, V... values);

    /**
     * Execute the command BF.MEXISTS.
     * Summary: Determines if one or more items may exist in the filter or not.
     * Group: bloom
     *
     * @param key the key
     * @param values the values, must not be {@code null}, must not contain {@code null}, must not be empty.
     **/
    void bfmexists(K key, V... values);

    /**
     * Execute the command BF.RESERVE.
     * Summary: Creates an empty Bloom Filter with a single sub-filter for the initial capacity requested and with an
     * upper bound {@code error_rate}.
     * Group: bloom
     *
     * @param key the key
     * @param errorRate The desired probability for false positives. The rate is a decimal value between 0 and 1.
     * @param capacity The number of entries intended to be added to the filter.
     **/
    void bfreserve(K key, double errorRate, long capacity);

    /**
     * Execute the command BF.RESERVE.
     * Summary: Creates an empty Bloom Filter with a single sub-filter for the initial capacity requested and with an
     * upper bound {@code error_rate}.
     * Group: bloom
     *
     * @param key the key
     * @param errorRate The desired probability for false positives. The rate is a decimal value between 0 and 1.
     * @param capacity The number of entries intended to be added to the filter.
     * @param args the extra parameters
     **/
    void bfreserve(K key, double errorRate, long capacity, BfReserveArgs args);

    /**
     * Execute the command BF.INSERT.
     * Summary: BF.INSERT is a sugarcoated combination of {@code BF.RESERVE} and {@code BF.ADD}. It creates a new filter
     * if the key does not exist using the relevant arguments. Next, all {@code ITEMS} are inserted.
     * Group: bloom
     * 
     *
     * @param key the key
     * @param args the creation parameters
     * @param values the value to add, must not contain {@code null}, must not be {@code null}, must not be empty
     **/
    void bfinsert(K key, BfInsertArgs args, V... values);
}