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
-
3
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:42:Factory-Candidates-Check/ghc-unordered-containers && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
ghc-unordered-containers.changes | 0000017181 16.8 KB | |
ghc-unordered-containers.spec | 0000004194 4.1 KB | |
unordered-containers-0.2.20.tar.gz | 0000059823 58.4 KB | |
unordered-containers.cabal | 0000003921 3.83 KB |
Revision 31 (latest revision is 32)
Ana Guerrero (anag+factory)
accepted
request 1139825
from
Factory Maintainer (factory-maintainer)
(revision 31)
Automatic submission by obs-autosubmit
Comments 0