Algorithmadvanced
TinyLFU
Also called W-TinyLFU.
Admission policy that uses a compact frequency sketch to admit only frequently used items.
Admission policy that uses a compact frequency sketch to admit only frequently used items.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag F0NQ2Y Edit this page History Report an error