CVS log for pkgsrc/devel/hs-psqueues/buildlink3.mk

Up to [cvs.NetBSD.org] / pkgsrc / devel / hs-psqueues

Request diff between arbitrary revisions

Keyword substitution: kv
Default branch: MAIN

recursive revbump after patching lang/ghc910

Bump all Haskell packages after switching the default compiler.

devel/hs-psqueues: update to psqueues-0.2.8.1

- 0.2.8.1 (2025-01-28)
    * Fix performance issue in OrdPSQ relating to balancing (#61).
    * Relax hashable upper bound to 1.5
    * Relax QuickCheck upper bound to 2.15
    * Relax tasty-quickcheck upper bound to 0.11

Recursive revbump after changing the default Haskell compiler

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

Revbump all Haskell after updating lang/ghc96

Bump Haskell packages after updating lang/ghc94

revbump all the Haskell packages after modifying the runtime system of lang/ghc94

Bump all Haskell packages after enabling "split sections" in mk/haskell.mk

revbump after changing the default Haskell compiler

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

Bump packages that depends on GHC

Import psqueues-0.2.7.2

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.