-
A few things I thought of in preparing #2042.
- After #2042, there's some duplication in the filtered/unfiltered variants of searching and whatnot. This can be eliminated by pulling the filtered im…
-
Wait so browsers get it wrong, [redacted] gets it wrong…anyone that ships stuff get it right[0]?
[0] https://twitter.com/ryanlanciaux/status/1473449954412838916?t=XZU_sIIaTkh0Sp2ZcevH4Q&s=19
-
At the moment, the implementation of red-black trees in the standard library are not generic and need to be embedded in other structs in order to work as intended.
https://github.com/ziglang/zig/bl…
-
Hi again :)
We're making an [index of awesome system and cross platform Swift libraries](https://github.com/felix91gr/awesome-system-swift) together with Valentin Knabel. We're lacking on the Data …
-
The "broadleaf" tree can contain 2 elements in its leaf nodes. The keys have to be small enough for us to pack both into a single `size_t`. The actual 2nd key and value will occupy the left and right …
-
The counterpart of `recv_buf` in linux kernel is called out-of-order queue, which is often shortened as _ofo queue_. That queue is implemented by a red-black tree so that every time the insertion into…
-
### Suggestion for enhancement: use color to differentiate output from input
Indented input and left-aligned output was a good idea in the time of printing teletypes (https://youtu.be/_DTpQ4Kk2wA) bu…
-
# 字典树Trie
字典树,即Trie树,又称单词查找树或键树,是一种树形结构。典型应用是用于统计和排序大量的字符串(但不仅限于字符串),所以经常被搜索引擎系统用于文本词频统计。**优点是:最大限度地减少无谓的字符串比较,查询效率比哈希表高。**
基本性质:
1. 结点本身不存完整单词;
2. 从根结点到某一结点,路径上经过的字符连接起来,为该结点对应的字符串;
3. 每个结点的所有子结…
-
//加载任意路径的合法插件, ref: https://www.codenong.com/cs106081348
//支持URL方式及源代码方式
var selObj = document.getElementById("selPlugIns");
//读取数据的回调函数
function _CBackComments(o)
{
for(i in o){
va…
-
It would be nice to have an iterator (forward and reverse varieties) starting from a given key. Currently if you want to walk the tree from a given point, its a series of map lookups.