fingertree 0.1.6.1 → 0.1.6.2
raw patch · 5 files changed
+10/−7 lines, 5 filesPVP ok
version bump matches the API change (PVP)
API changes (from Hackage documentation)
Files
- Data/FingerTree.hs +1/−1
- Data/IntervalMap/FingerTree.hs +1/−1
- Data/PriorityQueue/FingerTree.hs +1/−1
- changelog +3/−0
- fingertree.cabal +4/−4
Data/FingerTree.hs view
@@ -33,7 +33,7 @@ -- * Ralf Hinze and Ross Paterson, -- \"Finger trees: a simple general-purpose data structure\", -- /Journal of Functional Programming/ 16:2 (2006) pp 197-217.--- <http://staff.city.ac.uk/~ross/papers/FingerTree.html>+-- <https://staff.city.ac.uk/~ross/papers/FingerTree.html> -- -- For a directly usable sequence type, see @Data.Sequence@, which is -- a specialization of this structure.
Data/IntervalMap/FingerTree.hs view
@@ -27,7 +27,7 @@ -- * Ralf Hinze and Ross Paterson, -- \"Finger trees: a simple general-purpose data structure\", -- /Journal of Functional Programming/ 16:2 (2006) pp 197-217.--- <http://staff.city.ac.uk/~ross/papers/FingerTree.html>+-- <https://staff.city.ac.uk/~ross/papers/FingerTree.html> -- -- An amortized running time is given for each operation, with /n/ -- referring to the size of the priority queue. These bounds hold even
Data/PriorityQueue/FingerTree.hs view
@@ -27,7 +27,7 @@ -- * Ralf Hinze and Ross Paterson, -- \"Finger trees: a simple general-purpose data structure\", -- /Journal of Functional Programming/ 16:2 (2006) pp 197-217.--- <http://staff.city.ac.uk/~ross/papers/FingerTree.html>+-- <https://staff.city.ac.uk/~ross/papers/FingerTree.html> -- -- These have the same big-O complexity as skew heap implementations, -- but are approximately an order of magnitude slower.
changelog view
@@ -1,5 +1,8 @@ -*-change-log-*- +0.1.6.2 Ross Paterson <R.Paterson@city.ac.uk> Jul 2025+ * Change http links in docs to https+ 0.1.6.1 Ross Paterson <R.Paterson@city.ac.uk> May 2025 * Added NFData instances
fingertree.cabal view
@@ -1,11 +1,11 @@ Name: fingertree-Version: 0.1.6.1+Version: 0.1.6.2 Cabal-Version: 1.18 Copyright: (c) 2006 Ross Paterson, Ralf Hinze License: BSD3 License-File: LICENSE Maintainer: Ross Paterson <R.Paterson@city.ac.uk>-bug-reports: http://hub.darcs.net/ross/fingertree/issues+bug-reports: https://hub.darcs.net/ross/fingertree/issues Category: Data Structures Synopsis: Generic finger-tree structure, with example instances Description:@@ -17,7 +17,7 @@ * Ralf Hinze and Ross Paterson, \"Finger trees: a simple general-purpose data structure\", /Journal of Functional Programming/ 16:2 (2006) pp 197-217.- <http://staff.city.ac.uk/~ross/papers/FingerTree.html>+ <https://staff.city.ac.uk/~ross/papers/FingerTree.html> . For a tuned sequence type, see @Data.Sequence@ in the @containers@ package, which is a specialization of@@ -29,7 +29,7 @@ Source-Repository head Type: darcs- Location: http://hub.darcs.net/ross/fingertree+ Location: https://hub.darcs.net/ross/fingertree Library Build-Depends: