geotrellis.process

AtomicCache

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

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

Linear Supertypes
CacheStrategy[K, V], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. AtomicCache
  2. CacheStrategy
  3. AnyRef
  4. Any
Visibility
  1. Public
  2. All

Abstract Value Members

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

    Remove k from the cache

    Remove k from the cache

    Attributes
    abstract
    Definition Classes
    CacheStrategy

Concrete Value Members

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

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

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

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

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

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

    Attributes
    final
    Definition Classes
    Any
  7. val bigLock : Lock

  8. def clone (): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  9. val currentlyLoading : HashMap[K, Lock]

  10. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  11. def equals (arg0: Any): Boolean

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

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

    Attributes
    final
    Definition Classes
    AnyRef → Any
  14. def getOrInsert (k: K, v: ⇒ 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
    AtomicCacheCacheStrategy
  15. def hashCode (): Int

    Definition Classes
    AnyRef → Any
  16. 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
    AtomicCacheCacheStrategy
  17. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any
  18. 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
    AtomicCacheCacheStrategy
  19. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  20. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
  21. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
  22. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  23. def toString (): String

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

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

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from CacheStrategy[K, V]

Inherited from AnyRef

Inherited from Any