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.
- Sources inherited from project openSUSE:13.1
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:13.1:Update/ghc-unordered-containers && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
_service | 0000000075 75 Bytes | about 10 years |
ghc-unordered-containers.changes | 0000000602 602 Bytes | almost 10 years |
ghc-unordered-containers.spec | 0000002282 2.23 KB | almost 10 years |
unordered-containers-0.2.3.0.tar.gz | 0000025362 24.8 KB | about 10 years |
Comments 0