fingertree 0.1.0.2 → 0.1.1.0
raw patch · 4 files changed
+24/−2 lines, 4 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.FingerTree: instance (Eq a, Eq (s a)) => Eq (ViewL s a)
- Data.FingerTree: instance (Eq a, Eq (s a)) => Eq (ViewR s a)
- Data.FingerTree: instance (Ord a, Ord (s a)) => Ord (ViewL s a)
- Data.FingerTree: instance (Ord a, Ord (s a)) => Ord (ViewR s a)
- Data.FingerTree: instance (Read a, Read (s a)) => Read (ViewL s a)
- Data.FingerTree: instance (Read a, Read (s a)) => Read (ViewR s a)
- Data.FingerTree: instance (Show a, Show (s a)) => Show (ViewL s a)
- Data.FingerTree: instance (Show a, Show (s a)) => Show (ViewR s a)
- Data.FingerTree: instance (Show v, Show a) => Show (Node v a)
- Data.FingerTree: instance Eq a => Eq (FingerTree v a)
- Data.FingerTree: instance Foldable (FingerTree v)
- Data.FingerTree: instance Foldable (Node v)
- Data.FingerTree: instance Foldable Digit
- Data.FingerTree: instance Functor s => Functor (ViewL s)
- Data.FingerTree: instance Functor s => Functor (ViewR s)
- Data.FingerTree: instance Measured v a => Measured v (Digit a)
- Data.FingerTree: instance Measured v a => Measured v (FingerTree v a)
- Data.FingerTree: instance Measured v a => Monoid (FingerTree v a)
- Data.FingerTree: instance Monoid v => Measured v (Node v a)
- Data.FingerTree: instance Ord a => Ord (FingerTree v a)
- Data.FingerTree: instance Show a => Show (Digit a)
- Data.FingerTree: instance Show a => Show (FingerTree v a)
- Data.IntervalMap.FingerTree: instance Eq v => Eq (Interval v)
- Data.IntervalMap.FingerTree: instance Foldable (IntervalMap v)
- Data.IntervalMap.FingerTree: instance Foldable (Node v)
- Data.IntervalMap.FingerTree: instance Functor (IntervalMap v)
- Data.IntervalMap.FingerTree: instance Functor (Node v)
- Data.IntervalMap.FingerTree: instance Ord v => Measured (IntInterval v) (Node v a)
- Data.IntervalMap.FingerTree: instance Ord v => Monoid (IntInterval v)
- Data.IntervalMap.FingerTree: instance Ord v => Monoid (IntervalMap v a)
- Data.IntervalMap.FingerTree: instance Ord v => Ord (Interval v)
- Data.IntervalMap.FingerTree: instance Show v => Show (Interval v)
- Data.IntervalMap.FingerTree: instance Traversable (IntervalMap v)
- Data.IntervalMap.FingerTree: instance Traversable (Node v)
- Data.PriorityQueue.FingerTree: instance Foldable (Entry k)
- Data.PriorityQueue.FingerTree: instance Functor (Entry k)
- Data.PriorityQueue.FingerTree: instance Ord k => Foldable (PQueue k)
- Data.PriorityQueue.FingerTree: instance Ord k => Functor (PQueue k)
- Data.PriorityQueue.FingerTree: instance Ord k => Measured (Prio k v) (Entry k v)
- Data.PriorityQueue.FingerTree: instance Ord k => Monoid (PQueue k v)
- Data.PriorityQueue.FingerTree: instance Ord k => Monoid (Prio k v)
+ Data.FingerTree: instance [safe] (Eq a, Eq (s a)) => Eq (ViewL s a)
+ Data.FingerTree: instance [safe] (Eq a, Eq (s a)) => Eq (ViewR s a)
+ Data.FingerTree: instance [safe] (Ord a, Ord (s a)) => Ord (ViewL s a)
+ Data.FingerTree: instance [safe] (Ord a, Ord (s a)) => Ord (ViewR s a)
+ Data.FingerTree: instance [safe] (Read a, Read (s a)) => Read (ViewL s a)
+ Data.FingerTree: instance [safe] (Read a, Read (s a)) => Read (ViewR s a)
+ Data.FingerTree: instance [safe] (Show a, Show (s a)) => Show (ViewL s a)
+ Data.FingerTree: instance [safe] (Show a, Show (s a)) => Show (ViewR s a)
+ Data.FingerTree: instance [safe] (Show v, Show a) => Show (Node v a)
+ Data.FingerTree: instance [safe] Eq a => Eq (FingerTree v a)
+ Data.FingerTree: instance [safe] Foldable (FingerTree v)
+ Data.FingerTree: instance [safe] Foldable (Node v)
+ Data.FingerTree: instance [safe] Foldable Digit
+ Data.FingerTree: instance [safe] Functor s => Functor (ViewL s)
+ Data.FingerTree: instance [safe] Functor s => Functor (ViewR s)
+ Data.FingerTree: instance [safe] Measured v a => Measured v (Digit a)
+ Data.FingerTree: instance [safe] Measured v a => Measured v (FingerTree v a)
+ Data.FingerTree: instance [safe] Measured v a => Monoid (FingerTree v a)
+ Data.FingerTree: instance [safe] Monoid v => Measured v (Node v a)
+ Data.FingerTree: instance [safe] Ord a => Ord (FingerTree v a)
+ Data.FingerTree: instance [safe] Show a => Show (Digit a)
+ Data.FingerTree: instance [safe] Show a => Show (FingerTree v a)
+ Data.IntervalMap.FingerTree: instance [safe] Eq v => Eq (Interval v)
+ Data.IntervalMap.FingerTree: instance [safe] Foldable (IntervalMap v)
+ Data.IntervalMap.FingerTree: instance [safe] Foldable (Node v)
+ Data.IntervalMap.FingerTree: instance [safe] Functor (IntervalMap v)
+ Data.IntervalMap.FingerTree: instance [safe] Functor (Node v)
+ Data.IntervalMap.FingerTree: instance [safe] Ord v => Measured (IntInterval v) (Node v a)
+ Data.IntervalMap.FingerTree: instance [safe] Ord v => Monoid (IntInterval v)
+ Data.IntervalMap.FingerTree: instance [safe] Ord v => Monoid (IntervalMap v a)
+ Data.IntervalMap.FingerTree: instance [safe] Ord v => Ord (Interval v)
+ Data.IntervalMap.FingerTree: instance [safe] Show v => Show (Interval v)
+ Data.IntervalMap.FingerTree: instance [safe] Traversable (IntervalMap v)
+ Data.IntervalMap.FingerTree: instance [safe] Traversable (Node v)
+ Data.PriorityQueue.FingerTree: instance [safe] Foldable (Entry k)
+ Data.PriorityQueue.FingerTree: instance [safe] Functor (Entry k)
+ Data.PriorityQueue.FingerTree: instance [safe] Ord k => Foldable (PQueue k)
+ Data.PriorityQueue.FingerTree: instance [safe] Ord k => Functor (PQueue k)
+ Data.PriorityQueue.FingerTree: instance [safe] Ord k => Measured (Prio k v) (Entry k v)
+ Data.PriorityQueue.FingerTree: instance [safe] Ord k => Monoid (PQueue k v)
+ Data.PriorityQueue.FingerTree: instance [safe] Ord k => Monoid (Prio k v)
Files
- Data/FingerTree.hs +8/−1
- Data/IntervalMap/FingerTree.hs +7/−0
- Data/PriorityQueue/FingerTree.hs +7/−0
- fingertree.cabal +2/−1
Data/FingerTree.hs view
@@ -1,4 +1,11 @@-{-# LANGUAGE CPP, MultiParamTypeClasses, FunctionalDependencies, FlexibleInstances, UndecidableInstances #-}+{-# LANGUAGE CPP #-}+{-# LANGUAGE MultiParamTypeClasses, FunctionalDependencies, FlexibleInstances, UndecidableInstances #-}+#if __GLASGOW_HASKELL__ >= 702+{-# LANGUAGE Safe #-}+#endif+#if __GLASGOW_HASKELL__ >= 710+{-# LANGUAGE AutoDeriveTypeable #-}+#endif ----------------------------------------------------------------------------- -- | -- Module : Data.FingerTree
Data/IntervalMap/FingerTree.hs view
@@ -1,4 +1,11 @@+{-# LANGUAGE CPP #-} {-# LANGUAGE MultiParamTypeClasses #-}+#if __GLASGOW_HASKELL__ >= 702+{-# LANGUAGE Safe #-}+#endif+#if __GLASGOW_HASKELL__ >= 710+{-# LANGUAGE AutoDeriveTypeable #-}+#endif ----------------------------------------------------------------------------- -- | -- Module : Data.PriorityQueue.FingerTree
Data/PriorityQueue/FingerTree.hs view
@@ -1,4 +1,11 @@+{-# LANGUAGE CPP #-} {-# LANGUAGE MultiParamTypeClasses #-}+#if __GLASGOW_HASKELL__ >= 702+{-# LANGUAGE Safe #-}+#endif+#if __GLASGOW_HASKELL__ >= 710+{-# LANGUAGE AutoDeriveTypeable #-}+#endif ----------------------------------------------------------------------------- -- | -- Module : Data.PriorityQueue.FingerTree
fingertree.cabal view
@@ -1,10 +1,11 @@ Name: fingertree-Version: 0.1.0.2+Version: 0.1.1.0 Cabal-Version: >= 1.8 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 Category: Data Structures Synopsis: Generic finger-tree structure, with example instances Description: