V
- value typepublic class RedissonSortedSet<V> extends RedissonObject implements RSortedSet<V>
Modifier and Type | Class and Description |
---|---|
static class |
RedissonSortedSet.BinarySearchResult<V> |
codec, name
Modifier | Constructor and Description |
---|---|
|
RedissonSortedSet(Codec codec,
CommandExecutor commandExecutor,
String name,
Redisson redisson) |
protected |
RedissonSortedSet(CommandExecutor commandExecutor,
String name,
RedissonClient redisson) |
Modifier and Type | Method and Description |
---|---|
boolean |
add(V value) |
boolean |
addAll(Collection<? extends V> c) |
RFuture<Boolean> |
addAsync(V value) |
RedissonSortedSet.BinarySearchResult<V> |
binarySearch(V value,
Codec codec) |
void |
clear() |
Comparator<? super V> |
comparator() |
boolean |
contains(Object o) |
boolean |
containsAll(Collection<?> c) |
V |
first() |
SortedSet<V> |
headSet(V toElement) |
boolean |
isEmpty() |
Iterator<V> |
iterator() |
V |
last() |
<KOut,VOut> |
mapReduce()
Returns
RMapReduce object associated with this object |
Collection<V> |
readAll() |
RFuture<Collection<V>> |
readAllAsync() |
boolean |
remove(Object value) |
boolean |
removeAll(Collection<?> c) |
RFuture<Boolean> |
removeAsync(Object value) |
boolean |
retainAll(Collection<?> c) |
int |
size() |
SortedSet<V> |
subSet(V fromElement,
V toElement) |
SortedSet<V> |
tailSet(V fromElement) |
Object[] |
toArray() |
<T> T[] |
toArray(T[] a) |
String |
toString() |
boolean |
trySetComparator(Comparator<? super V> comparator)
Sets new comparator only if current set is empty
|
addListener, addListener, addListenerAsync, addListenerAsync, copy, copyAsync, delete, deleteAsync, deleteAsync, dump, dumpAsync, encode, encode, encode, encode, encodeMapKey, encodeMapKeys, encodeMapValue, encodeMapValues, get, getCodec, getLockByMapKey, getLockByValue, getName, getName, isExists, isExistsAsync, migrate, migrateAsync, move, moveAsync, prefixName, removeListener, removeListenerAsync, removeListenersAsync, rename, renameAsync, renamenx, renamenxAsync, restore, restore, restoreAndReplace, restoreAndReplace, restoreAndReplaceAsync, restoreAndReplaceAsync, restoreAsync, restoreAsync, sizeInMemory, sizeInMemoryAsync, sizeInMemoryAsync, suffixName, toSeconds, toStream, touch, touchAsync, unlink, unlinkAsync
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
spliterator
parallelStream, removeIf, stream
addListener, copy, delete, dump, getCodec, getName, isExists, migrate, move, removeListener, rename, renamenx, restore, restore, restoreAndReplace, restoreAndReplace, sizeInMemory, touch, unlink
addListenerAsync, copyAsync, deleteAsync, dumpAsync, isExistsAsync, migrateAsync, moveAsync, removeListenerAsync, renameAsync, renamenxAsync, restoreAndReplaceAsync, restoreAndReplaceAsync, restoreAsync, restoreAsync, sizeInMemoryAsync, touchAsync, unlinkAsync
protected RedissonSortedSet(CommandExecutor commandExecutor, String name, RedissonClient redisson)
public RedissonSortedSet(Codec codec, CommandExecutor commandExecutor, String name, Redisson redisson)
public <KOut,VOut> RCollectionMapReduce<V,KOut,VOut> mapReduce()
RSortedSet
RMapReduce
object associated with this objectmapReduce
in interface RSortedSet<V>
KOut
- output keyVOut
- output valuepublic Collection<V> readAll()
readAll
in interface RSortedSet<V>
public RFuture<Collection<V>> readAllAsync()
readAllAsync
in interface RSortedSet<V>
public int size()
public boolean isEmpty()
public boolean contains(Object o)
public Object[] toArray()
public <T> T[] toArray(T[] a)
public boolean add(V value)
public RFuture<Boolean> addAsync(V value)
addAsync
in interface RSortedSet<V>
public RFuture<Boolean> removeAsync(Object value)
removeAsync
in interface RSortedSet<V>
public boolean remove(Object value)
public boolean containsAll(Collection<?> c)
containsAll
in interface Collection<V>
containsAll
in interface Set<V>
public boolean addAll(Collection<? extends V> c)
public boolean retainAll(Collection<?> c)
public boolean removeAll(Collection<?> c)
public void clear()
public Comparator<? super V> comparator()
comparator
in interface SortedSet<V>
public boolean trySetComparator(Comparator<? super V> comparator)
RSortedSet
trySetComparator
in interface RSortedSet<V>
comparator
- for valuestrue
if new comparator setted
false
otherwisepublic RedissonSortedSet.BinarySearchResult<V> binarySearch(V value, Codec codec)
Copyright © 2014–2020 Redisson. All rights reserved.