BatchedStore

Instance Constructors

new BatchedStore(store: Store[K, V], maxMultiPutSize: Int, maxConcurrentMultiPuts: Int, maxMultiGetSize: Int, maxConcurrentMultiGets: Int)(implicit fc: FutureCollector)

store
the store to read and write values to
maxMultiPutSize
a multiPut to store will fetch values for at most maxMultiPutSize keys
maxConcurrentMultiPuts
the maximum number of multiputs to concurrently issue
maxMultiGetSize
a multiGet to store will fetch values for at most maxMultiGetSize keys
maxConcurrentMultiGets
the maximum number of multigets to concurrently issue

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 close(time: Time): Future[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
WritableStore → Closable
def close(after: Duration): Future[Unit]

Definition Classes
Closable
final def close(): Future[Unit]

Definition Classes
Closable
val connectionLock: AsyncSemaphore

Attributes
protected
Definition Classes
BatchedReadableStore
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 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
ReadableStoreProxy → ReadableStore
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
def multiGet[K1 <: K](keys: 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
BatchedReadableStore → ReadableStoreProxy → ReadableStore
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
BatchedStore → WritableStore
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(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
BatchedStore → WritableStore
val self: ReadableStore[K, V]

the store to fetch values from
the store to fetch values from

Attributes
protected
Definition Classes
BatchedReadableStore → Proxied
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( ... )
val writeConnectionLock: AsyncSemaphore

Attributes
protected

Related Doc: package storehaus

class BatchedStore[K, V] extends BatchedReadableStore[K, V] with Store[K, V]

Instance Constructors

new BatchedStore(store: Store[K, V], maxMultiPutSize: Int, maxConcurrentMultiPuts: Int, maxMultiGetSize: Int, maxConcurrentMultiGets: Int)(implicit fc: FutureCollector)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def close(time: Time): Future[Unit]

def close(after: Duration): Future[Unit]

final def close(): Future[Unit]

val connectionLock: AsyncSemaphore

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

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

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def multiGet[K1 <: K](keys: Set[K1]): Map[K1, Future[Option[V]]]

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

val self: ReadableStore[K, V]

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

val writeConnectionLock: AsyncSemaphore

Inherited from Store[K, V]

Inherited from WritableStore[K, Option[V]]

Inherited from BatchedReadableStore[K, V]

Inherited from ReadableStoreProxy[K, V]

Inherited from Proxied[ReadableStore[K, V]]

Inherited from ReadableStore[K, V]

Inherited from Closable

Inherited from AnyRef

Inherited from Any

Ungrouped