rebase 1.9 → 1.9.1

raw patch · 2 files changed

+5/−5 lines, 2 filesdep ~profunctorsPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: profunctors

API changes (from Hackage documentation)

- Rebase.Prelude: data Prep (p :: Type -> Type -> Type) a

- Rebase.Prelude: data Procompose (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) d c

- Rebase.Prelude: newtype Cayley (f :: Type -> Type) (p :: Type -> Type -> Type) a b

- Rebase.Prelude: newtype Codensity (p :: Type -> Type -> Type) a b

- Rebase.Prelude: newtype Coprep (p :: Type -> Type -> Type) a

- Rebase.Prelude: newtype Costar (f :: Type -> Type) d c

- Rebase.Prelude: newtype Forget r a b

- Rebase.Prelude: newtype Ran (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) a b

- Rebase.Prelude: newtype Rift (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) a b

- Rebase.Prelude: newtype Star (f :: Type -> Type) d c

+ Rebase.Prelude: -- structure <tt>l</tt>.

+ Rebase.Prelude: -- | The <a>Item</a> type function returns the type of items of the

+ Rebase.Prelude: class IsList l where {

+ Rebase.Prelude: data Prep (p :: Type -> k -> Type) (a :: k) :: forall k. () => Type -> k -> Type -> k -> Type

+ Rebase.Prelude: fromList :: IsList l => [Item l] -> l

+ Rebase.Prelude: fromListN :: IsList l => Int -> [Item l] -> l

+ Rebase.Prelude: newtype Rift (p :: k2 -> k -> Type) (q :: k1 -> k -> Type) (a :: k1) (b :: k2) :: forall k k1 k2. () => k2 -> k -> Type -> k1 -> k -> Type -> k1 -> k2 -> Type

- Rebase.Prelude: Cayley :: f (p a b) -> Cayley a b

+ Rebase.Prelude: Cayley :: f (p a b) -> Cayley

- Rebase.Prelude: Codensity :: (forall x. () => p x a -> p x b) -> Codensity a b

+ Rebase.Prelude: Codensity :: (forall (x :: k). () => p x a -> p x b) -> Codensity

- Rebase.Prelude: Coprep :: (forall r. () => p a r -> r) -> Coprep a

+ Rebase.Prelude: Coprep :: (forall r. () => p a r -> r) -> Coprep

- Rebase.Prelude: Costar :: (f d -> c) -> Costar d c

+ Rebase.Prelude: Costar :: (f d -> c) -> Costar c

- Rebase.Prelude: Forget :: (a -> r) -> Forget r a b

+ Rebase.Prelude: Forget :: (a -> r) -> Forget r a

- Rebase.Prelude: Ran :: (forall x. () => p x a -> q x b) -> Ran a b

+ Rebase.Prelude: Ran :: (forall (x :: k). () => p x a -> q x b) -> Ran

- Rebase.Prelude: Rift :: (forall x. () => p b x -> q a x) -> Rift a b

+ Rebase.Prelude: Rift :: (forall (x :: k). () => p b x -> q a x) -> Rift

- Rebase.Prelude: Star :: (d -> f c) -> Star d c

+ Rebase.Prelude: Star :: (d -> f c) -> Star d

- Rebase.Prelude: [Prep] :: forall (p :: Type -> Type -> Type) a x. () => x -> p x a -> Prep p a

+ Rebase.Prelude: [Prep] :: forall k (p :: Type -> k -> Type) (a :: k) x. () => x -> p x a -> Prep p a

- Rebase.Prelude: [Procompose] :: forall (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) d c x. () => p x c -> q d x -> Procompose p q d c

+ Rebase.Prelude: [Procompose] :: forall k k1 k2 (p :: k -> k2 -> Type) (q :: k1 -> k -> Type) (d :: k1) (c :: k2) (x :: k). () => p x c -> q d x -> Procompose p q d c

- Rebase.Prelude: [runCayley] :: Cayley a b -> f (p a b)

+ Rebase.Prelude: [runCayley] :: Cayley -> f (p a b)

- Rebase.Prelude: [runCodensity] :: Codensity a b -> forall x. () => p x a -> p x b

+ Rebase.Prelude: [runCodensity] :: Codensity -> forall (x :: k). () => p x a -> p x b

- Rebase.Prelude: [runCoprep] :: Coprep a -> forall r. () => p a r -> r

+ Rebase.Prelude: [runCoprep] :: Coprep -> forall r. () => p a r -> r

- Rebase.Prelude: [runCostar] :: Costar d c -> f d -> c

+ Rebase.Prelude: [runCostar] :: Costar c -> f d -> c

- Rebase.Prelude: [runForget] :: Forget r a b -> a -> r

+ Rebase.Prelude: [runForget] :: Forget r a -> a -> r

- Rebase.Prelude: [runRan] :: Ran a b -> forall x. () => p x a -> q x b

+ Rebase.Prelude: [runRan] :: Ran -> forall (x :: k). () => p x a -> q x b

- Rebase.Prelude: [runRift] :: Rift a b -> forall x. () => p b x -> q a x

+ Rebase.Prelude: [runRift] :: Rift -> forall (x :: k). () => p b x -> q a x

- Rebase.Prelude: [runStar] :: Star d c -> d -> f c

+ Rebase.Prelude: [runStar] :: Star d -> d -> f c

- Rebase.Prelude: class ProfunctorFunctor (t :: Type -> Type -> Type -> Type -> Type -> Type)

+ Rebase.Prelude: class ProfunctorFunctor (t :: Type -> Type -> Type -> k -> k1 -> Type)

- Rebase.Prelude: coprepAdj :: () => (forall a. () => f a -> Coprep p a) -> p :-> Costar f

+ Rebase.Prelude: coprepAdj :: () => (forall (a :: k). () => f a -> Coprep p a) -> p :-> Costar f

- Rebase.Prelude: data (:~:) (a :: k) (b :: k) :: forall k. () => k -> k -> Type

+ Rebase.Prelude: data Procompose (p :: k -> k2 -> Type) (q :: k1 -> k -> Type) (d :: k1) (c :: k2) :: forall k k1 k2. () => k -> k2 -> Type -> k1 -> k -> Type -> k1 -> k2 -> Type

- Rebase.Prelude: mapCayley :: () => (forall a. () => f a -> g a) -> Cayley f p x y -> Cayley g p x y

+ Rebase.Prelude: mapCayley :: () => (forall (a :: k3). () => f a -> g a) -> Cayley f p x y -> Cayley g p x y

- Rebase.Prelude: prepAdj :: () => (forall a. () => Prep p a -> g a) -> p :-> Star g

+ Rebase.Prelude: prepAdj :: () => (forall (a :: k). () => Prep p a -> g a) -> p :-> Star g

- Rebase.Prelude: toList :: Foldable t => t a -> [a]

+ Rebase.Prelude: toList :: IsList l => l -> [Item l]

- Rebase.Prelude: type (:->) (p :: Type -> Type -> Type) (q :: Type -> Type -> Type) = forall a b. () => p a b -> q a b

+ Rebase.Prelude: type (:->) (p :: k -> k1 -> Type) (q :: k -> k1 -> Type) = forall (a :: k) (b :: k1). () => p a b -> q a b

Files

library/Rebase/Prelude.hs +2/−2
rebase.cabal +3/−3

library/Rebase/Prelude.hs view

@@ -34,7 +34,7 @@ import Rebase.Data.Dynamic as Exports import Rebase.Data.Either as Exports import Rebase.Data.Fixed as Exports-import Rebase.Data.Foldable as Exports+import Rebase.Data.Foldable as Exports hiding (toList) import Rebase.Data.Function as Exports hiding (id, (.)) import Rebase.Data.Functor as Exports import Rebase.Data.Functor.Classes as Exports@@ -66,7 +66,7 @@ import Rebase.Foreign.StablePtr as Exports import Rebase.Foreign.Storable as Exports import Rebase.GHC.Conc as Exports hiding (orElse, withMVar, threadWaitWriteSTM, threadWaitWrite, threadWaitReadSTM, threadWaitRead)-import Rebase.GHC.Exts as Exports (lazy, inline, sortWith, groupWith)+import Rebase.GHC.Exts as Exports (lazy, inline, sortWith, groupWith, IsList(..)) import Rebase.GHC.Generics as Exports (Generic) import Rebase.GHC.IO.Exception as Exports import Rebase.GHC.OverloadedLabels as Exports

rebase.cabal view

@@ -1,5 +1,5 @@ name: rebase-version: 1.9+version: 1.9.1 synopsis: A more progressive alternative to the "base" package description:   This package is intended for those who are tired of keeping@@ -288,8 +288,8 @@     Rebase.Data.Vector.Generic.Base     Rebase.Data.Vector.Generic.Mutable     Rebase.Data.Vector.Generic.New-    Rebase.Data.Vector.Internal.Check     Rebase.Data.Vector.Instances+    Rebase.Data.Vector.Internal.Check     Rebase.Data.Vector.Mutable     Rebase.Data.Vector.Primitive     Rebase.Data.Vector.Primitive.Mutable@@ -435,7 +435,7 @@     hashable >=1.3 && <1.4,     hashable-time >=0.2.0.2 && <0.3,     mtl >=2.2 && <2.3,-    profunctors >=5.5.2 && <5.6,+    profunctors >=5.5.2 && <5.7,     scientific >=0.3 && <0.4,     selective >=0.4 && <0.5,     semigroupoids >=5.3 && <5.4,