V
- value typepublic interface RScoredSortedSetRx<V> extends RExpirableRx, RSortableRx<Set<V>>
Modifier and Type | Method and Description |
---|---|
io.reactivex.rxjava3.core.Single<Boolean> |
add(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
io.reactivex.rxjava3.core.Single<Integer> |
addAll(Map<V,Double> objects)
Adds all elements contained in the specified map to this sorted set.
|
io.reactivex.rxjava3.core.Single<Integer> |
addAndGetRank(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
io.reactivex.rxjava3.core.Single<Integer> |
addAndGetRevRank(double score,
V object)
Adds element to this set, overrides previous score if it has been already added.
|
io.reactivex.rxjava3.core.Single<List<Integer>> |
addAndGetRevRank(Map<? extends V,Double> map)
Adds elements to this set, overrides previous score if it has been already added.
|
io.reactivex.rxjava3.core.Single<Double> |
addScore(V element,
Number value)
Increases score of specified element by value.
|
io.reactivex.rxjava3.core.Single<Integer> |
addScoreAndGetRank(V object,
Number value)
Adds score to element and returns its rank
|
io.reactivex.rxjava3.core.Single<Integer> |
addScoreAndGetRevRank(V object,
Number value)
Adds score to element and returns its reverse rank
|
io.reactivex.rxjava3.core.Single<Boolean> |
contains(V o)
Returns
true if this sorted set contains encoded state of the specified element. |
io.reactivex.rxjava3.core.Single<Boolean> |
containsAll(Collection<?> c)
Returns
true if this sorted set contains all of the elements
in encoded state in the specified collection. |
io.reactivex.rxjava3.core.Single<Integer> |
count(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns the number of elements with a score between
startScore and endScore . |
io.reactivex.rxjava3.core.Single<Collection<ScoredEntry<V>>> |
entryRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all entries (value and its score) between
startScore and endScore . |
io.reactivex.rxjava3.core.Single<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 . |
io.reactivex.rxjava3.core.Single<Collection<ScoredEntry<V>>> |
entryRange(int startIndex,
int endIndex)
Returns entries (value and its score) by rank range.
|
io.reactivex.rxjava3.core.Single<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. |
io.reactivex.rxjava3.core.Single<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. |
io.reactivex.rxjava3.core.Single<Collection<ScoredEntry<V>>> |
entryRangeReversed(int startIndex,
int endIndex)
Returns entries (value and its score) by rank range in reverse order.
|
io.reactivex.rxjava3.core.Maybe<V> |
first()
Returns the head element or
null if this sorted set is empty. |
io.reactivex.rxjava3.core.Maybe<Double> |
firstScore()
Returns score of the head element or returns
null if this sorted set is empty. |
io.reactivex.rxjava3.core.Single<List<Double>> |
getScore(Collection<V> elements)
Returns scores of elements.
|
io.reactivex.rxjava3.core.Maybe<Double> |
getScore(V o)
Returns score of element or
null if it doesn't exist. |
io.reactivex.rxjava3.core.Single<Integer> |
intersection(Map<String,Double> nameWithWeight)
Intersect provided ScoredSortedSets mapped to weight multiplier
and store result to current ScoredSortedSet
|
io.reactivex.rxjava3.core.Single<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
|
io.reactivex.rxjava3.core.Single<Integer> |
intersection(RScoredSortedSet.Aggregate aggregate,
String... names)
Intersect provided ScoredSortedSets with defined aggregation method
and store result to current ScoredSortedSet
|
io.reactivex.rxjava3.core.Single<Integer> |
intersection(String... names)
Intersect provided ScoredSortedSets
and store result to current ScoredSortedSet
|
io.reactivex.rxjava3.core.Flowable<V> |
iterator() |
io.reactivex.rxjava3.core.Flowable<V> |
iterator(int count)
Returns an iterator over elements in this set.
|
io.reactivex.rxjava3.core.Flowable<V> |
iterator(String pattern)
Returns an iterator over elements in this set.
|
io.reactivex.rxjava3.core.Flowable<V> |
iterator(String pattern,
int count)
Returns an iterator over elements in this set.
|
io.reactivex.rxjava3.core.Maybe<V> |
last()
Returns the tail element or
null if this sorted set is empty. |
io.reactivex.rxjava3.core.Maybe<Double> |
lastScore()
Returns score of the tail element or returns
null if this sorted set is empty. |
io.reactivex.rxjava3.core.Maybe<V> |
pollFirst()
Removes and returns the head element or
null if this sorted set is empty. |
io.reactivex.rxjava3.core.Single<Collection<V>> |
pollFirst(int count)
Removes and returns the head elements of this sorted set.
|
io.reactivex.rxjava3.core.Maybe<V> |
pollFirst(long timeout,
TimeUnit unit)
Removes and returns the head element or
null if this sorted set is empty. |
io.reactivex.rxjava3.core.Maybe<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.
|
io.reactivex.rxjava3.core.Maybe<V> |
pollLast()
Removes and returns the tail element or
null if this sorted set is empty. |
io.reactivex.rxjava3.core.Single<Collection<V>> |
pollLast(int count)
Removes and returns the tail elements of this sorted set.
|
io.reactivex.rxjava3.core.Maybe<V> |
pollLast(long timeout,
TimeUnit unit)
Removes and returns the tail element or
null if this sorted set is empty. |
io.reactivex.rxjava3.core.Maybe<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.
|
io.reactivex.rxjava3.core.Maybe<Integer> |
rank(V o)
Returns rank of value, with the scores ordered from low to high.
|
io.reactivex.rxjava3.core.Single<Collection<V>> |
readAll()
Read all values at once.
|
io.reactivex.rxjava3.core.Single<Boolean> |
remove(V object)
Removes a single instance of the specified element from this
sorted set, if it is present.
|
io.reactivex.rxjava3.core.Single<Boolean> |
removeAll(Collection<?> c)
Removes all of this sorted set's elements that are also contained in the
specified collection.
|
io.reactivex.rxjava3.core.Single<Integer> |
removeRangeByRank(int startIndex,
int endIndex)
Removes values by rank range.
|
io.reactivex.rxjava3.core.Single<Integer> |
removeRangeByScore(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Removes values by score range.
|
io.reactivex.rxjava3.core.Single<Boolean> |
retainAll(Collection<?> c)
Retains only the elements in this sorted set that are contained in the
specified collection.
|
io.reactivex.rxjava3.core.Single<List<Integer>> |
revRank(Collection<V> elements)
Returns ranks of elements, with the scores ordered from high to low.
|
io.reactivex.rxjava3.core.Maybe<Integer> |
revRank(V o)
Returns rank of value, with the scores ordered from high to low.
|
io.reactivex.rxjava3.core.Single<Integer> |
size()
Returns size of this set.
|
io.reactivex.rxjava3.core.Single<V> |
takeFirst()
Removes and returns the head element waiting if necessary for an element to become available.
|
io.reactivex.rxjava3.core.Flowable<V> |
takeFirstElements()
Retrieves and removes continues stream of elements from the head.
|
io.reactivex.rxjava3.core.Single<V> |
takeLast()
Removes and returns the tail element waiting if necessary for an element to become available.
|
io.reactivex.rxjava3.core.Flowable<V> |
takeLastElements()
Retrieves and removes continues stream of elements from the tail.
|
io.reactivex.rxjava3.core.Single<Boolean> |
tryAdd(double score,
V object)
Adds element to this set only if has not been added before.
|
io.reactivex.rxjava3.core.Single<Integer> |
union(Map<String,Double> nameWithWeight)
Union provided ScoredSortedSets mapped to weight multiplier
and store result to current ScoredSortedSet
|
io.reactivex.rxjava3.core.Single<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
|
io.reactivex.rxjava3.core.Single<Integer> |
union(RScoredSortedSet.Aggregate aggregate,
String... names)
Union provided ScoredSortedSets with defined aggregation method
and store result to current ScoredSortedSet
|
io.reactivex.rxjava3.core.Single<Integer> |
union(String... names)
Union provided ScoredSortedSets
and store result to current ScoredSortedSet
|
io.reactivex.rxjava3.core.Single<Collection<V>> |
valueRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all values between
startScore and endScore . |
io.reactivex.rxjava3.core.Single<Collection<V>> |
valueRange(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive,
int offset,
int count)
Returns all values between
startScore and endScore . |
io.reactivex.rxjava3.core.Single<Collection<V>> |
valueRange(int startIndex,
int endIndex)
Returns values by rank range.
|
io.reactivex.rxjava3.core.Single<Collection<V>> |
valueRangeReversed(double startScore,
boolean startScoreInclusive,
double endScore,
boolean endScoreInclusive)
Returns all values between
startScore and endScore in reversed order. |
io.reactivex.rxjava3.core.Single<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. |
io.reactivex.rxjava3.core.Single<Collection<V>> |
valueRangeReversed(int startIndex,
int endIndex)
Returns values by rank range in reverse order.
|
clearExpire, expire, expireAt, expireAt, remainTimeToLive
addListener, copy, delete, dump, getCodec, getIdleTime, getName, isExists, migrate, move, removeListener, rename, renamenx, restore, restore, restoreAndReplace, restoreAndReplace, sizeInMemory, touch, unlink
readSorted, readSorted, readSorted, readSorted, readSorted, readSorted, sortTo, sortTo, sortTo, sortTo, sortTo, sortTo
io.reactivex.rxjava3.core.Maybe<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 emptyio.reactivex.rxjava3.core.Maybe<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 emptyio.reactivex.rxjava3.core.Maybe<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 emptyio.reactivex.rxjava3.core.Maybe<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 emptyio.reactivex.rxjava3.core.Single<Collection<V>> pollFirst(int count)
count
- - elements amountio.reactivex.rxjava3.core.Single<Collection<V>> pollLast(int count)
count
- - elements amountio.reactivex.rxjava3.core.Maybe<V> pollFirst()
null
if this sorted set is empty.null
if this sorted set is emptyio.reactivex.rxjava3.core.Maybe<V> pollLast()
null
if this sorted set is empty.null
if this sorted set is emptyio.reactivex.rxjava3.core.Maybe<V> first()
null
if this sorted set is empty.null
if this sorted set is emptyio.reactivex.rxjava3.core.Maybe<V> last()
null
if this sorted set is empty.null
if this sorted set is emptyio.reactivex.rxjava3.core.Maybe<Double> firstScore()
null
if this sorted set is empty.null
if this sorted set is emptyio.reactivex.rxjava3.core.Maybe<Double> lastScore()
null
if this sorted set is empty.null
if this sorted set is emptyio.reactivex.rxjava3.core.Flowable<V> iterator(String pattern)
pattern
is not null then only elements match this pattern are loaded.pattern
- - search patternio.reactivex.rxjava3.core.Flowable<V> iterator(int count)
count
param.count
- - size of elements batchio.reactivex.rxjava3.core.Flowable<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 batchio.reactivex.rxjava3.core.Flowable<V> iterator()
io.reactivex.rxjava3.core.Single<Integer> 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 inclusiveio.reactivex.rxjava3.core.Single<Integer> removeRangeByRank(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexio.reactivex.rxjava3.core.Maybe<Integer> rank(V o)
o
- - objectnull
if value does not existio.reactivex.rxjava3.core.Maybe<Integer> revRank(V o)
o
- - objectnull
if value does not existio.reactivex.rxjava3.core.Single<List<Integer>> revRank(Collection<V> elements)
elements
- - elementsnull
if value does not existio.reactivex.rxjava3.core.Maybe<Double> getScore(V o)
null
if it doesn't exist.o
- - elementio.reactivex.rxjava3.core.Single<List<Double>> getScore(Collection<V> elements)
elements
- - elementsio.reactivex.rxjava3.core.Single<Boolean> add(double score, V object)
score
- - object scoreobject
- - object itselftrue
if element has added and false
if not.io.reactivex.rxjava3.core.Single<Integer> addAll(Map<V,Double> objects)
objects
- - map of elements to addio.reactivex.rxjava3.core.Single<Integer> addAndGetRank(double score, V object)
score
- - object scoreobject
- - object itselfio.reactivex.rxjava3.core.Single<Integer> addAndGetRevRank(double score, V object)
score
- - object scoreobject
- - object itselfio.reactivex.rxjava3.core.Single<List<Integer>> addAndGetRevRank(Map<? extends V,Double> map)
map
- - map of object and scores, make sure to use an ordered mapio.reactivex.rxjava3.core.Single<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.io.reactivex.rxjava3.core.Single<Boolean> remove(V object)
object
- element to be removed from this sorted set, if presenttrue
if an element was removed as a result of this callio.reactivex.rxjava3.core.Single<Integer> size()
io.reactivex.rxjava3.core.Single<Boolean> contains(V 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
otherwiseio.reactivex.rxjava3.core.Single<Boolean> 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 collectionio.reactivex.rxjava3.core.Single<Boolean> removeAll(Collection<?> c)
c
- sorted set containing elements to be removed from this collectiontrue
if this sorted set changed as a result of the
callio.reactivex.rxjava3.core.Single<Boolean> retainAll(Collection<?> c)
c
- collection containing elements to be retained in this collectiontrue
if this sorted set changed as a result of the callio.reactivex.rxjava3.core.Single<Double> addScore(V element, Number value)
element
- - element whose score needs to be increasedvalue
- - valueio.reactivex.rxjava3.core.Single<Integer> addScoreAndGetRevRank(V object, Number value)
object
- - object itselfvalue
- - object scoreio.reactivex.rxjava3.core.Single<Integer> addScoreAndGetRank(V object, Number value)
object
- - object itselfvalue
- - object scoreio.reactivex.rxjava3.core.Single<Collection<V>> valueRange(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexio.reactivex.rxjava3.core.Single<Collection<ScoredEntry<V>>> entryRange(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexio.reactivex.rxjava3.core.Single<Collection<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 inclusiveio.reactivex.rxjava3.core.Single<Collection<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 inclusiveio.reactivex.rxjava3.core.Single<Collection<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 dataio.reactivex.rxjava3.core.Single<Collection<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 dataio.reactivex.rxjava3.core.Single<Collection<V>> valueRangeReversed(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexio.reactivex.rxjava3.core.Single<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 inclusiveio.reactivex.rxjava3.core.Single<Collection<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 dataio.reactivex.rxjava3.core.Single<Collection<ScoredEntry<V>>> entryRangeReversed(int startIndex, int endIndex)
-1
means the highest score, -2
means the second highest score.startIndex
- - start indexendIndex
- - end indexio.reactivex.rxjava3.core.Single<Collection<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 inclusiveio.reactivex.rxjava3.core.Single<Collection<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 dataio.reactivex.rxjava3.core.Single<Integer> count(double startScore, boolean startScoreInclusive, double endScore, boolean endScoreInclusive)
startScore
and endScore
.startScore
- - start scorestartScoreInclusive
- - start score inclusiveendScore
- - end scoreendScoreInclusive
- - end score inclusiveio.reactivex.rxjava3.core.Single<Collection<V>> readAll()
io.reactivex.rxjava3.core.Single<Integer> intersection(String... names)
names
- - names of ScoredSortedSetio.reactivex.rxjava3.core.Single<Integer> intersection(RScoredSortedSet.Aggregate aggregate, String... names)
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetio.reactivex.rxjava3.core.Single<Integer> intersection(Map<String,Double> nameWithWeight)
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierio.reactivex.rxjava3.core.Single<Integer> intersection(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
aggregate
- - score aggregation modenameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierio.reactivex.rxjava3.core.Single<Integer> union(String... names)
names
- - names of ScoredSortedSetio.reactivex.rxjava3.core.Single<Integer> union(RScoredSortedSet.Aggregate aggregate, String... names)
aggregate
- - score aggregation modenames
- - names of ScoredSortedSetio.reactivex.rxjava3.core.Single<Integer> union(Map<String,Double> nameWithWeight)
nameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierio.reactivex.rxjava3.core.Single<Integer> union(RScoredSortedSet.Aggregate aggregate, Map<String,Double> nameWithWeight)
aggregate
- - score aggregation modenameWithWeight
- - name of ScoredSortedSet mapped to weight multiplierio.reactivex.rxjava3.core.Single<V> takeFirst()
io.reactivex.rxjava3.core.Single<V> takeLast()
io.reactivex.rxjava3.core.Flowable<V> takeFirstElements()
io.reactivex.rxjava3.core.Flowable<V> takeLastElements()
Copyright © 2014–2020 Redisson. All rights reserved.