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.
- Links to devel:lan...:haskell / ghc-unord...ntainers
- Has a link diff
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout home:frispete:haskell/ghc-unordered-containers && cd $_
- Create Badge
Refresh
Refresh
Source Files (show merged sources derived from linked package)
Filename | Size | Changed |
---|---|---|
_link | 0000000474 474 Bytes |
Comments 0