It still bothers me that hash-maps are advertised as O(1) lookups, regardless whether their size is 1 kb, 1 Mb, 1 Gb or 1 Tb. This just isn't true based on seve

It still bothers me that hash-maps are advertised as O(1) lookups, regardless whether their size is 1 kb, 1 Mb, 1 Gb or 1 Tb. This just isn't true based on several benchmarks. So given that this is the case, using immutable data structures with O(log n) performance isn't "any" different than using the mutable ones.