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:Leap:15.2
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:15.2:Update/ghc-unordered-containers && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
ghc-unordered-containers.changes | 0000004495 4.39 KB | |
ghc-unordered-containers.spec | 0000002652 2.59 KB | |
unordered-containers-0.2.10.0.tar.gz | 0000044733 43.7 KB | |
unordered-containers.cabal | 0000005199 5.08 KB |
Latest Revision
Yuchen Lin (maxlin_factory)
accepted
request 771516
from
Ondřej Súkup (mimi_vx)
(revision 14)
Update leap haskell stack
Comments 0