MergeableStore

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
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.
implicit def enrich[K, V](store: MergeableStore[K, V]): EnrichedMergeableStore[K, V]
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fromStore[K, V](store: Store[K, V])(implicit sg: Semigroup[V], fc: FutureCollector): 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.
def fromStoreEmptyIsZero[K, V](store: Store[K, V])(implicit mon: Monoid[V], fc: FutureCollector): 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. This deletes zeros on put, but returns zero on empty (never returns None). Useful for sparse storage of counts, etc...
def fromStoreNoMulti[K, V](store: Store[K, V])(implicit sg: Semigroup[V]): MergeableStore[K, V]

Create a mergeable by implementing merge with single get followed by put for each key.
Create a mergeable by implementing merge with single get followed by put for each key. Also forces multiGet and multiPut to use the store's default implementation of a single get and put. The merge is only safe if each key is owned by a single thread. Useful in certain cases where multiGets and multiPuts may result in higher error rates or lower throughput.
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
def multiMergeFromMultiSet[K, V](store: Store[K, V], kvs: Map[K, V])(implicit sg: Semigroup[V]): Map[K, Future[Option[V]]]

Implements multiMerge functionality in terms of an underlying store's multiGet and multiSet.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def unpivot[K, OuterK, InnerK, V](store: MergeableStore[OuterK, Map[InnerK, V]])(split: (K) ⇒ (OuterK, InnerK))(implicit arg0: Semigroup[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 Semigroup is present at call time not the actual Semigroup being used by the underlying store. I guess we need to unpivot the Semigroup as well (and might not even be well defined). If the Semigroup is the usual mapMonoid, everything is fine.
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
def withSummer[K, V](store: MergeableStore[K, V])(summerCons: SummerConstructor[K]): 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

Deprecated Value Members

def multiMergeFromMultiSet[K, V](store: Store[K, V], kvs: Map[K, V], missingfn: (K) ⇒ Future[Option[V]] = FutureOps.missingValueFor)(implicit collect: FutureCollector, sg: Semigroup[V]): Map[K, Future[Option[V]]]

Use the newer function with less params below.
Use the newer function with less params below. This function just calls that ignoring missingfn and collect.

Annotations
@deprecated
Deprecated

Related Docs: trait MergeableStore | package algebra

object MergeableStore

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def convert[K1, K2, V1, V2](store: MergeableStore[K1, V1])(kfn: (K2) ⇒ K1)(implicit bij: ImplicitBijection[V2, V1]): MergeableStore[K2, V2]

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fromStore[K, V](store: Store[K, V])(implicit sg: Semigroup[V], fc: FutureCollector): MergeableStore[K, V]

def fromStoreEmptyIsZero[K, V](store: Store[K, V])(implicit mon: Monoid[V], fc: FutureCollector): MergeableStore[K, V]

def fromStoreNoMulti[K, V](store: Store[K, V])(implicit sg: Semigroup[V]): MergeableStore[K, V]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def multiMergeFromMultiSet[K, V](store: Store[K, V], kvs: Map[K, V])(implicit sg: Semigroup[V]): Map[K, Future[Option[V]]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withSummer[K, V](store: MergeableStore[K, V])(summerCons: SummerConstructor[K]): MergeableStore[K, V]

Deprecated Value Members

def multiMergeFromMultiSet[K, V](store: Store[K, V], kvs: Map[K, V], missingfn: (K) ⇒ Future[Option[V]] = FutureOps.missingValueFor)(implicit collect: FutureCollector, sg: Semigroup[V]): Map[K, Future[Option[V]]]

Inherited from AnyRef

Inherited from Any

Ungrouped