hash_trie
hash_trie copied to clipboard
A persistent hash array-mapped trie for C++
in clang, I get warnings on two lines: union { ; T m_values[1]; }; For unnecessary `;` and return sizeof(leaf_node) + sizeof(T*[size-1]); for using VLAs, which aren't a part of...
when storing a simple struct struct Val { public: uint64_t key; }; And inserting 10000000 items I see 64 bytes overhead, each entry take 72 bytes on average. Is this...
Hello, from the benchmark code I figured out that this seems to be the way to check if set contains an element: ``` bool res = set.find(i + 1).leaf(); ```...
We have: ``` template struct hash_trie_data { branch_node const* m_root; size_t m_size; }; ``` Then in the copy constructor, we copy as follows: ``` explicit hash_trie( hash_trie_data const& data )...