FutureCache

The FutureCache object provides the public interface for constructing FutureCaches. Once you've constructed a basic FutureCache, you should almost always wrap it with default. Normal usage looks like:

val fn: K => Future[V] val map = (new java.util.concurrent.ConcurrentHashMap[K, V]()).asScala val cachedFn: K => Future[V] = FutureCache.default(fn, FutureCache.fromMap(map))

We typically recommend that you use Caffeine Caches via com.twitter.cache.caffeine.CaffeineCache.

Linear Supertypes

AnyRef, Any

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 default[K, V](fn: (K) ⇒ Future[V], cache: FutureCache[K, V]): (K) ⇒ Future[V]

Creates a function which caches the results of fn in an com.twitter.cache.FutureCache.
Creates a function which caches the results of fn in an com.twitter.cache.FutureCache. Ensures that failed Futures are evicted, and that interrupting a Future returned to you by this function is safe.

See also
standard for the equivalent Java API.
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 fromMap[K, V](fn: (K) ⇒ Future[V], map: ConcurrentMap[K, Future[V]]): (K) ⇒ Future[V]

A com.twitter.cache.FutureCache backed by a java.util.concurrent.ConcurrentMap.
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
Any
def keyEncoded[K, V, U](encode: (K) ⇒ V, cache: FutureCache[V, U]): FutureCache[K, U]

Encodes keys, producing a Cache that takes keys of a different type.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def standard[K, V](fn: (K) ⇒ Future[V], cache: FutureCache[K, V]): (K) ⇒ Future[V]

Alias for default which can be called from Java.
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( ... )

Related Docs: class FutureCache | package cache

object FutureCache

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def default[K, V](fn: (K) ⇒ Future[V], cache: FutureCache[K, V]): (K) ⇒ Future[V]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fromMap[K, V](fn: (K) ⇒ Future[V], map: ConcurrentMap[K, Future[V]]): (K) ⇒ Future[V]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def keyEncoded[K, V, U](encode: (K) ⇒ V, cache: FutureCache[V, U]): FutureCache[K, U]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def standard[K, V](fn: (K) ⇒ Future[V], cache: FutureCache[K, V]): (K) ⇒ Future[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

Inherited from AnyRef

Inherited from Any

Ungrouped