Consider optimizing map update for the shape-preserving case
未关闭
Map
performance
- 主要语言
- Haskell
- 星标
- 355
- 派生
- 194
- 平均合并
- 3 天 4 小时
- 30 天内合并 PR
- 4
描述
One of the major costs of `update` is rebalancing on the way up. Notably, this has to follow pointers to the _siblings_ of all nodes along the path. We can avoid this in cases where the update neither inserts nor deletes a key by returning a flag saying so. This will obviously hurt a bit in cases where the shape _does_ change, but I conjecture that it won't hurt much.
贡献指南
评估
这个 Issue 还没有评估数据。