packages feed

pred-trie 0.0.10 → 0.0.10.1

raw patch · 5 files changed

+6/−4 lines, 5 filesdep −bifunctorsPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependencies removed: bifunctors

API changes (from Hackage documentation)

- Data.Trie.Pred.Disjoint: [Rooted] :: (Maybe x) -> [DPTrie p t x] -> RDPTrie p t x
- Data.Trie.Pred.Disjoint: instance (Eq p, Eq t) => Monoid (RDPTrie p t x)
- Data.Trie.Pred.Disjoint.Tail: [DMore] :: t -> Maybe x -> [DPTrie p t x] -> DPTrie p t x
- Data.Trie.Pred.Disjoint.Tail: [DPred] :: p -> (t -> Maybe r) -> Maybe (r -> x) -> [DPTrie p t (r -> x)] -> DPTrie p t x
- Data.Trie.Pred.Hetero.Unified: [Rooted] :: Maybe a -> [HUPTrie t a b] -> RHUPTrie t a b
- Data.Trie.Pred.Hetero.Unified: instance Eq t => Monoid (RHUPTrie t a b)
- Data.Trie.Pred.Hetero.Unified.Tail: [HUMore] :: t -> Maybe a -> [HUPTrie t a b] -> HUPTrie t a b
- Data.Trie.Pred.Hetero.Unified.Tail: [HUPred] :: t -> (t -> Maybe r) -> Maybe (r -> b) -> [HUPTrie t (r -> a) (r -> b)] -> HUPTrie t a b
- Data.Trie.Pred.Unified: [Rooted] :: Maybe x -> [UPTrie t x] -> RUPTrie t x
- Data.Trie.Pred.Unified: instance Eq t => Monoid (RUPTrie t x)
- Data.Trie.Pred.Unified.Tail: [UMore] :: t -> Maybe x -> [UPTrie t x] -> UPTrie t x
- Data.Trie.Pred.Unified.Tail: [UPred] :: t -> (t -> Maybe r) -> Maybe (r -> x) -> [UPTrie t (r -> x)] -> UPTrie t x
+ Data.Trie.Pred.Disjoint: Rooted :: (Maybe x) -> [DPTrie p t x] -> RDPTrie p t x
+ 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.Disjoint.Tail: DMore :: t -> Maybe x -> [DPTrie p t x] -> DPTrie p t x
+ Data.Trie.Pred.Disjoint.Tail: DPred :: p -> (t -> Maybe r) -> Maybe (r -> x) -> [DPTrie p t (r -> x)] -> DPTrie p t x
+ Data.Trie.Pred.Hetero.Unified: Rooted :: Maybe a -> [HUPTrie t a b] -> RHUPTrie t a b
+ 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.Hetero.Unified.Tail: HUMore :: t -> Maybe a -> [HUPTrie t a b] -> HUPTrie t a b
+ Data.Trie.Pred.Hetero.Unified.Tail: HUPred :: t -> (t -> Maybe r) -> Maybe (r -> b) -> [HUPTrie t (r -> a) (r -> b)] -> HUPTrie t a b
+ Data.Trie.Pred.Unified: Rooted :: Maybe x -> [UPTrie t x] -> RUPTrie t x
+ Data.Trie.Pred.Unified: instance GHC.Classes.Eq t => GHC.Base.Monoid (Data.Trie.Pred.Unified.RUPTrie t x)
+ Data.Trie.Pred.Unified.Tail: UMore :: t -> Maybe x -> [UPTrie t x] -> UPTrie t x
+ Data.Trie.Pred.Unified.Tail: UPred :: t -> (t -> Maybe r) -> Maybe (r -> x) -> [UPTrie t (r -> x)] -> UPTrie t x

Files

pred-trie.cabal view
@@ -1,5 +1,5 @@ Name:                   pred-trie-Version:                0.0.10+Version:                0.0.10.1 Author:                 Athan Clark <athan.clark@gmail.com> Maintainer:             Athan Clark <athan.clark@gmail.com> License:                BSD3@@ -21,9 +21,8 @@                         Data.Trie.Pred.Hetero.Unified.Tail                        -- Data.Trie.Pred.Hetero.Disjoint                        -- Data.Trie.Pred.Hetero.Disjoint.Tail-  Build-Depends:        base >= 4 && < 5+  Build-Depends:        base >= 4.8 && < 5                       , semigroups-                      , bifunctors  Test-Suite spec   Type:                 exitcode-stdio-1.0
src/Data/Trie/Pred/Disjoint/Tail.hs view
@@ -15,6 +15,7 @@  import Prelude hiding (lookup) import Data.List.NonEmpty as NE hiding (map, sort)+import Control.Applicative
src/Data/Trie/Pred/Hetero/Unified.hs view
@@ -13,6 +13,7 @@ import qualified Data.Trie.Pred.Hetero.Unified.Tail as NU import Data.Monoid import qualified Data.List.NonEmpty as NE+import Control.Applicative   data RHUPTrie t a b = Rooted { root :: Maybe a
src/Data/Trie/Pred/Hetero/Unified/Tail.hs view
@@ -15,7 +15,7 @@  import Prelude hiding (lookup) import Data.List.NonEmpty as NE hiding (map, sort)--- import Data.Bifunctor (bimap)+import Control.Applicative   data HUPTrie t a b where
src/Data/Trie/Pred/Unified/Tail.hs view
@@ -15,6 +15,7 @@  import Prelude hiding (lookup) import Data.List.NonEmpty as NE hiding (map, sort)+import Control.Applicative