Class

geotrellis.spark.util.cache

NoCache

Related Doc: package cache

Permalink

class NoCache[K, V] extends Cache[K, V]

A Cache Strategy that completely ignores caching and always returns the input object Operations on this cache execute in O(1) time

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
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NoCache
  2. Cache
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NoCache()

    Permalink

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 clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

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

  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  12. 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
    NoCache → Cache

  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  14. 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
    NoCache → Cache

  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink

    Remove k from the cache

    Remove k from the cache

    Definition Classes
    NoCache → Cache

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

    Permalink
    Definition Classes
    AnyRef

  20. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  21. final def wait(): Unit

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

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

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

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