com.twitter.storehaus.algebra

UnpivotedMergeableStore

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

MergeableStore enrichment which presents a MergeableStore[K, V] over top of a packed MergeableStore[OuterK, Map[InnerK, V]].

Source
UnpivotedMergeableStore.scala
Linear Supertypes
MergeableStore[K, V], UnpivotedStore[K, OuterK, InnerK, V], Store[K, V], UnpivotedReadableStore[K, OuterK, InnerK, V], ReadableStore[K, V], Closeable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. UnpivotedMergeableStore
  2. MergeableStore
  3. UnpivotedStore
  4. Store
  5. UnpivotedReadableStore
  6. ReadableStore
  7. Closeable
  8. AnyRef
  9. Any
Visibility
  1. Public
  2. All

Instance Constructors

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

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 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
    UnpivotedMergeableStoreUnpivotedStoreUnpivotedReadableStoreReadableStore → Closeable
  9. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  12. 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
    UnpivotedReadableStoreReadableStore
  13. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any
  14. def hashCode(): Int

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

    Definition Classes
    Any
  16. 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
    UnpivotedMergeableStoreMergeableStore
  17. 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
    UnpivotedMergeableStoreMergeableStore
  18. 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
    UnpivotedReadableStoreReadableStore
  19. def multiMerge[K1 <: K](kvs: Map[K1, V]): Map[K1, Future[Unit]]

    merge a set of keys.

    merge a set of keys.

    Definition Classes
    UnpivotedMergeableStoreMergeableStore
  20. 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
    UnpivotedStoreStore
  21. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  22. final def notify(): Unit

    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  24. 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
    UnpivotedStoreStore
  25. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  26. def toString(): String

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

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