hat-trie
hat-trie copied to clipboard
Tessil
C++ implementation of a fast and memory efficient HAT-trie
cmake .. -- The C compiler identification is GNU 9.3.0 -- The CXX compiler identification is GNU 9.3.0 -- Check for working C compiler: /usr/bin/cc -- Check for working C...
possible to implement a lru cache example using this hat trie?
when creating a `tsl::htrie_map` and trying to insert or emplace an element i'm getting the following error: ``` array_hash.h:870:14: error: non-const lvalue reference to type 'bool' cannot bind to a...
Hi, currently all `insert()` / `emplace()` functions take` const CharT* key, size_type key_size` parameters. I have a use-case to allow inserting via iterators instead (I need to insert a `std::string...
It would be quite useful if it was possible not just get an iterator to the longest prefix, but also a path leading to that prefix from the shortest prefix....
Hello, I just found your implementation of a HAT-tree map and already love it. I use strings as keys and structs as values, and it is faster than a `std::map`...
This is more a question, than a real issue. I am wondering, what is the most efficient way to intersect the keys of two or more hat-tries. My naive approach...
Hi, I admit, i haven't tried it. But looking at the code it seems to be doing case-sensitive searching. Imagine i put a bunch of files paths in the trie...
Hi, Imagine the case of inserting a whole filesystem structure in the hat-trie. You have folders with a bunch of files, more folders and more files. At the moment in...
When the burst-threshold is set to smaller than 65536, the hat-trie behaves normally, and memory usage is 32%. However, when set to 65536 or larger, it causes my process to...
