OrderedBoundedCache

abstract val maxSize: Long

Maximum size of the cache

abstract val removeIdx: (Seq[K]) ⇒ Int

Called when attempt to make space in the cache.

abstract val sizeOf: (V) ⇒ Long

Return the size of a a given cache item If items are objects (for example) this might just be: (x) => 1 If items are arrays of ints and the maxSize is in bytes this function might be: (x) => x.length * 4

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def cacheFree(ltgt: Long): Unit

Attempt to free space in the cache starting with the last accessed element

def canInsert(v: V): Boolean

returns true iff v can be inserted into the cache without violating the size boundary

def clone(): AnyRef

var currentSize: Long

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getOrInsert(k: K, vv: ⇒ V): V

Lookup the value for key k If the value is in the cache, return it.

def hashCode(): Int

def insert(k: K, v: V): Boolean

Insert the value v (keyed by k) into the cache

final def isInstanceOf[T0]: Boolean

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

Lookup the value for key k

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

Remove k from the cache

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