AsyncLoadingCache

Instance Constructors

new AsyncLoadingCache(underlying: benmanes.caffeine.cache.AsyncLoadingCache[K, V])

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( ... )
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(key: K)(implicit ec: ExecutionContext): Future[V]

Returns the future associated with key in this cache, obtaining that value from loader if necessary.
Returns the future associated with key in this cache, obtaining that value from loader if necessary. If the asynchronous computation fails, the entry will be automatically removed.
key
key with which the specified value is to be associated
returns
the current (existing or computed) future value associated with the specified key

Exceptions thrown
java.lang.RuntimeException or Error if the loader does when constructing the future, in which case the mapping is left unestablished
def get(key: K, mappingFunction: (K) ⇒ V)(implicit ec: ExecutionContext): Future[V]

Returns the future associated with key in this cache, obtaining that value from mappingFunction if necessary.
Returns the future associated with key in this cache, obtaining that value from mappingFunction if necessary. This method provides a simple substitute for the conventional "if cached, return; otherwise create, cache and return" pattern.
key
key with which the specified value is to be associated
mappingFunction
the function to asynchronously compute a value
returns
the current (existing or computed) future value associated with the specified key
def getAll(keys: Iterable[K])(implicit ec: ExecutionContext): Future[Map[K, V]]

Returns the future of a map of the values associated with keys, creating or retrieving those values if necessary.
Returns the future of a map of the values associated with keys, creating or retrieving those values if necessary. The returned map contains entries that were already cached, combined with newly loaded entries. If the any of the asynchronous computations fail, those entries will be automatically removed.
keys
the keys whose associated values are to be returned
returns
the future containing an mapping of keys to values for the specified keys in this cache

Exceptions thrown
java.lang.RuntimeException or Error if the loader does so
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getFuture(key: K, mappingFunction: (K) ⇒ Future[V])(implicit ec: ExecutionContext): Future[V]

Returns the future associated with key in this cache, obtaining that value from mappingFunction if necessary.
Returns the future associated with key in this cache, obtaining that value from mappingFunction if necessary. This method provides a simple substitute for the conventional "if cached, return; otherwise create, cache and return" pattern.
key
key with which the specified value is to be associated
mappingFunction
the function to asynchronously compute a value
returns
the current (existing or computed) future value associated with the specified key

Exceptions thrown
java.lang.RuntimeException or Error if the mappingFunction does when constructing the future, in which case the mapping is left unestablished
def getIfPresent(key: K)(implicit ec: ExecutionContext): Future[Option[V]]

Returns the future associated with key in this cache, or None if there is no cached future for key.
Returns the future associated with key in this cache, or None if there is no cached future for key.
key
key whose associated value is to be returned
returns
an option containing the current (existing or computed) future value to which the specified key is mapped, or None if this map contains no mapping for the key
def hashCode(): Int

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

Definition Classes
Any
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(key: K, valueFuture: Future[V])(implicit ec: ExecutionContext): Unit

Associates value with key in this cache.
Associates value with key in this cache. If the cache previously contained a value associated with key, the old value is replaced by value. If the asynchronous computation fails, the entry will be automatically removed.
key
key with which the specified value is to be associated
valueFuture
value to be associated with the specified key
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def synchronous(): LoadingCache[K, V]

Returns a view of the entries stored in this cache as a synchronous LoadingCache.
Returns a view of the entries stored in this cache as a synchronous LoadingCache. A mapping is not present if the value is currently being loaded. Modifications made to the synchronous cache directly affect the asynchronous cache. If a modification is made to a mapping that is currently loading, the operation blocks until the computation completes.
returns
a thread-safe synchronous view of this cache
def toString(): String

Definition Classes
AsyncLoadingCache → AnyRef → Any
val underlying: benmanes.caffeine.cache.AsyncLoadingCache[K, V]
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( ... )

Related Docs: object AsyncLoadingCache | package scaffeine

class AsyncLoadingCache[K, V] extends AnyRef

Instance Constructors

new AsyncLoadingCache(underlying: benmanes.caffeine.cache.AsyncLoadingCache[K, V])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def get(key: K)(implicit ec: ExecutionContext): Future[V]

def get(key: K, mappingFunction: (K) ⇒ V)(implicit ec: ExecutionContext): Future[V]

def getAll(keys: Iterable[K])(implicit ec: ExecutionContext): Future[Map[K, V]]

final def getClass(): Class[_]

def getFuture(key: K, mappingFunction: (K) ⇒ Future[V])(implicit ec: ExecutionContext): Future[V]

def getIfPresent(key: K)(implicit ec: ExecutionContext): Future[Option[V]]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def put(key: K, valueFuture: Future[V])(implicit ec: ExecutionContext): Unit

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

def synchronous(): LoadingCache[K, V]

def toString(): String

val underlying: benmanes.caffeine.cache.AsyncLoadingCache[K, V]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped