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

Linear Supertypes
MergeableStore[(ChannelBuffer, ChannelBuffer), Double], Mergeable[(ChannelBuffer, ChannelBuffer), Double], Store[(ChannelBuffer, ChannelBuffer), Double], WritableStore[(ChannelBuffer, ChannelBuffer), Option[Double]], ReadableStore[(ChannelBuffer, ChannelBuffer), Double], Closable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RedisSortedSetMembershipStore
  2. MergeableStore
  3. Mergeable
  4. Store
  5. WritableStore
  6. ReadableStore
  7. Closable
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Learn more about member selection
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[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def close(t: Time): Future[Unit]

    Definition Classes
    RedisSortedSetMembershipStore → Mergeable → WritableStore → ReadableStore → Closable
  9. def close(after: Duration): Future[Unit]

    Definition Classes
    Closable
  10. final def close(): Future[Unit]

    Definition Classes
    Closable
  11. final def eq(arg0: AnyRef): Boolean

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

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

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. 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
    RedisSortedSetMembershipStore → ReadableStore
  15. final def getClass(): Class[_]

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

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

    Definition Classes
    Any
  18. def merge(kv: ((ChannelBuffer, ChannelBuffer), Double)): Future[Option[Double]]

    Performs a zIncrBy operation on a set for a given member

    Performs a zIncrBy operation on a set for a given member

    Definition Classes
    RedisSortedSetMembershipStore → Mergeable
  19. def multiGet[K1 <: (ChannelBuffer, ChannelBuffer)](ks: Set[K1]): Map[K1, Future[Option[Double]]]

    Definition Classes
    ReadableStore
  20. def multiMerge[K1 <: (ChannelBuffer, ChannelBuffer)](kvs: Map[K1, Double]): Map[K1, Future[Option[Double]]]

    Definition Classes
    Mergeable
  21. 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
    RedisSortedSetMembershipStore → WritableStore
  22. 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 )

  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, ChannelBuffer), Option[Double])): Future[Unit]

    Definition Classes
    WritableStore
  27. def semigroup: Semigroup[Double]

    Definition Classes
    RedisSortedSetMembershipStore → Mergeable
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  29. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

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

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

Inherited from WritableStore[(ChannelBuffer, ChannelBuffer), Option[Double]]

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

Inherited from Closable

Inherited from AnyRef

Inherited from Any

Ungrouped