How did this compare against Hash Array Mapped Tries? It looks like the amount of nodes that you'd need to change would be smaller, and updates are less dramati

How did this compare against Hash Array Mapped Tries? It looks like the amount of nodes that you'd need to change would be smaller, and updates are less dramatic. (They're common in functional programming for persistent data structures, and you get almost as good performance as a hash table with a really wide trie)