In the above example, it will create a subtree for the first letter
of each key, putting the value underneath it. So we'd get a sub
MassiveSet for every key starting with 't' and every one starting with 'b'.
If maxDepth was 2, we'd get the same two top-level nodes, but then
another sub-node based on the second character of the value.
It's not a very smart data-structure since it does no self-balancing
or tuning.
MassiveSet supports semantics similar to Set, but without the limitation on how much data is stored.
It only supports strings, and stores data in a hierarchy.
In the above example, it will create a subtree for the first letter of each key, putting the value underneath it. So we'd get a sub MassiveSet for every key starting with 't' and every one starting with 'b'.
If
maxDepthwas 2, we'd get the same two top-level nodes, but then another sub-node based on the second character of the value.It's not a very smart data-structure since it does no self-balancing or tuning.