LocalLRUCache

Non-threadsafe, non-distributed LRU cache.

See: http://littletechsecrets.wordpress.com/2008/11/16/simple-lru-cache-in-java/ http://amix.dk/blog/post/19465

Xitrum uses this for storing etags for static files. Each web server in a cluster has its own cache of (path, mtime) -> etag.

Linear Supertypes

LinkedHashMap[K, V], HashMap[K, V], Serializable, Cloneable, AbstractMap[K, V], Map[K, V], AnyRef, Any

Type Hierarchy Learn more about scaladoc diagrams

Instance Constructors

new LocalLRUCache(capacity: Int)

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clear(): Unit

Definition Classes
LinkedHashMap → HashMap → AbstractMap → Map
def clone(): AnyRef

Definition Classes
HashMap → AbstractMap → AnyRef
def containsKey(arg0: Any): Boolean

Definition Classes
HashMap → AbstractMap → Map
def containsValue(arg0: Any): Boolean

Definition Classes
LinkedHashMap → HashMap → AbstractMap → Map
def entrySet(): Set[Entry[K, V]]

Definition Classes
HashMap → AbstractMap → Map
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AbstractMap → Map → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def get(arg0: Any): V

Definition Classes
LinkedHashMap → HashMap → AbstractMap → Map
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AbstractMap → Map → AnyRef → Any
def isEmpty(): Boolean

Definition Classes
HashMap → AbstractMap → Map
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def keySet(): Set[K]

Definition Classes
HashMap → AbstractMap → Map
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(arg0: K, arg1: V): V

Definition Classes
HashMap → AbstractMap → Map
def putAll(arg0: Map[_ <: K, _ <: V]): Unit

Definition Classes
HashMap → AbstractMap → Map
def remove(arg0: Any): V

Definition Classes
HashMap → AbstractMap → Map
def removeEldestEntry(eldest: Entry[K, V]): Boolean

Attributes
protected
Definition Classes
LocalLRUCache → LinkedHashMap
def size(): Int

Definition Classes
HashMap → AbstractMap → Map
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AbstractMap → AnyRef → Any
def values(): Collection[V]

Definition Classes
HashMap → AbstractMap → Map
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()

class LocalLRUCache[K, V] extends LinkedHashMap[K, V]

Instance Constructors

new LocalLRUCache(capacity: Int)

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clear(): Unit

def clone(): AnyRef

def containsKey(arg0: Any): Boolean

def containsValue(arg0: Any): Boolean

def entrySet(): Set[Entry[K, V]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def get(arg0: Any): V

final def getClass(): Class[_]

def hashCode(): Int

def isEmpty(): Boolean

final def isInstanceOf[T0]: Boolean

def keySet(): Set[K]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def put(arg0: K, arg1: V): V

def putAll(arg0: Map[_ <: K, _ <: V]): Unit

def remove(arg0: Any): V

def removeEldestEntry(eldest: Entry[K, V]): Boolean

def size(): Int

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

def toString(): String

def values(): Collection[V]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from LinkedHashMap[K, V]

Inherited from HashMap[K, V]

Inherited from Serializable

Inherited from Cloneable

Inherited from AbstractMap[K, V]

Inherited from Map[K, V]

Inherited from AnyRef

Inherited from Any

Ungrouped