Filewatcher File Search File Search
Content Search
» » » » »


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 version:1.1-2+b1


haskell-psqueue (1.1-2+b1) sid; urgency=low

  * Binary-only non-maintainer upload for s390x; no source changes.
  * Rebuild against ghc 7.4.1-2

 -- s390/s390x Build Daemon (zemlinsky) <>  Sun, 11 Mar 2012 19:11:19 +0000

haskell-psqueue (1.1-2) unstable; urgency=low

  * Sourceful upload to rebuild documentation package

 -- Joachim Breitner <nomeata@debia


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 copy

Browse inside libghc-psqueue-dev_1.1-2+b1_s390x.deb

         [DIR]DEBIAN/ (2)  65535+ mirrors
         [DIR]usr/ (2)  65535+ mirrors
         [DIR]var/ (1)  41013+ mirrors

Download libghc-psqueue-dev_1.1-2+b1_s390x.deb

Results 1 - 1 of 1
Help - FTP Sites List - Software Dir.
Search over 15 billion files
© 1997-2017