hs-PSQueue 1.1_1 devel =0

Priority Search Queue
Maintained by: haskell@FreeBSD.org
Port Added: 13 Aug 2011 18:55:55
Also Listed In: haskell
License: BSD

---

---

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.

WWW: http://hackage.haskell.org/package/PSQueue

CVSWeb : Sources : Main Web Site : Distfiles Availability : PortsMon

---

NOTE: FreshPorts displays only required dependencies information. Optional dependencies are not covered.
Required To Build: lang/ghc, lang/ghc, devel/hs-haddock
Required To Run: lang/ghc, lang/ghc

Required by:
for Build

www/hs-snap-server

for Run

www/hs-snap-server

---

To install the port: cd /usr/ports/devel/hs-PSQueue/ && make install clean
To add the package: pkg_add -r hs-PSQueue

---

Configuration Options

     No options to configure

---

Master Sites:

http://hackage.haskell.org/packages/archive/PSQueue/1.1/

ftp://ftp.FreeBSD.org/pub/FreeBSD/ports/distfiles/cabal/

• 2012-02-13

  Affects: users of lang/ghc and */hs-*

  Author: pgj@FreeBSD.org

  Reason: 
    GHC has been updated to version 7.0.4, and Haskell Platform to version
    2011.4.0.0, and other Haskell ports are also updated to their Haskell
    Platform versions or latest versions.
  
    To update all affected ports:
  
    # portmaster -r lang/ghc
    or
    # portupgrade -r lang/ghc
  
  



• 2011-05-09

  Affects: users of lang/ghc and */hs-*

  Author: ashish@FreeBSD.org

  Reason: 
    GHC has been updated to version 7.0.3 and other Haskell ports are also
    updated to their Haskell Platform versions or latest versions.
  
    To update all affected ports:
  
    # portmaster -r lang/ghc
    or
    # portupgrade -r lang/ghc
  
  

- Chase the GHC update

Obtained from:  FreeBSD Haskell

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.

WWW: http://hackage.haskell.org/package/PSQueue

Obtained from:  FreeBSD Haskell

12 vulnerabilities affecting 17 ports have been reported in the past 14 days

^* - modified, not new

All vulnerabilities