Trait

com.redis.api

SetApi

Related Doc: package api

Permalink

trait SetApi extends AnyRef

Linear Supertypes
AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SetApi
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

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

    Permalink

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

    Add the specified members to the set value stored at key. (VARIADIC: >= 2.4)

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

    Permalink

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

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

    Permalink

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

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

    Permalink

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

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

    Permalink

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

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

    Permalink

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

    Compute the intersection between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey. SINTERSTORE returns the size of the intersection, unlike what the documentation says refer http://code.google.com/p/redis/issues/detail?id=121

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

    Permalink

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

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

    Permalink

    Return all the members of the Set value at key.

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

    Permalink

    Move the specified member from one Set to another atomically.

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

    Permalink

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

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

    Permalink

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

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

    Permalink

    Return multiple random elements from a Set (since 2.6)

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

    Permalink

    Return a random element from a Set

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

    Permalink

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

    Remove the specified members from the set value stored at key. (VARIADIC: >= 2.4)

  15. abstract 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]]])]

    Permalink

    Incrementally iterate Set elements (since 2.8)

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

    Permalink

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

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

    Permalink

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

    Compute the union between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey. SUNIONSTORE returns the size of the union, unlike what the documentation says refer http://code.google.com/p/redis/issues/detail?id=121

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

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

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

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

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

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

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  16. def toString(): String

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped