V - value typepublic class RedissonScoredSortedSet<V> extends RedissonObject implements RScoredSortedSet<V>
RScoredSortedSet.Aggregatecodec, commandExecutor, name| Constructor and Description |
|---|
RedissonScoredSortedSet(Codec codec,
CommandAsyncExecutor commandExecutor,
String name,
RedissonClient redisson) |
RedissonScoredSortedSet(CommandAsyncExecutor commandExecutor,
String name,
RedissonClient redisson) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
int |
addAll(Map<V,Double> objects)
Adds all elements contained in the specified map to this sorted set.
|
RFuture<Integer> |
addAllAsync(Map<V,Double> objects)
Adds all elements contained in the specified map to this sorted set.
|
Integer |
addAndGetRank(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
RFuture<Integer> |
addAndGetRankAsync(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
Integer |
addAndGetRevRank(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
List<Integer> |
addAndGetRevRank(Map<? extends V,Double> map)
Adds elements to this set, overrides previous score if it has been already added.
|
RFuture<Integer> |
addAndGetRevRankAsync(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
RFuture<List<Integer>> |
addAndGetRevRankAsync(Map<? extends V,Double> map)
Adds elements to this set, overrides previous score if it has been already added.
|
RFuture<Boolean> |
addAsync(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
Double |
addScore(V object,
Number value)
Increases score of specified element by value.
|
Integer |
addScoreAndGetRank(V object,
Number value)
Adds score to element and returns its rank
|
RFuture<Integer> |
addScoreAndGetRankAsync(V object,
Number value)
Adds score to element and returns its rank
|
Integer |
addScoreAndGetRevRank(V object,
Number value)
Adds score to element and returns its reverse rank
|
RFuture<Integer> |
addScoreAndGetRevRankAsync(V object,
Number value)
Adds score to element and returns its reverse rank
|
RFuture<Double> |
addScoreAsync(V object,
Number value)
Increases score of specified element by value.
|
void |
clear()
Removes all elements of this sorted set.
|
boolean |
clearExpire()
Clear an expire timeout or expire date for object.
|
RFuture<Boolean> |
clearExpireAsync()
Clear an expire timeout or expire date for object in async mode.
|
protected RFuture<Boolean> |
clearExpireAsync(String... keys) |
boolean |
contains(Object object)
Returns
true if this sorted set contains encoded state of the specified element. |
boolean |
containsAll(Collection<?> c)
Returns
true if this sorted set contains all of the elements
in encoded state in the specified collection. |
RFuture<Boolean> |
containsAllAsync(Collection<?> c)
Returns
true if this sorted set contains all of the elements
in encoded state in the specified collection. |
RFuture<Boolean> |
containsAsync(Object o)
Returns
true if this sorted set contains encoded state of the specified element. |
int |
count(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns the number of elements with a score between
startScore and endScore. |
RFuture<Integer> |
countAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns the number of elements with a score between
startScore and endScore. |
Collection<ScoredEntry<V>> |
entryRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all entries (value and its score) between
startScore and endScore. |
Collection<ScoredEntry<V>> |
entryRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count)
Returns all entries (value and its score) between
startScore and endScore. |
Collection<ScoredEntry<V>> |
entryRange(int startIndex,
int endIndex)
Returns entries (value and its score) by rank range.
|
RFuture<Collection<ScoredEntry<V>>> |
entryRangeAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all entries (value and its score) between
startScore and endScore. |
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. |
RFuture<Collection<ScoredEntry<V>>> |
entryRangeAsync(int startIndex,
int endIndex)
Returns entries (value and its score) by rank range.
|
Collection<ScoredEntry<V>> |
entryRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all entries (value and its score) between
startScore and endScore in reversed order. |
Collection<ScoredEntry<V>> |
entryRangeReversed(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. |
Collection<ScoredEntry<V>> |
entryRangeReversed(int startIndex,
int endIndex)
Returns entries (value and its score) by rank range in reverse order.
|
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. |
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. |
RFuture<Collection<ScoredEntry<V>>> |
entryRangeReversedAsync(int startIndex,
int endIndex)
Returns entries (value and its score) by rank range in reverse order.
|
boolean |
expire(long timeToLive,
TimeUnit timeUnit)
Set a timeout for object.
|
RFuture<Boolean> |
expireAsync(long timeToLive,
TimeUnit timeUnit)
Set a timeout for object in async mode.
|
protected RFuture<Boolean> |
expireAsync(long timeToLive,
TimeUnit timeUnit,
String... keys) |
boolean |
expireAt(Date timestamp)
Set an expire date for object.
|
boolean |
expireAt(long timestamp)
Set an expire date for object.
|
RFuture<Boolean> |
expireAtAsync(Date timestamp)
Set an expire date for object in async mode.
|
RFuture<Boolean> |
expireAtAsync(long timestamp)
Set an expire date for object in async mode.
|
protected RFuture<Boolean> |
expireAtAsync(long timestamp,
String... keys) |
V |
first()
Returns the head element or
null if this sorted set is empty. |
RFuture<V> |
firstAsync()
Returns the head element or
null if this sorted set is empty. |
Double |
firstScore()
Returns score of the tail element or returns
null if this sorted set is empty. |
RFuture<Double> |
firstScoreAsync()
Returns score of the head element or returns
null if this sorted set is empty. |
List<Double> |
getScore(List<V> keys)
Returns scores of elements.
|
Double |
getScore(V o)
Returns score of element or
null if it doesn't exist. |
RFuture<List<Double>> |
getScoreAsync(Collection<V> elements)
Returns scores of elements.
|
RFuture<Double> |
getScoreAsync(V o)
Returns score of element or
null if it doesn't exist. |
int |
intersection(Map<String,Double> nameWithWeight)
Intersect provided ScoredSortedSets mapped to weight multiplier
and store result to current ScoredSortedSet
|
int |
intersection(RScoredSortedSet.Aggregate aggregate,
Map<String,Double> nameWithWeight)
Intersect provided ScoredSortedSets mapped to weight multiplier
with defined aggregation method
and store result to current ScoredSortedSet
|
int |
intersection(RScoredSortedSet.Aggregate aggregate,
String... names)
Intersect provided ScoredSortedSets with defined aggregation method
and store result to current ScoredSortedSet
|
int |
intersection(String... names)
Intersect provided ScoredSortedSets
and store result to current ScoredSortedSet
|
RFuture<Integer> |
intersectionAsync(Map<String,Double> nameWithWeight)
Intersect provided ScoredSortedSets mapped to weight multiplier
and store result to current ScoredSortedSet
|
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
|
RFuture<Integer> |
intersectionAsync(RScoredSortedSet.Aggregate aggregate,
String... names)
Intersect provided ScoredSortedSets with defined aggregation method
and store result to current ScoredSortedSet
|
RFuture<Integer> |
intersectionAsync(String... names)
Intersect provided ScoredSortedSets
and store result to current ScoredSortedSet
|
boolean |
isEmpty()
Returns
true if this set is empty |
Iterator<V> |
iterator() |
Iterator<V> |
iterator(int count)
Returns an iterator over elements in this set.
|
Iterator<V> |
iterator(String pattern)
Returns an iterator over elements in this set.
|
Iterator<V> |
iterator(String pattern,
int count)
Returns an iterator over elements in this set.
|
V |
last()
Returns the tail element or
null if this sorted set is empty. |
RFuture<V> |
lastAsync()
Returns the tail element or
null if this sorted set is empty. |
Double |
lastScore()
Returns score of the head element or returns
null if this sorted set is empty. |
RFuture<Double> |
lastScoreAsync()
Returns score of the tail element or returns
null if this sorted set is empty. |
<KOut,VOut> |
mapReduce()
Returns
RMapReduce object associated with this object |
V |
pollFirst()
Removes and returns the head element or
null if this sorted set is empty. |
Collection<V> |
pollFirst(int count)
Removes and returns the head elements of this sorted set.
|
V |
pollFirst(long timeout,
TimeUnit unit)
Removes and returns the head element or
null if this sorted set is empty. |
RFuture<V> |
pollFirstAsync()
Removes and returns the head element or
null if this sorted set is empty. |
RFuture<Collection<V>> |
pollFirstAsync(int count)
Removes and returns the head elements of this sorted set.
|
RFuture<V> |
pollFirstAsync(long timeout,
TimeUnit unit)
Removes and returns the head element or
null if this sorted set is empty. |
V |
pollFirstFromAny(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.
|
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.
|
V |
pollLast()
Removes and returns the tail element or
null if this sorted set is empty. |
Collection<V> |
pollLast(int count)
Removes and returns the tail elements of this sorted set.
|
V |
pollLast(long timeout,
TimeUnit unit)
Removes and returns the tail element or
null if this sorted set is empty. |
RFuture<V> |
pollLastAsync()
Removes and returns the tail element or
null if this sorted set is empty. |
RFuture<Collection<V>> |
pollLastAsync(int count)
Removes and returns the tail elements of this sorted set.
|
RFuture<V> |
pollLastAsync(long timeout,
TimeUnit unit)
Removes and returns the tail element or
null if this sorted set is empty. |
V |
pollLastFromAny(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.
|
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.
|
Integer |
rank(V o)
Returns rank of value, with the scores ordered from low to high.
|
RFuture<Integer> |
rankAsync(V o)
Returns rank of value, with the scores ordered from low to high.
|
Collection<V> |
readAll()
Read all values at once.
|
RFuture<Collection<V>> |
readAllAsync()
Read all values at once.
|
Set<V> |
readSort(SortOrder order)
Read data in sorted view
|
Set<V> |
readSort(SortOrder order,
int offset,
int count)
Read data in sorted view
|
<T> Collection<T> |
readSort(String byPattern,
List<String> getPatterns,
SortOrder order)
Read data in sorted view
|
<T> Collection<T> |
readSort(String byPattern,
List<String> getPatterns,
SortOrder order,
int offset,
int count)
Read data in sorted view
|
Set<V> |
readSort(String byPattern,
SortOrder order)
Read data in sorted view
|
Set<V> |
readSort(String byPattern,
SortOrder order,
int offset,
int count)
Read data in sorted view
|
Set<V> |
readSortAlpha(SortOrder order)
Read data in sorted view lexicographically
|
Set<V> |
readSortAlpha(SortOrder order,
int offset,
int count)
Read data in sorted view lexicographically
|
<T> Collection<T> |
readSortAlpha(String byPattern,
List<String> getPatterns,
SortOrder order)
Read data in sorted view lexicographically
|
<T> Collection<T> |
readSortAlpha(String byPattern,
List<String> getPatterns,
SortOrder order,
int offset,
int count)
Read data in sorted view lexicographically
|
Set<V> |
readSortAlpha(String byPattern,
SortOrder order)
Read data in sorted view lexicographically
|
Set<V> |
readSortAlpha(String byPattern,
SortOrder order,
int offset,
int count)
Read data in sorted view lexicographically
|
RFuture<Set<V>> |
readSortAlphaAsync(SortOrder order)
Read data in sorted view lexicographically
|
RFuture<Set<V>> |
readSortAlphaAsync(SortOrder order,
int offset,
int count)
Read data in sorted view lexicographically
|
<T> RFuture<Collection<T>> |
readSortAlphaAsync(String byPattern,
List<String> getPatterns,
SortOrder order)
Read data in sorted view lexicographically
|
<T> RFuture<Collection<T>> |
readSortAlphaAsync(String byPattern,
List<String> getPatterns,
SortOrder order,
int offset,
int count)
Read data in sorted view lexicographically
|
RFuture<Set<V>> |
readSortAlphaAsync(String byPattern,
SortOrder order)
Read data in sorted view lexicographically
|
RFuture<Set<V>> |
readSortAlphaAsync(String byPattern,
SortOrder order,
int offset,
int count)
Read data in sorted view lexicographically
|
RFuture<Set<V>> |
readSortAsync(SortOrder order)
Read data in sorted view
|
RFuture<Set<V>> |
readSortAsync(SortOrder order,
int offset,
int count)
Read data in sorted view
|
<T> RFuture<Collection<T>> |
readSortAsync(String byPattern,
List<String> getPatterns,
SortOrder order)
Read data in sorted view
|
<T> RFuture<Collection<T>> |
readSortAsync(String byPattern,
List<String> getPatterns,
SortOrder order,
int offset,
int count)
Read data in sorted view
|
RFuture<Set<V>> |
readSortAsync(String byPattern,
SortOrder order)
Read data in sorted view
|
RFuture<Set<V>> |
readSortAsync(String byPattern,
SortOrder order,
int offset,
int count)
Read data in sorted view
|
long |
remainTimeToLive()
Remaining time to live of Redisson object that has a timeout
|
RFuture<Long> |
remainTimeToLiveAsync()
Remaining time to live of Redisson object that has a timeout
|
boolean |
remove(Object object)
Removes a single instance of the specified element from this
sorted set, if it is present.
|
boolean |
removeAll(Collection<?> c)
Removes all of this sorted set's elements that are also contained in the
specified collection.
|
RFuture<Boolean> |
removeAllAsync(Collection<?> c)
Removes all of this sorted set's elements that are also contained in the
specified collection.
|
RFuture<Boolean> |
removeAsync(Object object)
Removes a single instance of the specified element from this
sorted set, if it is present.
|
int |
removeRangeByRank(int startIndex,
int endIndex)
Removes values by rank range.
|
RFuture<Integer> |
removeRangeByRankAsync(int startIndex,
int endIndex)
Removes values by rank range.
|
int |
removeRangeByScore(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Removes values by score range.
|
RFuture<Integer> |
removeRangeByScoreAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Removes values by score range.
|
boolean |
retainAll(Collection<?> c)
Retains only the elements in this sorted set that are contained in the
specified collection.
|
RFuture<Boolean> |
retainAllAsync(Collection<?> c)
Retains only the elements in this sorted set that are contained in the
specified collection.
|
List<Integer> |
revRank(Collection<V> elements)
Returns ranks of elements, with the scores ordered from high to low.
|
Integer |
revRank(V o)
Returns rank of value, with the scores ordered from high to low.
|
RFuture<List<Integer>> |
revRankAsync(Collection<V> elements)
Returns ranks of elements, with the scores ordered from high to low.
|
RFuture<Integer> |
revRankAsync(V o)
Returns rank of value, with the scores ordered from high to low.
|
RFuture<ListScanResult<Object>> |
scanIteratorAsync(RedisClient client,
long startPos,
String pattern,
int count) |
int |
size()
Returns size of this set.
|
RFuture<Integer> |
sizeAsync()
Returns size of this set.
|
int |
sortTo(String destName,
SortOrder order)
Sort data and store to
destName list |
int |
sortTo(String destName,
SortOrder order,
int offset,
int count)
Sort data and store to
destName list |
int |
sortTo(String destName,
String byPattern,
List<String> getPatterns,
SortOrder order)
Sort data and store to
destName list |
int |
sortTo(String destName,
String byPattern,
List<String> getPatterns,
SortOrder order,
int offset,
int count)
Sort data and store to
destName list |
int |
sortTo(String destName,
String byPattern,
SortOrder order)
Sort data and store to
destName list |
int |
sortTo(String destName,
String byPattern,
SortOrder order,
int offset,
int count)
Sort data and store to
destName list |
RFuture<Integer> |
sortToAsync(String destName,
SortOrder order)
Sort data and store to
destName list |
RFuture<Integer> |
sortToAsync(String destName,
SortOrder order,
int offset,
int count)
Sort data and store to
destName list |
RFuture<Integer> |
sortToAsync(String destName,
String byPattern,
List<String> getPatterns,
SortOrder order)
Sort data and store to
destName list |
RFuture<Integer> |
sortToAsync(String destName,
String byPattern,
List<String> getPatterns,
SortOrder order,
int offset,
int count)
Sort data and store to
destName list |
RFuture<Integer> |
sortToAsync(String destName,
String byPattern,
SortOrder order)
Sort data and store to
destName list |
RFuture<Integer> |
sortToAsync(String destName,
String byPattern,
SortOrder order,
int offset,
int count)
Sort data and store to
destName list |
Stream<V> |
stream()
Returns stream of elements in this set.
|
Stream<V> |
stream(int count)
Returns stream of elements in this set.
|
Stream<V> |
stream(String pattern)
Returns stream of elements in this set.
|
Stream<V> |
stream(String pattern,
int count)
Returns stream of elements in this set.
|
int |
subscribeOnFirstElements(Consumer<V> consumer)
Subscribes on first elements appeared in this set.
|
int |
subscribeOnLastElements(Consumer<V> consumer)
Subscribes on last elements appeared in this set.
|
V |
takeFirst()
Removes and returns the head element waiting if necessary for an element to become available.
|
RFuture<V> |
takeFirstAsync()
Removes and returns the head element waiting if necessary for an element to become available.
|
V |
takeLast()
Removes and returns the tail element waiting if necessary for an element to become available.
|
RFuture<V> |
takeLastAsync()
Removes and returns the tail element waiting if necessary for an element to become available.
|
Object[] |
toArray()
Returns this sorted set in array of Object type.
|
<T> T[] |
toArray(T[] a)
Returns this sorted set in array of defined type.
|
boolean |
tryAdd(double score,
V object)
Adds element to this set only if has not been added before.
|
RFuture<Boolean> |
tryAddAsync(double score,
V object)
Adds element to this set only if has not been added before.
|
int |
union(Map<String,Double> nameWithWeight)
Union provided ScoredSortedSets mapped to weight multiplier
and store result to current ScoredSortedSet
|
int |
union(RScoredSortedSet.Aggregate aggregate,
Map<String,Double> nameWithWeight)
Union provided ScoredSortedSets mapped to weight multiplier
with defined aggregation method
and store result to current ScoredSortedSet
|
int |
union(RScoredSortedSet.Aggregate aggregate,
String... names)
Union provided ScoredSortedSets with defined aggregation method
and store result to current ScoredSortedSet
|
int |
union(String... names)
Union provided ScoredSortedSets
and store result to current ScoredSortedSet
|
RFuture<Integer> |
unionAsync(Map<String,Double> nameWithWeight)
Union provided ScoredSortedSets mapped to weight multiplier
and store result to current ScoredSortedSet
|
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
|
RFuture<Integer> |
unionAsync(RScoredSortedSet.Aggregate aggregate,
String... names)
Union provided ScoredSortedSets with defined aggregation method
and store result to current ScoredSortedSet
|
RFuture<Integer> |
unionAsync(String... names)
Union provided ScoredSortedSets
and store result to current ScoredSortedSet
|
void |
unsubscribe(int listenerId)
Un-subscribes defined listener.
|
Collection<V> |
valueRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all values between
startScore and endScore. |
Collection<V> |
valueRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count)
Returns all values between
startScore and endScore. |
Collection<V> |
valueRange(int startIndex,
int endIndex)
Returns values by rank range.
|
RFuture<Collection<V>> |
valueRangeAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all values between
startScore and endScore. |
RFuture<Collection<V>> |
valueRangeAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count)
Returns all values between
startScore and endScore. |
RFuture<Collection<V>> |
valueRangeAsync(int startIndex,
int endIndex)
Returns values by rank range.
|
Collection<V> |
valueRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all values between
startScore and endScore in reversed order. |
Collection<V> |
valueRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count)
Returns all values between
startScore and endScore in reversed order. |
Collection<V> |
valueRangeReversed(int startIndex,
int endIndex)
Returns values by rank range in reverse order.
|
RFuture<Collection<V>> |
valueRangeReversedAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all values between
startScore and endScore in reversed order. |
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. |
RFuture<Collection<V>> |
valueRangeReversedAsync(int startIndex,
int endIndex)
Returns values by rank range in reverse order.
|
addListener, addListener, addListenerAsync, addListenerAsync, copy, copyAsync, delete, deleteAsync, deleteAsync, dump, dumpAsync, encode, encode, encode, encode, encodeMapKey, encodeMapKeys, encodeMapValue, encodeMapValues, get, getCodec, getIdleTime, getIdleTimeAsync, getLockByMapKey, getLockByValue, getName, getName, isExists, isExistsAsync, migrate, migrateAsync, move, moveAsync, prefixName, removeListener, removeListenerAsync, removeListenersAsync, rename, renameAsync, renamenx, renamenxAsync, restore, restore, restoreAndReplace, restoreAndReplace, restoreAndReplaceAsync, restoreAndReplaceAsync, restoreAsync, restoreAsync, sizeInMemory, sizeInMemoryAsync, sizeInMemoryAsync, sizeInMemoryAsync, suffixName, toSeconds, toStream, touch, touchAsync, unlink, unlinkAsyncclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitforEach, spliteratorclearExpire, expire, expireAt, expireAt, remainTimeToLiveaddListener, copy, delete, dump, getCodec, getIdleTime, getName, isExists, migrate, move, removeListener, rename, renamenx, restore, restore, restoreAndReplace, restoreAndReplace, sizeInMemory, touch, unlinkclearExpireAsync, expireAsync, expireAtAsync, expireAtAsync, remainTimeToLiveAsyncaddListenerAsync, copyAsync, deleteAsync, dumpAsync, getIdleTimeAsync, isExistsAsync, migrateAsync, moveAsync, removeListenerAsync, renameAsync, renamenxAsync, restoreAndReplaceAsync, restoreAndReplaceAsync, restoreAsync, restoreAsync, sizeInMemoryAsync, touchAsync, unlinkAsyncpublic RedissonScoredSortedSet(CommandAsyncExecutor commandExecutor, String name, RedissonClient redisson)
public RedissonScoredSortedSet(Codec codec, CommandAsyncExecutor commandExecutor, String name, RedissonClient redisson)
public <KOut,VOut> RCollectionMapReduce<V,KOut,VOut> mapReduce()
RScoredSortedSetRMapReduce object associated with this objectmapReduce in interface RScoredSortedSet<V>KOut - output keyVOut - output valuepublic Collection<V> readAll()
RScoredSortedSetreadAll in interface RScoredSortedSet<V>public RFuture<Collection<V>> readAllAsync()
RScoredSortedSetAsyncreadAllAsync in interface RScoredSortedSetAsync<V>public V pollFirst()
RScoredSortedSetnull if this sorted set is empty.pollFirst in interface RScoredSortedSet<V>null if this sorted set is emptypublic V pollLast()
RScoredSortedSetnull if this sorted set is empty.pollLast in interface RScoredSortedSet<V>null if this sorted set is emptypublic Collection<V> pollFirst(int count)
RScoredSortedSetpollFirst in interface RScoredSortedSet<V>count - - elements amountpublic Collection<V> pollLast(int count)
RScoredSortedSetpollLast in interface RScoredSortedSet<V>count - - elements amountpublic RFuture<Collection<V>> pollFirstAsync(int count)
RScoredSortedSetAsyncpollFirstAsync in interface RScoredSortedSetAsync<V>count - - elements amountpublic RFuture<Collection<V>> pollLastAsync(int count)
RScoredSortedSetAsyncpollLastAsync in interface RScoredSortedSetAsync<V>count - - elements amountpublic RFuture<V> pollFirstAsync()
RScoredSortedSetAsyncnull if this sorted set is empty.pollFirstAsync in interface RScoredSortedSetAsync<V>null if this sorted set is emptypublic RFuture<V> pollLastAsync()
RScoredSortedSetAsyncnull if this sorted set is empty.pollLastAsync in interface RScoredSortedSetAsync<V>null if this sorted set is emptypublic V pollFirst(long timeout, TimeUnit unit)
RScoredSortedSetnull if this sorted set is empty.pollFirst in interface RScoredSortedSet<V>timeout - how long to wait before giving up, in units of
unitunit - a TimeUnit determining how to interpret the
timeout parameternull if this sorted set is emptypublic RFuture<V> pollFirstAsync(long timeout, TimeUnit unit)
RScoredSortedSetAsyncnull if this sorted set is empty.
Requires Redis 5.0.0 and higher.
pollFirstAsync in interface RScoredSortedSetAsync<V>timeout - how long to wait before giving up, in units of
unitunit - a TimeUnit determining how to interpret the
timeout parameternull if this sorted set is emptypublic V pollFirstFromAny(long timeout, TimeUnit unit, String... queueNames)
RScoredSortedSetRequires Redis 5.0.0 and higher.
pollFirstFromAny in interface RScoredSortedSet<V>timeout - how long to wait before giving up, in units of
unitunit - a TimeUnit determining how to interpret the
timeout parameterqueueNames - - names of queuenull if all sorted sets are emptypublic RFuture<V> pollFirstFromAnyAsync(long timeout, TimeUnit unit, String... queueNames)
RScoredSortedSetAsyncRequires Redis 5.0.0 and higher.
pollFirstFromAnyAsync in interface RScoredSortedSetAsync<V>timeout - how long to wait before giving up, in units of
unitunit - a TimeUnit determining how to interpret the
timeout parameterqueueNames - - names of queuenull if all sorted sets are emptypublic V pollLastFromAny(long timeout, TimeUnit unit, String... queueNames)
RScoredSortedSetRequires Redis 5.0.0 and higher.
pollLastFromAny in interface RScoredSortedSet<V>timeout - how long to wait before giving up, in units of
unitunit - a TimeUnit determining how to interpret the
timeout parameterqueueNames - - names of queuenull if all sorted sets are emptypublic RFuture<V> pollLastFromAnyAsync(long timeout, TimeUnit unit, String... queueNames)
RScoredSortedSetAsyncRequires Redis 5.0.0 and higher.
pollLastFromAnyAsync in interface RScoredSortedSetAsync<V>timeout - how long to wait before giving up, in units of
unitunit - a TimeUnit determining how to interpret the
timeout parameterqueueNames - - names of queuenull if all sorted sets are emptypublic V pollLast(long timeout, TimeUnit unit)
RScoredSortedSetnull if this sorted set is empty.pollLast in interface RScoredSortedSet<V>timeout - how long to wait before giving up, in units of
unitunit - a TimeUnit determining how to interpret the
timeout parameternull if this sorted set is emptypublic RFuture<V> pollLastAsync(long timeout, TimeUnit unit)
RScoredSortedSetAsyncnull if this sorted set is empty.
Requires Redis 5.0.0 and higher.
pollLastAsync in interface RScoredSortedSetAsync<V>timeout - how long to wait before giving up, in units of
unitunit - a TimeUnit determining how to interpret the
timeout parameternull if this sorted set is emptypublic boolean add(double score,
V object)
RScoredSortedSetadd in interface RScoredSortedSet<V>score - - object scoreobject - - object itselftrue if element has added and false if not.public Integer addAndGetRank(double score, V object)
RScoredSortedSetaddAndGetRank in interface RScoredSortedSet<V>score - - object scoreobject - - object itselfpublic RFuture<Integer> addAndGetRankAsync(double score, V object)
RScoredSortedSetAsyncaddAndGetRankAsync in interface RScoredSortedSetAsync<V>score - - object scoreobject - - object itselfpublic Integer addAndGetRevRank(double score, V object)
RScoredSortedSetaddAndGetRevRank in interface RScoredSortedSet<V>score - - object scoreobject - - object itselfpublic List<Integer> addAndGetRevRank(Map<? extends V,Double> map)
RScoredSortedSetaddAndGetRevRank in interface RScoredSortedSet<V>map - - map of object and scores, make sure to use an ordered mappublic RFuture<Integer> addAndGetRevRankAsync(double score, V object)
RScoredSortedSetAsyncaddAndGetRevRankAsync in interface RScoredSortedSetAsync<V>score - - object scoreobject - - object itselfpublic RFuture<List<Integer>> addAndGetRevRankAsync(Map<? extends V,Double> map)
RScoredSortedSetAsyncaddAndGetRevRankAsync in interface RScoredSortedSetAsync<V>map - - map of object and scores, make sure to use an ordered mappublic boolean tryAdd(double score,
V object)
RScoredSortedSetWorks only with Redis 3.0.2 and higher.
tryAdd in interface RScoredSortedSet<V>score - - object scoreobject - - object itselftrue if element has added and false if not.public V first()
RScoredSortedSetnull if this sorted set is empty.first in interface RScoredSortedSet<V>null if this sorted set is emptypublic RFuture<V> firstAsync()
RScoredSortedSetAsyncnull if this sorted set is empty.firstAsync in interface RScoredSortedSetAsync<V>null if this sorted set is emptypublic V last()
RScoredSortedSetnull if this sorted set is empty.last in interface RScoredSortedSet<V>null if this sorted set is emptypublic RFuture<V> lastAsync()
RScoredSortedSetAsyncnull if this sorted set is empty.lastAsync in interface RScoredSortedSetAsync<V>null if this sorted set is emptypublic Double firstScore()
RScoredSortedSetnull if this sorted set is empty.firstScore in interface RScoredSortedSet<V>null if this sorted set is emptypublic RFuture<Double> firstScoreAsync()
RScoredSortedSetAsyncnull if this sorted set is empty.firstScoreAsync in interface RScoredSortedSetAsync<V>null if this sorted set is emptypublic Double lastScore()
RScoredSortedSetnull if this sorted set is empty.lastScore in interface RScoredSortedSet<V>null if this sorted set is emptypublic RFuture<Double> lastScoreAsync()
RScoredSortedSetAsyncnull if this sorted set is empty.lastScoreAsync in interface RScoredSortedSetAsync<V>null if this sorted set is emptypublic RFuture<Boolean> addAsync(double score, V object)
RScoredSortedSetAsyncaddAsync in interface RScoredSortedSetAsync<V>score - - object scoreobject - - object itselftrue if element has added and false if not.public int addAll(Map<V,Double> objects)
RScoredSortedSetaddAll in interface RScoredSortedSet<V>objects - - map of elements to addpublic RFuture<Integer> addAllAsync(Map<V,Double> objects)
RScoredSortedSetAsyncaddAllAsync in interface RScoredSortedSetAsync<V>objects - - map of elements to addpublic RFuture<Boolean> tryAddAsync(double score, V object)
RScoredSortedSetAsyncRequires Redis 3.0.2 and higher.
tryAddAsync in interface RScoredSortedSetAsync<V>score - - object scoreobject - - object itselftrue if element has added and false if not.public boolean remove(Object object)
RScoredSortedSetremove in interface RScoredSortedSet<V>object - element to be removed from this sorted set, if presenttrue if an element was removed as a result of this callpublic int removeRangeByRank(int startIndex,
int endIndex)
RScoredSortedSet-1 means the highest score, -2 means the second highest score.removeRangeByRank in interface RScoredSortedSet<V>startIndex - - start indexendIndex - - end indexpublic RFuture<Integer> removeRangeByRankAsync(int startIndex, int endIndex)
RScoredSortedSetAsync-1 means the highest score, -2 means the second highest score.removeRangeByRankAsync in interface RScoredSortedSetAsync<V>startIndex - - start indexendIndex - - end indexpublic int removeRangeByScore(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
RScoredSortedSetremoveRangeByScore in interface RScoredSortedSet<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic RFuture<Integer> removeRangeByScoreAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetAsyncremoveRangeByScoreAsync in interface RScoredSortedSetAsync<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic void clear()
RScoredSortedSetclear in interface RScoredSortedSet<V>public RFuture<Boolean> removeAsync(Object object)
RScoredSortedSetAsyncremoveAsync in interface RScoredSortedSetAsync<V>object - element to be removed from this sorted set, if presenttrue if an element was removed as a result of this callpublic boolean isEmpty()
RScoredSortedSettrue if this set is emptyisEmpty in interface RScoredSortedSet<V>true if emptypublic int size()
RScoredSortedSetsize in interface RScoredSortedSet<V>public RFuture<Integer> sizeAsync()
RScoredSortedSetAsyncsizeAsync in interface RScoredSortedSetAsync<V>public boolean contains(Object object)
RScoredSortedSettrue if this sorted set contains encoded state of the specified element.contains in interface RScoredSortedSet<V>object - element whose presence in this collection is to be testedtrue if this sorted set contains the specified
element and false otherwisepublic RFuture<Boolean> containsAsync(Object o)
RScoredSortedSetAsynctrue if this sorted set contains encoded state of the specified element.containsAsync in interface RScoredSortedSetAsync<V>o - element whose presence in this collection is to be testedtrue if this sorted set contains the specified
element and false otherwisepublic Double getScore(V o)
RScoredSortedSetnull if it doesn't exist.getScore in interface RScoredSortedSet<V>o - - elementpublic List<Double> getScore(List<V> keys)
RScoredSortedSetgetScore in interface RScoredSortedSet<V>keys - - elementspublic RFuture<Double> getScoreAsync(V o)
RScoredSortedSetAsyncnull if it doesn't exist.getScoreAsync in interface RScoredSortedSetAsync<V>o - - elementpublic RFuture<List<Double>> getScoreAsync(Collection<V> elements)
RScoredSortedSetAsyncgetScoreAsync in interface RScoredSortedSetAsync<V>elements - - elementspublic Integer rank(V o)
RScoredSortedSetrank in interface RScoredSortedSet<V>o - - objectnull if value does not existpublic RFuture<Integer> rankAsync(V o)
RScoredSortedSetAsyncrankAsync in interface RScoredSortedSetAsync<V>o - - objectnull if value does not existpublic RFuture<ListScanResult<Object>> scanIteratorAsync(RedisClient client, long startPos, String pattern, int count)
public Iterator<V> iterator(String pattern)
RScoredSortedSetpattern is not null then only elements match this pattern are loaded.iterator in interface RScoredSortedSet<V>pattern - - search patternpublic Iterator<V> iterator(int count)
RScoredSortedSetcount param.iterator in interface RScoredSortedSet<V>count - - size of elements batchpublic Iterator<V> iterator(String pattern, int count)
RScoredSortedSetcount param.
If pattern is not null then only elements match this pattern are loaded.iterator in interface RScoredSortedSet<V>pattern - - search patterncount - - size of elements batchpublic Object[] toArray()
RScoredSortedSettoArray in interface RScoredSortedSet<V>public <T> T[] toArray(T[] a)
RScoredSortedSettoArray in interface RScoredSortedSet<V>T - type of elementa - - instance of arraypublic boolean containsAll(Collection<?> c)
RScoredSortedSettrue if this sorted set contains all of the elements
in encoded state in the specified collection.containsAll in interface RScoredSortedSet<V>c - collection to be checked for containment in this sorted settrue if this sorted set contains all of the elements
in the specified collectionpublic RFuture<Boolean> containsAllAsync(Collection<?> c)
RScoredSortedSetAsynctrue if this sorted set contains all of the elements
in encoded state in the specified collection.containsAllAsync in interface RScoredSortedSetAsync<V>c - collection to be checked for containment in this sorted settrue if this sorted set contains all of the elements
in the specified collectionpublic RFuture<Boolean> removeAllAsync(Collection<?> c)
RScoredSortedSetAsyncremoveAllAsync in interface RScoredSortedSetAsync<V>c - sorted set containing elements to be removed from this collectiontrue if this sorted set changed as a result of the
callpublic boolean removeAll(Collection<?> c)
RScoredSortedSetremoveAll in interface RScoredSortedSet<V>c - collection containing elements to be removed from this collectiontrue if this sorted set changed as a result of the
callpublic boolean retainAll(Collection<?> c)
RScoredSortedSetretainAll in interface RScoredSortedSet<V>c - collection containing elements to be retained in this collectiontrue if this sorted set changed as a result of the callpublic RFuture<Boolean> retainAllAsync(Collection<?> c)
RScoredSortedSetAsyncretainAllAsync in interface RScoredSortedSetAsync<V>c - collection containing elements to be retained in this collectiontrue if this sorted set changed as a result of the callpublic Double addScore(V object, Number value)
RScoredSortedSetaddScore in interface RScoredSortedSet<V>object - - element whose score needs to be increasedvalue - - valuepublic RFuture<Double> addScoreAsync(V object, Number value)
RScoredSortedSetAsyncaddScoreAsync in interface RScoredSortedSetAsync<V>object - - element whose score needs to be increasedvalue - - valuepublic Integer addScoreAndGetRank(V object, Number value)
RScoredSortedSetaddScoreAndGetRank in interface RScoredSortedSet<V>object - - object itselfvalue - - object scorepublic RFuture<Integer> addScoreAndGetRankAsync(V object, Number value)
RScoredSortedSetAsyncaddScoreAndGetRankAsync in interface RScoredSortedSetAsync<V>object - - object itselfvalue - - object scorepublic Integer addScoreAndGetRevRank(V object, Number value)
RScoredSortedSetaddScoreAndGetRevRank in interface RScoredSortedSet<V>object - - object itselfvalue - - object scorepublic RFuture<Integer> addScoreAndGetRevRankAsync(V object, Number value)
RScoredSortedSetAsyncaddScoreAndGetRevRankAsync in interface RScoredSortedSetAsync<V>object - - object itselfvalue - - object scorepublic Collection<V> valueRange(int startIndex, int endIndex)
RScoredSortedSet-1 means the highest score, -2 means the second highest score.valueRange in interface RScoredSortedSet<V>startIndex - - start indexendIndex - - end indexpublic RFuture<Collection<V>> valueRangeAsync(int startIndex, int endIndex)
RScoredSortedSetAsync-1 means the highest score, -2 means the second highest score.valueRangeAsync in interface RScoredSortedSetAsync<V>startIndex - - start indexendIndex - - end indexpublic Collection<V> valueRangeReversed(int startIndex, int endIndex)
RScoredSortedSet-1 means the highest score, -2 means the second highest score.valueRangeReversed in interface RScoredSortedSet<V>startIndex - - start indexendIndex - - end indexpublic RFuture<Collection<V>> valueRangeReversedAsync(int startIndex, int endIndex)
RScoredSortedSetAsync-1 means the highest score, -2 means the second highest score.valueRangeReversedAsync in interface RScoredSortedSetAsync<V>startIndex - - start indexendIndex - - end indexpublic Collection<ScoredEntry<V>> entryRange(int startIndex, int endIndex)
RScoredSortedSet-1 means the highest score, -2 means the second highest score.entryRange in interface RScoredSortedSet<V>startIndex - - start indexendIndex - - end indexpublic RFuture<Collection<ScoredEntry<V>>> entryRangeAsync(int startIndex, int endIndex)
RScoredSortedSetAsync-1 means the highest score, -2 means the second highest score.entryRangeAsync in interface RScoredSortedSetAsync<V>startIndex - - start indexendIndex - - end indexpublic Collection<ScoredEntry<V>> entryRangeReversed(int startIndex, int endIndex)
RScoredSortedSet-1 means the highest score, -2 means the second highest score.entryRangeReversed in interface RScoredSortedSet<V>startIndex - - start indexendIndex - - end indexpublic RFuture<Collection<ScoredEntry<V>>> entryRangeReversedAsync(int startIndex, int endIndex)
RScoredSortedSetAsync-1 means the highest score, -2 means the second highest score.entryRangeReversedAsync in interface RScoredSortedSetAsync<V>startIndex - - start indexendIndex - - end indexpublic Collection<V> valueRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetstartScore and endScore.valueRange in interface RScoredSortedSet<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic RFuture<Collection<V>> valueRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetAsyncstartScore and endScore.valueRangeAsync in interface RScoredSortedSetAsync<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic Collection<V> valueRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetstartScore and endScore in reversed order.valueRangeReversed in interface RScoredSortedSet<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic RFuture<Collection<V>> valueRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetAsyncstartScore and endScore in reversed order.valueRangeReversedAsync in interface RScoredSortedSetAsync<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic Collection<ScoredEntry<V>> entryRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetstartScore and endScore.entryRange in interface RScoredSortedSet<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic RFuture<Collection<ScoredEntry<V>>> entryRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetAsyncstartScore and endScore.entryRangeAsync in interface RScoredSortedSetAsync<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic Collection<V> valueRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
RScoredSortedSetstartScore and endScore.valueRange in interface RScoredSortedSet<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusiveoffset - - offset of sorted datacount - - amount of sorted datapublic RFuture<Collection<V>> valueRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
RScoredSortedSetAsyncstartScore and endScore.valueRangeAsync in interface RScoredSortedSetAsync<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusiveoffset - - offset of sorted datacount - - amount of sorted datapublic Collection<V> valueRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
RScoredSortedSetstartScore and endScore in reversed order.valueRangeReversed in interface RScoredSortedSet<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusiveoffset - - offset of sorted datacount - - amount of sorted datapublic RFuture<Collection<V>> valueRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
RScoredSortedSetAsyncstartScore and endScore in reversed order.valueRangeReversedAsync in interface RScoredSortedSetAsync<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusiveoffset - - offset of sorted datacount - - amount of sorted datapublic Collection<ScoredEntry<V>> entryRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
RScoredSortedSetstartScore and endScore.entryRange in interface RScoredSortedSet<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusiveoffset - - offset of sorted datacount - - amount of sorted datapublic Collection<ScoredEntry<V>> entryRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
RScoredSortedSetstartScore and endScore in reversed order.entryRangeReversed in interface RScoredSortedSet<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusiveoffset - - offset of sorted datacount - - amount of sorted datapublic RFuture<Collection<ScoredEntry<V>>> entryRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
RScoredSortedSetAsyncstartScore and endScore.entryRangeAsync in interface RScoredSortedSetAsync<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusiveoffset - - offset of sorted datacount - - amount of sorted datapublic Collection<ScoredEntry<V>> entryRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetstartScore and endScore in reversed order.entryRangeReversed in interface RScoredSortedSet<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic RFuture<Collection<ScoredEntry<V>>> entryRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetAsyncstartScore and endScore in reversed order.entryRangeReversedAsync in interface RScoredSortedSetAsync<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusivepublic RFuture<Collection<ScoredEntry<V>>> entryRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
RScoredSortedSetAsyncstartScore and endScore in reversed order.entryRangeReversedAsync in interface RScoredSortedSetAsync<V>startScore - - start score.
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersstartScoreInclusive - - start score inclusiveendScore - - end score
Use Double.POSITIVE_INFINITY or Double.NEGATIVE_INFINITY
to define infinity numbersendScoreInclusive - - end score inclusiveoffset - - offset of sorted datacount - - amount of sorted datapublic RFuture<Integer> revRankAsync(V o)
RScoredSortedSetAsyncrevRankAsync in interface RScoredSortedSetAsync<V>o - - objectnull if value does not existpublic Integer revRank(V o)
RScoredSortedSetrevRank in interface RScoredSortedSet<V>o - - objectnull if value does not existpublic RFuture<List<Integer>> revRankAsync(Collection<V> elements)
RScoredSortedSetAsyncrevRankAsync in interface RScoredSortedSetAsync<V>elements - - elementsnull if value does not existpublic List<Integer> revRank(Collection<V> elements)
RScoredSortedSetrevRank in interface RScoredSortedSet<V>elements - - elementsnull if value does not existpublic int count(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
RScoredSortedSetstartScore and endScore.count in interface RScoredSortedSet<V>startScore - - start scorestartScoreInclusive - - start score inclusiveendScore - - end scoreendScoreInclusive - - end score inclusivepublic RFuture<Integer> countAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetAsyncstartScore and endScore.countAsync in interface RScoredSortedSetAsync<V>startScore - - start scorestartScoreInclusive - - start score inclusiveendScore - - end scoreendScoreInclusive - - end score inclusivepublic int intersection(String... names)
RScoredSortedSetintersection in interface RScoredSortedSet<V>names - - names of ScoredSortedSetpublic RFuture<Integer> intersectionAsync(String... names)
RScoredSortedSetAsyncintersectionAsync in interface RScoredSortedSetAsync<V>names - - names of ScoredSortedSetpublic int intersection(RScoredSortedSet.Aggregate aggregate, String... names)
RScoredSortedSetintersection in interface RScoredSortedSet<V>aggregate - - score aggregation modenames - - names of ScoredSortedSetpublic RFuture<Integer> intersectionAsync(RScoredSortedSet.Aggregate aggregate, String... names)
RScoredSortedSetAsyncintersectionAsync in interface RScoredSortedSetAsync<V>aggregate - - score aggregation modenames - - names of ScoredSortedSetpublic int intersection(Map<String,Double> nameWithWeight)
RScoredSortedSetintersection in interface RScoredSortedSet<V>nameWithWeight - - name of ScoredSortedSet mapped to weight multiplierpublic RFuture<Integer> intersectionAsync(Map<String,Double> nameWithWeight)
RScoredSortedSetAsyncintersectionAsync in interface RScoredSortedSetAsync<V>nameWithWeight - - name of ScoredSortedSet mapped to weight multiplierpublic int intersection(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
RScoredSortedSetintersection in interface RScoredSortedSet<V>aggregate - - score aggregation modenameWithWeight - - name of ScoredSortedSet mapped to weight multiplierpublic RFuture<Integer> intersectionAsync(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
RScoredSortedSetAsyncintersectionAsync in interface RScoredSortedSetAsync<V>aggregate - - score aggregation modenameWithWeight - - name of ScoredSortedSet mapped to weight multiplierpublic int union(String... names)
RScoredSortedSetunion in interface RScoredSortedSet<V>names - - names of ScoredSortedSetpublic RFuture<Integer> unionAsync(String... names)
RScoredSortedSetAsyncunionAsync in interface RScoredSortedSetAsync<V>names - - names of ScoredSortedSetpublic int union(RScoredSortedSet.Aggregate aggregate, String... names)
RScoredSortedSetunion in interface RScoredSortedSet<V>aggregate - - score aggregation modenames - - names of ScoredSortedSetpublic RFuture<Integer> unionAsync(RScoredSortedSet.Aggregate aggregate, String... names)
RScoredSortedSetAsyncunionAsync in interface RScoredSortedSetAsync<V>aggregate - - score aggregation modenames - - names of ScoredSortedSetpublic int union(Map<String,Double> nameWithWeight)
RScoredSortedSetunion in interface RScoredSortedSet<V>nameWithWeight - - name of ScoredSortedSet mapped to weight multiplierpublic RFuture<Integer> unionAsync(Map<String,Double> nameWithWeight)
RScoredSortedSetAsyncunionAsync in interface RScoredSortedSetAsync<V>nameWithWeight - - name of ScoredSortedSet mapped to weight multiplierpublic int union(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
RScoredSortedSetunion in interface RScoredSortedSet<V>aggregate - - score aggregation modenameWithWeight - - name of ScoredSortedSet mapped to weight multiplierpublic RFuture<Integer> unionAsync(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
RScoredSortedSetAsyncunionAsync in interface RScoredSortedSetAsync<V>aggregate - - score aggregation modenameWithWeight - - name of ScoredSortedSet mapped to weight multiplierpublic Set<V> readSort(SortOrder order)
RSortablepublic RFuture<Set<V>> readSortAsync(SortOrder order)
RSortableAsyncreadSortAsync in interface RSortableAsync<Set<V>>order - for sorted datapublic Set<V> readSort(SortOrder order, int offset, int count)
RSortablepublic RFuture<Set<V>> readSortAsync(SortOrder order, int offset, int count)
RSortableAsyncreadSortAsync in interface RSortableAsync<Set<V>>order - for sorted dataoffset - of sorted datacount - of sorted datapublic Set<V> readSort(String byPattern, SortOrder order)
RSortablepublic RFuture<Set<V>> readSortAsync(String byPattern, SortOrder order)
RSortableAsyncreadSortAsync in interface RSortableAsync<Set<V>>byPattern - that is used to generate the keys that are used for sortingorder - for sorted datapublic Set<V> readSort(String byPattern, SortOrder order, int offset, int count)
RSortablepublic RFuture<Set<V>> readSortAsync(String byPattern, SortOrder order, int offset, int count)
RSortableAsyncreadSortAsync in interface RSortableAsync<Set<V>>byPattern - that is used to generate the keys that are used for sortingorder - for sorted dataoffset - of sorted datacount - of sorted datapublic <T> Collection<T> readSort(String byPattern, List<String> getPatterns, SortOrder order)
RSortablepublic <T> RFuture<Collection<T>> readSortAsync(String byPattern, List<String> getPatterns, SortOrder order)
RSortableAsyncreadSortAsync in interface RSortableAsync<Set<V>>T - object typebyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted datapublic <T> Collection<T> readSort(String byPattern, List<String> getPatterns, SortOrder order, int offset, int count)
RSortablereadSort in interface RSortable<Set<V>>T - object typebyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted dataoffset - of sorted datacount - of sorted datapublic <T> RFuture<Collection<T>> readSortAsync(String byPattern, List<String> getPatterns, SortOrder order, int offset, int count)
RSortableAsyncreadSortAsync in interface RSortableAsync<Set<V>>T - object typebyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted dataoffset - of sorted datacount - of sorted datapublic Set<V> readSortAlpha(SortOrder order)
RSortablereadSortAlpha in interface RSortable<Set<V>>order - for sorted datapublic Set<V> readSortAlpha(SortOrder order, int offset, int count)
RSortablereadSortAlpha in interface RSortable<Set<V>>order - for sorted dataoffset - of sorted datacount - of sorted datapublic Set<V> readSortAlpha(String byPattern, SortOrder order)
RSortablereadSortAlpha in interface RSortable<Set<V>>byPattern - that is used to generate the keys that are used for sortingorder - for sorted datapublic Set<V> readSortAlpha(String byPattern, SortOrder order, int offset, int count)
RSortablereadSortAlpha in interface RSortable<Set<V>>byPattern - that is used to generate the keys that are used for sortingorder - for sorted dataoffset - of sorted datacount - of sorted datapublic <T> Collection<T> readSortAlpha(String byPattern, List<String> getPatterns, SortOrder order)
RSortablereadSortAlpha in interface RSortable<Set<V>>T - object typebyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted datapublic <T> Collection<T> readSortAlpha(String byPattern, List<String> getPatterns, SortOrder order, int offset, int count)
RSortablereadSortAlpha in interface RSortable<Set<V>>T - object typebyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted dataoffset - of sorted datacount - of sorted datapublic RFuture<Set<V>> readSortAlphaAsync(SortOrder order)
RSortableAsyncreadSortAlphaAsync in interface RSortableAsync<Set<V>>order - for sorted datapublic RFuture<Set<V>> readSortAlphaAsync(SortOrder order, int offset, int count)
RSortableAsyncreadSortAlphaAsync in interface RSortableAsync<Set<V>>order - for sorted dataoffset - of sorted datacount - of sorted datapublic RFuture<Set<V>> readSortAlphaAsync(String byPattern, SortOrder order)
RSortableAsyncreadSortAlphaAsync in interface RSortableAsync<Set<V>>byPattern - that is used to generate the keys that are used for sortingorder - for sorted datapublic RFuture<Set<V>> readSortAlphaAsync(String byPattern, SortOrder order, int offset, int count)
RSortableAsyncreadSortAlphaAsync in interface RSortableAsync<Set<V>>byPattern - that is used to generate the keys that are used for sortingorder - for sorted dataoffset - of sorted datacount - of sorted datapublic <T> RFuture<Collection<T>> readSortAlphaAsync(String byPattern, List<String> getPatterns, SortOrder order)
RSortableAsyncreadSortAlphaAsync in interface RSortableAsync<Set<V>>T - object typebyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted datapublic <T> RFuture<Collection<T>> readSortAlphaAsync(String byPattern, List<String> getPatterns, SortOrder order, int offset, int count)
RSortableAsyncreadSortAlphaAsync in interface RSortableAsync<Set<V>>T - object typebyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted dataoffset - of sorted datacount - of sorted datapublic int sortTo(String destName, SortOrder order)
RSortabledestName listpublic RFuture<Integer> sortToAsync(String destName, SortOrder order)
RSortableAsyncdestName listsortToAsync in interface RSortableAsync<Set<V>>destName - list object destinationorder - for sorted datapublic int sortTo(String destName, SortOrder order, int offset, int count)
RSortabledestName listpublic RFuture<Integer> sortToAsync(String destName, SortOrder order, int offset, int count)
RSortableAsyncdestName listsortToAsync in interface RSortableAsync<Set<V>>destName - list object destinationorder - for sorted dataoffset - of sorted datacount - of sorted datapublic int sortTo(String destName, String byPattern, SortOrder order, int offset, int count)
RSortabledestName listpublic int sortTo(String destName, String byPattern, SortOrder order)
RSortabledestName listpublic RFuture<Integer> sortToAsync(String destName, String byPattern, SortOrder order)
RSortableAsyncdestName listsortToAsync in interface RSortableAsync<Set<V>>destName - list object destinationbyPattern - that is used to generate the keys that are used for sortingorder - for sorted datapublic RFuture<Integer> sortToAsync(String destName, String byPattern, SortOrder order, int offset, int count)
RSortableAsyncdestName listsortToAsync in interface RSortableAsync<Set<V>>destName - list object destinationbyPattern - that is used to generate the keys that are used for sortingorder - for sorted dataoffset - of sorted datacount - of sorted datapublic int sortTo(String destName, String byPattern, List<String> getPatterns, SortOrder order)
RSortabledestName listpublic RFuture<Integer> sortToAsync(String destName, String byPattern, List<String> getPatterns, SortOrder order)
RSortableAsyncdestName listsortToAsync in interface RSortableAsync<Set<V>>destName - list object destinationbyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted datapublic int sortTo(String destName, String byPattern, List<String> getPatterns, SortOrder order, int offset, int count)
RSortabledestName listsortTo in interface RSortable<Set<V>>destName - list object destinationbyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted dataoffset - of sorted datacount - of sorted datapublic RFuture<Integer> sortToAsync(String destName, String byPattern, List<String> getPatterns, SortOrder order, int offset, int count)
RSortableAsyncdestName listsortToAsync in interface RSortableAsync<Set<V>>destName - list object destinationbyPattern - that is used to generate the keys that are used for sortinggetPatterns - that is used to load values by keys in sorted vieworder - for sorted dataoffset - of sorted datacount - of sorted datapublic RFuture<V> takeFirstAsync()
RScoredSortedSetAsynctakeFirstAsync in interface RScoredSortedSetAsync<V>public RFuture<V> takeLastAsync()
RScoredSortedSetAsynctakeLastAsync in interface RScoredSortedSetAsync<V>public V takeFirst()
RScoredSortedSettakeFirst in interface RScoredSortedSet<V>public V takeLast()
RScoredSortedSettakeLast in interface RScoredSortedSet<V>public int subscribeOnFirstElements(Consumer<V> consumer)
RScoredSortedSetRScoredSortedSetAsync.takeFirstAsync() method to get a new element.subscribeOnFirstElements in interface RScoredSortedSet<V>consumer - - queue elements listenerpublic int subscribeOnLastElements(Consumer<V> consumer)
RScoredSortedSetRScoredSortedSetAsync.takeLastAsync() method to get a new element.subscribeOnLastElements in interface RScoredSortedSet<V>consumer - - queue elements listenerpublic void unsubscribe(int listenerId)
RScoredSortedSetunsubscribe in interface RScoredSortedSet<V>listenerId - - id of listenerpublic Stream<V> stream()
RScoredSortedSetstream in interface RScoredSortedSet<V>public Stream<V> stream(String pattern)
RScoredSortedSetpattern is not null then only elements match this pattern are loaded.stream in interface RScoredSortedSet<V>pattern - - search patternpublic Stream<V> stream(int count)
RScoredSortedSetcount param.stream in interface RScoredSortedSet<V>count - - size of elements batchpublic Stream<V> stream(String pattern, int count)
RScoredSortedSetcount param.
If pattern is not null then only elements match this pattern are loaded.stream in interface RScoredSortedSet<V>pattern - - search patterncount - - size of elements batchpublic boolean expire(long timeToLive,
TimeUnit timeUnit)
RExpirableexpire in interface RExpirabletimeToLive - - timeout before object will be deletedtimeUnit - - timeout time unittrue if the timeout was set and false if notpublic RFuture<Boolean> expireAsync(long timeToLive, TimeUnit timeUnit)
RExpirableAsyncexpireAsync in interface RExpirableAsynctimeToLive - - timeout before object will be deletedtimeUnit - - timeout time unittrue if the timeout was set and false if notpublic boolean expireAt(long timestamp)
RExpirableexpireAt in interface RExpirabletimestamp - - expire date in milliseconds (Unix timestamp)true if the timeout was set and false if notpublic RFuture<Boolean> expireAtAsync(long timestamp)
RExpirableAsyncexpireAtAsync in interface RExpirableAsynctimestamp - - expire date in milliseconds (Unix timestamp)true if the timeout was set and false if notpublic boolean expireAt(Date timestamp)
RExpirableexpireAt in interface RExpirabletimestamp - - expire datetrue if the timeout was set and false if notpublic RFuture<Boolean> expireAtAsync(Date timestamp)
RExpirableAsyncexpireAtAsync in interface RExpirableAsynctimestamp - - expire datetrue if the timeout was set and false if notpublic boolean clearExpire()
RExpirableclearExpire in interface RExpirabletrue if timeout was removed
false if object does not exist or does not have an associated timeoutpublic RFuture<Boolean> clearExpireAsync()
RExpirableAsyncclearExpireAsync in interface RExpirableAsynctrue if the timeout was cleared and false if notpublic long remainTimeToLive()
RExpirableremainTimeToLive in interface RExpirablepublic RFuture<Long> remainTimeToLiveAsync()
RExpirableAsyncremainTimeToLiveAsync in interface RExpirableAsyncprotected RFuture<Boolean> expireAsync(long timeToLive, TimeUnit timeUnit, String... keys)
Copyright © 2014–2020 Redisson. All rights reserved.