com.twitter.storehaus.redis

RedisSortedSetStore

class RedisSortedSetStore extends MergeableStore[ChannelBuffer, Seq[(ChannelBuffer, Double)]]

A Store representation of a redis sorted set where keys represent the name of the set and values represent both the member's name and score within the set

Source
RedisSortedSetStore.scala
Linear Supertypes
MergeableStore[ChannelBuffer, Seq[(ChannelBuffer, Double)]], Store[ChannelBuffer, Seq[(ChannelBuffer, Double)]], ReadableStore[ChannelBuffer, Seq[(ChannelBuffer, Double)]], Closeable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. RedisSortedSetStore
  2. MergeableStore
  3. Store
  4. ReadableStore
  5. Closeable
  6. AnyRef
  7. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RedisSortedSetStore(client: Client)

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  8. def close(): Unit

    Close this store and release any resources.

    Close this store and release any resources. It is undefined what happens on get/multiGet after close

    Definition Classes
    RedisSortedSetStore → ReadableStore → Closeable

  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  12. def get(k: ChannelBuffer): Future[Option[Seq[(ChannelBuffer, Double)]]]

    Returns the whole set as a tuple of seq of (member, score)

    Returns the whole set as a tuple of seq of (member, score)

    Definition Classes
    RedisSortedSetStore → ReadableStore

  13. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any

  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  16. def members(set: ChannelBuffer): MergeableStore[ChannelBuffer, Double]

    returns

    a mergeable store for a given set with this store's client

  17. def members: MergeableStore[(ChannelBuffer, ChannelBuffer), Double]

    returns

    a mergeable store backed by redis with this store's client

  18. def merge(kv: (ChannelBuffer, Seq[(ChannelBuffer, Double)])): Future[Unit]

    Performs a zIncrBy operation on a set for a seq of members

    Performs a zIncrBy operation on a set for a seq of members

    Definition Classes
    RedisSortedSetStore → MergeableStore

  19. val monoid: Monoid[Seq[(ChannelBuffer, Double)]]

    The monoid equivalent to the merge operation of this store

    The monoid equivalent to the merge operation of this store

    Definition Classes
    RedisSortedSetStore → MergeableStore

  20. def multiGet[K1 <: ChannelBuffer](ks: Set[K1]): Map[K1, Future[Option[Seq[(ChannelBuffer, Double)]]]]

    Get a set of keys from the store.

    Get a set of keys from the store. Important: all keys in the input set are in the resulting map. If the store fails to return a value for a given key, that should be represented by a Future.exception.

    Definition Classes
    ReadableStore

  21. def multiMerge[K1 <: ChannelBuffer](kvs: Map[K1, Seq[(ChannelBuffer, Double)]]): Map[K1, Future[Unit]]

    merge a set of keys.

    merge a set of keys.

    Definition Classes
    MergeableStore

  22. def multiPut[K1 <: ChannelBuffer](kvs: Map[K1, Option[Seq[(ChannelBuffer, Double)]]]): Map[K1, Future[Unit]]

    Replace a set of keys at one time

    Replace a set of keys at one time

    Definition Classes
    Store

  23. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  24. final def notify(): Unit

    Definition Classes
    AnyRef

  25. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  26. def put(kv: (ChannelBuffer, Option[Seq[(ChannelBuffer, Double)]])): Future[Unit]

    Replaces or deletes the whole set.

    Replaces or deletes the whole set. Setting the set effectivly results in a delete of the previous sets key and multiple calls to zAdd for each member.

    Definition Classes
    RedisSortedSetStore → Store

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

    Definition Classes
    AnyRef

  28. def toString(): String

    Definition Classes
    AnyRef → Any

  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  31. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from MergeableStore[ChannelBuffer, Seq[(ChannelBuffer, Double)]]

Inherited from Store[ChannelBuffer, Seq[(ChannelBuffer, Double)]]

Inherited from ReadableStore[ChannelBuffer, Seq[(ChannelBuffer, Double)]]

Inherited from Closeable

Inherited from AnyRef

Inherited from Any