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:42.3
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:42.3:Update/ghc-unordered-containers && cd $_
- Create Badge
Refresh
Refresh
Source Files
Filename | Size | Changed |
---|---|---|
ghc-unordered-containers.changes | 0000002380 2.32 KB | |
ghc-unordered-containers.spec | 0000002689 2.63 KB | |
unordered-containers-0.2.7.2.tar.gz | 0000030847 30.1 KB |
Revision 6 (latest revision is 7)
Ludwig Nussel (lnussel_factory)
accepted
request 484617
from
Ondřej Súkup (mimi_vx)
(revision 6)
- Update to version 0.2.7.2 with cabal2obs. - Update to version 0.2.7.1 revision 0 with cabal2obs.
Comments 0