com.twitter.storehaus.redis

RedisSortedSetMembershipStore

class RedisSortedSetMembershipStore extends MergeableStore[(ChannelBuffer, ChannelBuffer), Double]

An unpivoted-like member-oriented view of redis sorted sets. Keys represent the both a name of the set and the member. Values represent the member's current score within a set. An absent score also indicates an absence of membership in the set.

These stores also have mergeable semantics via zIncrBy for a member's score

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

Instance Constructors

  1. new RedisSortedSetMembershipStore(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
    RedisSortedSetMembershipStoreReadableStore → 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, ChannelBuffer)): Future[Option[Double]]

    returns

    a member's score or None if the member is not in the set

    Definition Classes
    RedisSortedSetMembershipStoreReadableStore
  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 merge(kv: ((ChannelBuffer, ChannelBuffer), Double)): Future[Unit]

    Performs a zIncrBy operation on a set for a given member

    Performs a zIncrBy operation on a set for a given member

    Definition Classes
    RedisSortedSetMembershipStoreMergeableStore
  17. val monoid: Monoid[Double]

    The monoid equivalent to the merge operation of this store

    The monoid equivalent to the merge operation of this store

    Definition Classes
    RedisSortedSetMembershipStoreMergeableStore
  18. def multiGet[K1 <: (ChannelBuffer, ChannelBuffer)](ks: Set[K1]): Map[K1, Future[Option[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
  19. def multiMerge[K1 <: (ChannelBuffer, ChannelBuffer)](kvs: Map[K1, Double]): Map[K1, Future[Unit]]

    merge a set of keys.

    merge a set of keys.

    Definition Classes
    MergeableStore
  20. def multiPut[K1 <: (ChannelBuffer, ChannelBuffer)](kv: Map[K1, Option[Double]]): Map[K1, Future[Unit]]

    Adds or removes members from sets with an initial scoring.

    Adds or removes members from sets with an initial scoring. A score of None indicates the member should be removed from the set

    Definition Classes
    RedisSortedSetMembershipStoreStore
  21. def multiPutPartitioned[OutterK, InnerK, K1 <: (OutterK, InnerK), V, IndexK](kv: Map[K1, Option[V]])(by: (K1) ⇒ IndexK): (Map[IndexK, List[(K1, Option[V])]], Map[IndexK, List[(K1, Option[V])]])

    Partitions a map of multiPut pivoted values into a two item tuple of deletes and sets, multimapped by a key computed from K1.

    Partitions a map of multiPut pivoted values into a two item tuple of deletes and sets, multimapped by a key computed from K1.

    This makes partioning deletes and sets for pivoted multiPuts easier for stores that can perform batch operations on collections of InnerK values keyed by OutterK where V indicates membership of InnerK within OutterK.

    ( general enough to go into PivotOpts )

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

    Definition Classes
    AnyRef
  23. final def notify(): Unit

    Definition Classes
    AnyRef
  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  25. def put(kv: ((ChannelBuffer, ChannelBuffer), Option[Double])): Future[Unit]

    replace a value Delete is the same as put((k,None))

    replace a value Delete is the same as put((k,None))

    Definition Classes
    Store
  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  27. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

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

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

Inherited from Closeable

Inherited from AnyRef

Inherited from Any