p-fast trie: lexically ordered hash map

https://dotat.at/@/2025-08-04-p-fast-trie.html Here's a sketch of an idea that might or might not be a good idea. Dunno if it's similar to something already described in the literature -- if you know of something, please let me know via the links in the footer! The gist is to throw away the tree and interior pointers from a qp-trie. Instead, the p-fast trie is stored using a hash map organized…