invertible 0.2.0.5 → 0.2.0.6
raw patch · 1 files changed
+1/−1 lines, 1 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Control.Invertible.Functor: instance Control.Invertible.Functor.Functor Data.Monoid.Endo
- Data.Invertible.Bijection: type <-> = Bijection (->)
- Data.Invertible.Prelude: type <-> = Bijection (->)
+ Control.Invertible.BiArrow: infix 2 <->
+ Control.Invertible.Functor: instance Control.Invertible.Functor.Functor Data.Semigroup.Internal.Endo
+ Control.Invertible.Monoidal: infix 2 :<->:
+ Data.Invertible.Bijection: infix 2 <->
+ Data.Invertible.Bijection: type (<->) = Bijection (->)
+ Data.Invertible.Monoid: instance GHC.Base.Semigroup (Data.Invertible.Monoid.BiEndo a)
+ Data.Invertible.Prelude: type (<->) = Bijection (->)
- Control.Invertible.Functor: (<$>) :: Functor f => a <-> b -> f a -> f b
+ Control.Invertible.Functor: (<$>) :: Functor f => (a <-> b) -> f a -> f b
- Control.Invertible.Functor: fmap :: Functor f => a <-> b -> f a -> f b
+ Control.Invertible.Functor: fmap :: Functor f => (a <-> b) -> f a -> f b
- Control.Invertible.Functor: fmapDefault :: Functor f => a <-> b -> f a -> f b
+ Control.Invertible.Functor: fmapDefault :: Functor f => (a <-> b) -> f a -> f b
- Control.Invertible.Monoidal: (>$<) :: Functor f => a <-> b -> f a -> f b
+ Control.Invertible.Monoidal: (>$<) :: Functor f => (a <-> b) -> f a -> f b
- Control.Invertible.Monoidal.Free: [Free] :: !(f a) -> Free f a
+ Control.Invertible.Monoidal.Free: [Free] :: !f a -> Free f a
- Data.Invertible.Functor: bifmap :: Functor f => a <-> b -> f a <-> f b
+ Data.Invertible.Functor: bifmap :: Functor f => (a <-> b) -> f a <-> f b
- Data.Invertible.Invariant: invmap :: Invariant f => a <-> b -> f a -> f b
+ Data.Invertible.Invariant: invmap :: Invariant f => (a <-> b) -> f a -> f b
- Data.Invertible.Lens: toIso :: a <-> b -> Iso' a b
+ Data.Invertible.Lens: toIso :: (a <-> b) -> Iso' a b
- Data.Invertible.List: zipWith :: (a, b) <-> c -> ([a], [b]) <-> [(c)]
+ Data.Invertible.List: zipWith :: ((a, b) <-> c) -> ([a], [b]) <-> [c]
- Data.Invertible.Monad: liftM :: Monad m => a <-> b -> m a <-> m b
+ Data.Invertible.Monad: liftM :: Monad m => (a <-> b) -> m a <-> m b
- Data.Invertible.Monoid: BiEndo :: a <-> a -> BiEndo a
+ Data.Invertible.Monoid: BiEndo :: (a <-> a) -> BiEndo a
- Data.Invertible.PartialIsomorphism: (<$>) :: IsoFunctor f => a <-> b -> f a -> f b
+ Data.Invertible.PartialIsomorphism: (<$>) :: IsoFunctor f => (a <-> b) -> f a -> f b
- Data.Invertible.PartialIsomorphism: toIso :: a <-> b -> Iso a b
+ Data.Invertible.PartialIsomorphism: toIso :: (a <-> b) -> Iso a b
- Data.Invertible.Prelude: (<$>) :: Functor f => a <-> b -> f a -> f b
+ Data.Invertible.Prelude: (<$>) :: Functor f => (a <-> b) -> f a -> f b
- Data.Invertible.Prelude: bifmap :: Functor f => a <-> b -> f a <-> f b
+ Data.Invertible.Prelude: bifmap :: Functor f => (a <-> b) -> f a <-> f b
- Data.Invertible.Prelude: fmap :: Functor f => a <-> b -> f a -> f b
+ Data.Invertible.Prelude: fmap :: Functor f => (a <-> b) -> f a -> f b
- Data.Invertible.Prelude: zipWith :: (a, b) <-> c -> ([a], [b]) <-> [(c)]
+ Data.Invertible.Prelude: zipWith :: ((a, b) <-> c) -> ([a], [b]) <-> [c]
Files
- invertible.cabal +1/−1
invertible.cabal view
@@ -1,5 +1,5 @@ name: invertible-version: 0.2.0.5+version: 0.2.0.6 synopsis: bidirectional arrows, bijective functions, and invariant functors description: Representations and operations for bidirectional arrows (total isomorphisms: an