4 ms·
That is true but you lose some of the most important properties of crit-bit trees, ordered operations. If the data structure is unordered, I don't see any reas
by ot 15y ago
That is true but you lose some of the most important properties of crit-bit trees, ordered operations.
If the data structure is unordered, I don't see any reason why it should be better than a normal hash table.
- fmap 15y agoThe data structure is not better than a normal hash table. It is a different trade-off. For instance, you don't have to do a rehashing step, which is important for real time applications. Memory usage is also very deterministic at 2*(n-1) words in an n element table (with 2 words per node). If none of this matters to you and you merely want a map with fast lookups then a simple hash table is probably a better choice.