anchor.diff:  === Cache Miss
   When a data entry is requested from cache and the entry does not exist for the given key, it is referred to as a cache
   miss (or simply, a _miss_).
  +
  +=== Cache Access
  +Any time a data entry is requested from cache, the cache is _accessed_ no matter if the outcome was a _hit_ or a _miss_.
  +
  +=== Hit Ratio
  +It is the ratio of cache hits over cache accesses, or _hits_ / _accesses_. For instance, a cache accessed 100 times
  +that hit 90 times has a hit ratio of: _90_ / _100_ or _0.9_ or _90%_.
  +
  +=== Miss Ratio
  +It is the ratio of cache misses over cache accesses, or _misses_ / _accesses_. For instance, a cache accessed 100 times
  +that missed 30 times has a miss ratio of: _30_ / _100_ or _0.3_ or _30%_. It is the corollary of _hit ratio_ as
  +_hit ratio_ + _miss ratio_ is always _1.0_ or _100%_.
   
   === System-of-Record (SoR)
   The authoritative source of truth for the data. The cache acts as a local copy of data retrieved from or stored to the
  
positive.code: The removal of entries from the cache after some amount of time has passed, typically as a strategy to avoid stale
  data in the cache.
  
  === Hot Data
  Data that has recently been used by an application is very likely to be accessed again soon.  Such data is considered
  _hot_.  A cache may attempt to keep the _hottest_ data most quickly available, while attemping to choose the
  _least hot_ data for eviction.
  
negative.code: resources.
  
  === Cache Entry
  A cache entry consists of a key and its mapped data value within the cache. This is also sometimes referred to as a
  _cache mapping_.
  
  === Cache Hit
  When a data entry is requested from cache and the entry exists for the given key, it is referred to as a cache hit
  