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
-
2
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory/ghc-unordered-containers && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
ghc-unordered-containers.changes | 0000015163 14.8 KB | |
ghc-unordered-containers.spec | 0000004196 4.1 KB | |
unordered-containers-0.2.19.1.tar.gz | 0000058030 56.7 KB | |
unordered-containers.cabal | 0000003698 3.61 KB |
Revision 30 (latest revision is 33)
Ana Guerrero (anag+factory)
accepted
request 1118492
from
Peter Simons (psimons)
(revision 30)
version update
Comments 0