MergeableStore

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: MergeableStore[K1, V1])(kfn: (K2) ⇒ K1)(implicit bij: ImplicitBijection[V2, V1]): MergeableStore[K2, V2]

   Convert the key and value type of this mergeable.

   Convert the key and value type of this mergeable. Note this just bijects the Monoid, so the underlying monoid action is unchanged. For instance if you did a Bijection from Long to (Int,Int), the underlying monoid would still be long, not the default (Int,Int) monoid which works differently. Use of this probably requires careful design.

9. implicit def enrich[K, V](store: MergeableStore[K, V]): EnrichedMergeableStore[K, V]

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 fromStore[K, V](store: Store[K, V])(implicit mon: Monoid[V], fc: FutureCollector[(K, Option[V])]): MergeableStore[K, V]

    Create a mergeable by implementing merge with get followed by put.

    Create a mergeable by implementing merge with get followed by put. Only safe if each key is owned by a single thread.

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

    Definition Classes

    AnyRef → Any

15. def hashCode(): Int

    Definition Classes

    AnyRef → Any

16. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

17. def multiMergeFromMultiSet[K, V](store: Store[K, V], kvs: Map[K, V])(implicit collect: FutureCollector[(K, Option[V])], monoid: Monoid[V]): Map[K, Future[Unit]]

    Implements multiMerge functionality in terms of an underlying store's multiGet and multiSet.

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

    Definition Classes

    AnyRef

19. final def notify(): Unit

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

22. def toString(): String

    Definition Classes

    AnyRef → Any

23. def unpivot[K, OuterK, InnerK, V](store: MergeableStore[OuterK, Map[InnerK, V]])(split: (K) ⇒ (OuterK, InnerK))(implicit arg0: Monoid[V]): MergeableStore[K, V]

    unpivot or uncurry this MergeableStore TODO: not clear is correct.

    unpivot or uncurry this MergeableStore TODO: not clear is correct. It is injecting whatever monoid is present at call time not the actual monoid being used by the underlying store. I guess we need to unpivot the monoid as well (and might not even be well defined). If the monoid is the usual mapMonoid, everything is fine.

24. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

27. def withSummer[K, V](store: MergeableStore[K, V])(summerCons: (Monoid[V]) ⇒ StatefulSummer[Map[K, V]]): MergeableStore[K, V]

    Use a StatefulSummer to buffer results before calling merge.

    Use a StatefulSummer to buffer results before calling merge. Useful when merging to a remote store, of if you have some very hot keys