packages feed

pred-trie 0.0.10.1 → 0.0.10.2

raw patch · 1 files changed

+2/−2 lines, 1 filesdep ~basePVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: base

API changes (from Hackage documentation)

- Data.Trie.Pred.Disjoint: instance (GHC.Classes.Eq p, GHC.Classes.Eq t) => GHC.Base.Monoid (Data.Trie.Pred.Disjoint.RDPTrie p t x)
- Data.Trie.Pred.Hetero.Unified: [children] :: RHUPTrie t a b -> [HUPTrie t a b]
- Data.Trie.Pred.Hetero.Unified: [root] :: RHUPTrie t a b -> Maybe a
- Data.Trie.Pred.Hetero.Unified: instance GHC.Classes.Eq t => GHC.Base.Monoid (Data.Trie.Pred.Hetero.Unified.RHUPTrie t a b)
- Data.Trie.Pred.Unified: [children] :: RUPTrie t x -> [UPTrie t x]
- Data.Trie.Pred.Unified: [root] :: RUPTrie t x -> Maybe x
- Data.Trie.Pred.Unified: instance GHC.Classes.Eq t => GHC.Base.Monoid (Data.Trie.Pred.Unified.RUPTrie t x)
+ Data.Trie.Pred.Disjoint: instance (Eq p, Eq t) => Monoid (RDPTrie p t x)
+ Data.Trie.Pred.Hetero.Unified: children :: RHUPTrie t a b -> [HUPTrie t a b]
+ Data.Trie.Pred.Hetero.Unified: instance Eq t => Monoid (RHUPTrie t a b)
+ Data.Trie.Pred.Hetero.Unified: root :: RHUPTrie t a b -> Maybe a
+ Data.Trie.Pred.Unified: children :: RUPTrie t x -> [UPTrie t x]
+ Data.Trie.Pred.Unified: instance Eq t => Monoid (RUPTrie t x)
+ Data.Trie.Pred.Unified: root :: RUPTrie t x -> Maybe x
- Data.Trie.Pred.Disjoint: lookup :: (Eq t) => [t] -> RDPTrie p t x -> Maybe x
+ Data.Trie.Pred.Disjoint: lookup :: Eq t => [t] -> RDPTrie p t x -> Maybe x
- Data.Trie.Pred.Disjoint: lookupNearestParent :: (Eq t) => [t] -> RDPTrie p t x -> Maybe x
+ Data.Trie.Pred.Disjoint: lookupNearestParent :: Eq t => [t] -> RDPTrie p t x -> Maybe x
- Data.Trie.Pred.Hetero.Unified: lookup :: (Eq t) => [t] -> RHUPTrie t a b -> Maybe (Either a b)
+ Data.Trie.Pred.Hetero.Unified: lookup :: Eq t => [t] -> RHUPTrie t a b -> Maybe (Either a b)
- Data.Trie.Pred.Hetero.Unified: merge :: (Eq t) => RHUPTrie t a b -> RHUPTrie t a b -> RHUPTrie t a b
+ Data.Trie.Pred.Hetero.Unified: merge :: Eq t => RHUPTrie t a b -> RHUPTrie t a b -> RHUPTrie t a b
- Data.Trie.Pred.Hetero.Unified.Tail: areDisjoint :: (Eq t) => HUPTrie t a b -> HUPTrie t a b -> Bool
+ Data.Trie.Pred.Hetero.Unified.Tail: areDisjoint :: Eq t => HUPTrie t a b -> HUPTrie t a b -> Bool
- Data.Trie.Pred.Hetero.Unified.Tail: merge :: (Eq t) => HUPTrie t a b -> HUPTrie t a b -> HUPTrie t a b
+ Data.Trie.Pred.Hetero.Unified.Tail: merge :: Eq t => HUPTrie t a b -> HUPTrie t a b -> HUPTrie t a b
- Data.Trie.Pred.Hetero.Unified.Tail: sort :: (Eq t) => [HUPTrie t a b] -> [HUPTrie t a b]
+ Data.Trie.Pred.Hetero.Unified.Tail: sort :: Eq t => [HUPTrie t a b] -> [HUPTrie t a b]
- Data.Trie.Pred.Unified: lookup :: (Eq t) => [t] -> RUPTrie t x -> Maybe x
+ Data.Trie.Pred.Unified: lookup :: Eq t => [t] -> RUPTrie t x -> Maybe x
- Data.Trie.Pred.Unified: lookupNearestParent :: (Eq t) => [t] -> RUPTrie t x -> Maybe x
+ Data.Trie.Pred.Unified: lookupNearestParent :: Eq t => [t] -> RUPTrie t x -> Maybe x
- Data.Trie.Pred.Unified: merge :: (Eq t) => RUPTrie t x -> RUPTrie t x -> RUPTrie t x
+ Data.Trie.Pred.Unified: merge :: Eq t => RUPTrie t x -> RUPTrie t x -> RUPTrie t x
- Data.Trie.Pred.Unified.Tail: areDisjoint :: (Eq t) => UPTrie t x -> UPTrie t x -> Bool
+ Data.Trie.Pred.Unified.Tail: areDisjoint :: Eq t => UPTrie t x -> UPTrie t x -> Bool
- Data.Trie.Pred.Unified.Tail: merge :: (Eq t) => UPTrie t x -> UPTrie t x -> UPTrie t x
+ Data.Trie.Pred.Unified.Tail: merge :: Eq t => UPTrie t x -> UPTrie t x -> UPTrie t x
- Data.Trie.Pred.Unified.Tail: sort :: (Eq t) => [UPTrie t x] -> [UPTrie t x]
+ Data.Trie.Pred.Unified.Tail: sort :: Eq t => [UPTrie t x] -> [UPTrie t x]

Files

pred-trie.cabal view
@@ -1,5 +1,5 @@ Name:                   pred-trie-Version:                0.0.10.1+Version:                0.0.10.2 Author:                 Athan Clark <athan.clark@gmail.com> Maintainer:             Athan Clark <athan.clark@gmail.com> License:                BSD3@@ -21,7 +21,7 @@                         Data.Trie.Pred.Hetero.Unified.Tail                        -- Data.Trie.Pred.Hetero.Disjoint                        -- Data.Trie.Pred.Hetero.Disjoint.Tail-  Build-Depends:        base >= 4.8 && < 5+  Build-Depends:        base >= 4.6 && < 5                       , semigroups  Test-Suite spec