public interface SetBinaryCommands
Modifier and Type | Method and Description |
---|---|
long |
sadd(byte[] key,
byte[]... members) |
long |
scard(byte[] key) |
java.util.Set<byte[]> |
sdiff(byte[]... keys) |
long |
sdiffstore(byte[] dstkey,
byte[]... keys) |
java.util.Set<byte[]> |
sinter(byte[]... keys) |
long |
sintercard(byte[]... keys)
This command works exactly like
SINTER but instead of returning
the result set, it returns just the cardinality of the result. |
long |
sintercard(int limit,
byte[]... keys)
This command works exactly like
SINTER but instead of returning
the result set, it returns just the cardinality of the result. |
long |
sinterstore(byte[] dstkey,
byte[]... keys) |
boolean |
sismember(byte[] key,
byte[] member) |
java.util.Set<byte[]> |
smembers(byte[] key) |
java.util.List<java.lang.Boolean> |
smismember(byte[] key,
byte[]... members) |
long |
smove(byte[] srckey,
byte[] dstkey,
byte[] member) |
byte[] |
spop(byte[] key) |
java.util.Set<byte[]> |
spop(byte[] key,
long count) |
byte[] |
srandmember(byte[] key) |
java.util.List<byte[]> |
srandmember(byte[] key,
int count) |
long |
srem(byte[] key,
byte[]... members) |
default ScanResult<byte[]> |
sscan(byte[] key,
byte[] cursor) |
ScanResult<byte[]> |
sscan(byte[] key,
byte[] cursor,
ScanParams params) |
java.util.Set<byte[]> |
sunion(byte[]... keys) |
long |
sunionstore(byte[] dstkey,
byte[]... keys) |
long sadd(byte[] key, byte[]... members)
java.util.Set<byte[]> smembers(byte[] key)
long srem(byte[] key, byte[]... members)
byte[] spop(byte[] key)
java.util.Set<byte[]> spop(byte[] key, long count)
long scard(byte[] key)
boolean sismember(byte[] key, byte[] member)
java.util.List<java.lang.Boolean> smismember(byte[] key, byte[]... members)
byte[] srandmember(byte[] key)
java.util.List<byte[]> srandmember(byte[] key, int count)
default ScanResult<byte[]> sscan(byte[] key, byte[] cursor)
ScanResult<byte[]> sscan(byte[] key, byte[] cursor, ScanParams params)
java.util.Set<byte[]> sdiff(byte[]... keys)
long sdiffstore(byte[] dstkey, byte[]... keys)
java.util.Set<byte[]> sinter(byte[]... keys)
long sinterstore(byte[] dstkey, byte[]... keys)
long sintercard(byte[]... keys)
SINTER
but instead of returning
the result set, it returns just the cardinality of the result. LIMIT defaults to 0 and means unlimited
Time complexity O(N*M) worst case where N is the cardinality of the smallest
keys
- long sintercard(int limit, byte[]... keys)
SINTER
but instead of returning
the result set, it returns just the cardinality of the result.
Time complexity O(N*M) worst case where N is the cardinality of the smallest
limit
- If the intersection cardinality reaches limit partway through the computation,
the algorithm will exit and yield limit as the cardinality.keys
- java.util.Set<byte[]> sunion(byte[]... keys)
long sunionstore(byte[] dstkey, byte[]... keys)
long smove(byte[] srckey, byte[] dstkey, byte[] member)
Copyright © 2023. All rights reserved.