geotrellis.process

OrderedBoundedCache

trait OrderedBoundedCache[K, V] extends BoundedCache[K, V]

Linear Supertypes
BoundedCache[K, V], CacheStrategy[K, V], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. OrderedBoundedCache
  2. BoundedCache
  3. CacheStrategy
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract val maxSize: Long

    Maximum size of the cache

    Maximum size of the cache

    Definition Classes
    BoundedCache
  2. abstract val removeIdx: (Seq[K]) ⇒ Int

    Called when attempt to make space in the cache.

    Called when attempt to make space in the cache. This function should return the index of the item to remove next

  3. 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.

    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

    Definition Classes
    BoundedCache

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  3. final def ##(): Int

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

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

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def cacheFree(ltgt: Long): Unit

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

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

    Definition Classes
    OrderedBoundedCacheBoundedCache
  8. def canInsert(v: V): Boolean

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

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

    Definition Classes
    BoundedCache
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. var currentSize: Long

    Definition Classes
    BoundedCache
  11. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  15. def getOrInsert(k: K, vv: ⇒ V): V

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

    Lookup the value for key k If the value is in the cache, return it. Otherwise, insert the value v and return it

    Note: This method does not guarantee that v will be in the cache when it returns

    returns

    the cached value keyed to k or the computed value of v

    Definition Classes
    CacheStrategy
  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  17. def insert(k: K, v: V): Boolean

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

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

    returns

    true if the value was inserted into the cache

    Definition Classes
    OrderedBoundedCacheBoundedCacheCacheStrategy
  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  19. def lookup(k: K): Option[V]

    Lookup the value for key k

    Lookup the value for key k

    returns

    Some(v) if the value was cached, None otherwise

    Definition Classes
    OrderedBoundedCacheCacheStrategy
  20. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  21. final def notify(): Unit

    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  23. def remove(k: K): Option[V]

    Remove k from the cache

    Remove k from the cache

    Definition Classes
    BoundedCacheCacheStrategy
  24. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  25. def toString(): String

    Definition Classes
    AnyRef → Any
  26. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from BoundedCache[K, V]

Inherited from CacheStrategy[K, V]

Inherited from AnyRef

Inherited from Any

Ungrouped