Compared to a standard HashMap, a tree-based map is useful in situations
where the number of elements in the map is hard to predict. The overhead
of an ebtree is very low compared to a hash map, as the overhead of a hash
map is the whole bucket set array, while for an ebtree is only a little
struct. Additionally, any tree modification is permitted during the
iteration.
The map internally allocates internal nodes which contain elements
using malloc, so they are invisible to the GC.
EBtree based map.
Compared to a standard HashMap, a tree-based map is useful in situations where the number of elements in the map is hard to predict. The overhead of an ebtree is very low compared to a hash map, as the overhead of a hash map is the whole bucket set array, while for an ebtree is only a little struct. Additionally, any tree modification is permitted during the iteration.
The map internally allocates internal nodes which contain elements using malloc, so they are invisible to the GC.