Package org.redisson.api

Interface RScoredSortedSetAsync<V>

Type Parameters:
V - value
All Superinterfaces:
RExpirableAsync, RObjectAsync, RSortableAsync<Set<V>>
All Known Subinterfaces:
RGeo<V>, RGeoAsync<V>, RScoredSortedSet<V>
All Known Implementing Classes:
RedissonGeo, RedissonLexSortedSet, RedissonScoredSortedSet
public interface RScoredSortedSetAsync<V> extends RExpirableAsync, RSortableAsync<Set<V>>
Author:
Nikita Koksharov

  • Method Details

    • pollLastFromAnyAsync

      RFuture<V> pollLastFromAnyAsync(long timeout, TimeUnit unit, String... queueNames)
      Removes and returns first available tail element of any sorted set, waiting up to the specified wait time if necessary for an element to become available in any of defined sorted sets including this one.

      Requires Redis 5.0.0 and higher.

      Parameters:
      queueNames - name of queues
      timeout - how long to wait before giving up, in units of unit
      unit - a TimeUnit determining how to interpret the timeout parameter
      Returns:
      the tail element, or null if all sorted sets are empty

    • pollLastFromAnyAsync

      RFuture<List<V>> pollLastFromAnyAsync(Duration duration, int count, String... queueNames)
      Removes and returns first available tail elements of any sorted set, waiting up to the specified wait time if necessary for elements to become available in any of defined sorted sets including this one.

      Requires Redis 7.0.0 and higher.

      Parameters:
      duration - how long to wait before giving up
      count - elements amount
      queueNames - name of queues
      Returns:
      the tail elements

    • pollLastFromAnyAsync

      RFuture<List<V>> pollLastFromAnyAsync(int count, String... queueNames)
      Removes and returns first available tail elements of any sorted set including this one.

      Requires Redis 7.0.0 and higher.

      Parameters:
      count - elements amount
      queueNames - name of queues
      Returns:
      the tail elements

    • pollLastEntriesFromAnyAsync

      RFuture<Map<String,Map<V,Double>>> pollLastEntriesFromAnyAsync(int count, String... queueNames)
      Removes and returns first available tail entries of any sorted set including this one.

      Requires Redis 7.0.0 and higher.

      Parameters:
      count - entries amount
      queueNames - name of queues
      Returns:
      the head entries

    • pollLastEntriesFromAnyAsync

      RFuture<Map<String,Map<V,Double>>> pollLastEntriesFromAnyAsync(Duration duration, int count, String... queueNames)
      Removes and returns first available tail entries of any sorted set, waiting up to the specified wait time if necessary for elements to become available in any of defined sorted sets including this one.

      Requires Redis 7.0.0 and higher.

      Parameters:
      duration - how long to wait before giving up
      count - entries amount
      queueNames - name of queues
      Returns:
      the tail entries

    • pollFirstFromAnyAsync

      RFuture<V> pollFirstFromAnyAsync(long timeout, TimeUnit unit, String... queueNames)
      Removes and returns first available head element of any sorted set, waiting up to the specified wait time if necessary for an element to become available in any of defined sorted sets including this one.

      Requires Redis 5.0.0 and higher.

      Parameters:
      queueNames - name of queues
      timeout - how long to wait before giving up, in units of unit
      unit - a TimeUnit determining how to interpret the timeout parameter
      Returns:
      the head element, or null if all sorted sets are empty

    • pollFirstFromAnyAsync

      RFuture<List<V>> pollFirstFromAnyAsync(Duration duration, int count, String... queueNames)
      Removes and returns first available head elements of any sorted set, waiting up to the specified wait time if necessary for elements to become available in any of defined sorted sets including this one.

      Requires Redis 7.0.0 and higher.

      Parameters:
      duration - how long to wait before giving up
      count - elements amount
      queueNames - name of queues
      Returns:
      the head elements

    • pollFirstFromAnyAsync

      RFuture<List<V>> pollFirstFromAnyAsync(int count, String... queueNames)
      Removes and returns first available head elements of any sorted set including this one.

      Requires Redis 7.0.0 and higher.

      Parameters:
      count - elements amount
      queueNames - name of queues
      Returns:
      the head elements

    • pollFirstEntriesFromAnyAsync

      RFuture<Map<String,Map<V,Double>>> pollFirstEntriesFromAnyAsync(int count, String... queueNames)
      Removes and returns first available head elements of any sorted set including this one.

      Requires Redis 7.0.0 and higher.

      Parameters:
      count - elements amount
      queueNames - name of queues
      Returns:
      the head elements

    • pollFirstEntriesFromAnyAsync

      RFuture<Map<String,Map<V,Double>>> pollFirstEntriesFromAnyAsync(Duration duration, int count, String... queueNames)
      Removes and returns first available head elements of any sorted set, waiting up to the specified wait time if necessary for elements to become available in any of defined sorted sets including this one.

      Requires Redis 7.0.0 and higher.

      Parameters:
      duration - how long to wait before giving up
      count - elements amount
      queueNames - name of queues
      Returns:
      the head elements

    • pollFirstAsync

      RFuture<V> pollFirstAsync(long timeout, TimeUnit unit)
      Removes and returns the head element or null if this sorted set is empty.

      Requires Redis 5.0.0 and higher.

      Parameters:
      timeout - how long to wait before giving up, in units of unit
      unit - a TimeUnit determining how to interpret the timeout parameter
      Returns:
      the head element, or null if this sorted set is empty

    • pollFirstAsync

      RFuture<List<V>> pollFirstAsync(Duration duration, int count)
      Removes and returns the head elements.

      Requires Redis 7.0.0 and higher.

      Parameters:
      duration - how long to wait before giving up
      count - elements amount
      Returns:
      the head elements

    • takeFirstAsync

      RFuture<V> takeFirstAsync()
      Removes and returns the head element waiting if necessary for an element to become available.
      Returns:
      the head element

    • takeLastAsync

      RFuture<V> takeLastAsync()
      Removes and returns the tail element waiting if necessary for an element to become available.
      Returns:
      the tail element

    • pollLastAsync

      RFuture<V> pollLastAsync(long timeout, TimeUnit unit)
      Removes and returns the tail element or null if this sorted set is empty.

      Requires Redis 5.0.0 and higher.

      Parameters:
      timeout - how long to wait before giving up, in units of unit
      unit - a TimeUnit determining how to interpret the timeout parameter
      Returns:
      the tail element or null if this sorted set is empty

    • pollLastAsync

      RFuture<List<V>> pollLastAsync(Duration duration, int count)
      Removes and returns the tail elements.

      Requires Redis 7.0.0 and higher.

      Parameters:
      duration - how long to wait before giving up
      count - elements amount
      Returns:
      the tail elements

    • pollFirstAsync

      RFuture<Collection<V>> pollFirstAsync(int count)
      Removes and returns the head elements of this sorted set.
      Parameters:
      count - - elements amount
      Returns:
      the head elements of this sorted set

    • pollLastAsync

      RFuture<Collection<V>> pollLastAsync(int count)
      Removes and returns the tail elements of this sorted set.
      Parameters:
      count - - elements amount
      Returns:
      the tail elements of this sorted set

    • pollFirstAsync

      RFuture<V> pollFirstAsync()
      Removes and returns the head element or null if this sorted set is empty.
      Returns:
      the head element, or null if this sorted set is empty

    • pollFirstEntryAsync

      RFuture<ScoredEntry<V>> pollFirstEntryAsync()
      Removes and returns the head entry (value and its score) or null if this sorted set is empty.
      Returns:
      the head entry, or null if this sorted set is empty

    • pollFirstEntriesAsync

      RFuture<List<ScoredEntry<V>>> pollFirstEntriesAsync(int count)
      Removes and returns the head entries (value and its score) of this sorted set.
      Parameters:
      count - entries amount
      Returns:
      the head entries of this sorted set

    • pollFirstEntriesAsync

      RFuture<List<ScoredEntry<V>>> pollFirstEntriesAsync(Duration duration, int count)
      Removes and returns the head entries (value and its score).

      Requires Redis 7.0.0 and higher.

      Parameters:
      duration - how long to wait before giving up
      count - entries amount
      Returns:
      the head entries

    • pollLastAsync

      RFuture<V> pollLastAsync()
      Removes and returns the tail element or null if this sorted set is empty.
      Returns:
      the tail element or null if this sorted set is empty

    • pollLastEntryAsync

      RFuture<ScoredEntry<V>> pollLastEntryAsync()
      Removes and returns the tail entry (value and its score) or null if this sorted set is empty.
      Returns:
      the tail entry or null if this sorted set is empty

    • pollLastEntriesAsync

      RFuture<List<ScoredEntry<V>>> pollLastEntriesAsync(int count)
      Removes and returns the tail entries (value and its score) of this sorted set.
      Parameters:
      count - entries amount
      Returns:
      the tail entries of this sorted set

    • pollLastEntriesAsync

      RFuture<List<ScoredEntry<V>>> pollLastEntriesAsync(Duration duration, int count)
      Removes and returns the head entries (value and its score).

      Requires Redis 7.0.0 and higher.

      Parameters:
      duration - how long to wait before giving up
      count - entries amount
      Returns:
      the tail entries

    • firstAsync

      RFuture<V> firstAsync()
      Returns the head element or null if this sorted set is empty.
      Returns:
      the head element or null if this sorted set is empty

    • firstEntryAsync

      RFuture<ScoredEntry<V>> firstEntryAsync()
      Returns the head entry (value and its score) or null if this sorted set is empty.
      Returns:
      the head entry or null if this sorted set is empty

    • lastAsync

      RFuture<V> lastAsync()
      Returns the tail element or null if this sorted set is empty.
      Returns:
      the tail element or null if this sorted set is empty

    • lastEntryAsync

      RFuture<ScoredEntry<V>> lastEntryAsync()
      Returns the tail entry (value and its score) or null if this sorted set is empty.
      Returns:
      the tail entry or null if this sorted set is empty

    • firstScoreAsync

      RFuture<Double> firstScoreAsync()
      Returns score of the head element or returns null if this sorted set is empty.
      Returns:
      the tail element or null if this sorted set is empty

    • lastScoreAsync

      RFuture<Double> lastScoreAsync()
      Returns score of the tail element or returns null if this sorted set is empty.
      Returns:
      the tail element or null if this sorted set is empty

    • randomAsync

      RFuture<V> randomAsync()
      Returns random element from this sorted set

      Requires Redis 6.2.0 and higher.

      Returns:
      value

    • randomAsync

      RFuture<Collection<V>> randomAsync(int count)
      Returns random elements from this sorted set limited by count

      Requires Redis 6.2.0 and higher.

      Parameters:
      count - - values amount to return
      Returns:
      value

    • randomEntriesAsync

      RFuture<Map<V,Double>> randomEntriesAsync(int count)
      Returns random entries from this sorted set limited by count. Each map entry uses element as key and score as value.

      Requires Redis 6.2.0 and higher.

      Parameters:
      count - - entries amount to return
      Returns:
      random entries

    • addAllAsync

      RFuture<Integer> addAllAsync(Map<V,Double> objects)
      Adds all elements contained in the specified map to this sorted set. Map contains of score mapped by object.
      Parameters:
      objects - - map of elements to add
      Returns:
      amount of added elements, not including already existing in this sorted set

    • addAllIfAbsentAsync

      RFuture<Integer> addAllIfAbsentAsync(Map<V,Double> objects)
      Adds elements to this set only if they haven't been added before.

      Requires Redis 3.0.2 and higher.

      Parameters:
      objects - map of elements to add
      Returns:
      amount of added elements

    • addAllIfExistAsync

      RFuture<Integer> addAllIfExistAsync(Map<V,Double> objects)
      Adds elements to this set only if they already exist.

      Requires Redis 3.0.2 and higher.

      Parameters:
      objects - map of elements to add
      Returns:
      amount of added elements

    • addAllIfGreaterAsync

      RFuture<Integer> addAllIfGreaterAsync(Map<V,Double> objects)
      Adds elements to this set only if new scores greater than current score of existed elements.

      Requires Redis 6.2.0 and higher.

      Parameters:
      objects - map of elements to add
      Returns:
      amount of added elements

    • addAllIfLessAsync

      RFuture<Integer> addAllIfLessAsync(Map<V,Double> objects)
      Adds elements to this set only if new scores less than current score of existed elements.

      Requires Redis 6.2.0 and higher.

      Parameters:
      objects - map of elements to add
      Returns:
      amount of added elements

    • removeRangeByScoreAsync

      RFuture<Integer> removeRangeByScoreAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
      Removes values by score range.
      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      Returns:
      number of elements removed

    • removeRangeByRankAsync

      RFuture<Integer> removeRangeByRankAsync(int startIndex, int endIndex)
      Removes values by rank range. Indexes are zero based. -1 means the highest score, -2 means the second highest score.
      Parameters:
      startIndex - - start index
      endIndex - - end index
      Returns:
      number of elements removed

    • rankAsync

      RFuture<Integer> rankAsync(V o)
      Returns rank of value, with the scores ordered from low to high.
      Parameters:
      o - - object
      Returns:
      rank or null if value does not exist

    • rankEntryAsync

      RFuture<RankedEntry<V>> rankEntryAsync(V value)
      Returns rank and score of specified value, with the ranks ordered from low to high.
      Parameters:
      value - object
      Returns:
      ranked entry or null if value does not exist

    • revRankAsync

      RFuture<Integer> revRankAsync(V o)
      Returns rank of value, with the scores ordered from high to low.
      Parameters:
      o - - object
      Returns:
      rank or null if value does not exist

    • revRankEntryAsync

      RFuture<RankedEntry<V>> revRankEntryAsync(V value)
      Returns rank and score of specified value, with the ranks ordered from high to low.
      Parameters:
      value - object
      Returns:
      ranked entry or null if value does not exist

    • revRankAsync

      RFuture<List<Integer>> revRankAsync(Collection<V> elements)
      Returns ranks of elements, with the scores ordered from high to low.
      Parameters:
      elements - - elements
      Returns:
      ranks or null if value does not exist

    • getScoreAsync

      RFuture<Double> getScoreAsync(V o)
      Returns score of element or null if it doesn't exist.
      Parameters:
      o - - element
      Returns:
      score

    • getScoreAsync

      RFuture<List<Double>> getScoreAsync(Collection<V> elements)
      Returns scores of elements.
      Parameters:
      elements - - elements
      Returns:
      element scores

    • addAsync

      RFuture<Boolean> addAsync(double score, V object)
      Adds element to this set, overrides previous score if it has been already added.
      Parameters:
      score - - object score
      object - - object itself
      Returns:
      true if element has added and false if not.

    • addAndGetRankAsync

      RFuture<Integer> addAndGetRankAsync(double score, V object)
      Adds element to this set, overrides previous score if it has been already added. Finally return the rank of the item
      Parameters:
      score - - object score
      object - - object itself
      Returns:
      rank

    • addAndGetRevRankAsync

      RFuture<Integer> addAndGetRevRankAsync(double score, V object)
      Adds element to this set, overrides previous score if it has been already added. Finally return the reverse rank of the item
      Parameters:
      score - - object score
      object - - object itself
      Returns:
      reverse rank

    • addAndGetRevRankAsync

      RFuture<List<Integer>> addAndGetRevRankAsync(Map<? extends V,Double> map)
      Adds elements to this set, overrides previous score if it has been already added. Finally returns reverse rank list of the items
      Parameters:
      map - - map of object and scores, make sure to use an ordered map
      Returns:
      collection of reverse ranks

    • tryAddAsync

      @Deprecated RFuture<Boolean> tryAddAsync(double score, V object)
      Deprecated.
      Use addIfAbsentAsync(double, Object) instead
      Parameters:
      score - - object score
      object - - object itself
      Returns:
      true if element has added and false if not.

    • addIfAbsentAsync

      RFuture<Boolean> addIfAbsentAsync(double score, V object)
      Adds element to this set only if has not been added before.

      Requires Redis 3.0.2 and higher.

      Parameters:
      score - - object score
      object - - object itself
      Returns:
      true if element added and false if not.

    • addIfExistsAsync

      RFuture<Boolean> addIfExistsAsync(double score, V object)
      Adds element to this set only if it's already exists.

      Requires Redis 3.0.2 and higher.

      Parameters:
      score - - object score
      object - - object itself
      Returns:
      true if element added and false if not.

    • addIfLessAsync

      RFuture<Boolean> addIfLessAsync(double score, V object)
      Adds element to this set only if new score less than current score of existed element.

      Requires Redis 6.2.0 and higher.

      Parameters:
      score - - object score
      object - - object itself
      Returns:
      true if element added and false if not.

    • addIfGreaterAsync

      RFuture<Boolean> addIfGreaterAsync(double score, V object)
      Adds element to this set only if new score greater than current score of existed element.

      Requires Redis 6.2.0 and higher.

      Parameters:
      score - - object score
      object - - object itself
      Returns:
      true if element added and false if not.

    • removeAsync

      RFuture<Boolean> removeAsync(V o)
      Removes a single instance of the specified element from this sorted set, if it is present.
      Parameters:
      o - element to be removed from this sorted set, if present
      Returns:
      true if an element was removed as a result of this call

    • replaceAsync

      RFuture<Boolean> replaceAsync(V oldObject, V newObject)
      Replaces a previous oldObject with a newObject. Returns false if previous object doesn't exist.
      Parameters:
      oldObject - old object
      newObject - new object
      Returns:
      true if object has been replaced otherwise false.

    • sizeAsync

      RFuture<Integer> sizeAsync()
      Returns size of this set.
      Returns:
      size

    • containsAsync

      RFuture<Boolean> containsAsync(Object o)
      Returns true if this sorted set contains encoded state of the specified element.
      Parameters:
      o - element whose presence in this collection is to be tested
      Returns:
      true if this sorted set contains the specified element and false otherwise

    • containsAllAsync

      RFuture<Boolean> containsAllAsync(Collection<?> c)
      Returns true if this sorted set contains all of the elements in encoded state in the specified collection.
      Parameters:
      c - collection to be checked for containment in this sorted set
      Returns:
      true if this sorted set contains all of the elements in the specified collection

    • removeAllAsync

      RFuture<Boolean> removeAllAsync(Collection<?> c)
      Removes all of this sorted set's elements that are also contained in the specified collection.
      Parameters:
      c - sorted set containing elements to be removed from this collection
      Returns:
      true if this sorted set changed as a result of the call

    • retainAllAsync

      RFuture<Boolean> retainAllAsync(Collection<?> c)
      Retains only the elements in this sorted set that are contained in the specified collection.
      Parameters:
      c - collection containing elements to be retained in this collection
      Returns:
      true if this sorted set changed as a result of the call

    • addScoreAsync

      RFuture<Double> addScoreAsync(V element, Number value)
      Increases score of specified element by value.
      Parameters:
      element - - element whose score needs to be increased
      value - - value
      Returns:
      updated score of element

    • addScoreAndGetRevRankAsync

      RFuture<Integer> addScoreAndGetRevRankAsync(V object, Number value)
      Adds score to element and returns its reverse rank
      Parameters:
      object - - object itself
      value - - object score
      Returns:
      reverse rank

    • addScoreAndGetRankAsync

      RFuture<Integer> addScoreAndGetRankAsync(V object, Number value)
      Adds score to element and returns its rank
      Parameters:
      object - - object itself
      value - - object score
      Returns:
      rank

    • rangeToAsync

      RFuture<Integer> rangeToAsync(String destName, int startIndex, int endIndex)
      Stores to defined ScoredSortedSet values by rank range. Indexes are zero based. -1 means the highest score, -2 means the second highest score.
      Parameters:
      startIndex - - start index
      endIndex - - end index
      Returns:
      elements

    • rangeToAsync

      RFuture<Integer> rangeToAsync(String destName, double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
      Stores to defined ScoredSortedSet values between startScore and endScore.

      Requires Redis 6.2.0 and higher.

      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      Returns:
      values

    • rangeToAsync

      RFuture<Integer> rangeToAsync(String destName, double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
      Stores to defined ScoredSortedSet values between startScore and endScore.

      Requires Redis 6.2.0 and higher.

      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      offset - - offset of sorted data
      count - - amount of sorted data
      Returns:
      values

    • revRangeToAsync

      RFuture<Integer> revRangeToAsync(String destName, int startIndex, int endIndex)
      Stores to defined ScoredSortedSet values in reversed order by rank range. Indexes are zero based. -1 means the highest score, -2 means the second highest score.
      Parameters:
      startIndex - - start index
      endIndex - - end index
      Returns:
      elements

    • revRangeToAsync

      RFuture<Integer> revRangeToAsync(String destName, double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
      Stores to defined ScoredSortedSet values in reversed order between startScore and endScore.

      Requires Redis 6.2.0 and higher.

      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      Returns:
      values

    • revRangeToAsync

      RFuture<Integer> revRangeToAsync(String destName, double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
      Stores to defined ScoredSortedSet values in reversed order between startScore and endScore.

      Requires Redis 6.2.0 and higher.

      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      offset - - offset of sorted data
      count - - amount of sorted data
      Returns:
      values

    • valueRangeAsync

      RFuture<Collection<V>> valueRangeAsync(int startIndex, int endIndex)
      Returns values by rank range. Indexes are zero based. -1 means the highest score, -2 means the second highest score.

      Requires Redis 6.2.0 and higher.

      Parameters:
      startIndex - - start index
      endIndex - - end index
      Returns:
      elements

    • valueRangeReversedAsync

      RFuture<Collection<V>> valueRangeReversedAsync(int startIndex, int endIndex)
      Returns values by rank range in reverse order. Indexes are zero based. -1 means the highest score, -2 means the second highest score.
      Parameters:
      startIndex - - start index
      endIndex - - end index
      Returns:
      elements

    • entryRangeAsync

      RFuture<Collection<ScoredEntry<V>>> entryRangeAsync(int startIndex, int endIndex)
      Returns entries (value and its score) by rank range. Indexes are zero based. -1 means the highest score, -2 means the second highest score.
      Parameters:
      startIndex - - start index
      endIndex - - end index
      Returns:
      entries

    • entryRangeReversedAsync

      RFuture<Collection<ScoredEntry<V>>> entryRangeReversedAsync(int startIndex, int endIndex)
      Returns entries (value and its score) by rank range in reverse order. Indexes are zero based. -1 means the highest score, -2 means the second highest score.
      Parameters:
      startIndex - - start index
      endIndex - - end index
      Returns:
      entries

    • valueRangeAsync

      RFuture<Collection<V>> valueRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
      Returns all values between startScore and endScore.
      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      Returns:
      values

    • valueRangeReversedAsync

      RFuture<Collection<V>> valueRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
      Returns all values between startScore and endScore in reversed order.
      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      Returns:
      values

    • entryRangeAsync

      RFuture<Collection<ScoredEntry<V>>> entryRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
      Returns all entries (value and its score) between startScore and endScore.
      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      Returns:
      entries

    • valueRangeAsync

      RFuture<Collection<V>> valueRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
      Returns all values between startScore and endScore.
      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      offset - - offset of sorted data
      count - - amount of sorted data
      Returns:
      values

    • valueRangeReversedAsync

      RFuture<Collection<V>> valueRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
      Returns all values between startScore and endScore in reversed order.
      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      offset - - offset of sorted data
      count - - amount of sorted data
      Returns:
      values

    • entryRangeAsync

      RFuture<Collection<ScoredEntry<V>>> entryRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
      Returns all entries (value and its score) between startScore and endScore.
      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      offset - - offset of sorted data
      count - - amount of sorted data
      Returns:
      entries

    • entryRangeReversedAsync

      RFuture<Collection<ScoredEntry<V>>> entryRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
      Returns all entries (value and its score) between startScore and endScore in reversed order.
      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      Returns:
      entries

    • entryRangeReversedAsync

      RFuture<Collection<ScoredEntry<V>>> entryRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
      Returns all entries (value and its score) between startScore and endScore in reversed order.
      Parameters:
      startScore - - start score. Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      startScoreInclusive - - start score inclusive
      endScore - - end score Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY to define infinity numbers
      endScoreInclusive - - end score inclusive
      offset - - offset of sorted data
      count - - amount of sorted data
      Returns:
      entries

    • countAsync

      RFuture<Integer> countAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
      Returns the number of elements with a score between startScore and endScore.
      Parameters:
      startScore - - start score
      startScoreInclusive - - start score inclusive
      endScore - - end score
      endScoreInclusive - - end score inclusive
      Returns:
      count

    • readAllAsync

      RFuture<Collection<V>> readAllAsync()
      Read all values at once.
      Returns:
      values

    • intersectionAsync

      RFuture<Integer> intersectionAsync(String... names)
      Intersect provided ScoredSortedSets and store result to current ScoredSortedSet
      Parameters:
      names - - names of ScoredSortedSet
      Returns:
      length of intersection

    • intersectionAsync

      RFuture<Integer> intersectionAsync(RScoredSortedSet.Aggregate aggregate, String... names)
      Intersect provided ScoredSortedSets with defined aggregation method and store result to current ScoredSortedSet
      Parameters:
      aggregate - - score aggregation mode
      names - - names of ScoredSortedSet
      Returns:
      length of intersection

    • intersectionAsync

      RFuture<Integer> intersectionAsync(Map<String,Double> nameWithWeight)
      Intersect provided ScoredSortedSets mapped to weight multiplier and store result to current ScoredSortedSet
      Parameters:
      nameWithWeight - - name of ScoredSortedSet mapped to weight multiplier
      Returns:
      length of intersection

    • intersectionAsync

      RFuture<Integer> intersectionAsync(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
      Intersect provided ScoredSortedSets mapped to weight multiplier with defined aggregation method and store result to current ScoredSortedSet
      Parameters:
      aggregate - - score aggregation mode
      nameWithWeight - - name of ScoredSortedSet mapped to weight multiplier
      Returns:
      length of intersection

    • readIntersectionAsync

      RFuture<Collection<V>> readIntersectionAsync(String... names)
      Intersect provided ScoredSortedSets with current ScoredSortedSet without state change

      Requires Redis 6.2.0 and higher.

      Parameters:
      names - - names of ScoredSortedSet
      Returns:
      result of intersection

    • readIntersectionAsync

      RFuture<Collection<V>> readIntersectionAsync(RScoredSortedSet.Aggregate aggregate, String... names)
      Intersect provided ScoredSortedSets with current ScoredSortedSet using defined aggregation method without state change

      Requires Redis 6.2.0 and higher.

      Parameters:
      aggregate - - score aggregation mode
      names - - names of ScoredSortedSet
      Returns:
      result of intersection

    • readIntersectionAsync

      RFuture<Collection<V>> readIntersectionAsync(Map<String,Double> nameWithWeight)
      Intersect provided ScoredSortedSets mapped to weight multiplier with current ScoredSortedSet without state change

      Requires Redis 6.2.0 and higher.

      Parameters:
      nameWithWeight - - name of ScoredSortedSet mapped to weight multiplier
      Returns:
      result of intersection

    • readIntersectionAsync

      RFuture<Collection<V>> readIntersectionAsync(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
      Intersect provided ScoredSortedSets mapped to weight multiplier with current ScoredSortedSet using defined aggregation method without state change

      Requires Redis 6.2.0 and higher.

      Parameters:
      aggregate - - score aggregation mode
      nameWithWeight - - name of ScoredSortedSet mapped to weight multiplier
      Returns:
      result of intersection

    • countIntersectionAsync

      RFuture<Integer> countIntersectionAsync(String... names)
      Counts elements of set as a result of sets intersection with current set.

      Requires Redis 7.0.0 and higher.

      Parameters:
      names - - name of sets
      Returns:
      amount of elements

    • countIntersectionAsync

      RFuture<Integer> countIntersectionAsync(int limit, String... names)
      Counts elements of set as a result of sets intersection with current set.

      Requires Redis 7.0.0 and higher.

      Parameters:
      names - - name of sets
      limit - - sets intersection limit
      Returns:
      amount of elements

    • unionAsync

      RFuture<Integer> unionAsync(String... names)
      Union provided ScoredSortedSets and store result to current ScoredSortedSet
      Parameters:
      names - - names of ScoredSortedSet
      Returns:
      length of union

    • unionAsync

      RFuture<Integer> unionAsync(RScoredSortedSet.Aggregate aggregate, String... names)
      Union provided ScoredSortedSets with defined aggregation method and store result to current ScoredSortedSet
      Parameters:
      aggregate - - score aggregation mode
      names - - names of ScoredSortedSet
      Returns:
      length of union

    • unionAsync

      RFuture<Integer> unionAsync(Map<String,Double> nameWithWeight)
      Union provided ScoredSortedSets mapped to weight multiplier and store result to current ScoredSortedSet
      Parameters:
      nameWithWeight - - name of ScoredSortedSet mapped to weight multiplier
      Returns:
      length of union

    • unionAsync

      RFuture<Integer> unionAsync(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
      Union provided ScoredSortedSets mapped to weight multiplier with defined aggregation method and store result to current ScoredSortedSet
      Parameters:
      aggregate - - score aggregation mode
      nameWithWeight - - name of ScoredSortedSet mapped to weight multiplier
      Returns:
      length of union

    • readUnionAsync

      RFuture<Collection<V>> readUnionAsync(String... names)
      Union ScoredSortedSets specified by name with current ScoredSortedSet without state change.

      Requires Redis 6.2.0 and higher.

      Parameters:
      names - - names of ScoredSortedSet
      Returns:
      result of union

    • readUnionAsync

      RFuture<Collection<V>> readUnionAsync(RScoredSortedSet.Aggregate aggregate, String... names)
      Union ScoredSortedSets specified by name with defined aggregation method and current ScoredSortedSet without state change.

      Requires Redis 6.2.0 and higher.

      Parameters:
      aggregate - - score aggregation mode
      names - - names of ScoredSortedSet
      Returns:
      result of union

    • readUnionAsync

      RFuture<Collection<V>> readUnionAsync(Map<String,Double> nameWithWeight)
      Union provided ScoredSortedSets mapped to weight multiplier and current ScoredSortedSet without state change.

      Requires Redis 6.2.0 and higher.

      Parameters:
      nameWithWeight - - name of ScoredSortedSet mapped to weight multiplier
      Returns:
      result of union

    • readUnionAsync

      RFuture<Collection<V>> readUnionAsync(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
      Union provided ScoredSortedSets mapped to weight multiplier with defined aggregation method and current ScoredSortedSet without state change

      Requires Redis 6.2.0 and higher.

      Parameters:
      aggregate - - score aggregation mode
      nameWithWeight - - name of ScoredSortedSet mapped to weight multiplier
      Returns:
      result of union

    • readDiffAsync

      RFuture<Collection<V>> readDiffAsync(String... names)
      Diff ScoredSortedSets specified by name with current ScoredSortedSet without state change.

      Requires Redis 6.2.0 and higher.

      Parameters:
      names - - name of sets
      Returns:
      result of diff

    • diffAsync

      RFuture<Integer> diffAsync(String... names)
      Diff provided ScoredSortedSets and store result to current ScoredSortedSet

      Requires Redis 6.2.0 and higher.

      Parameters:
      names - - name of sets
      Returns:
      length of diff