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. object TimeSpec

   

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def copyCache[F[_], K, V](cache: Cache[F, K, V])(implicit arg0: Sync[F]): F[Cache[F, K, V]]

   

   Create a deep copy of the cache.

8. def createCache[F[_], K, V](defaultExpiration: Option[TimeSpec])(implicit arg0: Sync[F]): F[Cache[F, K, V]]

   

   Create a new cache with a default expiration value for newly added cache items.

   Create a new cache with a default expiration value for newly added cache items.

   Items that are added to the cache without an explicit expiration value (using insert) will be inserted with the default expiration value.

   If the specified default expiration value is None, items inserted by insert will never expire.

9. def delete[F[_], K, V](cache: Cache[F, K, V])(k: K)(implicit arg0: 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.

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

    

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

15. def insert[F[_], K, V](cache: Cache[F, K, V])(k: K, v: V)(implicit arg0: Sync[F], arg1: Clock[F]): F[Unit]

    

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

16. def insertWithTimeout[F[_], K, V](cache: Cache[F, K, V])(optionTimeout: Option[TimeSpec])(k: K, v: V)(implicit arg0: 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.

17. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

18. def keys[F[_], K, V](cache: Cache[F, K, V])(implicit arg0: Sync[F]): F[List[K]]

    

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

19. def lookup[F[_], K, V](c: Cache[F, K, V])(k: K)(implicit arg0: 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.

20. def lookupNoUpdate[F[_], K, V](c: Cache[F, K, V])(k: K)(implicit arg0: 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.

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

    

    Definition Classes

    AnyRef

22. final def notify(): Unit

    

    Definition Classes

    AnyRef

23. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

24. def purgeExpired[F[_], K, V](c: Cache[F, K, V])(implicit arg0: 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.

25. def setDefaultExpiration[F[_], K, V](cache: Cache[F, K, V], defaultExpiration: Option[TimeSpec]): Cache[F, K, V]

    

    Change the default expiration value of newly added cache items.

    Change the default expiration value of newly added cache items. Shares an underlying reference with the other cache. Use copyCache if you want different caches.

26. def size[F[_], K, V](cache: Cache[F, K, V])(implicit arg0: Sync[F]): F[Int]

    

    Return the size of the cache, including expired items.

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

    

    Definition Classes

    AnyRef

28. def toString(): String

    

    Definition Classes

    AnyRef → Any

29. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )