20/08/25 18:47:32.02 NgJQjBWI.net
>>436 ドキュメントにそれっぽいことが書いてあるけど
URLﾘﾝｸ(hackage.haskell.org)
> The implementation of Map is based on size balanced binary trees (or trees of bounded balance) as described by:
> If you don't care about ordering, consider use Data.HashMap.Strict from the unordered-containers package instead.