SetsApi

Type Members

abstract type HashKey

The type of Redis hash keys or hash key patterns used in methods representing Redis commands that work on hashes (HashesApi).
The type of Redis hash keys or hash key patterns used in methods representing Redis commands that work on hashes (HashesApi).

Definition Classes
ApiSubset
abstract type Key

The type of Redis keys or key patterns used in methods representing Redis commands.
The type of Redis keys or key patterns used in methods representing Redis commands. For example, if Key = String then get returns Result[Opt[String]]. This type is used only for toplevel Redis keys, hash keys have their own type, HashKey.

Definition Classes
ApiSubset
abstract type Result[A]

The type constructor into which a result of each command is wrapped.
The type constructor into which a result of each command is wrapped. For example if Result is Future, then incr returns Future[Long].

Definition Classes
ApiSubset
abstract type Value

The type of Redis values used in methods representing Redis commands.
The type of Redis values used in methods representing Redis commands. "Value" is the data that might be stored directly under a Redis key (e.g. using set) but also a value of hash field, list element, set member, sorted set member, geo set member or element inserted into hyper-log-log structure. There are no separate types specified for every of those use cases because only one of them can be used in a single command (for example, there is no Redis command that works on both list elements and set members at the same time).

Definition Classes
ApiSubset

Abstract Value Members

abstract def execute[A](command: RedisCommand[A]): Result[A]

Definition Classes
ApiSubset
implicit abstract def hashKeyCodec: RedisDataCodec[HashKey]

Attributes
protected
Definition Classes
ApiSubset
implicit abstract def keyCodec: RedisDataCodec[Key]

Attributes
protected
Definition Classes
ApiSubset
implicit abstract def valueCodec: RedisDataCodec[Value]

Attributes
protected
Definition Classes
ApiSubset

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
implicit def headOps[T](head: T): HeadOps[T]

Attributes
protected
Definition Classes
ApiSubset
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
implicit def iterableTailOps[T](tail: Iterable[T]): IterableTailOps[T]

Attributes
protected
Definition Classes
ApiSubset
implicit def iteratorTailOps[T](tail: Iterator[T]): IteratorTailOps[T]

Attributes
protected
Definition Classes
ApiSubset
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def sadd(key: Key, members: Iterable[Value]): Result[Int]

Executes SADD or simply returns 0 when members is empty
def sadd(key: Key, member: Value, members: Value*): Result[Int]

Executes SADD
def sadd(key: Key, member: Value): Result[Boolean]

Executes SADD
def scard(key: Key): Result[Long]

Executes SCARD
def sdiff(source: Key, keys: Iterable[Key]): Result[commons.BSet[Value]]

Executes SDIFF
def sdiff(source: Key, keys: Key*): Result[commons.BSet[Value]]

Executes SDIFF
def sdiffstore(destination: Key, source: Key, keys: Iterable[Key]): Result[Long]

Executes SDIFFSTORE
def sdiffstore(destination: Key, source: Key, keys: Key*): Result[Long]

Executes SDIFFSTORE
def sinter(keys: Iterable[Key]): Result[commons.BSet[Value]]

Executes SINTER NOTE: keys MUST NOT be empty
def sinter(key: Key, keys: Key*): Result[commons.BSet[Value]]

Executes SINTER
def sinterstore(destination: Key, keys: Iterable[Key]): Result[Long]

Executes SINTERSTORE NOTE: keys MUST NOT be empty
def sinterstore(destination: Key, key: Key, keys: Key*): Result[Long]

Executes SINTERSTORE
def sismember(key: Key, member: Value): Result[Boolean]

Executes SISMEMBER
def smembers(key: Key): Result[commons.BSet[Value]]

Executes SMEMBERS
def smove(source: Key, destination: Key, member: Value): Result[Boolean]

Executes SMOVE
def spop(key: Key, count: Int): Result[commons.BSet[Value]]

Executes SPOP
def spop(key: Key): Result[commons.Opt[Value]]

Executes SPOP
def srandmember(key: Key, count: Int): Result[Seq[Value]]

Executes SRANDMEMBER
def srandmember(key: Key): Result[commons.Opt[Value]]

Executes SRANDMEMBER
def srandmemberDistinct(key: Key, count: Int): Result[commons.BSet[Value]]

Executes SRANDMEMBER
def srem(key: Key, members: Iterable[Value]): Result[Int]

Executes SREM or simply returns 0 when members is empty
def srem(key: Key, member: Value, members: Value*): Result[Int]

Executes SREM
def srem(key: Key, member: Value): Result[Boolean]

Executes SREM
def sscan(key: Key, cursor: Cursor, matchPattern: commons.OptArg[Value] = OptArg.Empty, count: commons.OptArg[Int] = OptArg.Empty): Result[(Cursor, Seq[Value])]

Executes SSCAN
def sunion(keys: Iterable[Key]): Result[commons.BSet[Value]]

Executes SUNION or simply returns empty set when keys is empty
def sunion(key: Key, keys: Key*): Result[commons.BSet[Value]]

Executes SUNION
def sunionstore(destination: Key, keys: Iterable[Key]): Result[Long]

Executes SUNIONSTORE NOTE: unlike in SUNION keys MUST NOT be empty because SUNIONSTORE overwrites destination key.
Executes SUNIONSTORE NOTE: unlike in SUNION keys MUST NOT be empty because SUNIONSTORE overwrites destination key. An operation equivalent to invoking SUNIONSTORE with only destination and no keys would be DEL destination
def sunionstore(destination: Key, key: Key, keys: Key*): Result[Long]

Executes SUNIONSTORE
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package commands

trait SetsApi extends ApiSubset

Type Members

abstract type HashKey

abstract type Key

abstract type Result[A]

abstract type Value

Abstract Value Members

abstract def execute[A](command: RedisCommand[A]): Result[A]

implicit abstract def hashKeyCodec: RedisDataCodec[HashKey]

implicit abstract def keyCodec: RedisDataCodec[Key]

implicit abstract def valueCodec: RedisDataCodec[Value]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

implicit def headOps[T](head: T): HeadOps[T]

final def isInstanceOf[T0]: Boolean

implicit def iterableTailOps[T](tail: Iterable[T]): IterableTailOps[T]

implicit def iteratorTailOps[T](tail: Iterator[T]): IteratorTailOps[T]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def sadd(key: Key, members: Iterable[Value]): Result[Int]

def sadd(key: Key, member: Value, members: Value*): Result[Int]

def sadd(key: Key, member: Value): Result[Boolean]

def scard(key: Key): Result[Long]

def sdiff(source: Key, keys: Iterable[Key]): Result[commons.BSet[Value]]

def sdiff(source: Key, keys: Key*): Result[commons.BSet[Value]]

def sdiffstore(destination: Key, source: Key, keys: Iterable[Key]): Result[Long]

def sdiffstore(destination: Key, source: Key, keys: Key*): Result[Long]

def sinter(keys: Iterable[Key]): Result[commons.BSet[Value]]

def sinter(key: Key, keys: Key*): Result[commons.BSet[Value]]

def sinterstore(destination: Key, keys: Iterable[Key]): Result[Long]

def sinterstore(destination: Key, key: Key, keys: Key*): Result[Long]

def sismember(key: Key, member: Value): Result[Boolean]

def smembers(key: Key): Result[commons.BSet[Value]]

def smove(source: Key, destination: Key, member: Value): Result[Boolean]

def spop(key: Key, count: Int): Result[commons.BSet[Value]]

def spop(key: Key): Result[commons.Opt[Value]]

def srandmember(key: Key, count: Int): Result[Seq[Value]]

def srandmember(key: Key): Result[commons.Opt[Value]]

def srandmemberDistinct(key: Key, count: Int): Result[commons.BSet[Value]]

def srem(key: Key, members: Iterable[Value]): Result[Int]

def srem(key: Key, member: Value, members: Value*): Result[Int]

def srem(key: Key, member: Value): Result[Boolean]

def sscan(key: Key, cursor: Cursor, matchPattern: commons.OptArg[Value] = OptArg.Empty, count: commons.OptArg[Int] = OptArg.Empty): Result[(Cursor, Seq[Value])]

def sunion(keys: Iterable[Key]): Result[commons.BSet[Value]]

def sunion(key: Key, keys: Key*): Result[commons.BSet[Value]]

def sunionstore(destination: Key, keys: Iterable[Key]): Result[Long]

def sunionstore(destination: Key, key: Key, keys: Key*): Result[Long]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from ApiSubset

Inherited from AnyRef

Inherited from Any

Ungrouped