This module provides APIs for in-memory caching by using a semi-persistent mapping from keys to values. Cache entries are added to the cache manually and are stored in the cache until either evicted or invalidated manually.
This is based on the Least Recently Used (LRU) eviction algorithm by using a
map data structure and defining the most basic operations on a collection of cache entries, which entails basic reading, writing, and deleting individual cache items.
It does not allow the
() as a key or value of the cache and entries can be accessed safely by multiple concurrent threads as it is thread-safe.
The cache can be defined with optional configurations as follows:
The Cache entries will be evicted in case of the following scenarios:
- When using the
getAPI, if the returning cache entry has expired, it gets removed.
- When using the
putAPI, if the cache size has reached its capacity, the number of entries that get removed will be based on the
eviction policyand the
cleanupInterval(optional property) is configured, the recurrence task will remove the expired cache entries based on the configured interval. The main benefit of this property is that you can optimize the memory usage while adding some additional CPU costs and vice versa. The default behaviour is the CPU-optimized method.
cache:AbstractCache object has the common APIs for the caching functionalities. Custom implementations of the cache can be done with different data storages like file, database, etc., with the structural equivalency to the
The Ballerina Cache package provides the
cache:Cache class, which is a
map data structure based implementation of the