Trait

play.api.cache.redis

RedisSet

Related Doc: package redis

Permalink

trait RedisSet[Elem, Result[_]] extends RedisCollection[Set[Elem], Result]

Redis Sets are simply unsorted sets of objects. It is possible to add elements to a Redis Set by adding new elements into the collection.

This simplified wrapper implements only unordered Sets.

Elem

Data type of the inserted element

Linear Supertypes
RedisCollection[Set[Elem], Result], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RedisSet
  2. RedisCollection
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type This = RedisSet[Elem, Result]

    Permalink
    Definition Classes
    RedisSet → RedisCollection

Abstract Value Members

  1. abstract def add(element: Elem*): Result[This]

    Permalink

    Add the specified members to the set stored at key.

    Add the specified members to the set stored at key. Specified members that are already a member of this set are ignored. If key does not exist, a new set is created before adding the specified members.

    element

    elements to be added

    returns

    the set for chaining calls

    Note

    Time complexity: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.

    ,

    An error is returned when the value stored at key is not a set.

  2. abstract def contains(element: Elem): Result[Boolean]

    Permalink

    Tests if the element is contained in the set.

    Tests if the element is contained in the set. Returns true if exists, otherwise returns false

    element

    tested element

    returns

    true if exists in the set, otherwise false

    Note

    Time complexity: O(1)

  3. abstract def isEmpty: Result[Boolean]

    Permalink
    Definition Classes
    RedisCollection

  4. abstract def nonEmpty: Result[Boolean]

    Permalink
    Definition Classes
    RedisCollection

  5. abstract def remove(element: Elem*): Result[This]

    Permalink

    Removes the specified members from the sorted set stored at key.

    Removes the specified members from the sorted set stored at key. Non existing members are ignored. An error is returned when key exists and does not hold a sorted set.

    element

    elements to be removed

    returns

    the set for chaining calls

    Note

    Time complexity: O(N) where N is the number of members to be removed.

  6. abstract def size: Result[Long]

    Permalink

    Returns the length of the collection stored at key.

    Returns the length of the collection stored at key. If key does not exist, it is interpreted as an empty collection and 0 is returned. An error is returned when the value stored at key is not a proper collection.

    Time complexity: O(1)

    returns

    size of the list

    Definition Classes
    RedisCollection

  7. abstract def toSet: Result[Set[Elem]]

    Permalink

    Returns all elements in the set

    Returns all elements in the set

    returns

    all elements in the set

    Note

    Time complexity: O(N) where N is the set cardinality.

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 RedisCollection[Set[Elem], Result]

Inherited from AnyRef

Inherited from Any

Ungrouped