com.redis.lettucemod.api.async.RedisBloomAsyncCommands Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of lettucemod Show documentation
LettuceMod
There is a newer version: 4.1.2
package com.redis.lettucemod.api.async;

import java.util.List;

import com.redis.lettucemod.bloom.BloomFilterInfo;
import com.redis.lettucemod.bloom.BloomFilterInfoType;
import com.redis.lettucemod.bloom.BloomFilterInsertOptions;
import com.redis.lettucemod.bloom.BloomFilterReserveOptions;
import com.redis.lettucemod.bloom.CmsInfo;
import com.redis.lettucemod.bloom.CuckooFilter;
import com.redis.lettucemod.bloom.CuckooFilterInsertOptions;
import com.redis.lettucemod.bloom.CuckooFilterReserveOptions;
import com.redis.lettucemod.bloom.LongScoredValue;
import com.redis.lettucemod.bloom.TDigestInfo;
import com.redis.lettucemod.bloom.TDigestMergeOptions;
import com.redis.lettucemod.bloom.TopKInfo;

import io.lettuce.core.KeyValue;
import io.lettuce.core.RedisFuture;
import io.lettuce.core.Value;

@SuppressWarnings("unchecked")
public interface RedisBloomAsyncCommands {

	RedisFuture bfAdd(K key, V item);

	RedisFuture bfCard(K key);

	RedisFuture bfExists(K key, V item);

	RedisFuture bfInfo(K key);

	RedisFuture bfInfo(K key, BloomFilterInfoType infoType);

	RedisFuture> bfInsert(K key, V... items);

	RedisFuture> bfInsert(K key, BloomFilterInsertOptions options, V... items);

	RedisFuture> bfMAdd(K key, V... items);

	RedisFuture> bfMExists(K key, V... items);

	RedisFuture bfReserve(K key, double errorRate, long capacity);

	RedisFuture bfReserve(K key, double errorRate, long capacity, BloomFilterReserveOptions options);

	RedisFuture cfAdd(K key, V item);

	RedisFuture cfAddNx(K key, V item);

	RedisFuture cfCount(K key, V item);

	RedisFuture cfDel(K key, V item);

	RedisFuture cfExists(K key, V item);

	RedisFuture cfInfo(K key);

	RedisFuture> cfInsert(K key, V... items);

	RedisFuture> cfInsert(K key, CuckooFilterInsertOptions options, V... items);

	RedisFuture> cfInsertNx(K key, V... items);

	RedisFuture> cfInsertNx(K key, CuckooFilterInsertOptions options, V... items);

	RedisFuture> cfMExists(K key, V... items);

	RedisFuture cfReserve(K key, long capacity);

	RedisFuture cfReserve(K key, long capacity, CuckooFilterReserveOptions options);

	RedisFuture cmsIncrBy(K key, V item, long increment);

	RedisFuture> cmsIncrBy(K key, LongScoredValue... itemIncrements);

	RedisFuture cmsInitByProb(K key, double error, double probability);

	RedisFuture cmsInitByDim(K key, long width, long depth);

	RedisFuture> cmsQuery(K key, V... items);

	RedisFuture cmsMerge(K destKey, K... keys);

	RedisFuture cmsMerge(K destKey, LongScoredValue... sourceKeyWeights);

	RedisFuture cmsInfo(K key);

	RedisFuture>> topKAdd(K key, V... items);

	RedisFuture>> topKIncrBy(K key, LongScoredValue... itemIncrements);

	RedisFuture topKInfo(K key);

	RedisFuture> topKList(K key);

	RedisFuture>> topKListWithScores(K key);

	RedisFuture> topKQuery(K key, V... items);

	RedisFuture topKReserve(K key, long k);

	RedisFuture topKReserve(K key, long k, long width, long depth, double decay);

	RedisFuture tDigestAdd(K key, double... value);

	RedisFuture> tDigestByRank(K key, long... ranks);

	RedisFuture> tDigestByRevRank(K key, long... revRanks);

	RedisFuture> tDigestCdf(K key, double... values);

	RedisFuture tDigestCreate(K key);

	RedisFuture tDigestCreate(K key, long compression);

	RedisFuture tDigestInfo(K key);

	RedisFuture tDigestMax(K key);

	RedisFuture tDigestMerge(K destinationKey, K... sourceKeys);

	RedisFuture tDigestMerge(K destinationKey, TDigestMergeOptions options, K... sourceKeys);

	RedisFuture tDigestMin(K key);

	RedisFuture> tDigestQuantile(K key, double... quantiles);

	RedisFuture> tDigestRank(K key, double... values);

	RedisFuture tDigestReset(K key);

	RedisFuture> tDigestRevRank(K key, double... values);

	RedisFuture tDigestTrimmedMean(K key, double lowCutQuantile, double highCutQuantile);
}