-
## [460. LFU Cache](https://leetcode.com/problems/lfu-cache/)
设计并实现`最不经常使用（LFU）`缓存的数据结构。它应该支持以下操作：`get` 和 `put`。
`get(key)` - 如果键存在于缓存中，则获取键的值（总是正数），否则返回 -1。
`put(key, value)`- 如果键不存在，请设置或插入值。当…
-
[缓存算法（FIFO 、LRU、LFU三种算法的区别）](https://www.cnblogs.com/hongdada/p/10406902.html)
-
Problem name: LFU Cache
Difficulty: Hard
Language: Python
-
The documentation page https://redis.io/topics/lru-cache states that LFU uses the Morris Counter, but it seemed to not be the case when I tried looking at the source code (line 315 of https://github.c…
-
支持 LRU 和 LFU 逐出策略
-
https://duckdb.org/2022/05/27/iejoin.html
https://interjectedfuture.com/lab-notes/lab-note-034-incremental-insertion-into-prolly-trees/
https://www.figma.com/blog/how-figmas-databases-team-lived…
-
## Bug Report
Please answer these questions before submitting your issue. Thanks!
### 1. Minimal reproduce step (Required)
1. `make ut`
### 2. What did you expect to see? (Required)
succe…
-
# 揭开LRU、LFU面纱
[https://blog.zgx.io/2022/05/29/jie-kai-lru-lfumian-sha/](https://blog.zgx.io/2022/05/29/jie-kai-lru-lfumian-sha/)
-
Hi, I found that `lfu.set` starts throwing the following error when running some tests agains it. I'm using it like: `const lfu = require('lfu-cache')(20, 60000);`
Let me know if there are other de…
-
**Is your feature request related to a problem? Please describe.**
We ingest and search on petabytes of data reaching as far back as 90 days old. We maintain multiple terabytes of cache for quickwi…