debian/0000755000000000000000000000000012232601377007171 5ustar debian/watch0000644000000000000000000000034012036250134010210 0ustar version=3 opts="downloadurlmangle=s|archive/([\w\d_-]+)/([\d\.]+)/|archive/$1/$2/$1-$2.tar.gz|,\ filenamemangle=s|(.*)/$|hashtables-$1.tar.gz|" \ http://hackage.haskell.org/packages/archive/hashtables \ ([\d\.]*\d)/ debian/rules0000755000000000000000000000015512036250134010243 0ustar #!/usr/bin/make -f include /usr/share/cdbs/1/rules/debhelper.mk include /usr/share/cdbs/1/class/hlibrary.mk debian/copyright0000644000000000000000000000364312036250134011123 0ustar This work was packaged for Debian by: Iain Lane on Wed Nov 23 10:19:38 GMT 2011 It was downloaded from http://hackage.haskell.org/package/hashtables Upstream Author: Gregory Collins Copyright: Copyright (c) 2011, Google, Inc. License: All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. * Neither the name of Google, Inc. nor the names of other contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. The Debian packaging is: Copyright (c) Iain Lane and is licensed under the BSD license, as above. debian/source/0000755000000000000000000000000012036250134010462 5ustar debian/source/format0000644000000000000000000000001412036250134011670 0ustar 3.0 (quilt) debian/compat0000644000000000000000000000000212147620641010367 0ustar 9 debian/control0000644000000000000000000001077412147626617010616 0ustar Source: haskell-hashtables Section: haskell Priority: extra Maintainer: Debian Haskell Group Uploaders: Iain Lane Build-Depends: cdbs, debhelper (>= 9), ghc, ghc-doc, ghc-prof, haskell-devscripts (>= 0.8.15), libghc-hashable-dev (>= 1.1), libghc-hashable-dev (<< 2), libghc-hashable-prof, libghc-hashable-doc, libghc-primitive-dev (>= 0.4), libghc-primitive-dev (<< 0.6), libghc-primitive-prof, libghc-primitive-doc, libghc-vector-dev (>= 0.7), libghc-vector-dev (<< 0.11), libghc-vector-prof, libghc-vector-doc Standards-Version: 3.9.4 Homepage: http://hackage.haskell.org/package/hashtables Package: libghc-hashtables-dev Architecture: any Depends: ${haskell:Depends}, ${misc:Depends}, ${shlibs:Depends} Recommends: ${haskell:Recommends} Suggests: ${haskell:Suggests} Provides: ${haskell:Provides} Description: mutable hash tables${haskell:ShortBlurb} This package provides a couple of different implementations of mutable hash tables in the ST monad, as well as a typeclass abstracting their common operations, and a set of wrappers to use the hash tables in the IO monad. . 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. . ${haskell:Blurb} Package: libghc-hashtables-prof Architecture: any Depends: ${haskell:Depends}, ${misc:Depends}, ${shlibs:Depends} Recommends: ${haskell:Recommends} Suggests: ${haskell:Suggests} Provides: ${haskell:Provides} Description: mutable hash tables -- profiling libraries${haskell:ShortBlurb} This package provides a couple of different implementations of mutable hash tables in the ST monad, as well as a typeclass abstracting their common operations, and a set of wrappers to use the hash tables in the IO monad. . 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. . ${haskell:Blurb} Package: libghc-hashtables-doc Section: doc Architecture: all Depends: ${haskell:Depends}, ${misc:Depends}, ${shlibs:Depends} Recommends: ${haskell:Recommends} Suggests: ${haskell:Suggests} Provides: ${haskell:Provides} Description: mutable hash tables -- documentation${haskell:ShortBlurb} This package provides a couple of different implementations of mutable hash tables in the ST monad, as well as a typeclass abstracting their common operations, and a set of wrappers to use the hash tables in the IO monad. . 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. . ${haskell:Blurb} debian/changelog0000644000000000000000000000265412232601377011052 0ustar haskell-hashtables (1.0.1.8-2build2) trusty; urgency=low * Rebuild for new GHC ABIs. -- Colin Watson Sat, 26 Oct 2013 00:47:11 +0100 haskell-hashtables (1.0.1.8-2build1) saucy; urgency=low * Rebuild for new GHC ABIs. -- Colin Watson Thu, 30 May 2013 10:36:57 +0100 haskell-hashtables (1.0.1.8-2) unstable; urgency=low * Enable compat level 9 * Use substvars for Haskell description blurbs -- Joachim Breitner Fri, 24 May 2013 12:50:49 +0200 haskell-hashtables (1.0.1.8-1) experimental; urgency=low * New upstream release -- Joachim Breitner Thu, 13 Dec 2012 09:16:08 +0100 haskell-hashtables (1.0.1.4-2) experimental; urgency=low * Depend on haskell-devscripts 0.8.13 to ensure this packages is built against experimental * Bump standards version, no change -- Joachim Breitner Thu, 18 Oct 2012 10:25:30 +0200 haskell-hashtables (1.0.1.4-1) unstable; urgency=low * New upstream release (Closes: #669227) -- Joachim Breitner Fri, 20 Apr 2012 15:28:39 +0200 haskell-hashtables (1.0.0.0-2) unstable; urgency=low * Sourceful upload to rebuild documentation package -- Iain Lane Thu, 23 Feb 2012 11:13:59 +0000 haskell-hashtables (1.0.0.0-1) unstable; urgency=low * Initial release. -- Iain Lane Wed, 23 Nov 2011 10:24:22 +0000