representable-tries 2.0.3 → 2.0.4

raw patch · 2 files changed

+4/−6 lines, 2 filesdep ~adjunctionsdep ~representable-functors

Dependency ranges changed: adjunctions, representable-functors

Files

• Data/Functor/Representable/Trie.hs +0/−1
• representable-tries.cabal +4/−5

@@ -39,7 +39,6 @@ import Data.Functor.Adjunction import Data.Functor.Bind import Data.Functor.Identity-import Data.Functor.Representable import Data.Functor.Representable.Trie.Bool import Data.Functor.Representable.Trie.Either import Data.Functor.Representable.Trie.List

@@ -1,6 +1,6 @@ name:          representable-tries category:      Data Structures, Functors, Monads, Comonads-version:       2.0.3+version:       2.0.4 license:       BSD3 cabal-version: >= 1.6 license-file:  LICENSE@@ -31,7 +31,7 @@     TypeOperators     UndecidableInstances -  build-depends: +  build-depends:     base                   >= 4       && < 5,     containers             >= 0.3     && < 0.5,     mtl                    >= 2.0.1.0 && < 2.1,@@ -43,8 +43,8 @@     semigroupoids          >= 1.2.4   && < 1.3,     keys                   >= 2.1     && < 2.2,     comonad-transformers   >= 2.0     && < 2.1,-    adjunctions            >= 2.0.2   && < 2.1,-    representable-functors >= 2.0     && < 2.1+    adjunctions            >= 2.0.4   && < 2.1,+    representable-functors >= 2.1     && < 2.2    exposed-modules:     Control.Monad.Reader.Trie@@ -55,5 +55,4 @@     Data.Traversable.Fair     Numeric.Nat.Zeroless ---     Data.Vector.Zeroless   ghc-options: -Wall