Interface ReactiveZSetOperations<K,V>
@NullUnmarked
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(@NonNull K key, @NonNull Collection<? extends @NonNull 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(@NonNull K key, @NonNull K otherKey) Diff sortedsets.difference(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys) Diff sortedsets.differenceAndStore(@NonNull K key, @NonNull K otherKey, @NonNull K destKey) Diff sortedsetsand store result in destinationdestKey.differenceAndStore(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey) Diff sortedsetsand store result in destinationdestKey.default Flux<ZSetOperations.TypedTuple<V>> differenceWithScores(@NonNull K key, @NonNull K otherKey) Diff sortedsets.differenceWithScores(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys) Diff sortedsets.distinctRandomMembers(@NonNull K key, long count) Getcountdistinct random elements from set atkey.distinctRandomMembersWithScore(@NonNull K key, long count) Getcountdistinct random elements with their score from set atkey.incrementScore(@NonNull K key, @NonNull V value, double delta) Increment the score of element withvaluein sorted set byincrement.Intersect sortedsets.intersect(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys) Intersect sortedsets.intersectAndStore(@NonNull K key, @NonNull K otherKey, @NonNull K destKey) Intersect sorted sets atkeyandotherKeyand store result in destinationdestKey.intersectAndStore(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey) Intersect sorted sets atkeyandotherKeysand store result in destinationdestKey.intersectAndStore(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey, @NonNull Aggregate aggregate) Intersect sorted sets atkeyandotherKeysand store result in destinationdestKey.intersectAndStore(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey, @NonNull Aggregate aggregate, @NonNull Weights weights) Intersect sorted sets atkeyandotherKeysand store result in destinationdestKey.default Flux<ZSetOperations.TypedTuple<V>> intersectWithScores(@NonNull K key, @NonNull K otherKey) Intersect sortedsets.intersectWithScores(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys) Intersect sortedsets.intersectWithScores(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull Aggregate aggregate, @NonNull Weights weights) Intersect sortedsets.default Flux<ZSetOperations.TypedTuple<V>> intersectWithScores(@NonNull K key, @NonNull Collection<K> otherKeys, @NonNull Aggregate aggregate) Intersect sorted sets atkeyandotherKeys.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(@NonNull K key) Get random element from set atkey.randomMembers(@NonNull K key, long count) Getcountrandom elements from set atkey.randomMembersWithScore(@NonNull K key, long count) Getcountrandom elements with their score from set atkey.randomMemberWithScore(@NonNull K key) Get random element with its score from set atkey.Get elements betweenstartandendfrom sorted set.rangeAndStoreByLex(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<String> range) Store all elements atdstKeywith lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().rangeAndStoreByLex(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<String> range, @NonNull Limit limit) Store n elements atdstKey, where n =Limit.getCount(), starting atLimit.getOffset()with lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().rangeAndStoreByScore(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<Double> range) Store all elements atdstKeywith ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().rangeAndStoreByScore(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<Double> range, @NonNull Limit limit) 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(@NonNull K key, @NonNull Range<String> range) Get all elements with lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().rangeByLex(@NonNull K key, @NonNull Range<String> range, @NonNull 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(@NonNull K key, @NonNull Range<Double> range) Get elements where score is betweenminandmaxfrom sorted set.rangeByScore(@NonNull K key, @NonNull Range<Double> range, @NonNull Limit limit) Get elements in range fromstarttoendwhere score is betweenminandmaxfrom sorted set.rangeByScoreWithScores(@NonNull K key, @NonNull Range<Double> range) rangeByScoreWithScores(@NonNull K key, @NonNull Range<Double> range, @NonNull Limit limit) rangeWithScores(@NonNull K key, @NonNull Range<Long> range) Determine the index of element withvaluein a sorted set.Removevaluesfrom sorted set.removeRange(@NonNull K key, @NonNull Range<Long> range) Remove elements in range betweenstartandendfrom sorted set withkey.removeRangeByLex(@NonNull K key, @NonNull Range<String> range) Remove elements in range from sorted set withkey.removeRangeByScore(@NonNull K key, @NonNull Range<Double> range) Remove elements with scores betweenminandmaxfrom sorted set withkey.reverseRange(@NonNull K key, @NonNull Range<Long> range) Get elements in range fromstarttoendfrom sorted set ordered from high to low.reverseRangeAndStoreByLex(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<String> range) Store all elements atdstKeywith reverse lexicographical ordering from ZSET atsrcKeywith a value betweenRange.getLowerBound()andRange.getUpperBound().reverseRangeAndStoreByLex(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<String> range, @NonNull Limit limit) 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(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<Double> range) Store all elements atdstKeywith reverse ordering by score from ZSET atsrcKeywith a score betweenRange.getLowerBound()andRange.getUpperBound().reverseRangeAndStoreByScore(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<Double> range, @NonNull Limit limit) 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(@NonNull K key, @NonNull Range<String> range) Get all elements with reverse lexicographical ordering from ZSET atkeywith a value betweenRange.getLowerBound()andRange.getUpperBound().reverseRangeByLex(@NonNull K key, @NonNull Range<String> range, @NonNull 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(@NonNull K key, @NonNull Range<Double> range) Get elements where score is betweenminandmaxfrom sorted set ordered from high to low.reverseRangeByScore(@NonNull K key, @NonNull Range<Double> range, @NonNull Limit limit) Get elements in range fromstarttoendwhere score is betweenminandmaxfrom sorted set ordered high -> low.reverseRangeByScoreWithScores(@NonNull K key, @NonNull Range<Double> range) reverseRangeByScoreWithScores(@NonNull K key, @NonNull Range<Double> range, @NonNull Limit limit) Get set ofTuplein range fromstarttoendwhere score is betweenminandmaxfrom sorted set ordered high -> low.reverseRangeWithScores(@NonNull K key, @NonNull Range<Long> range) reverseRank(@NonNull K key, @NonNull 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(@NonNull K key, @Nullable 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 sortedsets.union(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys) Union sortedsets.unionAndStore(@NonNull K key, @NonNull K otherKey, @NonNull K destKey) Union sorted sets atkeyandotherKeysand store result in destinationdestKey.unionAndStore(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey) Union sorted sets atkeyandotherKeysand store result in destinationdestKey.unionAndStore(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey, @NonNull Aggregate aggregate) Union sorted sets atkeyandotherKeysand store result in destinationdestKey.unionAndStore(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey, @NonNull Aggregate aggregate, @NonNull Weights weights) Union sorted sets atkeyandotherKeysand store result in destinationdestKey.default Flux<ZSetOperations.TypedTuple<V>> unionWithScores(@NonNull K key, @NonNull K otherKey) Union sortedsets.unionWithScores(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys) Union sortedsets.default Flux<ZSetOperations.TypedTuple<V>> unionWithScores(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull Aggregate aggregate) Union sorted sets atkeyandotherKeys.unionWithScores(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull Aggregate aggregate, @NonNull Weights weights) Union sortedsets.
-
Method Details
-
add
-
addAll
Mono<Long> addAll(@NonNull K key, @NonNull Collection<? extends @NonNull ZSetOperations.TypedTuple<V>> tuples) 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
-
incrementScore
-
randomMember
-
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
-
reverseRank
-
range
-
rangeWithScores
-
rangeByScore
-
rangeByScoreWithScores
-
rangeByScore
-
rangeByScoreWithScores
-
reverseRange
-
reverseRangeWithScores
-
reverseRangeByScore
-
reverseRangeByScoreWithScores
-
reverseRangeByScore
-
reverseRangeByScoreWithScores
Flux<ZSetOperations.TypedTuple<V>> reverseRangeByScoreWithScores(@NonNull K key, @NonNull Range<Double> range, @NonNull 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
default Mono<Long> rangeAndStoreByLex(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<String> range) 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
Mono<Long> rangeAndStoreByLex(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<String> range, @NonNull Limit limit) 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
default Mono<Long> reverseRangeAndStoreByLex(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<String> range) 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
Mono<Long> reverseRangeAndStoreByLex(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<String> range, @NonNull Limit limit) 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
default @Nullable Mono<Long> rangeAndStoreByScore(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<Double> range) 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
Mono<Long> rangeAndStoreByScore(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<Double> range, @NonNull Limit limit) 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
default Mono<Long> reverseRangeAndStoreByScore(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<Double> range) 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
Mono<Long> reverseRangeAndStoreByScore(@NonNull K srcKey, @NonNull K dstKey, @NonNull Range<Double> range, @NonNull Limit limit) 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
-
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
-
score
-
score
-
removeRange
-
removeRangeByLex
-
removeRangeByScore
-
difference
-
difference
Diff sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
differenceWithScores
default Flux<ZSetOperations.TypedTuple<V>> differenceWithScores(@NonNull K key, @NonNull K otherKey) Diff sortedsets.- Parameters:
key- must not be null.otherKey- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
differenceWithScores
Flux<ZSetOperations.TypedTuple<V>> differenceWithScores(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys) Diff sortedsets.- Parameters:
key- must not be null.otherKeys- must not be null.- Returns:
- Since:
- 2.6
- See Also:
-
differenceAndStore
-
differenceAndStore
-
intersect
-
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
Flux<ZSetOperations.TypedTuple<V>> intersectWithScores(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys) 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(@NonNull K key, @NonNull Collection<K> otherKeys, @NonNull 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(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull Aggregate aggregate, @NonNull 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
-
intersectAndStore
Mono<Long> intersectAndStore(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey) 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(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey, @NonNull 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(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey, @NonNull Aggregate aggregate, @NonNull 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
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
Flux<ZSetOperations.TypedTuple<V>> unionWithScores(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys) 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(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull 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(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull Aggregate aggregate, @NonNull 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
-
unionAndStore
-
unionAndStore
default Mono<Long> unionAndStore(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey, @NonNull Aggregate aggregate) 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(@NonNull K key, @NonNull Collection<@NonNull K> otherKeys, @NonNull K destKey, @NonNull Aggregate aggregate, @NonNull 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
-