Store

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 convert[K1, K2, V1, V2](store: Store[K1, V1])(kfn: (K2) ⇒ K1)(implicit inj: Injection[V2, V1]): Store[K2, V2]

9. implicit def enrich[K, V](store: Store[K, V]): EnrichedStore[K, V]

   Import Store.

   Import Store.enrich to get access to additional methods/combinators on your stores see EnrichedStore

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

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

13. def first[K, V](stores: Seq[Store[K, V]])(implicit collect: FutureCollector[Unit]): Store[K, V]

    Returns a new Store[K, V] that queries all of the stores on read and returns the first values that are not exceptions.

    Returns a new Store[K, V] that queries all of the stores on read and returns the first values that are not exceptions. Writes are routed to every store in the supplied sequence.

14. def firstPresent[K, V](stores: Seq[Store[K, V]]): Store[K, V]

    Returns a new ReadableStore[K, V] that queries all of the stores and returns the first values that are not exceptions and that are present (ie, not equivalent to Future.

    Returns a new ReadableStore[K, V] that queries all of the stores and returns the first values that are not exceptions and that are present (ie, not equivalent to Future.None). Writes are routed to every store in the supplied sequence.

15. def fromCache[K, V](cache: MutableCache[K, V]): CacheStore[K, V]

    Generates a store from the supplied MutableCache

16. def fromJMap[K, V](m: Map[K, Option[V]]): Store[K, V]

    Given a java Map with Option[V] for the values, make a store

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

    Definition Classes

    AnyRef → Any

18. def hashCode(): Int

    Definition Classes

    AnyRef → Any

19. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

21. final def notify(): Unit

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    Definition Classes

    AnyRef

23. def select[K, V](stores: Seq[Store[K, V]])(pred: (Option[V]) ⇒ Boolean)(implicit collect: FutureCollector[Unit]): Store[K, V]

    Returns a new Store[K, V] that queries all of the stores and returns the first values that are not exceptions and that pass the supplied predicate.

    Returns a new Store[K, V] that queries all of the stores and returns the first values that are not exceptions and that pass the supplied predicate. Writes are routed to every store in the supplied sequence.

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

    Definition Classes

    AnyRef

25. def toString(): String

    Definition Classes

    AnyRef → Any

26. def unpivot[K, OuterK, InnerK, V](store: Store[OuterK, Map[InnerK, V]])(split: (K) ⇒ (OuterK, InnerK)): Store[K, V]

    Given a Store with values which are themselves Maps, unpivot/uncurry.

    Given a Store with values which are themselves Maps, unpivot/uncurry. The values of the new store are the inner values of the original store. multiGet/multiPut on this store will do the smart thing and pack into a minimum number of multiGets/multiPuts on the underlying store

27. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

30. def withRetry[K, V](store: Store[K, V], backoffs: Iterable[Duration])(pred: (Option[V]) ⇒ Boolean)(implicit timer: Timer): Store[K, V]

    Returns a Store[K, V] that attempts reads from a store multiple times until a predicate is met.

    Returns a Store[K, V] that attempts reads from a store multiple times until a predicate is met. The iterable of backoffs defines the time interval between two read attempts. If there is not read result satisfying the given predicate after all read attempts, a NotFoundException will be thrown.