Trait

geotrellis.spark.util.cache

AtomicCache

Related Doc: package cache

Permalink

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

Atomic cache provides an atomic getOrInsert(k,v) method This cache assumes that (k,v) pair is immutable

Linear Supertypes
Cache[K, V], Serializable, Serializable, AnyRef, Any
Known Subclasses
LRUCache, MRUCache
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AtomicCache
  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 remove(k: K): Option[V]

    Permalink

    Remove k from the cache

    Remove k from the cache

    Definition Classes
    Cache

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. val bigLock: Lock

    Permalink

  6. def clone(): AnyRef

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

  7. val currentlyLoading: HashMap[K, Lock]

    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 finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  12. def getOrInsert(k: K, v: ⇒ 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
    AtomicCache → Cache

  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  16. 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
    AtomicCache → Cache

  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. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  21. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  22. final def wait(): Unit

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

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

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

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