Debian Codegraph @

CHANGELOG

raw
1 # CHANGELOG
2
3 - 0.2.8.3 (2025-12-28)
4 * Fix compilation with MicroHS
5
6 - 0.2.8.2 (2025-08-08)
7 * Use Straka's balancing algorithm for OrdPSQ (#64):
8
9 Milan Straka's paper 'Adams’ Trees Revisited' argues that Adams'
10 balancing algorithm previously did not have a correct proof. It
11 provides a proof of a slightly modified balancing algorithm that
12 prefers single rotations in many more cases. The small change
13 specified in that paper fixes the frequent quickcheck failures
14 exposed when the balance test was made more precise.
15
16 * Remove unnecessary dependencies: array, containers, ghc-prim, mtl,
17 unordered-containers
18
19 - 0.2.8.1 (2025-01-28)
20 * Fix performance issue in OrdPSQ relating to balancing (#61).
21 * Relax hashable upper bound to 1.5
22 * Relax QuickCheck upper bound to 2.15
23 * Relax tasty-quickcheck upper bound to 0.11
24
25 - 0.2.8.0 (2022-10-27)
26 * Add a number of minor optimizations and INLINE pragmas:
27 - The previous `INLINABLE` pragmas were insufficient to fully specialize
28 functions. Add a bunch more. I believe they now do the job they were
29 meant to.
30 - Change the way we check for very short queues in `lbalance` and
31 `rbalance` to avoid redundant size comparisons in the non-short
32 case.
33 - Make the fields of `Play` strict. I doubt this makes any practical
34 difference, since `tourView` is `INLINE`, but in fact the fields are
35 always in WHNF, so we might as well make that explicitly clear.
36 * Fix a bug in `fromList`. It previously used the *first* occurrence
37 of a duplicated key; it now uses the *last* occurrence, as documented.
38 * Cleanup: refactor `binShrinkL` and `binShrinkR` into `bin`.
39 * Bump deepseq upper bound to 1.6
40 * Bump tasty upper bound to 1.6
41
42 - 0.2.7.3 (2021-11-05)
43 * Relax hashable, tasty and QuickCheck upper bounds
44 * Bump Cabal-version to 1.10
45
46 - 0.2.7.2 (2019-06-07)
47 * Relax hashable upper bound to 1.3
48 * Relax QuickCheck upper bound to 2.13
49 * Switch from test-framework to tasty
50
51 - 0.2.7.1 (2019-01-07)
52 * Relax QuickCheck upper bound to 2.12
53
54 - 0.2.7.0 (2018-04-30)
55 * Export unsafe operations
56
57 - 0.2.6.0 (2018-03-14)
58 * Fix issue with (<>) on 8.4
59 * Bump QuickCheck dependency to 2.11
60
61 - 0.2.5.0 (2018-01-18)
62 * Fix build on GHC 8.4
63
64 - 0.2.4.0 (2017-09-27)
65 * Add `unsafeMapMonotonic`
66 * Lower build depends version for hashable
67 * Move repo to `jaspervdj/psqueues` to enable travis
68 * Lower build depends version for hashable
69
70 - 0.2.3.0
71 * Add an `atMostView` function to all PSQ flavours
72 * Bump HUnit dependency to 1.6
73 * Bump QuickCheck dependency to 2.10
74 * Clean up warnings on newer and older GHC versions
75
76 - 0.2.2.3
77 * Bump HUnit dependency to 1.5
78
79 - 0.2.2.2
80 * Bump QuickCheck dependency bounds
81
82 - 0.2.2.1
83 * Fix benchmark compilation with stack
84
85 - 0.2.2.0
86 * Fix import of Traversable on GHC 7.8
87
88 - 0.2.1.0
89 * Add Traversable instances
90
91 - 0.2.0.3
92 * Bump HUnit dependency bounds
93
94 - 0.2.0.2
95 * Bump QuickCheck dependency bounds
96
97 - 0.2.0.1
98 * Minor documentation fixes
99
100 - 0.2.0.0
101 * Add convenience `deleteMin` function
102 * Bump `deepseq` dependency to 1.4
103
104 - 0.1.1.0
105 * Remove constraints from `size`
106
107 - 0.1.0.1
108 * Extend cabal description, include CHANGELOG
109
110 - 0.1.0.0
111 * First release: <https://medium.com/@bttr/announcing-psqueues-8a0fe9fe939>