🐢 First-In-First-Out (FIFO) Cache

🐝 Random Replacement (RR) Cache

Yet another cache implementations. But why? Yeah, there are a few reasons for that.

Major reasons:

1. Research.
2. Education.
3. Fun.

Minor reasons:

1. To produce ready-to-use library well enough to just copy-paste into real project.

There are also several let's say acceptance criteria and non-functional requirements which I follow here:

1. Simplicity in implementation means better maintainability.

If in general it's usually true, this is very subjective if applied to implementations in this repository. Despite the fact that I try to maintain the lowest complexity level as it's possible and reasonable (without damage to performance in the first place), some specific decisions could probably be simplified.

2. Simplicity in interface means better learnability (see "ISO/IEC 9126 Software engineering — Product quality").

3. Zero dependencies to achieve better predictability, safety, reduces overall application size and CI/CD duration.

When the cache becomes full, a cache block or record/entry must be evicted to make room for a new block. The replacement policy determines which block to evict.

Various cache implementations can have slightly different public APIs, however most of them are very consistent in their core capabilities. In the list below there are typical extra features which can be found in known cache realisations (as part of their public API):