pred-trie 0.0.10.2 → 0.0.11
raw patch · 3 files changed
+13/−1 lines, 3 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.Trie.Pred.Disjoint: Rooted :: (Maybe x) -> [DPTrie p t x] -> 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: 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.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: children :: RUPTrie t x -> [UPTrie t x]
- Data.Trie.Pred.Unified: root :: RUPTrie t x -> Maybe 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.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: [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.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: [children] :: RUPTrie t x -> [UPTrie t x]
+ Data.Trie.Pred.Unified: [root] :: RUPTrie t x -> Maybe x
+ Data.Trie.Pred.Unified: showTrie :: Show t => RUPTrie t x -> String
+ 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.Unified.Tail: showTail :: (Show t) => UPTrie t x -> String
- 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.2+Version: 0.0.11 Author: Athan Clark <athan.clark@gmail.com> Maintainer: Athan Clark <athan.clark@gmail.com> License: BSD3
src/Data/Trie/Pred/Unified.hs view
@@ -1,5 +1,6 @@ module Data.Trie.Pred.Unified ( RUPTrie (..)+ , showTrie , merge , lookup , lookupNearestParent@@ -12,11 +13,17 @@ import Data.Trie.Pred.Unified.Tail hiding (lookup, lookupNearestParent, merge) import qualified Data.Trie.Pred.Unified.Tail as NU import Data.Monoid+import Data.Maybe (fromMaybe) import qualified Data.List.NonEmpty as NE data RUPTrie t x = Rooted { root :: Maybe x , children :: [UPTrie t x] }++showTrie :: Show t => RUPTrie t x -> String+showTrie (Rooted mx xs) = case mx of+ Nothing -> "(NoRoot) [" ++ concatMap showTail xs ++ "] "+ Just x -> "(Root) [" ++ concatMap showTail xs ++ "] " instance (Eq t) => Monoid (RUPTrie t x) where mempty = Rooted Nothing []
src/Data/Trie/Pred/Unified/Tail.hs view
@@ -4,6 +4,7 @@ module Data.Trie.Pred.Unified.Tail ( UPTrie (..)+ , showTail , lookup , lookupNearestParent , merge@@ -29,6 +30,10 @@ -> Maybe (r -> x) -> [UPTrie t (r -> x)] -> UPTrie t x++showTail :: (Show t) => UPTrie t x -> String+showTail (UMore t mx xs) = "(UMore " ++ show t ++ ") [" ++ concatMap showTail xs ++ "] "+showTail (UPred t p mx xs) = "(UPred " ++ show t ++ ") [" ++ concatMap showTail xs ++ "] " -- | Overwrites when similar, leaves untouched when not