Trait

geotrellis.spark.util.cache

BoundedCache

Related Doc: package cache

Permalink

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

A hash backed cache with a size boundary Operations on this cache may required O(N) time to execute (N = size of cache)

Annotations
@deprecated
Deprecated

(Since version 1.2) This will be removed in favor of a pluggable cache in 2.0

Linear Supertypes
Cache[K, V], Serializable, Serializable, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BoundedCache
  2. Cache
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def cacheFree(l: Long): Unit

    Permalink

    Attempt to free l amount of cache space this method is called once after an insert would have failed due to space constraints.

    Attempt to free l amount of cache space this method is called once after an insert would have failed due to space constraints. After this method returns the insert will be retried

  2. abstract def lookup(k: K): Option[V]

    Permalink

    Lookup the value for key k

    Lookup the value for key k

    returns

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

    Definition Classes
    Cache
  3. abstract val maxSize: Long

    Permalink

    Maximum size of the cache

  4. abstract val sizeOf: (V) ⇒ Long

    Permalink

    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

Concrete Value Members

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

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

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

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

    Permalink
    Definition Classes
    Any
  5. def canInsert(v: V): Boolean

    Permalink

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

  6. def clone(): AnyRef

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

    Permalink
  8. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  10. def evicted(v: V): Unit

    Permalink
  11. def finalize(): Unit

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

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

    Permalink

    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
    Cache
  14. def hashCode(): Int

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

    Permalink

    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
    BoundedCacheCache
  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  17. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

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

    Permalink

    Remove k from the cache

    Remove k from the cache

    Definition Classes
    BoundedCacheCache
  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  22. def toString(): String

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Cache[K, V]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped