FifoEvictionPolicy class Null safety
Using this algorithm the cache behaves in the same way as a FIFO queue. The cache evicts the sampled entries in the order they were added, without any regard to how often or how many times they were accessed before. This algorithm uses CacheStat.creationTime to keep track of when a entry was created.
Invocation invocation) → dynamic
Invoked when a non-existent method or property is accessed. [...]
Iterable< CacheStat?>entries, CacheStat justAdded) → CacheStat?
Finds the best eviction candidate based on the sampled entries. What
distinguishes this approach from the classic data structures approach is
that an CacheStat contains metadata (e.g. usage statistics) which can be used
for making policy decisions, while generic data structures do not. It is
expected that implementations will take advantage of that metadata. [...]
) → String
A string representation of this object. [...]