Cache

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. val defaultExpiration: Option[TimeSpec]

   

7. def delete(k: K)(implicit F: Sync[F]): F[Unit]

   

   Delete an item from the cache.

   Delete an item from the cache. Won't do anything if the item is not present.

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

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

13. def insert(k: K, v: V)(implicit F: Sync[F], C: Clock[F]): F[Unit]

    

    Insert an item in the cache, using the default expiration value of the cache.

14. def insertWithTimeout(timeout: Option[TimeSpec])(k: K, v: V)(implicit F: Sync[F], C: Clock[F]): F[Unit]

    

    Insert an item in the cache, with an explicit expiration value.

    Insert an item in the cache, with an explicit expiration value.

    If the expiration value is None, the item will never expire. The default expiration value of the cache is ignored.

    The expiration value is relative to the current clockMonotonic time, i.e. it will be automatically added to the result of clockMonotonic for the supplied unit.

15. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

16. def keys(implicit F: Sync[F]): F[List[K]]

    

    Return all keys present in the cache, including expired items.

17. def lookup(k: K)(implicit F: Sync[F], C: Clock[F]): F[Option[V]]

    

    Lookup an item with the given key, and delete it if it is expired.

    Lookup an item with the given key, and delete it if it is expired.

    The function will only return a value if it is present in the cache and if the item is not expired.

    The function will eagerly delete the item from the cache if it is expired.

18. def lookupNoUpdate(k: K)(implicit F: Sync[F], C: Clock[F]): F[Option[V]]

    

    Lookup an item with the given key, but don't delete it if it is expired.

    Lookup an item with the given key, but don't delete it if it is expired.

    The function will only return a value if it is present in the cache and if the item is not expired.

    The function will not delete the item from the cache.

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

    

    Definition Classes

    AnyRef

20. final def notify(): Unit

    

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

22. def purgeExpired(implicit F: Sync[F], C: Clock[F]): F[Unit]

    

    Delete all items that are expired.

    Delete all items that are expired.

    This is one big atomic operation.

23. def size(implicit F: Sync[F]): F[Int]

    

    Return the size of the cache, including expired items.

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

    

    Definition Classes

    AnyRef

25. def toString(): String

    

    Definition Classes

    AnyRef → Any

26. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )