V
- value typepublic class RedissonScoredSortedSet<V> extends RedissonObject implements RScoredSortedSet<V>
RScoredSortedSet.Aggregate
codec, commandExecutor
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.
|
Long |
addAll(Map<V,Double> objects) |
RFuture<Long> |
addAllAsync(Map<V,Double> objects) |
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.
|
RFuture<Integer> |
addAndGetRevRankAsync(double score,
V object)
Adds element 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) |
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) |
void |
clear() |
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.
|
boolean |
contains(Object object) |
boolean |
containsAll(Collection<?> c) |
RFuture<Boolean> |
containsAllAsync(Collection<?> c) |
RFuture<Boolean> |
containsAsync(Object o) |
Long |
count(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns the number of elements with a score between
startScore and endScore . |
RFuture<Long> |
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) |
Collection<ScoredEntry<V>> |
entryRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count) |
Collection<ScoredEntry<V>> |
entryRange(int startIndex,
int endIndex) |
RFuture<Collection<ScoredEntry<V>>> |
entryRangeAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive) |
RFuture<Collection<ScoredEntry<V>>> |
entryRangeAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count) |
RFuture<Collection<ScoredEntry<V>>> |
entryRangeAsync(int startIndex,
int endIndex) |
Collection<ScoredEntry<V>> |
entryRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive) |
Collection<ScoredEntry<V>> |
entryRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count) |
Collection<ScoredEntry<V>> |
entryRangeReversed(int startIndex,
int endIndex) |
RFuture<Collection<ScoredEntry<V>>> |
entryRangeReversedAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive) |
RFuture<Collection<ScoredEntry<V>>> |
entryRangeReversedAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count) |
RFuture<Collection<ScoredEntry<V>>> |
entryRangeReversedAsync(int startIndex,
int endIndex) |
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.
|
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.
|
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. |
Double |
getScore(V o)
Returns score of element or
null if it doesn't exist. |
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() |
Iterator<V> |
iterator() |
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 or
null if this sorted set is empty. |
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 or
null if this sorted set is empty. |
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 or
null if this sorted set is empty. |
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 or
null if this sorted set is empty. |
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
|
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) |
boolean |
removeAll(Collection<?> c) |
RFuture<Boolean> |
removeAllAsync(Collection<?> c) |
RFuture<Boolean> |
removeAsync(Object object) |
int |
removeRangeByRank(int startIndex,
int endIndex) |
RFuture<Integer> |
removeRangeByRankAsync(int startIndex,
int endIndex) |
int |
removeRangeByScore(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive) |
RFuture<Integer> |
removeRangeByScoreAsync(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive) |
boolean |
retainAll(Collection<?> c) |
RFuture<Boolean> |
retainAllAsync(Collection<?> c) |
Integer |
revRank(V o)
Returns rank of value, 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.
|
int |
size() |
RFuture<Integer> |
sizeAsync() |
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 |
Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
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
|
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) |
Collection<V> |
valueRange(int startIndex,
int endIndex) |
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) |
RFuture<Collection<V>> |
valueRangeAsync(int startIndex,
int endIndex) |
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) |
Collection<V> |
valueRangeReversed(int startIndex,
int endIndex) |
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) |
RFuture<Collection<V>> |
valueRangeReversedAsync(int startIndex,
int endIndex) |
await, copy, copyAsync, delete, deleteAsync, encode, encode, encode, encodeMapKey, encodeMapKeys, encodeMapValue, encodeMapValues, get, getCodec, getName, getName, isExists, isExistsAsync, migrate, migrateAsync, move, moveAsync, prefixName, rename, renameAsync, renamenx, renamenxAsync, suffixName, toSeconds, touch, touchAsync, unlink, unlinkAsync
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
forEach, spliterator
clearExpire, expire, expireAt, expireAt, remainTimeToLive
copy, delete, getCodec, getName, isExists, migrate, move, rename, renamenx, touch, unlink
clearExpireAsync, expireAsync, expireAtAsync, expireAtAsync, remainTimeToLiveAsync
copyAsync, deleteAsync, isExistsAsync, migrateAsync, moveAsync, renameAsync, renamenxAsync, touchAsync, unlinkAsync
public 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()
RScoredSortedSet
RMapReduce
object associated with this objectmapReduce
in interface RScoredSortedSet<V>
KOut
- output keyVOut
- output valuepublic Collection<V> readAll()
RScoredSortedSet
readAll
in interface RScoredSortedSet<V>
public RFuture<Collection<V>> readAllAsync()
RScoredSortedSetAsync
readAllAsync
in interface RScoredSortedSetAsync<V>
public V pollFirst()
RScoredSortedSet
null
if this sorted set is empty.pollFirst
in interface RScoredSortedSet<V>
null
if this sorted set is emptypublic V pollLast()
RScoredSortedSet
null
if this sorted set is empty.pollLast
in interface RScoredSortedSet<V>
null
if this sorted set is emptypublic Collection<V> pollFirst(int count)
RScoredSortedSet
null
if this sorted set is empty.pollFirst
in interface RScoredSortedSet<V>
count
- - elements amountnull
if this sorted set is emptypublic Collection<V> pollLast(int count)
RScoredSortedSet
null
if this sorted set is empty.pollLast
in interface RScoredSortedSet<V>
count
- - elements amountnull
if this sorted set is emptypublic RFuture<Collection<V>> pollFirstAsync(int count)
RScoredSortedSetAsync
null
if this sorted set is empty.pollFirstAsync
in interface RScoredSortedSetAsync<V>
count
- - elements amountnull
if this sorted set is emptypublic RFuture<Collection<V>> pollLastAsync(int count)
RScoredSortedSetAsync
null
if this sorted set is empty.pollLastAsync
in interface RScoredSortedSetAsync<V>
count
- - elements amountnull
if this sorted set is emptypublic RFuture<V> pollFirstAsync()
RScoredSortedSetAsync
null
if this sorted set is empty.pollFirstAsync
in interface RScoredSortedSetAsync<V>
null
if this sorted set is emptypublic RFuture<V> pollLastAsync()
RScoredSortedSetAsync
null
if this sorted set is empty.pollLastAsync
in interface RScoredSortedSetAsync<V>
null
if this sorted set is emptypublic V pollFirst(long timeout, TimeUnit unit)
RScoredSortedSet
null
if this sorted set is empty.pollFirst
in interface RScoredSortedSet<V>
timeout
- how long to wait before giving up, in units of
unit
unit
- a TimeUnit
determining how to interpret the
timeout
parameternull
if this sorted set is emptypublic RFuture<V> pollFirstAsync(long timeout, TimeUnit unit)
RScoredSortedSetAsync
null
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
unit
unit
- a TimeUnit
determining how to interpret the
timeout
parameternull
if this sorted set is emptypublic V pollFirstFromAny(long timeout, TimeUnit unit, String... queueNames)
RScoredSortedSet
Requires Redis 5.0.0 and higher.
pollFirstFromAny
in interface RScoredSortedSet<V>
timeout
- how long to wait before giving up, in units of
unit
unit
- 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)
RScoredSortedSetAsync
Requires Redis 5.0.0 and higher.
pollFirstFromAnyAsync
in interface RScoredSortedSetAsync<V>
timeout
- how long to wait before giving up, in units of
unit
unit
- 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)
RScoredSortedSet
Requires Redis 5.0.0 and higher.
pollLastFromAny
in interface RScoredSortedSet<V>
timeout
- how long to wait before giving up, in units of
unit
unit
- 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)
RScoredSortedSetAsync
Requires Redis 5.0.0 and higher.
pollLastFromAnyAsync
in interface RScoredSortedSetAsync<V>
timeout
- how long to wait before giving up, in units of
unit
unit
- a TimeUnit
determining how to interpret the
timeout
parameterqueueNames
- - names of queuenull
if all sorted sets are emptypublic V pollLast(long timeout, TimeUnit unit)
RScoredSortedSet
null
if this sorted set is empty.pollLast
in interface RScoredSortedSet<V>
timeout
- how long to wait before giving up, in units of
unit
unit
- a TimeUnit
determining how to interpret the
timeout
parameternull
if this sorted set is emptypublic RFuture<V> pollLastAsync(long timeout, TimeUnit unit)
RScoredSortedSetAsync
null
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
unit
unit
- a TimeUnit
determining how to interpret the
timeout
parameternull
if this sorted set is emptypublic boolean add(double score, V object)
RScoredSortedSet
add
in interface RScoredSortedSet<V>
score
- - object scoreobject
- - object itselftrue
if element has added and false
if not.public Integer addAndGetRank(double score, V object)
RScoredSortedSet
addAndGetRank
in interface RScoredSortedSet<V>
score
- - object scoreobject
- - object itselfpublic RFuture<Integer> addAndGetRankAsync(double score, V object)
RScoredSortedSetAsync
addAndGetRankAsync
in interface RScoredSortedSetAsync<V>
score
- - object scoreobject
- - object itselfpublic Integer addAndGetRevRank(double score, V object)
RScoredSortedSet
addAndGetRevRank
in interface RScoredSortedSet<V>
score
- - object scoreobject
- - object itselfpublic RFuture<Integer> addAndGetRevRankAsync(double score, V object)
RScoredSortedSetAsync
addAndGetRevRankAsync
in interface RScoredSortedSetAsync<V>
score
- - object scoreobject
- - object itselfpublic boolean tryAdd(double score, V object)
RScoredSortedSet
Works 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()
RScoredSortedSet
null
if this sorted set is empty.first
in interface RScoredSortedSet<V>
null
if this sorted set is emptypublic RFuture<V> firstAsync()
RScoredSortedSetAsync
null
if this sorted set is empty.firstAsync
in interface RScoredSortedSetAsync<V>
null
if this sorted set is emptypublic V last()
RScoredSortedSet
null
if this sorted set is empty.last
in interface RScoredSortedSet<V>
null
if this sorted set is emptypublic RFuture<V> lastAsync()
RScoredSortedSetAsync
null
if this sorted set is empty.lastAsync
in interface RScoredSortedSetAsync<V>
null
if this sorted set is emptypublic Double firstScore()
RScoredSortedSet
null
if this sorted set is empty.firstScore
in interface RScoredSortedSet<V>
null
if this sorted set is emptypublic RFuture<Double> firstScoreAsync()
RScoredSortedSetAsync
null
if this sorted set is empty.firstScoreAsync
in interface RScoredSortedSetAsync<V>
null
if this sorted set is emptypublic Double lastScore()
RScoredSortedSet
null
if this sorted set is empty.lastScore
in interface RScoredSortedSet<V>
null
if this sorted set is emptypublic RFuture<Double> lastScoreAsync()
RScoredSortedSetAsync
null
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)
RScoredSortedSetAsync
addAsync
in interface RScoredSortedSetAsync<V>
score
- - object scoreobject
- - object itselftrue
if element has added and false
if not.public Long addAll(Map<V,Double> objects)
addAll
in interface RScoredSortedSet<V>
public RFuture<Long> addAllAsync(Map<V,Double> objects)
addAllAsync
in interface RScoredSortedSetAsync<V>
public RFuture<Boolean> tryAddAsync(double score, V object)
RScoredSortedSetAsync
Requires 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)
remove
in interface RScoredSortedSet<V>
public int removeRangeByRank(int startIndex, int endIndex)
removeRangeByRank
in interface RScoredSortedSet<V>
public RFuture<Integer> removeRangeByRankAsync(int startIndex, int endIndex)
removeRangeByRankAsync
in interface RScoredSortedSetAsync<V>
public int removeRangeByScore(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
removeRangeByScore
in interface RScoredSortedSet<V>
public RFuture<Integer> removeRangeByScoreAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
removeRangeByScoreAsync
in interface RScoredSortedSetAsync<V>
public void clear()
clear
in interface RScoredSortedSet<V>
public RFuture<Boolean> removeAsync(Object object)
removeAsync
in interface RScoredSortedSetAsync<V>
public boolean isEmpty()
isEmpty
in interface RScoredSortedSet<V>
public int size()
size
in interface RScoredSortedSet<V>
public RFuture<Integer> sizeAsync()
sizeAsync
in interface RScoredSortedSetAsync<V>
public boolean contains(Object object)
contains
in interface RScoredSortedSet<V>
public RFuture<Boolean> containsAsync(Object o)
containsAsync
in interface RScoredSortedSetAsync<V>
public Double getScore(V o)
RScoredSortedSet
null
if it doesn't exist.getScore
in interface RScoredSortedSet<V>
o
- - elementpublic RFuture<Double> getScoreAsync(V o)
RScoredSortedSetAsync
null
if it doesn't exist.getScoreAsync
in interface RScoredSortedSetAsync<V>
o
- - elementpublic Integer rank(V o)
RScoredSortedSet
rank
in interface RScoredSortedSet<V>
o
- - objectnull
if value does not existpublic RFuture<Integer> rankAsync(V o)
RScoredSortedSetAsync
rankAsync
in interface RScoredSortedSetAsync<V>
o
- - objectnull
if value does not existpublic Object[] toArray()
toArray
in interface RScoredSortedSet<V>
public <T> T[] toArray(T[] a)
toArray
in interface RScoredSortedSet<V>
public boolean containsAll(Collection<?> c)
containsAll
in interface RScoredSortedSet<V>
public RFuture<Boolean> containsAllAsync(Collection<?> c)
containsAllAsync
in interface RScoredSortedSetAsync<V>
public RFuture<Boolean> removeAllAsync(Collection<?> c)
removeAllAsync
in interface RScoredSortedSetAsync<V>
public boolean removeAll(Collection<?> c)
removeAll
in interface RScoredSortedSet<V>
public boolean retainAll(Collection<?> c)
retainAll
in interface RScoredSortedSet<V>
public RFuture<Boolean> retainAllAsync(Collection<?> c)
retainAllAsync
in interface RScoredSortedSetAsync<V>
public Double addScore(V object, Number value)
addScore
in interface RScoredSortedSet<V>
public RFuture<Double> addScoreAsync(V object, Number value)
addScoreAsync
in interface RScoredSortedSetAsync<V>
public Integer addScoreAndGetRank(V object, Number value)
RScoredSortedSet
addScoreAndGetRank
in interface RScoredSortedSet<V>
object
- - object itselfvalue
- - object scorepublic RFuture<Integer> addScoreAndGetRankAsync(V object, Number value)
RScoredSortedSetAsync
addScoreAndGetRankAsync
in interface RScoredSortedSetAsync<V>
object
- - object itselfvalue
- - object scorepublic Integer addScoreAndGetRevRank(V object, Number value)
RScoredSortedSet
addScoreAndGetRevRank
in interface RScoredSortedSet<V>
object
- - object itselfvalue
- - object scorepublic RFuture<Integer> addScoreAndGetRevRankAsync(V object, Number value)
RScoredSortedSetAsync
addScoreAndGetRevRankAsync
in interface RScoredSortedSetAsync<V>
object
- - object itselfvalue
- - object scorepublic Collection<V> valueRange(int startIndex, int endIndex)
valueRange
in interface RScoredSortedSet<V>
public RFuture<Collection<V>> valueRangeAsync(int startIndex, int endIndex)
valueRangeAsync
in interface RScoredSortedSetAsync<V>
public Collection<V> valueRangeReversed(int startIndex, int endIndex)
valueRangeReversed
in interface RScoredSortedSet<V>
public RFuture<Collection<V>> valueRangeReversedAsync(int startIndex, int endIndex)
valueRangeReversedAsync
in interface RScoredSortedSetAsync<V>
public Collection<ScoredEntry<V>> entryRange(int startIndex, int endIndex)
entryRange
in interface RScoredSortedSet<V>
public RFuture<Collection<ScoredEntry<V>>> entryRangeAsync(int startIndex, int endIndex)
entryRangeAsync
in interface RScoredSortedSetAsync<V>
public Collection<ScoredEntry<V>> entryRangeReversed(int startIndex, int endIndex)
entryRangeReversed
in interface RScoredSortedSet<V>
public RFuture<Collection<ScoredEntry<V>>> entryRangeReversedAsync(int startIndex, int endIndex)
entryRangeReversedAsync
in interface RScoredSortedSetAsync<V>
public Collection<V> valueRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSet
startScore
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)
RScoredSortedSetAsync
startScore
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)
RScoredSortedSet
startScore
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)
RScoredSortedSetAsync
startScore
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)
entryRange
in interface RScoredSortedSet<V>
public RFuture<Collection<ScoredEntry<V>>> entryRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
entryRangeAsync
in interface RScoredSortedSetAsync<V>
public Collection<V> valueRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
valueRange
in interface RScoredSortedSet<V>
public RFuture<Collection<V>> valueRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
valueRangeAsync
in interface RScoredSortedSetAsync<V>
public Collection<V> valueRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
valueRangeReversed
in interface RScoredSortedSet<V>
public RFuture<Collection<V>> valueRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
valueRangeReversedAsync
in interface RScoredSortedSetAsync<V>
public Collection<ScoredEntry<V>> entryRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
entryRange
in interface RScoredSortedSet<V>
public Collection<ScoredEntry<V>> entryRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
entryRangeReversed
in interface RScoredSortedSet<V>
public RFuture<Collection<ScoredEntry<V>>> entryRangeAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
entryRangeAsync
in interface RScoredSortedSetAsync<V>
public Collection<ScoredEntry<V>> entryRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
entryRangeReversed
in interface RScoredSortedSet<V>
public RFuture<Collection<ScoredEntry<V>>> entryRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
entryRangeReversedAsync
in interface RScoredSortedSetAsync<V>
public RFuture<Collection<ScoredEntry<V>>> entryRangeReversedAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
entryRangeReversedAsync
in interface RScoredSortedSetAsync<V>
public RFuture<Integer> revRankAsync(V o)
RScoredSortedSetAsync
revRankAsync
in interface RScoredSortedSetAsync<V>
o
- - objectnull
if value does not existpublic Integer revRank(V o)
RScoredSortedSet
revRank
in interface RScoredSortedSet<V>
o
- - objectnull
if value does not existpublic Long count(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSet
startScore
and endScore
.count
in interface RScoredSortedSet<V>
startScore
- - start scorestartScoreInclusive
- - start score inclusiveendScore
- - end scoreendScoreInclusive
- - end score inclusivepublic RFuture<Long> countAsync(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
RScoredSortedSetAsync
startScore
and endScore
.countAsync
in interface RScoredSortedSetAsync<V>
startScore
- - start scorestartScoreInclusive
- - start score inclusiveendScore
- - end scoreendScoreInclusive
- - end score inclusivepublic int intersection(String... names)
RScoredSortedSet
intersection
in interface RScoredSortedSet<V>
names
- - names of ScoredSortedSetpublic RFuture<Integer> intersectionAsync(String... names)
RScoredSortedSetAsync
intersectionAsync
in interface RScoredSortedSetAsync<V>
names
- - names of ScoredSortedSetpublic int intersection(RScoredSortedSet.Aggregate aggregate, String... names)
RScoredSortedSet
intersection
in interface RScoredSortedSet<V>
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetpublic RFuture<Integer> intersectionAsync(RScoredSortedSet.Aggregate aggregate, String... names)
RScoredSortedSetAsync
intersectionAsync
in interface RScoredSortedSetAsync<V>
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetpublic int intersection(Map<String,Double> nameWithWeight)
RScoredSortedSet
intersection
in interface RScoredSortedSet<V>
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierpublic RFuture<Integer> intersectionAsync(Map<String,Double> nameWithWeight)
RScoredSortedSetAsync
intersectionAsync
in interface RScoredSortedSetAsync<V>
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierpublic int intersection(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
RScoredSortedSet
intersection
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)
RScoredSortedSetAsync
intersectionAsync
in interface RScoredSortedSetAsync<V>
aggregate
- - score aggregation modenameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierpublic int union(String... names)
RScoredSortedSet
union
in interface RScoredSortedSet<V>
names
- - names of ScoredSortedSetpublic RFuture<Integer> unionAsync(String... names)
RScoredSortedSetAsync
unionAsync
in interface RScoredSortedSetAsync<V>
names
- - names of ScoredSortedSetpublic int union(RScoredSortedSet.Aggregate aggregate, String... names)
RScoredSortedSet
union
in interface RScoredSortedSet<V>
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetpublic RFuture<Integer> unionAsync(RScoredSortedSet.Aggregate aggregate, String... names)
RScoredSortedSetAsync
unionAsync
in interface RScoredSortedSetAsync<V>
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetpublic int union(Map<String,Double> nameWithWeight)
RScoredSortedSet
union
in interface RScoredSortedSet<V>
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierpublic RFuture<Integer> unionAsync(Map<String,Double> nameWithWeight)
RScoredSortedSetAsync
unionAsync
in interface RScoredSortedSetAsync<V>
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierpublic int union(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
RScoredSortedSet
union
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)
RScoredSortedSetAsync
unionAsync
in interface RScoredSortedSetAsync<V>
aggregate
- - score aggregation modenameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierpublic Set<V> readSort(SortOrder order)
RSortable
public RFuture<Set<V>> readSortAsync(SortOrder order)
RSortableAsync
readSortAsync
in interface RSortableAsync<Set<V>>
order
- for sorted datapublic Set<V> readSort(SortOrder order, int offset, int count)
RSortable
public RFuture<Set<V>> readSortAsync(SortOrder order, int offset, int count)
RSortableAsync
readSortAsync
in interface RSortableAsync<Set<V>>
order
- for sorted dataoffset
- of sorted datacount
- of sorted datapublic Set<V> readSort(String byPattern, SortOrder order)
RSortable
public RFuture<Set<V>> readSortAsync(String byPattern, SortOrder order)
RSortableAsync
readSortAsync
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)
RSortable
public RFuture<Set<V>> readSortAsync(String byPattern, SortOrder order, int offset, int count)
RSortableAsync
readSortAsync
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)
RSortable
public <T> RFuture<Collection<T>> readSortAsync(String byPattern, List<String> getPatterns, SortOrder order)
RSortableAsync
readSortAsync
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)
RSortable
readSort
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)
RSortableAsync
readSortAsync
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)
RSortable
destName
listpublic RFuture<Integer> sortToAsync(String destName, SortOrder order)
RSortableAsync
destName
listsortToAsync
in interface RSortableAsync<Set<V>>
destName
- list object destinationorder
- for sorted datapublic int sortTo(String destName, SortOrder order, int offset, int count)
RSortable
destName
listpublic RFuture<Integer> sortToAsync(String destName, SortOrder order, int offset, int count)
RSortableAsync
destName
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)
RSortable
destName
listpublic int sortTo(String destName, String byPattern, SortOrder order)
RSortable
destName
listpublic RFuture<Integer> sortToAsync(String destName, String byPattern, SortOrder order)
RSortableAsync
destName
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)
RSortableAsync
destName
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)
RSortable
destName
listpublic RFuture<Integer> sortToAsync(String destName, String byPattern, List<String> getPatterns, SortOrder order)
RSortableAsync
destName
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)
RSortable
destName
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)
RSortableAsync
destName
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 boolean expire(long timeToLive, TimeUnit timeUnit)
RExpirable
expire
in interface RExpirable
timeToLive
- - 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)
RExpirableAsync
expireAsync
in interface RExpirableAsync
timeToLive
- - timeout before object will be deletedtimeUnit
- - timeout time unittrue
if the timeout was set and false
if notpublic boolean expireAt(long timestamp)
RExpirable
expireAt
in interface RExpirable
timestamp
- - expire date in milliseconds (Unix timestamp)true
if the timeout was set and false
if notpublic RFuture<Boolean> expireAtAsync(long timestamp)
RExpirableAsync
expireAtAsync
in interface RExpirableAsync
timestamp
- - expire date in seconds (Unix timestamp)true
if the timeout was set and false
if notpublic boolean expireAt(Date timestamp)
RExpirable
expireAt
in interface RExpirable
timestamp
- - expire datetrue
if the timeout was set and false
if notpublic RFuture<Boolean> expireAtAsync(Date timestamp)
RExpirableAsync
expireAtAsync
in interface RExpirableAsync
timestamp
- - expire datetrue
if the timeout was set and false
if notpublic boolean clearExpire()
RExpirable
clearExpire
in interface RExpirable
true
if timeout was removed
false
if object does not exist or does not have an associated timeoutpublic RFuture<Boolean> clearExpireAsync()
RExpirableAsync
clearExpireAsync
in interface RExpirableAsync
true
if the timeout was cleared and false
if notpublic long remainTimeToLive()
RExpirable
remainTimeToLive
in interface RExpirable
public RFuture<Long> remainTimeToLiveAsync()
RExpirableAsync
remainTimeToLiveAsync
in interface RExpirableAsync
Copyright © 2014–2018 The Redisson Project. All rights reserved.