com.twitter.util

ImmutableLRU

class ImmutableLRU[K, V] extends AnyRef

An immutable key/value store that evicts the least recently accessed elements to stay constrained in a maximum size bound.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ImmutableLRU
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

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. def +(kv: (K, V)): (Option[K], ImmutableLRU[K, V])

    Build a new LRU containing the given key/value

    Build a new LRU containing the given key/value

    returns

    a tuple with of the following two items: _1 represents the evicted entry (if the given lru is at the maximum size) or None if the lru is not at capacity yet. _2 is the new lru with the given key/value pair inserted.

  5. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  6. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

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

  12. def get(k: K): (Option[V], ImmutableLRU[K, V])

    If the key is present in the cache, returns the pair of Some(value) and the cache with the key's entry as the most recently accessed.

    If the key is present in the cache, returns the pair of Some(value) and the cache with the key's entry as the most recently accessed. Else, returns None and the unmodified cache.

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

    Definition Classes
    AnyRef → Any

  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  16. implicit val kOrd: Ordering[K]

    Attributes
    protected

  17. def keySet: Set[K]

    the Set of all keys in the LRU

    the Set of all keys in the LRU

    Note

    accessing this set does not update the element LRU ordering

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

    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  21. def remove(k: K): (Option[V], ImmutableLRU[K, V])

    If the key is present in the cache, returns the pair of Some(value) and the cache with the key removed.

    If the key is present in the cache, returns the pair of Some(value) and the cache with the key removed. Else, returns None and the unmodified cache.

  22. def size: Int

    the number of entries in the cache

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

    Definition Classes
    AnyRef

  24. def toString(): String

    Definition Classes
    ImmutableLRU → AnyRef → Any

  25. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  27. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped