Module spring.data.redis
Interface ReactiveZSetOperations<K,V>
public interface ReactiveZSetOperations<K,V>
Reactive Redis operations for Sorted (ZSet) Commands.
Streams of methods returning Mono<K> or Flux<M> are terminated with
InvalidDataAccessApiUsageException when
RedisElementReader.read(ByteBuffer) returns null for a
particular element as Reactive Streams prohibit the usage of null values.
- Since:
- 2.0
- Author:
- Mark Paluch, Christoph Strobl, Andrey Shlykov
- See Also:
-
Method Summary
Modifier and TypeMethodDescriptionAddvalueto a sorted set atkey, or update itsscoreif it already exists.addAll(K key, Collection<? extends ZSetOperations.TypedTuple<V>> tuples) Addtuplesto a sorted set atkey, or update their score if it already exists.Count number of elements within sorted set with scores betweenminandmax.Removes the given key.difference(K key, Collection<K> otherKeys) Diff sortedsets.difference(K key, K otherKey) Diff sortedsets.differenceAndStore(K key, Collection<K> otherKeys, K destKey) Diff sortedsetsand store result in destinationdestKey.differenceAndStore(K key, K otherKey, K destKey) Diff sortedsetsand store result in destinationdestKey.differenceWithScores(K key, Collection<K> otherKeys) Diff sortedsets.default Flux<ZSetOperations.TypedTuple<V>>differenceWithScores(K key, K otherKey) Diff sortedsets.distinctRandomMembers(K key, long count) Getcountdistinct random elements from set atkey.distinctRandomMembersWithScore(K key, long count) Getcountdistinct random elements with their score from set atkey.incrementScore(K key, V value, double delta) Increment the score of element withvaluein sorted set byincrement.intersect(K key, Collection<K> otherKeys) Intersect sortedsets.Intersect sortedsets.intersectAndStore(K key, Collection<K> otherKeys, K destKey) Intersect sorted sets atkeyandotherKeysand store result in destinationdestKey.intersectAndStore(K key, Collection<K> otherKeys, K destKey, Aggregate aggregate) Intersect sorted sets atkeyandotherKeysand store result in destinationdestKey.intersectAndStore(K key, Collection<K> otherKeys, K destKey, Aggregate aggregate, Weights weights) Intersect sorted sets atkeyandotherKeysand store result in destinationdestKey.intersectAndStore(K key, K otherKey, K destKey) Intersect sorted sets atkeyandotherKeyand store result in destinationdestKey.intersectWithScores(K key, Collection<K> otherKeys) Intersect sortedsets.default Flux<ZSetOperations.TypedTuple<V>>intersectWithScores(K key, Collection<K> otherKeys, Aggregate aggregate) Intersect sorted sets atkeyandotherKeys.intersectWithScores(K key, Collection<K> otherKeys, Aggregate aggregate, Weights weights) Intersect sortedsets.default Flux<ZSetOperations.TypedTuple<V>>intersectWithScores(K key, K otherKey) Intersect sortedsets.Count number of elements within sorted set with a value betweenRange.getLowerBound()andRange.getUpperBound()applying lexicographical ordering.Remove and return the value with its score having the highest score from sorted set atkey.Remove and returncountvalues with their score having the highest score from sorted set atkey.Remove and return the value with its score having the highest score from sorted set atkey.Remove and return the value with its score having the lowest score from sorted set atkey.Remove and returncountvalues with their score having the lowest score from sorted set atkey.Remove and return the value with its score having the lowest score from sorted set atkey.randomMember(K key) Get random element from set atkey.randomMembers(K key, long count) Getcountrandom elements from set atkey.randomMembersWithScore(K key, long count) Getcountrandom elements with their score from set atkey.randomMemberWithScore(K key) Get random element with its score from set atkey.Get elements betweenstartandendfrom sorted set.rangeAndStoreByLex(K srcKey, K dstKey, Range<String> range) Store all elements atdstKeywith lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().Store n elements atdstKey, where n =Limit.getCount(), starting atLimit.getOffset()with lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().rangeAndStoreByScore(K srcKey, K dstKey, Range<Double> range) Store all elements atdstKeywith ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().Store n elements atdstKey, where n =Limit.getCount(), starting atLimit.getOffset()with ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().rangeByLex(K key, Range<String> range) Get all elements with lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().rangeByLex(K key, Range<String> range, Limit limit) Get all elements n elements, where n =Limit.getCount(), starting atLimit.getOffset()with lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().rangeByScore(K key, Range<Double> range) Get elements where score is betweenminandmaxfrom sorted set.rangeByScore(K key, Range<Double> range, Limit limit) Get elements in range fromstarttoendwhere score is betweenminandmaxfrom sorted set.rangeByScoreWithScores(K key, Range<Double> range) rangeByScoreWithScores(K key, Range<Double> range, Limit limit) rangeWithScores(K key, Range<Long> range) Determine the index of element withvaluein a sorted set.Removevaluesfrom sorted set.removeRange(K key, Range<Long> range) Remove elements in range betweenstartandendfrom sorted set withkey.removeRangeByLex(K key, Range<String> range) Remove elements in range from sorted set withkey.removeRangeByScore(K key, Range<Double> range) Remove elements with scores betweenminandmaxfrom sorted set withkey.reverseRange(K key, Range<Long> range) Get elements in range fromstarttoendfrom sorted set ordered from high to low.reverseRangeAndStoreByLex(K srcKey, K dstKey, Range<String> range) Store all elements atdstKeywith reverse lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().Store n elements atdstKey, where n =Limit.getCount(), starting atLimit.getOffset()with reverse lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().reverseRangeAndStoreByScore(K srcKey, K dstKey, Range<Double> range) Store all elements atdstKeywith reverse ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().Store n elements atdstKey, where n =Limit.getCount(), starting atLimit.getOffset()with reverse ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().reverseRangeByLex(K key, Range<String> range) Get all elements with reverse lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().reverseRangeByLex(K key, Range<String> range, Limit limit) Get all elements n elements, where n =Limit.getCount(), starting atLimit.getOffset()with reverse lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().reverseRangeByScore(K key, Range<Double> range) Get elements where score is betweenminandmaxfrom sorted set ordered from high to low.reverseRangeByScore(K key, Range<Double> range, Limit limit) Get elements in range fromstarttoendwhere score is betweenminandmaxfrom sorted set ordered high -> low.reverseRangeByScoreWithScores(K key, Range<Double> range) reverseRangeByScoreWithScores(K key, Range<Double> range, Limit limit) Get set ofTuplein range fromstarttoendwhere score is betweenminandmaxfrom sorted set ordered high -> low.reverseRangeWithScores(K key, Range<Long> range) reverseRank(K key, Object o) Determine the index of element withvaluein a sorted set when scored high to low.default Flux<ZSetOperations.TypedTuple<V>>Use aFluxto iterate over entries in the sorted set atkey.scan(K key, ScanOptions options) Get the score of element withvaluefrom sorted set with keykey.Get the scores of elements withvaluesfrom sorted set with keykey.Returns the number of elements of the sorted set stored with givenkey.union(K key, Collection<K> otherKeys) Union sortedsets.Union sortedsets.unionAndStore(K key, Collection<K> otherKeys, K destKey) Union sorted sets atkeyandotherKeysand store result in destinationdestKey.unionAndStore(K key, Collection<K> otherKeys, K destKey, Aggregate aggregate) Union sorted sets atkeyandotherKeysand store result in destinationdestKey.unionAndStore(K key, Collection<K> otherKeys, K destKey, Aggregate aggregate, Weights weights) Union sorted sets atkeyandotherKeysand store result in destinationdestKey.unionAndStore(K key, K otherKey, K destKey) Union sorted sets atkeyandotherKeysand store result in destinationdestKey.unionWithScores(K key, Collection<K> otherKeys) Union sortedsets.default Flux<ZSetOperations.TypedTuple<V>>unionWithScores(K key, Collection<K> otherKeys, Aggregate aggregate) Union sorted sets atkeyandotherKeys.unionWithScores(K key, Collection<K> otherKeys, Aggregate aggregate, Weights weights) Union sortedsets.default Flux<ZSetOperations.TypedTuple<V>>unionWithScores(K key, K otherKey) Union sortedsets.
-
Method Details
-
add
Addvalueto a sorted set atkey, or update itsscoreif it already exists.- Parameters:
key- must not be null.value- the value.score- the score.- Returns:
- See Also:
-
addAll
Addtuplesto a sorted set atkey, or update their score if it already exists.- Parameters:
key- must not be null.tuples- the score.- Returns:
- See Also:
-
remove
Removevaluesfrom sorted set. Return number of removed elements.- Parameters:
key- must not be null.values- must not be null.- Returns:
- See Also:
-
incrementScore
Increment the score of element withvaluein sorted set byincrement.- Parameters:
key- must not be null.value- the value.delta- the delta to add. Can be negative.- Returns:
- See Also:
-
randomMember
Get random element from set atkey.- Parameters:
key- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
distinctRandomMembers
Getcountdistinct random elements from set atkey.- Parameters:
key- must not be null.count- number of members to return.- Returns:
- Throws:
IllegalArgumentException- if count is negative.- Since:
- 2.6
- See Also:
-
randomMembers
Getcountrandom elements from set atkey.- Parameters:
key- must not be null.count- number of members to return.- Returns:
- Throws:
IllegalArgumentException- if count is negative.- Since:
- 2.6
- See Also:
-
randomMemberWithScore
Get random element with its score from set atkey.- Parameters:
key- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
distinctRandomMembersWithScore
Getcountdistinct random elements with their score from set atkey.- Parameters:
key- must not be null.count- number of members to return.- Returns:
- Throws:
IllegalArgumentException- if count is negative.- Since:
- 2.6
- See Also:
-
randomMembersWithScore
Getcountrandom elements with their score from set atkey.- Parameters:
key- must not be null.count- number of members to return.- Returns:
- Throws:
IllegalArgumentException- if count is negative.- Since:
- 2.6
- See Also:
-
rank
Determine the index of element withvaluein a sorted set.- Parameters:
key- must not be null.o- the value.- Returns:
- See Also:
-
reverseRank
Determine the index of element withvaluein a sorted set when scored high to low.- Parameters:
key- must not be null.o- the value.- Returns:
- See Also:
-
range
Get elements betweenstartandendfrom sorted set.- Parameters:
key- must not be null.range- must not be null.- Returns:
- See Also:
-
rangeWithScores
- Parameters:
key- must not be null.range- must not be null.- Returns:
- See Also:
-
rangeByScore
Get elements where score is betweenminandmaxfrom sorted set.- Parameters:
key- must not be null.range- must not be null.- Returns:
- See Also:
-
rangeByScoreWithScores
- Parameters:
key- must not be null.range- must not be null.- Returns:
- See Also:
-
rangeByScore
Get elements in range fromstarttoendwhere score is betweenminandmaxfrom sorted set.- Parameters:
key- must not be null.range-limit-- Returns:
- See Also:
-
rangeByScoreWithScores
- Parameters:
key-range-limit-- Returns:
- See Also:
-
reverseRange
Get elements in range fromstarttoendfrom sorted set ordered from high to low.- Parameters:
key- must not be null.range-- Returns:
- See Also:
-
reverseRangeWithScores
- Parameters:
key- must not be null.range-- Returns:
- See Also:
-
reverseRangeByScore
Get elements where score is betweenminandmaxfrom sorted set ordered from high to low.- Parameters:
key- must not be null.range-- Returns:
- See Also:
-
reverseRangeByScoreWithScores
- Parameters:
key- must not be null.range-- Returns:
- See Also:
-
reverseRangeByScore
Get elements in range fromstarttoendwhere score is betweenminandmaxfrom sorted set ordered high -> low.- Parameters:
key- must not be null.range-limit-- Returns:
- See Also:
-
reverseRangeByScoreWithScores
Flux<ZSetOperations.TypedTuple<V>> reverseRangeByScoreWithScores(K key, Range<Double> range, Limit limit) Get set ofTuplein range fromstarttoendwhere score is betweenminandmaxfrom sorted set ordered high -> low.- Parameters:
key- must not be null.range-limit-- Returns:
- See Also:
-
rangeAndStoreByLex
Store all elements atdstKeywith lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
srcKey- must not be null.dstKey- must not be null.range- must not be null.- Returns:
- the number of stored elements.
- Since:
- 3.0
- See Also:
-
rangeAndStoreByLex
Store n elements atdstKey, where n =Limit.getCount(), starting atLimit.getOffset()with lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
srcKey- must not be null.dstKey- must not be null.range- must not be null.limit- must not be null.- Returns:
- the number of stored elements.
- Since:
- 3.0
- See Also:
-
reverseRangeAndStoreByLex
Store all elements atdstKeywith reverse lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
srcKey- must not be null.dstKey- must not be null.range- must not be null.- Returns:
- the number of stored elements.
- Since:
- 3.0
- See Also:
-
reverseRangeAndStoreByLex
Store n elements atdstKey, where n =Limit.getCount(), starting atLimit.getOffset()with reverse lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
srcKey- must not be null.dstKey- must not be null.range- must not be null.limit- must not be null.- Returns:
- the number of stored elements.
- Since:
- 3.0
- See Also:
-
rangeAndStoreByScore
Store all elements atdstKeywith ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
srcKey- must not be null.dstKey- must not be null.range- must not be null.- Returns:
- the number of stored elements.
- Since:
- 3.0
- See Also:
-
rangeAndStoreByScore
Store n elements atdstKey, where n =Limit.getCount(), starting atLimit.getOffset()with ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
srcKey- must not be null.dstKey- must not be null.range- must not be null.limit- must not be null.- Returns:
- the number of stored elements.
- Since:
- 3.0
- See Also:
-
reverseRangeAndStoreByScore
Store all elements atdstKeywith reverse ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
srcKey- must not be null.dstKey- must not be null.range- must not be null.- Returns:
- the number of stored elements.
- Since:
- 3.0
- See Also:
-
reverseRangeAndStoreByScore
Store n elements atdstKey, where n =Limit.getCount(), starting atLimit.getOffset()with reverse ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
srcKey- must not be null.dstKey- must not be null.range- must not be null.limit- must not be null.- Returns:
- the number of stored elements.
- Since:
- 3.0
- See Also:
-
scan
Use aFluxto iterate over entries in the sorted set atkey. The resultingFluxacts as a cursor and issuesZSCANcommands itself as long as the subscriber signals demand.- Parameters:
key- must not be null.- Returns:
- the
Fluxemitting the values one by one or anempty Fluxif none exist. - Throws:
IllegalArgumentException- when givenkeyis null.- Since:
- 2.1
- See Also:
-
scan
Use aFluxto iterate over entries in the sorted set atkeygivenScanOptions. The resultingFluxacts as a cursor and issuesZSCANcommands itself as long as the subscriber signals demand.- Parameters:
key- must not be null.options- must not be null. UseScanOptions.NONEinstead.- Returns:
- the
Fluxemitting the values one by one or anempty Fluxif none exist. - Throws:
IllegalArgumentException- when one of the required arguments is null.- Since:
- 2.1
- See Also:
-
count
Count number of elements within sorted set with scores betweenminandmax.- Parameters:
key- must not be null.range-- Returns:
- See Also:
-
lexCount
Count number of elements within sorted set with a value betweenRange.getLowerBound()andRange.getUpperBound()applying lexicographical ordering.- Parameters:
key- must not be null.range- must not be null- Returns:
- Since:
- 2.4
- See Also:
-
popMin
Remove and return the value with its score having the lowest score from sorted set atkey.- Parameters:
key- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
popMin
Remove and returncountvalues with their score having the lowest score from sorted set atkey.- Parameters:
key- must not be null.count- number of elements to pop.- Returns:
- Since:
- 2.6
- See Also:
-
popMin
Remove and return the value with its score having the lowest score from sorted set atkey.- Parameters:
key- must not be null.timeout- maximal duration to wait until an entry in the list atkeyis available. Must be eitherDuration.ZEROor greater 1 second, must not be null. A timeout of zero can be used to wait indefinitely. Durations between zero and one second are not supported.- Returns:
- Since:
- 2.6
- See Also:
-
popMax
Remove and return the value with its score having the highest score from sorted set atkey.- Parameters:
key- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
popMax
Remove and returncountvalues with their score having the highest score from sorted set atkey.- Parameters:
key- must not be null.count- number of elements to pop.- Returns:
- Since:
- 2.6
- See Also:
-
popMax
Remove and return the value with its score having the highest score from sorted set atkey.- Parameters:
key- must not be null.timeout- maximal duration to wait until an entry in the list atkeyis available. Must be eitherDuration.ZEROor greater 1 second, must not be null. A timeout of zero can be used to wait indefinitely. Durations between zero and one second are not supported.- Returns:
- Since:
- 2.6
- See Also:
-
size
Returns the number of elements of the sorted set stored with givenkey.- Parameters:
key-- Returns:
- See Also:
-
score
Get the score of element withvaluefrom sorted set with keykey.- Parameters:
key- must not be null.o- the value.- Returns:
- See Also:
-
score
Get the scores of elements withvaluesfrom sorted set with keykey.- Parameters:
key- must not be null.o- the values.- Returns:
- Since:
- 2.6
- See Also:
-
removeRange
Remove elements in range betweenstartandendfrom sorted set withkey.- Parameters:
key- must not be null.range-- Returns:
- See Also:
-
removeRangeByLex
Remove elements in range from sorted set withkey.- Parameters:
key- must not be null.range- must not be null.- Returns:
- a
Monoemitting the number or removed elements. - Since:
- 2.5
- See Also:
-
removeRangeByScore
Remove elements with scores betweenminandmaxfrom sorted set withkey.- Parameters:
key- must not be null.range-- Returns:
- See Also:
-
difference
Diff sortedsets.- Parameters:
key- must not be null.otherKey- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
difference
Diff sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
differenceWithScores
Diff sortedsets.- Parameters:
key- must not be null.otherKey- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
differenceWithScores
Diff sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
differenceAndStore
Diff sortedsetsand store result in destinationdestKey.- Parameters:
key- must not be null.otherKey- must not be null.destKey- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
differenceAndStore
Diff sortedsetsand store result in destinationdestKey.- Parameters:
key- must not be null.otherKeys- must not be null.destKey- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
intersect
Intersect sortedsets.- Parameters:
key- must not be null.otherKey- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
intersect
Intersect sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
intersectWithScores
Intersect sortedsets.- Parameters:
key- must not be null.otherKey- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
intersectWithScores
Intersect sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
intersectWithScores
default Flux<ZSetOperations.TypedTuple<V>> intersectWithScores(K key, Collection<K> otherKeys, Aggregate aggregate) Intersect sorted sets atkeyandotherKeys.- Parameters:
key- must not be null.otherKeys- must not be null.aggregate- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
intersectWithScores
Flux<ZSetOperations.TypedTuple<V>> intersectWithScores(K key, Collection<K> otherKeys, Aggregate aggregate, Weights weights) Intersect sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.aggregate- must not be null.weights- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
intersectAndStore
Intersect sorted sets atkeyandotherKeyand store result in destinationdestKey.- Parameters:
key- must not be null.otherKey- must not be null.destKey- must not be null.- Returns:
- See Also:
-
intersectAndStore
Intersect sorted sets atkeyandotherKeysand store result in destinationdestKey.- Parameters:
key- must not be null.otherKeys- must not be null.destKey- must not be null.- Returns:
- See Also:
-
intersectAndStore
default Mono<Long> intersectAndStore(K key, Collection<K> otherKeys, K destKey, Aggregate aggregate) Intersect sorted sets atkeyandotherKeysand store result in destinationdestKey.- Parameters:
key- must not be null.otherKeys- must not be null.destKey- must not be null.aggregate- must not be null.- Returns:
- Since:
- 2.1
- See Also:
-
intersectAndStore
Mono<Long> intersectAndStore(K key, Collection<K> otherKeys, K destKey, Aggregate aggregate, Weights weights) Intersect sorted sets atkeyandotherKeysand store result in destinationdestKey.- Parameters:
key- must not be null.otherKeys- must not be null.destKey- must not be null.aggregate- must not be null.weights- must not be null.- Returns:
- Since:
- 2.1
- See Also:
-
union
Union sortedsets.- Parameters:
key- must not be null.otherKey- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
union
Union sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
unionWithScores
Union sortedsets.- Parameters:
key- must not be null.otherKey- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
unionWithScores
Union sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
unionWithScores
default Flux<ZSetOperations.TypedTuple<V>> unionWithScores(K key, Collection<K> otherKeys, Aggregate aggregate) Union sorted sets atkeyandotherKeys.- Parameters:
key- must not be null.otherKeys- must not be null.aggregate- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
unionWithScores
Flux<ZSetOperations.TypedTuple<V>> unionWithScores(K key, Collection<K> otherKeys, Aggregate aggregate, Weights weights) Union sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.aggregate- must not be null.weights- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
unionAndStore
Union sorted sets atkeyandotherKeysand store result in destinationdestKey.- Parameters:
key- must not be null.otherKey- must not be null.destKey- must not be null.- Returns:
- See Also:
-
unionAndStore
Union sorted sets atkeyandotherKeysand store result in destinationdestKey.- Parameters:
key- must not be null.otherKeys- must not be null.destKey- must not be null.- Returns:
- See Also:
-
unionAndStore
Union sorted sets atkeyandotherKeysand store result in destinationdestKey.- Parameters:
key- must not be null.otherKeys- must not be null.destKey- must not be null.aggregate- must not be null.- Returns:
- Since:
- 2.1
- See Also:
-
unionAndStore
Mono<Long> unionAndStore(K key, Collection<K> otherKeys, K destKey, Aggregate aggregate, Weights weights) Union sorted sets atkeyandotherKeysand store result in destinationdestKey.- Parameters:
key- must not be null.otherKeys- must not be null.destKey- must not be null.aggregate- must not be null.weights- must not be null.- Returns:
- Since:
- 2.1
- See Also:
-
rangeByLex
Get all elements with lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
key- must not be null.range- must not be null.- See Also:
-
rangeByLex
Get all elements n elements, where n =Limit.getCount(), starting atLimit.getOffset()with lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
key- must not be nullrange- must not be null.limit- can be null.- Returns:
- See Also:
-
reverseRangeByLex
Get all elements with reverse lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
key- must not be null.range- must not be null.- See Also:
-
reverseRangeByLex
Get all elements n elements, where n =Limit.getCount(), starting atLimit.getOffset()with reverse lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().- Parameters:
key- must not be nullrange- must not be null.limit- can be null.- Returns:
- See Also:
-
delete
Removes the given key.- Parameters:
key- must not be null.
-