list-tries 0.6.0 → 0.6.1

raw patch · 4 files changed

+8/−9 lines, 4 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.ListTrie.Base.Map: instance (GHC.Classes.Eq k, GHC.Classes.Eq v) => GHC.Classes.Eq (Data.ListTrie.Base.Map.AList k v)

- Data.ListTrie.Base.Map: instance (GHC.Classes.Ord k, GHC.Classes.Ord v) => GHC.Classes.Ord (Data.ListTrie.Base.Map.AList k v)

- Data.ListTrie.Base.Map: instance Data.Foldable.Foldable (Data.ListTrie.Base.Map.AList k)

- Data.ListTrie.Base.Map: instance Data.Foldable.Foldable (Data.ListTrie.Base.Map.WrappedIntMap k)

- Data.ListTrie.Base.Map: instance Data.Traversable.Traversable (Data.ListTrie.Base.Map.AList k)

- Data.ListTrie.Base.Map: instance Data.Traversable.Traversable (Data.ListTrie.Base.Map.WrappedIntMap k)

- Data.ListTrie.Base.Map: instance GHC.Base.Functor (Data.ListTrie.Base.Map.AList k)

- Data.ListTrie.Base.Map: instance GHC.Base.Functor (Data.ListTrie.Base.Map.WrappedIntMap k)

- Data.ListTrie.Base.Map: instance GHC.Classes.Eq k => Data.ListTrie.Base.Map.Map Data.ListTrie.Base.Map.AList k

- Data.ListTrie.Base.Map: instance GHC.Classes.Eq v => GHC.Classes.Eq (Data.ListTrie.Base.Map.WrappedIntMap k v)

- Data.ListTrie.Base.Map: instance GHC.Classes.Ord k => Data.ListTrie.Base.Map.Map Data.Map.Base.Map k

- Data.ListTrie.Base.Map: instance GHC.Classes.Ord k => Data.ListTrie.Base.Map.OrdMap Data.ListTrie.Base.Map.AList k

- Data.ListTrie.Base.Map: instance GHC.Classes.Ord k => Data.ListTrie.Base.Map.OrdMap Data.Map.Base.Map k

- Data.ListTrie.Base.Map: instance GHC.Classes.Ord v => GHC.Classes.Ord (Data.ListTrie.Base.Map.WrappedIntMap k v)

- Data.ListTrie.Base.Map: instance GHC.Enum.Enum k => Data.ListTrie.Base.Map.Map Data.ListTrie.Base.Map.WrappedIntMap k

- Data.ListTrie.Base.Map: instance GHC.Enum.Enum k => Data.ListTrie.Base.Map.OrdMap Data.ListTrie.Base.Map.WrappedIntMap k

- Data.ListTrie.Map: instance (Data.ListTrie.Base.Map.Map map k, Data.Binary.Class.Binary k, Data.Binary.Class.Binary a) => Data.Binary.Class.Binary (Data.ListTrie.Map.TrieMap map k a)

- Data.ListTrie.Map: instance (Data.ListTrie.Base.Map.Map map k, Data.Traversable.Traversable (map k)) => Data.Traversable.Traversable (Data.ListTrie.Map.TrieMap map k)

- Data.ListTrie.Map: instance (Data.ListTrie.Base.Map.Map map k, GHC.Read.Read k, GHC.Read.Read a) => GHC.Read.Read (Data.ListTrie.Map.TrieMap map k a)

- Data.ListTrie.Map: instance (Data.ListTrie.Base.Map.Map map k, GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (Data.ListTrie.Map.TrieMap map k a)

- Data.ListTrie.Map: instance (GHC.Classes.Eq (map k (Data.ListTrie.Map.TrieMap map k a)), Data.ListTrie.Base.Map.OrdMap map k, GHC.Classes.Ord k, GHC.Classes.Ord a) => GHC.Classes.Ord (Data.ListTrie.Map.TrieMap map k a)

- Data.ListTrie.Map: instance (GHC.Classes.Eq (map k (Data.ListTrie.Map.TrieMap map k a)), GHC.Classes.Eq a) => GHC.Classes.Eq (Data.ListTrie.Map.TrieMap map k a)

- Data.ListTrie.Map: instance Data.ListTrie.Base.Map.Map map k => Data.Foldable.Foldable (Data.ListTrie.Map.TrieMap map k)

- Data.ListTrie.Map: instance Data.ListTrie.Base.Map.Map map k => Data.ListTrie.Base.Trie Data.ListTrie.Map.TrieMap GHC.Base.Maybe map k

- Data.ListTrie.Map: instance Data.ListTrie.Base.Map.Map map k => GHC.Base.Functor (Data.ListTrie.Map.TrieMap map k)

- Data.ListTrie.Map: instance Data.ListTrie.Base.Map.Map map k => GHC.Base.Monoid (Data.ListTrie.Map.TrieMap map k a)

- Data.ListTrie.Patricia.Map: instance (Data.ListTrie.Base.Map.Map map k, Data.Binary.Class.Binary k, Data.Binary.Class.Binary a) => Data.Binary.Class.Binary (Data.ListTrie.Patricia.Map.TrieMap map k a)

- Data.ListTrie.Patricia.Map: instance (Data.ListTrie.Base.Map.Map map k, Data.Traversable.Traversable (map k)) => Data.Traversable.Traversable (Data.ListTrie.Patricia.Map.TrieMap map k)

- Data.ListTrie.Patricia.Map: instance (Data.ListTrie.Base.Map.Map map k, GHC.Classes.Eq (map k (Data.ListTrie.Patricia.Map.TrieMap map k a)), GHC.Classes.Eq a) => GHC.Classes.Eq (Data.ListTrie.Patricia.Map.TrieMap map k a)

- Data.ListTrie.Patricia.Map: instance (Data.ListTrie.Base.Map.Map map k, GHC.Read.Read k, GHC.Read.Read a) => GHC.Read.Read (Data.ListTrie.Patricia.Map.TrieMap map k a)

- Data.ListTrie.Patricia.Map: instance (Data.ListTrie.Base.Map.Map map k, GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (Data.ListTrie.Patricia.Map.TrieMap map k a)

- Data.ListTrie.Patricia.Map: instance (GHC.Classes.Eq (map k (Data.ListTrie.Patricia.Map.TrieMap map k a)), Data.ListTrie.Base.Map.OrdMap map k, GHC.Classes.Ord k, GHC.Classes.Ord a) => GHC.Classes.Ord (Data.ListTrie.Patricia.Map.TrieMap map k a)

- Data.ListTrie.Patricia.Map: instance Data.ListTrie.Base.Map.Map map k => Data.Foldable.Foldable (Data.ListTrie.Patricia.Map.TrieMap map k)

- Data.ListTrie.Patricia.Map: instance Data.ListTrie.Base.Map.Map map k => Data.ListTrie.Patricia.Base.Trie Data.ListTrie.Patricia.Map.TrieMap GHC.Base.Maybe map k

- Data.ListTrie.Patricia.Map: instance Data.ListTrie.Base.Map.Map map k => GHC.Base.Functor (Data.ListTrie.Patricia.Map.TrieMap map k)

- Data.ListTrie.Patricia.Map: instance Data.ListTrie.Base.Map.Map map k => GHC.Base.Monoid (Data.ListTrie.Patricia.Map.TrieMap map k a)

- Data.ListTrie.Patricia.Set: instance (Data.ListTrie.Base.Map.Map map a, Data.Binary.Class.Binary a) => Data.Binary.Class.Binary (Data.ListTrie.Patricia.Set.TrieSet map a)

- Data.ListTrie.Patricia.Set: instance (Data.ListTrie.Base.Map.Map map a, GHC.Classes.Eq (Data.ListTrie.Patricia.Set.CMap map a GHC.Types.Bool)) => GHC.Classes.Eq (Data.ListTrie.Patricia.Set.TrieSetBase map a GHC.Types.Bool)

- Data.ListTrie.Patricia.Set: instance (Data.ListTrie.Base.Map.Map map a, GHC.Read.Read a) => GHC.Read.Read (Data.ListTrie.Patricia.Set.TrieSet map a)

- Data.ListTrie.Patricia.Set: instance (Data.ListTrie.Base.Map.Map map a, GHC.Show.Show a) => GHC.Show.Show (Data.ListTrie.Patricia.Set.TrieSet map a)

- Data.ListTrie.Patricia.Set: instance (Data.ListTrie.Base.Map.Map map k, Data.Binary.Class.Binary k, Data.Binary.Class.Binary a) => Data.Binary.Class.Binary (Data.ListTrie.Patricia.Set.TrieSetBase map k a)

- Data.ListTrie.Patricia.Set: instance (GHC.Classes.Eq (Data.ListTrie.Patricia.Set.CMap map a GHC.Types.Bool), Data.ListTrie.Base.Map.Map map a) => GHC.Classes.Eq (Data.ListTrie.Patricia.Set.TrieSet map a)

- Data.ListTrie.Patricia.Set: instance (GHC.Classes.Eq (Data.ListTrie.Patricia.Set.CMap map a GHC.Types.Bool), Data.ListTrie.Base.Map.OrdMap map a, GHC.Classes.Ord a) => GHC.Classes.Ord (Data.ListTrie.Patricia.Set.TrieSet map a)

- Data.ListTrie.Patricia.Set: instance Data.ListTrie.Base.Map.Map map a => GHC.Base.Monoid (Data.ListTrie.Patricia.Set.TrieSet map a)

- Data.ListTrie.Patricia.Set: instance Data.ListTrie.Base.Map.Map map k => Data.ListTrie.Patricia.Base.Trie Data.ListTrie.Patricia.Set.TrieSetBase Data.ListTrie.Base.Classes.Identity map k

- Data.ListTrie.Set: instance (Data.ListTrie.Base.Map.Map map a, Data.Binary.Class.Binary a) => Data.Binary.Class.Binary (Data.ListTrie.Set.TrieSet map a)

- Data.ListTrie.Set: instance (Data.ListTrie.Base.Map.Map map a, GHC.Read.Read a) => GHC.Read.Read (Data.ListTrie.Set.TrieSet map a)

- Data.ListTrie.Set: instance (Data.ListTrie.Base.Map.Map map a, GHC.Show.Show a) => GHC.Show.Show (Data.ListTrie.Set.TrieSet map a)

- Data.ListTrie.Set: instance (Data.ListTrie.Base.Map.Map map k, Data.Binary.Class.Binary k, Data.Binary.Class.Binary a) => Data.Binary.Class.Binary (Data.ListTrie.Set.TrieSetBase map k a)

- Data.ListTrie.Set: instance (GHC.Classes.Eq (Data.ListTrie.Set.CMap map a GHC.Types.Bool), Data.ListTrie.Base.Map.OrdMap map a, GHC.Classes.Ord a) => GHC.Classes.Ord (Data.ListTrie.Set.TrieSet map a)

- Data.ListTrie.Set: instance Data.ListTrie.Base.Map.Map map a => GHC.Base.Monoid (Data.ListTrie.Set.TrieSet map a)

- Data.ListTrie.Set: instance Data.ListTrie.Base.Map.Map map k => Data.ListTrie.Base.Trie Data.ListTrie.Set.TrieSetBase Data.ListTrie.Base.Classes.Identity map k

- Data.ListTrie.Set: instance GHC.Classes.Eq (Data.ListTrie.Set.CMap map a GHC.Types.Bool) => GHC.Classes.Eq (Data.ListTrie.Set.TrieSet map a)

- Data.ListTrie.Set: instance GHC.Classes.Eq (Data.ListTrie.Set.CMap map a GHC.Types.Bool) => GHC.Classes.Eq (Data.ListTrie.Set.TrieSetBase map a GHC.Types.Bool)

+ Data.ListTrie.Base.Map: instance (Eq k, Eq v) => Eq (AList k v)

+ Data.ListTrie.Base.Map: instance (Ord k, Ord v) => Ord (AList k v)

+ Data.ListTrie.Base.Map: instance Enum k => Map WrappedIntMap k

+ Data.ListTrie.Base.Map: instance Enum k => OrdMap WrappedIntMap k

+ Data.ListTrie.Base.Map: instance Eq k => Map AList k

+ Data.ListTrie.Base.Map: instance Eq v => Eq (WrappedIntMap k v)

+ Data.ListTrie.Base.Map: instance Foldable (AList k)

+ Data.ListTrie.Base.Map: instance Foldable (WrappedIntMap k)

+ Data.ListTrie.Base.Map: instance Functor (AList k)

+ Data.ListTrie.Base.Map: instance Functor (WrappedIntMap k)

+ Data.ListTrie.Base.Map: instance Ord k => Map Map k

+ Data.ListTrie.Base.Map: instance Ord k => OrdMap AList k

+ Data.ListTrie.Base.Map: instance Ord k => OrdMap Map k

+ Data.ListTrie.Base.Map: instance Ord v => Ord (WrappedIntMap k v)

+ Data.ListTrie.Base.Map: instance Traversable (AList k)

+ Data.ListTrie.Base.Map: instance Traversable (WrappedIntMap k)

+ Data.ListTrie.Map: instance (Eq (map k (TrieMap map k a)), Eq a) => Eq (TrieMap map k a)

+ Data.ListTrie.Map: instance (Eq (map k (TrieMap map k a)), OrdMap map k, Ord k, Ord a) => Ord (TrieMap map k a)

+ Data.ListTrie.Map: instance (Map map k, Binary k, Binary a) => Binary (TrieMap map k a)

+ Data.ListTrie.Map: instance (Map map k, Read k, Read a) => Read (TrieMap map k a)

+ Data.ListTrie.Map: instance (Map map k, Show k, Show a) => Show (TrieMap map k a)

+ Data.ListTrie.Map: instance (Map map k, Traversable (map k)) => Traversable (TrieMap map k)

+ Data.ListTrie.Map: instance Map map k => Foldable (TrieMap map k)

+ Data.ListTrie.Map: instance Map map k => Functor (TrieMap map k)

+ Data.ListTrie.Map: instance Map map k => Monoid (TrieMap map k a)

+ Data.ListTrie.Map: instance Map map k => Trie TrieMap Maybe map k

+ Data.ListTrie.Patricia.Map: instance (Eq (map k (TrieMap map k a)), OrdMap map k, Ord k, Ord a) => Ord (TrieMap map k a)

+ Data.ListTrie.Patricia.Map: instance (Map map k, Binary k, Binary a) => Binary (TrieMap map k a)

+ Data.ListTrie.Patricia.Map: instance (Map map k, Eq (map k (TrieMap map k a)), Eq a) => Eq (TrieMap map k a)

+ Data.ListTrie.Patricia.Map: instance (Map map k, Read k, Read a) => Read (TrieMap map k a)

+ Data.ListTrie.Patricia.Map: instance (Map map k, Show k, Show a) => Show (TrieMap map k a)

+ Data.ListTrie.Patricia.Map: instance (Map map k, Traversable (map k)) => Traversable (TrieMap map k)

+ Data.ListTrie.Patricia.Map: instance Map map k => Foldable (TrieMap map k)

+ Data.ListTrie.Patricia.Map: instance Map map k => Functor (TrieMap map k)

+ Data.ListTrie.Patricia.Map: instance Map map k => Monoid (TrieMap map k a)

+ Data.ListTrie.Patricia.Map: instance Map map k => Trie TrieMap Maybe map k

+ Data.ListTrie.Patricia.Set: instance (Eq (CMap map a Bool), Map map a) => Eq (TrieSet map a)

+ Data.ListTrie.Patricia.Set: instance (Eq (CMap map a Bool), OrdMap map a, Ord a) => Ord (TrieSet map a)

+ Data.ListTrie.Patricia.Set: instance (Eq (CMap map a Bool), OrdMap map a, Ord a) => Ord (TrieSetBase map a Bool)

+ Data.ListTrie.Patricia.Set: instance (Map map a, Binary a) => Binary (TrieSet map a)

+ Data.ListTrie.Patricia.Set: instance (Map map a, Eq (CMap map a Bool)) => Eq (TrieSetBase map a Bool)

+ Data.ListTrie.Patricia.Set: instance (Map map a, Read a) => Read (TrieSet map a)

+ Data.ListTrie.Patricia.Set: instance (Map map a, Show a) => Show (TrieSet map a)

+ Data.ListTrie.Patricia.Set: instance (Map map k, Binary k, Binary a) => Binary (TrieSetBase map k a)

+ Data.ListTrie.Patricia.Set: instance Map map a => Monoid (TrieSet map a)

+ Data.ListTrie.Patricia.Set: instance Map map k => Trie TrieSetBase Identity map k

+ Data.ListTrie.Set: instance (Eq (CMap map a Bool), OrdMap map a, Ord a) => Ord (TrieSet map a)

+ Data.ListTrie.Set: instance (Eq (CMap map a Bool), OrdMap map a, Ord a) => Ord (TrieSetBase map a Bool)

+ Data.ListTrie.Set: instance (Map map a, Binary a) => Binary (TrieSet map a)

+ Data.ListTrie.Set: instance (Map map a, Read a) => Read (TrieSet map a)

+ Data.ListTrie.Set: instance (Map map a, Show a) => Show (TrieSet map a)

+ Data.ListTrie.Set: instance (Map map k, Binary k, Binary a) => Binary (TrieSetBase map k a)

+ Data.ListTrie.Set: instance Eq (CMap map a Bool) => Eq (TrieSet map a)

+ Data.ListTrie.Set: instance Eq (CMap map a Bool) => Eq (TrieSetBase map a Bool)

+ Data.ListTrie.Set: instance Map map a => Monoid (TrieSet map a)

+ Data.ListTrie.Set: instance Map map k => Trie TrieSetBase Identity map k

Files

CHANGELOG.txt +3/−0
Data/ListTrie/Base/Map.hs +3/−7
LICENSE.txt +1/−1
list-tries.cabal +1/−1

CHANGELOG.txt view

@@ -1,3 +1,6 @@+2015-04-03, 0.6.1:+	Fixed build on base < 4.8.+ 2015-03-28, 0.6.0: 	Updated dependencies for GHC 7.10.

Data/ListTrie/Base/Map.hs view

@@ -12,18 +12,14 @@ import Control.Monad       (liftM, liftM2) import Data.Foldable       (Foldable(..)) import Data.Function       (on)-import Data.List           ( foldl1'-                           , mapAccumL, nubBy, partition-                           , sort, sortBy-                           )+import Data.List           (foldl1', mapAccumL, nubBy, partition, sort, sortBy) import Data.Ord            (comparing) import Data.Traversable    (Traversable(..), mapAccumR) import qualified Data.IntMap as IM import qualified Data.Map    as M -import Prelude hiding ( mapM,sequence-                      , null,lookup,filter -- for Haddock-                      , toList+import Prelude hiding ( filter, foldl, foldl1, foldr, foldr1, lookup, null+                      , mapM, sequence, toList                       ) import qualified Prelude

LICENSE.txt view

@@ -2,7 +2,7 @@ are held by whoever wrote the code in question: see CREDITS.txt for a list of authors. -Copyright (c) 2008-2014 <authors>+Copyright (c) 2008-2015 <authors> All rights reserved.  Redistribution and use in source and binary forms, with or without

list-tries.cabal view

@@ -1,7 +1,7 @@ Cabal-Version: >= 1.6  Name:        list-tries-Version:     0.6.0+Version:     0.6.1 Homepage:    http://iki.fi/matti.niemenmaa/list-tries/ Synopsis:    Tries and Patricia tries: finite sets and maps for list keys Category:    Data, Data Structures