SetsApi

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

abstract val serialization: RedisSerialization

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

implicit final def fieldCodec: RedisDataCodec[Field]

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]

implicit final def keyCodec: RedisDataCodec[Key]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit final def recordCodec: RedisRecordCodec[Record]

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.

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

Executes SUNIONSTORE

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

def toString(): String

implicit final def valueCodec: RedisDataCodec[Value]

final def wait(): Unit

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

final def wait(arg0: Long): Unit