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.1
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:42.1:Update/ghc-unordered-containers && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| _service | 0000000075 75 Bytes | |
| ghc-unordered-containers.changes | 0000001295 1.26 KB | |
| ghc-unordered-containers.spec | 0000002432 2.38 KB | |
| unordered-containers-0.2.5.1.tar.gz | 0000026093 25.5 KB |
Latest Revision
Stephan Kulow (coolo)
accepted
request 333124
from
Ondřej Súkup (mimi_vx)
(revision 1)
Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed.
Comments 0