Efficient hashing-based container types
https://github.com/tibbe/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.
- Developed at devel:languages:haskell
- Sources inherited from project openSUSE:Factory
-
2
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory:zSystems/ghc-unordered-containers && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
ghc-unordered-containers.changes | 0000003615 3.53 KB | |
ghc-unordered-containers.spec | 0000002596 2.54 KB | |
unordered-containers-0.2.9.0.tar.gz | 0000033098 32.3 KB |
Revision 13 (latest revision is 31)
- Cosmetic: replace tabs with blanks, strip trailing white space, and update copyright headers with spec-cleaner.
Comments 0