debian/0000755000000000000000000000000012147643101007165 5ustar debian/watch0000644000000000000000000000033212036251214010211 0ustar version=3 opts="downloadurlmangle=s|archive/([\w\d_-]+)/([\d\.]+)/|archive/$1/$2/$1-$2.tar.gz|,\ filenamemangle=s|(.*)/$|PSQueue-$1.tar.gz|" \ http://hackage.haskell.org/packages/archive/PSQueue \ ([\d\.]*\d)/ debian/control0000644000000000000000000000523212147621365010602 0ustar Source: haskell-psqueue Priority: extra Section: haskell Maintainer: Debian Haskell Group Uploaders: Kiwamu Okabe Build-Depends: debhelper (>= 9), haskell-devscripts (>= 0.8.13), cdbs, ghc, ghc-prof Build-Depends-Indep: ghc-doc Standards-Version: 3.9.4 Homepage: http://hackage.haskell.org/package/PSQueue Vcs-Darcs: http://darcs.debian.org/pkg-haskell/haskell-psqueue Vcs-Browser: http://darcs.debian.org/cgi-bin/darcsweb.cgi?r=pkg-haskell/haskell-psqueue DM-Upload-Allowed: yes Package: libghc-psqueue-dev Architecture: any Depends: ${shlibs:Depends}, ${haskell:Depends}, ${misc:Depends} Recommends: ${haskell:Recommends} Suggests: ${haskell:Suggests} Provides: ${haskell:Provides} Description: Priority Search Queue A /priority search queue/ efficiently supports the opperations of both a search tree and a priority queue. A 'Binding' is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time. . This package contains the normal library files. Package: libghc-psqueue-prof Architecture: any Depends: ${haskell:Depends}, ${misc:Depends} Recommends: ${haskell:Recommends} Suggests: ${haskell:Suggests} Provides: ${haskell:Provides} Description: Priority Search Queue; profiling libraries A /priority search queue/ efficiently supports the opperations of both a search tree and a priority queue. A 'Binding' is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time. . This package contains the libraries compiled with profiling enabled. Package: libghc-psqueue-doc Architecture: all Section: doc Depends: ${haskell:Depends}, ${misc:Depends} Recommends: ${haskell:Recommends} Suggests: ${haskell:Suggests} Description: Priority Search Queue; documentation A /priority search queue/ efficiently supports the opperations of both a search tree and a priority queue. A 'Binding' is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time. . This package contains the documentation files. debian/rules0000755000000000000000000000015412036251214010242 0ustar #!/usr/bin/make -f include /usr/share/cdbs/1/rules/debhelper.mk include /usr/share/cdbs/1/class/hlibrary.mk debian/changelog0000644000000000000000000000141612147643101011041 0ustar haskell-psqueue (1.1-4) unstable; urgency=low * Enable compat level 9 -- Joachim Breitner Fri, 24 May 2013 12:51:45 +0200 haskell-psqueue (1.1-3) 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 Sun, 14 Oct 2012 12:01:49 +0200 haskell-psqueue (1.1-2) unstable; urgency=low * Sourceful upload to rebuild documentation package -- Joachim Breitner Mon, 06 Feb 2012 17:58:42 +0100 haskell-psqueue (1.1-1) unstable; urgency=low * Debianization generated by cabal-debian * ITP (Closes: #653453) -- Kiwamu Okabe Thu, 29 Dec 2011 01:17:28 +0900 debian/source/0000755000000000000000000000000012036251214010462 5ustar debian/source/format0000644000000000000000000000001412036251214011670 0ustar 3.0 (quilt) debian/compat0000644000000000000000000000000212147620571010371 0ustar 9 debian/copyright0000644000000000000000000000267612036251214011130 0ustar Copyright (c) 2008, Ralf Hinze 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. * The names of the contributors may not 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.