TTLCache

Instance Constructors

new TTLCache(ttl: Duration, cache: Map[K, (Long, V)])(clock: () ⇒ Long)

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def +(kv: (K, (Long, V))): Cache[K, (Long, V)]

Definition Classes
Cache
def -(k: K): Cache[K, (Long, V)]

Definition Classes
Cache
def --(ks: Set[K]): Cache[K, (Long, V)]

Definition Classes
Cache
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
val clock: () ⇒ Long
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def contains(k: K): Boolean

Returns true if the cache contains a value for the supplied key, false otherwise.
Returns true if the cache contains a value for the supplied key, false otherwise.

Definition Classes
TTLCache → Cache
def empty: TTLCache[K, V]

Returns an empty version of this specific cache implementation.
Returns an empty version of this specific cache implementation.

Definition Classes
TTLCache → Cache
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def evict(k: K): (Option[(Long, V)], Cache[K, (Long, V)])

Definition Classes
TTLCache → Cache
def expired(k: K): Boolean
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def get(k: K): Option[(Long, V)]

Returns an option containing the value stored for the supplied key or None if the key is not present in the cache.
Returns an option containing the value stored for the supplied key or None if the key is not present in the cache. (A call to get should not change the underlying cache in any way.)

Definition Classes
TTLCache → Cache
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getNonExpired(k: K): Option[V]
def hashCode(): Int

Definition Classes
AnyRef → Any
def hit(k: K): TTLCache[K, V]

Definition Classes
TTLCache → Cache
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def iterator: Iterator[(K, (Long, V))]

Returns an iterator of all key-value pairs inside of this cache.
Returns an iterator of all key-value pairs inside of this cache.

Definition Classes
TTLCache → Cache
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, (Long, V))): (Set[K], TTLCache[K, V])

Definition Classes
TTLCache → Cache
def putClocked(kv: (K, V)): (Set[K], TTLCache[K, V])
def putWithTime(kv: (K, (Long, V)), currentMillis: Long): (Set[K], TTLCache[K, V])

Attributes
protected
def removeExpired: (Set[K], TTLCache[K, V])
def seed(m: Map[K, (Long, V)]): Cache[K, (Long, V)]

Definition Classes
Cache
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toMap: Map[K, (Long, V)]

Definition Classes
TTLCache → Cache
def toMutable(exhaustFn: (Set[K]) ⇒ Unit = _ => ()): MutableCache[K, (Long, V)]

Definition Classes
Cache
def toNonExpiredMap: Map[K, V]
def toRemove(currentMillis: Long): Set[K]

Attributes
protected
def toString(): String

Definition Classes
AnyRef → Any
def touch(k: K, v: ⇒ (Long, V)): Cache[K, (Long, V)]

Touches the cache with the supplied key.
Touches the cache with the supplied key. If the key is present in the cache, the cache calls "hit" on the key. If the key is missing, the cache adds fn(k) to itself.

Definition Classes
Cache
val ttl: Duration
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 TTLCache | package cache

class TTLCache[K, V] extends Cache[K, (Long, V)]

Instance Constructors

new TTLCache(ttl: Duration, cache: Map[K, (Long, V)])(clock: () ⇒ Long)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(kv: (K, (Long, V))): Cache[K, (Long, V)]

def -(k: K): Cache[K, (Long, V)]

def --(ks: Set[K]): Cache[K, (Long, V)]

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

val clock: () ⇒ Long

def clone(): AnyRef

def contains(k: K): Boolean

def empty: TTLCache[K, V]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def evict(k: K): (Option[(Long, V)], Cache[K, (Long, V)])

def expired(k: K): Boolean

def finalize(): Unit

def get(k: K): Option[(Long, V)]

final def getClass(): Class[_]

def getNonExpired(k: K): Option[V]

def hashCode(): Int

def hit(k: K): TTLCache[K, V]

final def isInstanceOf[T0]: Boolean

def iterator: Iterator[(K, (Long, V))]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def put(kv: (K, (Long, V))): (Set[K], TTLCache[K, V])

def putClocked(kv: (K, V)): (Set[K], TTLCache[K, V])

def putWithTime(kv: (K, (Long, V)), currentMillis: Long): (Set[K], TTLCache[K, V])

def removeExpired: (Set[K], TTLCache[K, V])

def seed(m: Map[K, (Long, V)]): Cache[K, (Long, V)]

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

def toMap: Map[K, (Long, V)]

def toMutable(exhaustFn: (Set[K]) ⇒ Unit = _ => ()): MutableCache[K, (Long, V)]

def toNonExpiredMap: Map[K, V]

def toRemove(currentMillis: Long): Set[K]

def toString(): String

def touch(k: K, v: ⇒ (Long, V)): Cache[K, (Long, V)]

val ttl: Duration

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Cache[K, (Long, V)]

Inherited from AnyRef

Inherited from Any

Ungrouped