Packages

final class SetCommands[K, V] extends AnyRef

Exposes the set of redis **set** commands available.

Source
SetCommands.scala
See also

Set commands reference.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SetCommands
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  9. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. def sAdd(key: K, members: Iterable[V]): Task[Long]
  16. def sAdd(key: K, members: V*): Task[Long]

    Add one or more members to a set.

    Add one or more members to a set.

    returns

    The number of elements that were added to the set, not including all the elements already present into the set.

    See also

    SADD.

  17. def sCard(key: K): Task[Long]

    Get the number of members in a set.

    Get the number of members in a set.

    returns

    The cardinality (number of elements) of the set, 0 if the key does not exist.

    See also

    SCARD.

  18. def sDiff(first: K, rest: Iterable[K]): Observable[V]
  19. def sDiff(first: K, rest: K*): Observable[V]

    Subtract the first set with all the successive sets.

    Subtract the first set with all the successive sets.

    returns

    A list with members of the resulting set.

    See also

    SDIFF.

  20. def sDiffStore(destination: K, first: K, rest: Iterable[K]): Task[Long]
  21. def sDiffStore(destination: K, first: K, rest: K*): Task[Long]

    Subtract multiple sets and store the resulting set in a key.

    Subtract multiple sets and store the resulting set in a key.

    returns

    The number of elements in the resulting set.

    See also

    SDIFFSTORE.

  22. def sInter(keys: Iterable[K]): Observable[V]
  23. def sInter(keys: K*): Observable[V]

    Intersect multiple sets.

    Intersect multiple sets.

    returns

    A list with members of the resulting set.

    See also

    SINTER.

  24. def sInterStore(destination: K, keys: Iterable[K]): Task[Long]
  25. def sInterStore(destination: K, keys: K*): Task[Long]

    Intersect multiple sets and store the resulting set in a key.

    Intersect multiple sets and store the resulting set in a key.

    returns

    The number of elements in the resulting set.

    See also

    SINTERSOTRE.

  26. def sIsMember(key: K, member: V): Task[Boolean]

    Determine if a given value is a member of a set.

    Determine if a given value is a member of a set.

    returns

    True if the element is a member of the set. False if the element is not a member of the set, or if key does not exist.

    See also

    SINTERSOTRE.

  27. def sMembers(key: K): Observable[V]

    Get all the members in a set.

    Get all the members in a set.

    returns

    All elements of the set.

    See also

    SMEMBERS.

  28. def sMove(source: K, destination: K, member: V): Task[Boolean]

    Move a member from one set to another.

    Move a member from one set to another.

    returns

    True if the element is moved. False if the element is not a member of source and no operation was performed.

    See also

    SMOVE.

  29. def sPop(key: K, count: Long): Observable[V]

    Remove and return one or multiple random members from a set.

    Remove and return one or multiple random members from a set.

    returns

    The removed element, or null when key does not exist.

    See also

    SPOP.

  30. def sPop(key: K): Task[Option[V]]

    Remove and return a random member from a set.

    Remove and return a random member from a set.

    returns

    The removed element, or None when key does not exist.

    See also

    SPOP.

  31. def sRandMember(key: K, count: Long): Observable[V]

    Get one or multiple random members from a set.

    Get one or multiple random members from a set.

    returns

    The randomly selected elements.

    See also

    SRANDMEMBER.

  32. def sRandMember(key: K): Task[Option[V]]

    Get one random member from a set.

    Get one random member from a set.

    returns

    The randomly selected element, if the key exists, otherwise None

    See also

    SRANDMEMBER.

  33. def sRem(key: K, members: Iterable[V]): Task[Long]
  34. def sRem(key: K, members: V*): Task[Long]

    Remove one or more members from a set.

    Remove one or more members from a set.

    returns

    The number of members that were removed from the set, not including non existing members.

    See also

    SREM.

  35. def sUnion(keys: Iterable[K]): Observable[V]
  36. def sUnion(keys: K*): Observable[V]

    Add multiple sets.

    Add multiple sets.

    returns

    The members of the resulting set.

    See also

    SUNION.

  37. def sUnionStore(destination: K, keys: Iterable[K]): Task[Long]
  38. def sUnionStore(destination: K, keys: K*): Task[Long]

    Add multiple sets and store the resulting set in a key.

    Add multiple sets and store the resulting set in a key.

    returns

    Long that represents the number of elements in the resulting set.

    See also

    SUNIONSTORE.

  39. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  40. def toString(): String
    Definition Classes
    AnyRef → Any
  41. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  42. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  43. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped