|File Search||Catalog||Content Search|
It contains 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.
haskell-unordered-containers (0.2.1.0-1) unstable; urgency=low * New upstream version. * Bump to Standards-Version 3.9.3. -- Clint Adams <email@example.com> Thu, 17 May 2012 10:42:34 -0400 haskell-unordered-containers (0.1.4.6-3) unstable; urgency=low * Rebuild against hashable 188.8.131.52. -- Joey Hess <firstname.lastname@example.org> Mon, 27 Feb 2012 19:13:50 -0400 haskell-unordered-containers (0.1 more»
This package was debianized by Clint Adams <email@example.com> on Sat, 25 Jun 2011 22:47:42 -0000 It was downloaded from http://hackage.haskell.org/package/unordered-containers Upstream Authors: Johan Tibell <firstname.lastname@example.org> Copyright: 2010-2011 Johan Tibell 2011 Bryan O'Sullivan 2002 Daan Leijen License: Redistribution and use in source and binary forms, with or wit more»