Class

com.twitter.storehaus

EnrichedReadableStore

Related Doc: package storehaus

Permalink

class EnrichedReadableStore[-K, +V] extends AnyRef

Enrichment on the com.twitter.storehaus.ReadableStore trait. Storehaus uses the enrichment pattern instead of adding these methods directly to the trait because many of the functions (mapValues, for example) have different meanings for ReadableStore, Store and MergeableStore.

import ReadableStore.enrich

to get access to these methods.

TODO: in scala 2.10 this should be a value class

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

Instance Constructors

  1. new EnrichedReadableStore(store: ReadableStore[K, V])

    Permalink

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. def andThen[V2, K1 >: V](other: ReadableStore[K1, V2])(implicit fc: FutureCollector): ReadableStore[K, V2]

    Permalink

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def clone(): AnyRef

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

  7. def composeKeyMapping[K1](fn: (K1) ⇒ K): ReadableStore[K1, V]

    Permalink

    convert K1 to K then lookup K in this store

  8. def convert[K1, V1](kfn: (K1) ⇒ K)(vfn: (V) ⇒ Future[V1]): ReadableStore[K1, V1]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. def flatMapValues[V2](fn: (V) ⇒ Future[V2]): ReadableStore[K, V2]

    Permalink

    apply an async function on all the values

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

    Permalink
    Definition Classes
    AnyRef → Any

  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  16. def mapValues[V1](fn: (V) ⇒ V1): ReadableStore[K, V1]

    Permalink

    Apply a non-blocking function on all the values.

    Apply a non-blocking function on all the values. If this function throws, it will be caught in the Future.

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

    Permalink
    Definition Classes
    AnyRef

  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  21. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  22. def unpivot[CombinedK, InnerK, InnerV](split: (CombinedK) ⇒ (K, InnerK))(implicit ev: <:<[V, Map[InnerK, InnerV]]): ReadableStore[CombinedK, InnerV]

    Permalink

  23. final def wait(): Unit

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

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

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

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

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

  26. def withCache[K1 <: K, V1 >: V](cache: Cache[K1, Future[Option[V1]]]): ReadableStore[K1, V1]

    Permalink

  27. def withCache[K1 <: K, V1 >: V](cache: MutableCache[K1, Future[Option[V1]]]): ReadableStore[K1, V1]

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped