https://github.com/haskell-unordered-containers/unordered-containers

Efficient hashing-based container types
https://github.com/haskell-unordered-containers/unordered-containers

Last synced: 3 months ago
JSON representation

Efficient hashing-based container types

• Host: GitHub
• URL: https://github.com/haskell-unordered-containers/unordered-containers
• Owner: haskell-unordered-containers
• License: bsd-3-clause
• Created: 2011-01-17T19:52:29.000Z (about 14 years ago)
• Default Branch: master
• Last Pushed: 2024-05-13T06:54:14.000Z (9 months ago)
• Last Synced: 2024-08-17T21:48:53.987Z (6 months ago)
• Language: Haskell
• Homepage:
• Size: 2.14 MB
• Stars: 221
• Watchers: 12
• Forks: 97
• Open Issues: 117
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGES.md
  • Contributing: CONTRIBUTING.md
  • License: LICENSE

Awesome Lists containing this project

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](docs/developer-guide.md).

For practical advice for contributors see [`CONTRIBUTING.md`](CONTRIBUTING.md).