V
- object typepublic interface RScoredSortedSet<V> extends RScoredSortedSetAsync<V>, Iterable<V>, RExpirable, RSortable<Set<V>>
Modifier and Type | Interface and Description |
---|---|
static class |
RScoredSortedSet.Aggregate |
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.
|
Integer |
addAndGetRank(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.
|
Double |
addScore(V element,
Number value)
Increases score of specified element by value.
|
Integer |
addScoreAndGetRank(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
|
void |
clear()
Removes all elements of this sorted set.
|
boolean |
contains(Object o)
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. |
int |
count(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.
|
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.
|
V |
first()
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. |
Double |
getScore(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
|
boolean |
isEmpty()
Returns
true if this set is empty |
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. |
Double |
lastScore()
Returns score of the head 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. |
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.
|
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. |
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.
|
Integer |
rank(V o)
Returns rank of value, with the scores ordered from low to high.
|
Collection<V> |
readAll()
Read all values at once.
|
boolean |
remove(Object o)
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.
|
int |
removeRangeByRank(int startIndex,
int endIndex)
Removes values by rank range.
|
int |
removeRangeByScore(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.
|
Integer |
revRank(V o)
Returns rank of value, with the scores ordered from high to low.
|
int |
size()
Returns size of this set.
|
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.
|
V |
takeFirst()
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.
|
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.
|
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
|
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.
|
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.
|
addAllAsync, addAndGetRankAsync, addAndGetRevRankAsync, addAsync, addScoreAndGetRankAsync, addScoreAndGetRevRankAsync, addScoreAsync, containsAllAsync, containsAsync, countAsync, entryRangeAsync, entryRangeAsync, entryRangeAsync, entryRangeReversedAsync, entryRangeReversedAsync, entryRangeReversedAsync, firstAsync, firstScoreAsync, getScoreAsync, intersectionAsync, intersectionAsync, intersectionAsync, intersectionAsync, lastAsync, lastScoreAsync, pollFirstAsync, pollFirstAsync, pollFirstAsync, pollFirstFromAnyAsync, pollLastAsync, pollLastAsync, pollLastAsync, pollLastFromAnyAsync, rankAsync, readAllAsync, removeAllAsync, removeAsync, removeRangeByRankAsync, removeRangeByScoreAsync, retainAllAsync, revRankAsync, sizeAsync, takeFirstAsync, takeLastAsync, tryAddAsync, unionAsync, unionAsync, unionAsync, unionAsync, valueRangeAsync, valueRangeAsync, valueRangeAsync, valueRangeReversedAsync, valueRangeReversedAsync, valueRangeReversedAsync
forEach, iterator, spliterator
clearExpire, expire, expireAt, expireAt, remainTimeToLive
copy, delete, dump, getCodec, getName, isExists, migrate, move, rename, renamenx, restore, restore, restoreAndReplace, restoreAndReplace, sizeInMemory, touch, unlink
clearExpireAsync, expireAsync, expireAtAsync, expireAtAsync, remainTimeToLiveAsync
copyAsync, deleteAsync, dumpAsync, isExistsAsync, migrateAsync, moveAsync, renameAsync, renamenxAsync, restoreAndReplaceAsync, restoreAndReplaceAsync, restoreAsync, restoreAsync, sizeInMemoryAsync, touchAsync, unlinkAsync
readSort, readSort, readSort, readSort, readSort, readSort, readSortAlpha, readSortAlpha, readSortAlpha, readSortAlpha, readSortAlpha, readSortAlpha, sortTo, sortTo, sortTo, sortTo, sortTo, sortTo
readSortAlphaAsync, readSortAlphaAsync, readSortAlphaAsync, readSortAlphaAsync, readSortAlphaAsync, readSortAlphaAsync, readSortAsync, readSortAsync, readSortAsync, readSortAsync, readSortAsync, readSortAsync, sortToAsync, sortToAsync, sortToAsync, sortToAsync, sortToAsync, sortToAsync
<KOut,VOut> RCollectionMapReduce<V,KOut,VOut> mapReduce()
RMapReduce
object associated with this objectKOut
- output keyVOut
- output valueV pollLastFromAny(long timeout, TimeUnit unit, String... queueNames)
Requires Redis 5.0.0 and higher.
queueNames
- - names of queuetimeout
- how long to wait before giving up, in units of
unit
unit
- a TimeUnit
determining how to interpret the
timeout
parameternull
if all sorted sets are emptyV pollFirstFromAny(long timeout, TimeUnit unit, String... queueNames)
Requires Redis 5.0.0 and higher.
queueNames
- - names of queuetimeout
- how long to wait before giving up, in units of
unit
unit
- a TimeUnit
determining how to interpret the
timeout
parameternull
if all sorted sets are emptyV takeFirst()
V takeLast()
V pollFirst(long timeout, TimeUnit unit)
null
if this sorted set is empty.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 emptyV pollLast(long timeout, TimeUnit unit)
null
if this sorted set is empty.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 emptyCollection<V> pollFirst(int count)
null
if this sorted set is empty.count
- - elements amountnull
if this sorted set is emptyCollection<V> pollLast(int count)
null
if this sorted set is empty.count
- - elements amountnull
if this sorted set is emptyV pollFirst()
null
if this sorted set is empty.null
if this sorted set is emptyV pollLast()
null
if this sorted set is empty.null
if this sorted set is emptyV first()
null
if this sorted set is empty.null
if this sorted set is emptyV last()
null
if this sorted set is empty.null
if this sorted set is emptyDouble firstScore()
null
if this sorted set is empty.null
if this sorted set is emptyDouble lastScore()
null
if this sorted set is empty.null
if this sorted set is emptyint addAll(Map<V,Double> objects)
objects
- - map of elements to addint removeRangeByScore(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
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 inclusiveint removeRangeByRank(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexInteger rank(V o)
o
- - objectnull
if value does not existInteger revRank(V o)
o
- - objectnull
if value does not existDouble getScore(V o)
null
if it doesn't exist.o
- - elementboolean add(double score, V object)
score
- - object scoreobject
- - object itselftrue
if element has added and false
if not.Integer addAndGetRank(double score, V object)
score
- - object scoreobject
- - object itselfInteger addAndGetRevRank(double score, V object)
score
- - object scoreobject
- - object itselfboolean tryAdd(double score, V object)
Works only with Redis 3.0.2 and higher.
score
- - object scoreobject
- - object itselftrue
if element has added and false
if not.int size()
boolean isEmpty()
true
if this set is emptytrue
if emptyStream<V> stream()
Stream<V> stream(String pattern)
pattern
is not null then only elements match this pattern are loaded.pattern
- - search patternStream<V> stream(int count)
count
param.count
- - size of elements batchStream<V> stream(String pattern, int count)
count
param.
If pattern is not null then only elements match this pattern are loaded.pattern
- - search patterncount
- - size of elements batchIterator<V> iterator(String pattern)
pattern
is not null then only elements match this pattern are loaded.pattern
- - search patternIterator<V> iterator(int count)
count
param.count
- - size of elements batchIterator<V> iterator(String pattern, int count)
count
param.
If pattern is not null then only elements match this pattern are loaded.pattern
- - search patterncount
- - size of elements batchboolean contains(Object o)
true
if this sorted set contains encoded state of the specified element.o
- element whose presence in this collection is to be testedtrue
if this sorted set contains the specified
element and false
otherwiseObject[] toArray()
<T> T[] toArray(T[] a)
a
- - instance of arrayboolean remove(Object o)
o
- element to be removed from this sorted set, if presenttrue
if an element was removed as a result of this callboolean containsAll(Collection<?> c)
true
if this sorted set contains all of the elements
in encoded state in the specified collection.c
- collection to be checked for containment in this sorted settrue
if this sorted set contains all of the elements
in the specified collectionboolean removeAll(Collection<?> c)
c
- collection containing elements to be removed from this collectiontrue
if this sorted set changed as a result of the
callboolean retainAll(Collection<?> c)
c
- collection containing elements to be retained in this collectiontrue
if this sorted set changed as a result of the callvoid clear()
Double addScore(V element, Number value)
element
- - element whose score needs to be increasedvalue
- - valueInteger addScoreAndGetRank(V object, Number value)
object
- - object itselfvalue
- - object scoreInteger addScoreAndGetRevRank(V object, Number value)
object
- - object itselfvalue
- - object scoreCollection<V> valueRange(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexCollection<V> valueRangeReversed(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexCollection<ScoredEntry<V>> entryRange(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexCollection<ScoredEntry<V>> entryRangeReversed(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexCollection<V> valueRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
startScore
and endScore
.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 inclusiveCollection<V> valueRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
startScore
and endScore
in reversed order.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 inclusiveCollection<ScoredEntry<V>> entryRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
startScore
and endScore
.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 inclusiveCollection<V> valueRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
startScore
and endScore
.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 dataCollection<V> valueRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
startScore
and endScore
in reversed order.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 dataCollection<ScoredEntry<V>> entryRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
startScore
and endScore
.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 dataCollection<ScoredEntry<V>> entryRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
startScore
and endScore
in reversed order.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 inclusiveCollection<ScoredEntry<V>> entryRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
startScore
and endScore
in reversed order.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 dataint count(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
startScore
and endScore
.startScore
- - start scorestartScoreInclusive
- - start score inclusiveendScore
- - end scoreendScoreInclusive
- - end score inclusiveCollection<V> readAll()
int intersection(String... names)
names
- - names of ScoredSortedSetint intersection(RScoredSortedSet.Aggregate aggregate, String... names)
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetint intersection(Map<String,Double> nameWithWeight)
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierint intersection(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
aggregate
- - score aggregation modenameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierint union(String... names)
names
- - names of ScoredSortedSetint union(RScoredSortedSet.Aggregate aggregate, String... names)
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetint union(Map<String,Double> nameWithWeight)
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierint union(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
aggregate
- - score aggregation modenameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierCopyright © 2014–2019 The Redisson Project. All rights reserved.