You are wrong. Erlang uses HAMT for large maps. Smaller maps (up to 32 elements) have logarithmic complexity, but that mean at most 5 comparisons, so we can say that these have also constant access time. More about HAMT
This conflicts with other information that I could find, such as the SO answer above. Can you clarify this?
I guess the ordered list can be searched through with a binary search, leading to logarithmic lookup time, but everywhere else I’ve seen the HAMT mentioned to also have logarithmic lookup.
The functions in this module that need to find a specific key work in logarithmic time. This means that the time it takes to find keys grows as the map grows, but it’s not directly proportional to the map size. In comparison to finding an element in a list, it performs better because lists have a linear time complexity.
Totally ignoring the real implementation now, just to make sure, tries do not have a time complexity for searching that would depend on the number of entries, but instead they depend on the length of the key they are trying to access.