SetOperations

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

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def sadd(key: Any, value: Any, values: Any*)(implicit format: Format): Option[Long]

Add the specified members to the set value stored at key.

def scard(key: Any)(implicit format: Format): Option[Long]

Return the number of elements (the cardinality) of the Set at key.

def sdiff[A](key: Any, keys: Any*)(implicit format: Format, parse: Parse[A]): Option[Set[Option[A]]]

Return the difference between the Set stored at key1 and all the Sets key2, ..., keyN.

def sdiffstore(key: Any, keys: Any*)(implicit format: Format): Option[Long]

Compute the difference between the Set key1 and all the Sets key2, ..., keyN, and store the resulting Set at dstkey.

def sinter[A](key: Any, keys: Any*)(implicit format: Format, parse: Parse[A]): Option[Set[Option[A]]]

Return the intersection between the Sets stored at key1, key2, ..., keyN.

def sinterstore(key: Any, keys: Any*)(implicit format: Format): Option[Long]

Compute the intersection between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey.

def sismember(key: Any, value: Any)(implicit format: Format): Boolean

Test if the specified value is a member of the Set at key.

def smembers[A](key: Any)(implicit format: Format, parse: Parse[A]): Option[Set[Option[A]]]

Return all the members of the Set value at key.

def smove(sourceKey: Any, destKey: Any, value: Any)(implicit format: Format): Option[Long]

Move the specified member from one Set to another atomically.

def spop[A](key: Any, count: Int)(implicit format: Format, parse: Parse[A]): Option[Set[Option[A]]]

Remove and return multiple random elements (pop) from the Set value at key since (3.2).

def spop[A](key: Any)(implicit format: Format, parse: Parse[A]): Option[A]

Remove and return (pop) a random element from the Set value at key.

def srandmember[A](key: Any, count: Int)(implicit format: Format, parse: Parse[A]): Option[List[Option[A]]]

Return multiple random elements from a Set (since 2.6)

def srandmember[A](key: Any)(implicit format: Format, parse: Parse[A]): Option[A]

Return a random element from a Set

def srem(key: Any, value: Any, values: Any*)(implicit format: Format): Option[Long]

Remove the specified members from the set value stored at key.

def sscan[A](key: Any, cursor: Int, pattern: Any = "*", count: Int = 10)(implicit format: Format, parse: Parse[A]): Option[(Option[Int], Option[List[Option[A]]])]

Incrementally iterate Set elements (since 2.8)

def sunion[A](key: Any, keys: Any*)(implicit format: Format, parse: Parse[A]): Option[Set[Option[A]]]

Return the union between the Sets stored at key1, key2, ..., keyN.

def sunionstore(key: Any, keys: Any*)(implicit format: Format): Option[Long]

Compute the union between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey.

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit