V
- value typepublic interface RScoredSortedSetReactive<V> extends RExpirableReactive, RSortableReactive<Set<V>>
Modifier and Type | Method and Description |
---|---|
reactor.core.publisher.Mono<Boolean> |
add(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
reactor.core.publisher.Mono<Long> |
addAll(Map<V,Double> objects) |
reactor.core.publisher.Mono<Integer> |
addAndGetRank(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
reactor.core.publisher.Mono<Integer> |
addAndGetRevRank(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
reactor.core.publisher.Mono<Double> |
addScore(V object,
Number value) |
reactor.core.publisher.Mono<Integer> |
addScoreAndGetRank(V object,
Number value)
Adds score to element and returns its rank
|
reactor.core.publisher.Mono<Integer> |
addScoreAndGetRevRank(V object,
Number value)
Adds score to element and returns its reverse rank
|
reactor.core.publisher.Mono<Boolean> |
contains(V o) |
reactor.core.publisher.Mono<Boolean> |
containsAll(Collection<?> c) |
reactor.core.publisher.Mono<Long> |
count(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns the number of elements with a score between
startScore and endScore . |
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> |
entryRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive) |
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> |
entryRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count) |
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> |
entryRange(int startIndex,
int endIndex) |
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> |
entryRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive) |
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> |
entryRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count) |
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> |
entryRangeReversed(int startIndex,
int endIndex) |
reactor.core.publisher.Mono<V> |
first()
Returns the head element or
null if this sorted set is empty. |
reactor.core.publisher.Mono<Double> |
firstScore()
Returns score of the head element or returns
null if this sorted set is empty. |
reactor.core.publisher.Mono<Double> |
getScore(V o) |
reactor.core.publisher.Mono<Integer> |
intersection(Map<String,Double> nameWithWeight)
Intersect provided ScoredSortedSets mapped to weight multiplier
and store result to current ScoredSortedSet
|
reactor.core.publisher.Mono<Integer> |
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
|
reactor.core.publisher.Mono<Integer> |
intersection(RScoredSortedSet.Aggregate aggregate,
String... names)
Intersect provided ScoredSortedSets with defined aggregation method
and store result to current ScoredSortedSet
|
reactor.core.publisher.Mono<Integer> |
intersection(String... names)
Intersect provided ScoredSortedSets
and store result to current ScoredSortedSet
|
reactor.core.publisher.Flux<V> |
iterator() |
reactor.core.publisher.Flux<V> |
iterator(int count)
Returns an iterator over elements in this set.
|
reactor.core.publisher.Flux<V> |
iterator(String pattern)
Returns an iterator over elements in this set.
|
reactor.core.publisher.Flux<V> |
iterator(String pattern,
int count)
Returns an iterator over elements in this set.
|
reactor.core.publisher.Mono<V> |
last()
Returns the tail element or
null if this sorted set is empty. |
reactor.core.publisher.Mono<Double> |
lastScore()
Returns score of the tail element or returns
null if this sorted set is empty. |
reactor.core.publisher.Mono<V> |
pollFirst()
Removes and returns the head element or
null if this sorted set is empty. |
reactor.core.publisher.Mono<Collection<V>> |
pollFirst(int count)
Removes and returns the head elements or
null if this sorted set is empty. |
reactor.core.publisher.Mono<V> |
pollFirst(long timeout,
TimeUnit unit)
Removes and returns the head element or
null if this sorted set is empty. |
reactor.core.publisher.Mono<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.
|
reactor.core.publisher.Mono<V> |
pollLast()
Removes and returns the tail element or
null if this sorted set is empty. |
reactor.core.publisher.Mono<Collection<V>> |
pollLast(int count)
Removes and returns the tail elements or
null if this sorted set is empty. |
reactor.core.publisher.Mono<V> |
pollLast(long timeout,
TimeUnit unit)
Removes and returns the tail element or
null if this sorted set is empty. |
reactor.core.publisher.Mono<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.
|
reactor.core.publisher.Mono<Integer> |
rank(V o)
Returns rank of value, with the scores ordered from low to high.
|
reactor.core.publisher.Mono<Collection<V>> |
readAll()
Read all values at once.
|
reactor.core.publisher.Mono<Boolean> |
remove(V object) |
reactor.core.publisher.Mono<Boolean> |
removeAll(Collection<?> c) |
reactor.core.publisher.Mono<Integer> |
removeRangeByRank(int startIndex,
int endIndex) |
reactor.core.publisher.Mono<Integer> |
removeRangeByScore(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive) |
reactor.core.publisher.Mono<Boolean> |
retainAll(Collection<?> c) |
reactor.core.publisher.Mono<Integer> |
revRank(V o)
Returns rank of value, with the scores ordered from high to low.
|
reactor.core.publisher.Mono<Integer> |
size() |
reactor.core.publisher.Mono<V> |
takeFirst()
Removes and returns the head element waiting if necessary for an element to become available.
|
reactor.core.publisher.Flux<V> |
takeFirstElements()
Retrieves and removes continues stream of elements from the head of this queue.
|
reactor.core.publisher.Mono<V> |
takeLast()
Removes and returns the tail element waiting if necessary for an element to become available.
|
reactor.core.publisher.Flux<V> |
takeLastElements()
Retrieves and removes continues stream of elements from the tail of this queue.
|
reactor.core.publisher.Mono<Boolean> |
tryAdd(double score,
V object)
Adds element to this set only if has not been added before.
|
reactor.core.publisher.Mono<Integer> |
union(Map<String,Double> nameWithWeight)
Union provided ScoredSortedSets mapped to weight multiplier
and store result to current ScoredSortedSet
|
reactor.core.publisher.Mono<Integer> |
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
|
reactor.core.publisher.Mono<Integer> |
union(RScoredSortedSet.Aggregate aggregate,
String... names)
Union provided ScoredSortedSets with defined aggregation method
and store result to current ScoredSortedSet
|
reactor.core.publisher.Mono<Integer> |
union(String... names)
Union provided ScoredSortedSets
and store result to current ScoredSortedSet
|
reactor.core.publisher.Mono<Collection<V>> |
valueRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive) |
reactor.core.publisher.Mono<Collection<V>> |
valueRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count) |
reactor.core.publisher.Mono<Collection<V>> |
valueRange(int startIndex,
int endIndex) |
reactor.core.publisher.Mono<Collection<V>> |
valueRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all values between
startScore and endScore in reversed order. |
reactor.core.publisher.Mono<Collection<V>> |
valueRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count) |
reactor.core.publisher.Mono<Collection<V>> |
valueRangeReversed(int startIndex,
int endIndex) |
clearExpire, expire, expireAt, expireAt, remainTimeToLive
copy, delete, dump, getCodec, getName, isExists, migrate, move, rename, renamenx, restore, restore, restoreAndReplace, restoreAndReplace, touch, unlink
readSorted, readSorted, readSorted, readSorted, readSorted, readSorted, sortTo, sortTo, sortTo, sortTo, sortTo, sortTo
reactor.core.publisher.Mono<V> 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 emptyreactor.core.publisher.Mono<V> 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 emptyreactor.core.publisher.Mono<V> pollFirst(long timeout, TimeUnit unit)
null
if this sorted set is empty.
Requires Redis 5.0.0 and higher.
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 emptyreactor.core.publisher.Mono<V> pollLast(long timeout, TimeUnit unit)
null
if this sorted set is empty.
Requires Redis 5.0.0 and higher.
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 emptyreactor.core.publisher.Mono<Collection<V>> pollFirst(int count)
null
if this sorted set is empty.count
- - elements amountnull
if this sorted set is emptyreactor.core.publisher.Mono<Collection<V>> pollLast(int count)
null
if this sorted set is empty.count
- - elements amountnull
if this sorted set is emptyreactor.core.publisher.Mono<V> pollFirst()
null
if this sorted set is empty.null
if this sorted set is emptyreactor.core.publisher.Mono<V> pollLast()
null
if this sorted set is empty.null
if this sorted set is emptyreactor.core.publisher.Mono<V> first()
null
if this sorted set is empty.null
if this sorted set is emptyreactor.core.publisher.Mono<V> last()
null
if this sorted set is empty.null
if this sorted set is emptyreactor.core.publisher.Mono<Double> firstScore()
null
if this sorted set is empty.null
if this sorted set is emptyreactor.core.publisher.Mono<Double> lastScore()
null
if this sorted set is empty.null
if this sorted set is emptyreactor.core.publisher.Flux<V> iterator(String pattern)
pattern
is not null then only elements match this pattern are loaded.pattern
- - search patternreactor.core.publisher.Flux<V> iterator(int count)
count
param.count
- - size of elements batchreactor.core.publisher.Flux<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 batchreactor.core.publisher.Flux<V> iterator()
reactor.core.publisher.Mono<Integer> removeRangeByScore(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
reactor.core.publisher.Mono<Integer> removeRangeByRank(int startIndex, int endIndex)
reactor.core.publisher.Mono<Integer> rank(V o)
o
- - objectnull
if value does not existreactor.core.publisher.Mono<Integer> revRank(V o)
o
- - objectnull
if value does not existreactor.core.publisher.Mono<Boolean> add(double score, V object)
score
- - object scoreobject
- - object itselftrue
if element has added and false
if not.reactor.core.publisher.Mono<Integer> addAndGetRank(double score, V object)
score
- - object scoreobject
- - object itselfreactor.core.publisher.Mono<Integer> addAndGetRevRank(double score, V object)
score
- - object scoreobject
- - object itselfreactor.core.publisher.Mono<Boolean> tryAdd(double score, V object)
Requires Redis 3.0.2 and higher.
score
- - object scoreobject
- - object itselftrue
if element has added and false
if not.reactor.core.publisher.Mono<Integer> size()
reactor.core.publisher.Mono<Boolean> containsAll(Collection<?> c)
reactor.core.publisher.Mono<Boolean> removeAll(Collection<?> c)
reactor.core.publisher.Mono<Boolean> retainAll(Collection<?> c)
reactor.core.publisher.Mono<Integer> addScoreAndGetRevRank(V object, Number value)
object
- - object itselfvalue
- - object scorereactor.core.publisher.Mono<Integer> addScoreAndGetRank(V object, Number value)
object
- - object itselfvalue
- - object scorereactor.core.publisher.Mono<Collection<V>> valueRange(int startIndex, int endIndex)
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> entryRange(int startIndex, int endIndex)
reactor.core.publisher.Mono<Collection<V>> valueRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> entryRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
reactor.core.publisher.Mono<Collection<V>> valueRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> entryRange(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
reactor.core.publisher.Mono<Collection<V>> valueRangeReversed(int startIndex, int endIndex)
reactor.core.publisher.Mono<Collection<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 inclusivereactor.core.publisher.Mono<Collection<V>> valueRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> entryRangeReversed(int startIndex, int endIndex)
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> entryRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
reactor.core.publisher.Mono<Collection<ScoredEntry<V>>> entryRangeReversed(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive, int offset, int count)
reactor.core.publisher.Mono<Long> count(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
startScore
and endScore
.startScore
- - start scorestartScoreInclusive
- - start score inclusiveendScore
- - end scoreendScoreInclusive
- - end score inclusivereactor.core.publisher.Mono<Collection<V>> readAll()
reactor.core.publisher.Mono<Integer> intersection(String... names)
names
- - names of ScoredSortedSetreactor.core.publisher.Mono<Integer> intersection(RScoredSortedSet.Aggregate aggregate, String... names)
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetreactor.core.publisher.Mono<Integer> intersection(Map<String,Double> nameWithWeight)
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierreactor.core.publisher.Mono<Integer> intersection(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
aggregate
- - score aggregation modenameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierreactor.core.publisher.Mono<Integer> union(String... names)
names
- - names of ScoredSortedSetreactor.core.publisher.Mono<Integer> union(RScoredSortedSet.Aggregate aggregate, String... names)
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetreactor.core.publisher.Mono<Integer> union(Map<String,Double> nameWithWeight)
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierreactor.core.publisher.Mono<Integer> union(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
aggregate
- - score aggregation modenameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierreactor.core.publisher.Mono<V> takeFirst()
reactor.core.publisher.Mono<V> takeLast()
reactor.core.publisher.Flux<V> takeFirstElements()
reactor.core.publisher.Flux<V> takeLastElements()
Copyright © 2014–2019 The Redisson Project. All rights reserved.