./devel/hs-psqueues, Pure priority search queues

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: CURRENT, Version: 0.2.8.0nb1, Package name: hs-psqueues-0.2.8.0nb1, Maintainer: pho

The psqueues package provides Priority Search Queues in three
different flavors.

* OrdPSQ k p v, which uses the Ord k instance to provide fast
insertion, deletion and lookup. This implementation is based on Ralf
Hinze's A Simple Implementation Technique for Priority Search
Queues. Hence, it is similar to the PSQueue library, although it is
considerably faster and provides a slightly different API.

* IntPSQ p v is a far more efficient implementation. It fixes the key
type to Int and uses a radix tree (like IntMap) with an additional
min-heap property.

* HashPSQ k p v is a fairly straightforward extension of IntPSQ: it
simply uses the keys' hashes as indices in the IntPSQ. If there are
any hash collisions, it uses an OrdPSQ to resolve those. The
performance of this implementation is comparable to that of IntPSQ,
but it is more widely applicable since the keys are not restricted
to Int, but rather to any Hashable datatype.

Each of the three implementations provides the same API, so they can
be used interchangeably. The benchmarks show how they perform relative
to one another, and also compared to the other Priority Search Queue
implementations on Hackage: PSQueue and fingertree-psqueue.

Master sites:

Filesize: 26.903 KB

Version history: (Expand)

CVS history: (Expand)


   2024-05-09 03:32:57 by Masatake Daimon | Files touched by this commit (1137) 
Log message:
Recursive revbump after changing the default Haskell compiler
   2024-04-29 07:01:12 by Masatake Daimon | Files touched by this commit (4) 
Log message:
devel/hs-psqueues: Update to 0.2.8.0

- 0.2.8.0 (2022-10-27)
    * Add a number of minor optimizations and INLINE pragmas:
        - The previous `INLINABLE` pragmas were insufficient to fully specialize
          functions. Add a bunch more. I believe they now do the job they were
          meant to.
        - Change the way we check for very short queues in `lbalance` and
          `rbalance` to avoid redundant size comparisons in the non-short
          case.
        - Make the fields of `Play` strict. I doubt this makes any practical
          difference, since `tourView` is `INLINE`, but in fact the fields are
          always in WHNF, so we might as well make that explicitly clear.
    * Fix a bug in `fromList`. It previously used the *first* occurrence
      of a duplicated key; it now uses the *last* occurrence, as documented.
    * Cleanup: refactor `binShrinkL` and `binShrinkR` into `bin`.
    * Bump deepseq upper bound to 1.6
    * Bump tasty upper bound to 1.6
   2023-11-02 07:37:49 by Masatake Daimon | Files touched by this commit (1141) 
Log message:
Revbump all Haskell after updating lang/ghc96
   2023-10-27 14:48:42 by Masatake Daimon | Files touched by this commit (1) 
Log message:
devel/hs-psqueues: Fix build with GHC 9.6
   2023-10-09 06:55:01 by Masatake Daimon | Files touched by this commit (988) 
Log message:
Bump Haskell packages after updating lang/ghc94
   2022-02-26 04:58:36 by Masatake Daimon | Files touched by this commit (872) 
Log message:
Bump all Haskell packages after enabling "split sections" in mk/haskell.mk
   2022-02-12 09:51:00 by Masatake Daimon | Files touched by this commit (575) 
Log message:
revbump after changing the default Haskell compiler
   2022-02-11 14:19:59 by Masatake Daimon | Files touched by this commit (3) 
Log message:
Update to psqueues-0.2.7.3

- 0.2.7.3 (2021-11-05)
    * Relax hashable, tasty and QuickCheck upper bounds
    * Bump Cabal-version to 1.10