-
### Description
As an validator, I want flat database healing to be documented to take a very long time and incurring downtime on mainnet so that i can switch beacon-node before starting healing.
…
p4fg updated
4 months ago
-
Will avoid the need to keep copying string between buffers.
-
```
thread 'tasks-pool-0' panicked at 'assertion failed: stored_value.is_some()', /home/user/git-clones/smoldot/src/trie/calculate_root.rs:455:9
```
A bit above Polkadot block 2719744
-
The explanation given is unclear and doesn't give exact ideas and rationale behind doing things.
Examples:
> For any vertex in the trie we will associate the string from the root to the vertex.
…
-
See #2100 and #1848 for work done up to this point and resources on snap sync.
Starting with a new master tracker ticket for continuing work on snap sync. We currently have the ability to perform a…
-
All implementations of `TrieDatabaseRef` raise exceptions but have exception safety issues - in particular, resources will not be released / aborted / committed correctly leading to deadlocks / data l…
-
#### src\flashlight\lib\text
- [x] dictionary.R
- [x] _dictionary.cpp
- [x] `void Dictionary_addEntry_0(Dictionary& dict, const std::string& entry, int idx)`
- [x] `void Dictionary_addEntry_1(…
-
# 学习笔记
## Trie(前缀树、字典树)
### 定义
trie,又称前缀树或字典树,是一种有序树,用于保存关联数组,其中的键通常是字符串。与二叉查找树不同,键不是直接保存在节点中,而是由节点在树中的位置决定。一个节点的所有子孙都有相同的前缀,也就是这个节点对应的字符串,而根节点对应空字符串。一般情况下,不是所有的节点都有对应的值,只有叶子节点和部分内部节点所对应的键才有相关的值。
…
-
The searching for symbols can be improved (faster) with a trie, e.g. from Trienet
-
datrie.pyx specifies a **delitem** magic method, I can call it explicitly to remove an item from the Trie.
I don't understand why there isn't a public (non-double-underscore) function to delete an it…