You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In 2021, #317 was made and merged (and included in 0.2.15.0). This changed the branching factor / bitmap mask size from 16 to 32.
This was updated in the module documentation of Data.HashMap.Lazy, but not in the module documentation of Data.HashMap.Strict. There it still states:
Many operations have a average-case complexity of (O(\log n)). The implementation uses a large base (i.e. 16) so in practice these operations are constant time.
The text was updated successfully, but these errors were encountered:
Qqwy
added a commit
to Qqwy/unordered-containers
that referenced
this issue
Sep 27, 2024
In 2021, #317 was made and merged (and included in
0.2.15.0
). This changed the branching factor / bitmap mask size from 16 to 32.This was updated in the module documentation of
Data.HashMap.Lazy
, but not in the module documentation ofData.HashMap.Strict
. There it still states:The text was updated successfully, but these errors were encountered: