-
正常情况下，淘汰策略都是 LRU 或者 LFU。但是在一些业务场景下，这两种淘汰策略缺乏灵活性。例如在一些场景下，我需要考虑先淘汰了大对象，有些时候我会考虑先淘汰了小对象。
那么这一切就可以抽象为：按照优先级来淘汰，并且是优先淘汰优先级低的对象。
那么对于 LRU 和 LFU 来说，也可以通过将它们伪装成优先级。比如说最近最少使用的优先级就最低。
在这里，因为考虑到控制本地缓存的…
-
The move from Pathfinder database to RPC protocol for querying Starknet data slowed down the replayer.
An optimisation to speed up the replayer is to cache RPC responses due to some data being querie…
-
**Description**
This ticket is to describe the current implementation of data eviction and to propose improvements to the eviction algorithm.
**Change in user-visible behavior**
N/A
**Requires doc…
-
First of all, awesome work! Very promising.
That being said, I may I found a bug in the following situation:
### Step to reproduce
```
var cacheSize int64 = 1000
client, err := the…
-
I have only 1 year of professional experience in programming, so this is maybe stupid one, why not caching tiles in Dictionary, where string would be fileName, and then limit number of entries on, l…
-
This may be something very weird with my storage adapter, but when using source I have my images generated with a formats/webp path but my content directory has no formats directory and no .webp
Th…
-
由于时间有限，先抄一下各位大佬的
**位运算**
1. 算数移位与逻辑移位
左移：">"：0110 => 0011
2.位运算符
“｜”：按位或，0011，1011 => 1011
“ & ”：按位与，0011，1011 => 0011
“ ～ ”：按位取反，0011 => 1100
“ ^ ”：按位异或（相同为零、不同为一）
常用^
- x ^ 0 = x
- x…
-
See https://crates.io/crates/TinyUFO. I think we would see a good perf boost from this
-
### 引言
这个标题已经很明显的告诉我们：前端需要了解 LRU 算法！
这也是前端技能的亮点，当面试官在问到你前端开发中遇到过哪些算法，你也可以把这部分丢过去！
本节按以下步骤切入：
- 由浏览器缓存策略引出 LRU 算法原理
- 然后走进 `vue` 中…
-
In the last 24 hours, we've had over 20 instances of the `dandidav` web dyno exceeding its memory limit of 512MB and getting killed by Heroku as a result. See https://dashboard.heroku.com/apps/dandida…