com.twitter.storehaus.algebra

MergeableStore

trait MergeableStore[-K, V] extends Store[K, V]

Main trait to represent stores that are used for aggregation

Source
MergeableStore.scala
Linear Supertypes
Store[K, V], ReadableStore[K, V], Closeable, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. MergeableStore
  2. Store
  3. ReadableStore
  4. Closeable
  5. AnyRef
  6. Any
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def monoid: Monoid[V]

    The monoid equivalent to the merge operation of this store

Concrete 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
    ReadableStore → 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
    ReadableStore
  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(kv: (K, V)): Future[Unit]

    the key should hold: Monoid.

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

  17. def multiGet[K1 <: K](ks: Set[K1]): Map[K1, 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
    ReadableStore
  18. def multiMerge[K1 <: K](kvs: Map[K1, V]): Map[K1, Future[Unit]]

    merge a set of keys.

  19. 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
    Store
  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 put(kv: (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
    Store
  24. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  25. def toString(): String

    Definition Classes
    AnyRef → Any
  26. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from Store[K, V]

Inherited from ReadableStore[K, V]

Inherited from Closeable

Inherited from AnyRef

Inherited from Any