haskell-unordered-containers/unordered-containers

Efficient hashing-based container types

Haskell

224

746 commits

updated Jul 25, 2026

See the code

README

unordered-containers

Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed.

The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared.

For background information and design considerations on this package see the Developer Guide.

For practical advice for contributors see CONTRIBUTING.md.

Contributors

(top 30 of 60)

tibbe

405 commits

sjakobi

133 commits

treeowl

41 commits

bos

24 commits

haskell-unordered-containers/unordered-containers

Efficient hashing-based container types

Haskell

224

746 commits

updated Jul 25, 2026

See the code

README

unordered-containers

Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed.

The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared.

For background information and design considerations on this package see the Developer Guide.

For practical advice for contributors see CONTRIBUTING.md.

Contributors

(top 30 of 60)

tibbe

405 commits

sjakobi

133 commits

treeowl

41 commits

bos

24 commits

Languages

Haskell

100.0%