|File Search||Catalog||Content Search|
There are three hash table implementations:
* Data.HashTable.ST.Basic contains a basic open-addressing hash table using linear probing as the collision strategy. This should currently be the fastest available hash table implementation for lookups, although it has a higher memory overhead than others. * Data.HashTable.ST.Cuckoo contains an implementation of "cuckoo hashing". Cuckoo hashing has worst-case O(1) lookups and performs well even when the table is highly loaded. * Data.HashTable.ST.Linear contains a linear hash table, which trades some insert and lookup performance for higher space efficiency and much shorter delays when expanding the table.
This package provides a library for the Haskell programming language, compiled for profiling. See http://www.haskell.org/ for more information on Haskell.
haskell-hashtables (188.8.131.52-1+b1) sid; urgency=low * Binary-only non-maintainer upload for armel; no source changes. * Dependency libghc-text-dev-0.11.1.13-66a2f not available any more -- armel Build Daemon (alwyn) <firstname.lastname@example.org> Sat, 26 May 2012 21:34:36 +0000 haskell-hashtables (184.108.40.206-1) unstable; urgency=low * New upstream release (Closes: #669227) -- Joa more»
This work was packaged for Debian by: Iain Lane <email@example.com> on Wed Nov 23 10:19:38 GMT 2011 It was downloaded from http://hackage.haskell.org/package/hashtables Upstream Author: Gregory Collins <firstname.lastname@example.org> Copyright: Copyright (c) 2011, Google, Inc. License: All rights reserved. Redistribution and use in source and binary forms, with or without modifi more»