pred-trie 0.0.7.1 → 0.0.8

raw patch · 3 files changed

+8/−7 lines, 3 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

Files

• pred-trie.cabal +1/−1
• src/Data/Trie/Pred/Unified.hs +3/−2
• src/Data/Trie/Pred/Unified/Tail.hs +4/−4

@@ -1,5 +1,5 @@ Name:                   pred-trie-Version:                0.0.7.1+Version:                0.0.8 Author:                 Athan Clark <athan.clark@gmail.com> Maintainer:             Athan Clark <athan.clark@gmail.com> License:                BSD3

@@ -14,7 +14,8 @@ import qualified Data.List.NonEmpty as NE  -data RUPTrie t x = Rooted (Maybe x) [UPTrie t x]+data RUPTrie t x = Rooted { root :: Maybe x+                          , children :: [UPTrie t x] }  instance (Eq t) => Monoid (RUPTrie t x) where   mempty = Rooted Nothing []@@ -22,7 +23,7 @@  merge :: (Eq t) => RUPTrie t x -> RUPTrie t x -> RUPTrie t x merge (Rooted mx xs) (Rooted my ys) =-  Rooted (getLast $ Last mx <> Last my) $ foldr go [] $ xs ++ ys+  Rooted (getLast $ Last mx <> Last my) $ NU.sort $ foldr go [] $ xs ++ ys   where     go :: (Eq t) => UPTrie t x -> [UPTrie t x] -> [UPTrie t x]     go a [] = [a]

@@ -48,10 +48,10 @@   areDisjoint :: (Eq t) => UPTrie t x -> UPTrie t x -> Bool-areDisjoint (UMore t _ _)    (UMore p _ _)    = t == p-areDisjoint (UPred t _ _ _)  (UPred p _ _ _)  = t == p-areDisjoint (UPred t _ _ _)  (UMore p _ _)    = t == p-areDisjoint (UMore t _ _)    (UPred p _ _ _)  = t == p+areDisjoint (UMore t _ _)    (UMore p _ _)    = not $ t == p+areDisjoint (UPred t _ _ _)  (UPred p _ _ _)  = not $ t == p+areDisjoint (UPred t _ _ _)  (UMore p _ _)    = not $ t == p+areDisjoint (UMore t _ _)    (UPred p _ _ _)  = not $ t == p   lookup :: Eq t => NonEmpty t -> UPTrie t x -> Maybe x