LRUCache

A least-recently-used cache for Key -> Value computations It currently keeps the last 8 associations, but this can be changed to anywhere between 2 and 16 by changing LRUCache.Retained.

Implementation: We keep a ring of eight places, linked with the next data structure. The ring models a priority queue. last points to the last element of the queue, and next(last) to the first one. Lookups compare keys sequentially from first to last. Elements with successful lookup get promoted to be first in the queue. Elements are evicted at the last position.

Linear Supertypes

AnyRef, Any

Instance Constructors

new LRUCache()(implicit arg0: ClassTag[Key], arg1: ClassTag[Value])

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 enter(key: Key, value: Value): Unit

Enter key/value in cache at position last.
Enter key/value in cache at position last. As a side effect, sets last to lastButOne. If lastButOne was set by a preceding unsuccessful lookup for the same key, this means that the new element is now the first in the queue. If there was no preceding lookup, the element is inserted at a random position in the queue.
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 first: Int
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def indices: Iterator[Int]
def invalidate(key: Key): Unit

Invalidate key.
Invalidate key. The invalidated element becomes the last in the queue.
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val keys: Array[Key]
def keysIterator: Iterator[Key]
var last: Int
var lastButOne: Int
def lookup(key: Key): Value

Lookup key, returning value or null for not found.
Lookup key, returning value or null for not found. As a side effect, sets lastButOne to the element before last if key was not found.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
var next: SixteenNibbles
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

Definition Classes
AnyRef
def toString(): String

Definition Classes
LRUCache → AnyRef → Any
val values: Array[Value]
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 LRUCache | package util

class LRUCache[Key >: Null <: AnyRef, Value >: Null] extends AnyRef

Instance Constructors

new LRUCache()(implicit arg0: ClassTag[Key], arg1: ClassTag[Value])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def enter(key: Key, value: Value): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def first: Int

final def getClass(): Class[_]

def hashCode(): Int

def indices: Iterator[Int]

def invalidate(key: Key): Unit

final def isInstanceOf[T0]: Boolean

val keys: Array[Key]

def keysIterator: Iterator[Key]

var last: Int

var lastButOne: Int

def lookup(key: Key): Value

final def ne(arg0: AnyRef): Boolean

var next: SixteenNibbles

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

val values: Array[Value]

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