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.
- Developed at devel:languages:haskell
- Sources inherited from project openSUSE:Factory
-
2
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory:zSystems/ghc-unordered-containers && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| ghc-unordered-containers.changes | 0000002045 2 KB | |
| ghc-unordered-containers.spec | 0000002432 2.38 KB | |
| unordered-containers-0.2.7.1.tar.gz | 0000029507 28.8 KB |
Revision 7 (latest revision is 32)
Dominique Leuenberger (dimstar_suse)
accepted
request 401655
from
Ondřej Súkup (mimi_vx)
(revision 7)
- update to 0.2.7.1 - remove useless _service * Fix linker error related to popcnt. - update to 0.2.7.0 * support criterion-1.1 * Add unionWithKey for hash maps. - update to 0.2.6.0 * Mark several modules as Trustworthy. * Add Hashable instances for HashMap and HashSet. * Add mapMaybe, mapMaybeWithKey, update, alter, and intersectionWithKey. * Add roles. * Add Hashable and Semigroup instances. * Haskell Platform 2014.2.0.0 - regenerate spec file - more transparent packaging (fewer macros) * expand macro in name tag (forwarded request 401654 from mimi_vx)
Comments 0