-
## Description
HackerRank recently introduced a module called [**Cracking the Coding Interview**](https://www.hackerrank.com/domains/tutorials/cracking-the-coding-interview/status/all/page/1). For th…
-
## Synopsis
TODO
See :+1: and ⏬
## Prior discussions
Mentioned at https://github.com/rclone/rclone/pull/5587#issuecomment-917416354 and...
### https://github.com/cjnaz/rclonesync-V2/issu…
-
Currently one can serialize mnemonist data-structures with `.toJSON` but there does not appear to be a standard way to deserialize. I'd like to be able to cache mnemonist structures in the browser or …
-
The idea:
The most natural thing for the prefix implementation is `Vec`. The Trie is currently implemented through serialization of the key value into `Vec`.
Could be great if `Vec` was usable as 'pla…
-
See #64, #67, #68, and #70 for background. Basically when a TLS terminator is doing TLS for a lot of different hostnames, it will have a lot of certificates to manage. In #64 @Geal mentioned that he h…
-
Below is a list of OCaml 5 lockfree data structures done by some awesome hackers. These were done either out of curiosity, or due to the needing them for applications. In any case, it would be nice to…
-
So far I've got a prototype with a number of limitations:
- It only syncs against a trie which is standing still, it doesn't do any patch-up or pivoting
- It only syncs the account trie, it doesn't …
lithp updated
5 years ago
-
-
Here's one implementation: http://linux.thai.net/~thep/datrie/
For liblevenshtein, implement the algorithm described in, "Compression of double array structures for fixed length keywords", by Masao F…
dylon updated
8 years ago
-
This issue is a "pre-RFC". Writing a complete RFC would be time consuming (especially because it requires some technical knowledge about BEEFY that I'm currently lacking), so I would like to gather so…