com.twitter.storehaus.algebra.UnpivotedMergeableStore

Instance Constructors

new UnpivotedMergeableStore(store: MergeableStore[OuterK, Map[InnerK, V]])(split: (K) ⇒ (OuterK, InnerK))(implicit arg0: Monoid[V])

Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def close(): Unit

Close this store and release any resources.
Close this store and release any resources. It is undefined what happens on get/multiGet after close

Definition Classes
UnpivotedMergeableStore → UnpivotedStore → UnpivotedReadableStore → ReadableStore → Closeable
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def get(k: K): Future[Option[V]]

get a single key from the store.
get a single key from the store. Prefer multiGet if you are getting more than one key at a time

Definition Classes
UnpivotedReadableStore → ReadableStore
final def getClass(): java.lang.Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
def merge(pair: (K, V)): Future[Unit]

the key should hold: Monoid.
the key should hold: Monoid.plus(get(kv._1).get, Some(kv._2)) after this.

Definition Classes
UnpivotedMergeableStore → MergeableStore
val monoid: Monoid[V]

The monoid equivalent to the merge operation of this store
The monoid equivalent to the merge operation of this store

Definition Classes
UnpivotedMergeableStore → MergeableStore
def multiGet[T <: K](ks: Set[T]): Map[T, Future[Option[V]]]

Get a set of keys from the store.
Get a set of keys from the store. Important: all keys in the input set are in the resulting map. If the store fails to return a value for a given key, that should be represented by a Future.exception.

Definition Classes
UnpivotedReadableStore → ReadableStore
def multiMerge[K1 <: K](kvs: Map[K1, V]): Map[K1, Future[Unit]]

merge a set of keys.
merge a set of keys.

Definition Classes
UnpivotedMergeableStore → MergeableStore
def multiPut[K1 <: K](kvs: Map[K1, Option[V]]): Map[K1, Future[Unit]]

Replace a set of keys at one time
Replace a set of keys at one time

Definition Classes
UnpivotedStore → Store
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def put(pair: (K, Option[V])): Future[Unit]

replace a value Delete is the same as put((k,None))
replace a value Delete is the same as put((k,None))

Definition Classes
UnpivotedStore → Store
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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()

UnpivotedMergeableStore

class UnpivotedMergeableStore[-K, OuterK, InnerK, V] extends UnpivotedStore[K, OuterK, InnerK, V] with MergeableStore[K, V]

Instance Constructors

new UnpivotedMergeableStore(store: MergeableStore[OuterK, Map[InnerK, V]])(split: (K) ⇒ (OuterK, InnerK))(implicit arg0: Monoid[V])

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def close(): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def get(k: K): Future[Option[V]]

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

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def merge(pair: (K, V)): Future[Unit]

val monoid: Monoid[V]

def multiGet[T <: K](ks: Set[T]): Map[T, Future[Option[V]]]

def multiMerge[K1 <: K](kvs: Map[K1, V]): Map[K1, Future[Unit]]

def multiPut[K1 <: K](kvs: Map[K1, Option[V]]): Map[K1, Future[Unit]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def put(pair: (K, Option[V])): Future[Unit]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from MergeableStore[K, V]

Inherited from UnpivotedStore[K, OuterK, InnerK, V]

Inherited from Store[K, V]

Inherited from UnpivotedReadableStore[K, OuterK, InnerK, V]

Inherited from ReadableStore[K, V]

Inherited from Closeable

Inherited from AnyRef

Inherited from Any