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:Slowroll:Base:1/ghc-unordered-containers && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
_service | 0000000075 75 Bytes | |
ghc-unordered-containers.changes | 0000000602 602 Bytes | |
ghc-unordered-containers.spec | 0000002282 2.23 KB | |
unordered-containers-0.2.3.0.tar.gz | 0000025362 24.8 KB |
Revision 1 (latest revision is 33)
Stephan Kulow (coolo)
accepted
request 185525
from
Peter Trommler (ptrommler)
(revision 1)
New package for Haskell Platform 2013.2.0.0. See http://lists.opensuse.org/opensuse-factory/2013-07/msg00409.html
Comments 0