incipit-base 0.6.1.0 → 0.6.1.1
raw patch · 1 files changed
+6/−6 lines, 1 filesdep ~basedep ~containersPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base, containers
API changes (from Hackage documentation)
- Incipit.Base: (&&) :: Bool -> Bool -> Bool
- Incipit.Base: (/=) :: Eq a => a -> a -> Bool
- Incipit.Base: (==) :: Eq a => a -> a -> Bool
- Incipit.Base: (||) :: Bool -> Bool -> Bool
- Incipit.Base: Compose :: f (g a) -> Compose (f :: k -> Type) (g :: k1 -> k) (a :: k1)
- Incipit.Base: False :: Bool
- Incipit.Base: Identity :: a -> Identity a
- Incipit.Base: True :: Bool
- Incipit.Base: [getCompose] :: Compose (f :: k -> Type) (g :: k1 -> k) (a :: k1) -> f (g a)
- Incipit.Base: [runIdentity] :: Identity a -> a
- Incipit.Base: bimap :: Bifunctor p => (a -> b) -> (c -> d) -> p a c -> p b d
- Incipit.Base: bool :: a -> a -> Bool -> a
- Incipit.Base: class () => Bifunctor (p :: Type -> Type -> Type)
- Incipit.Base: class a ~R# b => Coercible (a :: k) (b :: k)
- Incipit.Base: class () => Eq a
- Incipit.Base: class () => IsLabel (x :: Symbol) a
- Incipit.Base: class Monad m => MonadFail (m :: Type -> Type)
- Incipit.Base: coerce :: forall {k :: RuntimeRep} (a :: TYPE k) (b :: TYPE k). Coercible a b => a -> b
- Incipit.Base: data () => Bool
- Incipit.Base: data () => Constraint
- Incipit.Base: data () => Int
- Incipit.Base: data () => Int16
- Incipit.Base: data () => Int32
- Incipit.Base: data () => Int64
- Incipit.Base: data () => Int8
- Incipit.Base: fail :: MonadFail m => String -> m a
- Incipit.Base: first :: Bifunctor p => (a -> b) -> p a c -> p b c
- Incipit.Base: fromLabel :: IsLabel x a => a
- Incipit.Base: infixr 2 ||
- Incipit.Base: newtype () => Compose (f :: k -> Type) (g :: k1 -> k) (a :: k1)
- Incipit.Base: newtype () => Identity a
- Incipit.Base: not :: Bool -> Bool
- Incipit.Base: otherwise :: Bool
- Incipit.Base: second :: Bifunctor p => (b -> c) -> p a b -> p a c
+ Incipit.Base: charSing :: KnownChar n => SChar n
+ Incipit.Base: data SChar (s :: Char)
+ Incipit.Base: data SNat (n :: Nat)
+ Incipit.Base: data SSymbol (s :: Symbol)
+ Incipit.Base: decideChar :: forall (a :: Char) (b :: Char) proxy1 proxy2. (KnownChar a, KnownChar b) => proxy1 a -> proxy2 b -> Either ((a :~: b) -> Void) (a :~: b)
+ Incipit.Base: decideNat :: forall (a :: Nat) (b :: Nat) proxy1 proxy2. (KnownNat a, KnownNat b) => proxy1 a -> proxy2 b -> Either ((a :~: b) -> Void) (a :~: b)
+ Incipit.Base: decideSymbol :: forall (a :: Symbol) (b :: Symbol) proxy1 proxy2. (KnownSymbol a, KnownSymbol b) => proxy1 a -> proxy2 b -> Either ((a :~: b) -> Void) (a :~: b)
+ Incipit.Base: fromSChar :: forall (c :: Char). SChar c -> Char
+ Incipit.Base: fromSNat :: forall (n :: Nat). SNat n -> Integer
+ Incipit.Base: fromSSymbol :: forall (s :: Symbol). SSymbol s -> String
+ Incipit.Base: natSing :: KnownNat n => SNat n
+ Incipit.Base: pattern SChar :: () => KnownChar c => SChar c
+ Incipit.Base: pattern SNat :: () => KnownNat n => SNat n
+ Incipit.Base: pattern SSymbol :: () => KnownSymbol s => SSymbol s
+ Incipit.Base: symbolSing :: KnownSymbol n => SSymbol n
+ Incipit.Base: type Constraint = CONSTRAINT LiftedRep
+ Incipit.Base: withKnownChar :: forall (c :: Char) r. SChar c -> (KnownChar c => r) -> r
+ Incipit.Base: withKnownNat :: forall (n :: Nat) r. SNat n -> (KnownNat n => r) -> r
+ Incipit.Base: withKnownSymbol :: forall (s :: Symbol) r. SSymbol s -> (KnownSymbol s => r) -> r
+ Incipit.Base: withSomeSChar :: Char -> (forall (c :: Char). () => SChar c -> r) -> r
+ Incipit.Base: withSomeSNat :: Integer -> (forall (n :: Nat). () => Maybe (SNat n) -> r) -> r
+ Incipit.Base: withSomeSSymbol :: String -> (forall (s :: Symbol). () => SSymbol s -> r) -> r
+ Incipit.Libraries: data IntMap a
+ Incipit.Libraries: data IntSet
+ Incipit.Libraries: data Map k a
+ Incipit.Libraries: data Seq a
+ Incipit.Libraries: data Set a
- Incipit.Base: ($!) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
+ Incipit.Base: ($!) :: (a -> b) -> a -> b
- Incipit.Base: ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
+ Incipit.Base: ($) :: (a -> b) -> a -> b
- Incipit.Base: class () => Bounded a
+ Incipit.Base: class Bounded a
- Incipit.Base: class () => Contravariant (f :: Type -> Type)
+ Incipit.Base: class Contravariant (f :: Type -> Type)
- Incipit.Base: class () => Enum a
+ Incipit.Base: class Enum a
- Incipit.Base: class () => Functor (f :: Type -> Type)
+ Incipit.Base: class Functor (f :: Type -> Type)
- Incipit.Base: class () => Generic a
+ Incipit.Base: class Generic a
- Incipit.Base: class () => KnownChar (n :: Char)
+ Incipit.Base: class KnownChar (n :: Char)
- Incipit.Base: class () => KnownNat (n :: Nat)
+ Incipit.Base: class KnownNat (n :: Nat)
- Incipit.Base: class () => KnownSymbol (n :: Symbol)
+ Incipit.Base: class KnownSymbol (n :: Symbol)
- Incipit.Base: class () => Num a
+ Incipit.Base: class Num a
- Incipit.Base: class () => Semigroup a
+ Incipit.Base: class Semigroup a
- Incipit.Base: class () => Show a
+ Incipit.Base: class Show a
- Incipit.Base: class () => Typeable (a :: k)
+ Incipit.Base: class Typeable (a :: k)
- Incipit.Base: data () => Char
+ Incipit.Base: data Char
- Incipit.Base: data () => Double
+ Incipit.Base: data Double
- Incipit.Base: data () => Float
+ Incipit.Base: data Float
- Incipit.Base: data () => IO a
+ Incipit.Base: data IO a
- Incipit.Base: data () => Integer
+ Incipit.Base: data Integer
- Incipit.Base: data () => Maybe a
+ Incipit.Base: data Maybe a
- Incipit.Base: data () => Natural
+ Incipit.Base: data Natural
- Incipit.Base: data () => NonEmpty a
+ Incipit.Base: data NonEmpty a
- Incipit.Base: data () => Ordering
+ Incipit.Base: data Ordering
- Incipit.Base: data () => OrderingI (a :: k) (b :: k)
+ Incipit.Base: data OrderingI (a :: k) (b :: k)
- Incipit.Base: data () => Proxy (t :: k)
+ Incipit.Base: data Proxy (t :: k)
- Incipit.Base: data () => Ratio a
+ Incipit.Base: data Ratio a
- Incipit.Base: data () => SomeChar
+ Incipit.Base: data SomeChar
- Incipit.Base: data () => SomeException
+ Incipit.Base: data SomeException
- Incipit.Base: data () => SomeNat
+ Incipit.Base: data SomeNat
- Incipit.Base: data () => SomeSymbol
+ Incipit.Base: data SomeSymbol
- Incipit.Base: data () => Symbol
+ Incipit.Base: data Symbol
- Incipit.Base: data () => Void
+ Incipit.Base: data Void
- Incipit.Base: data () => Word
+ Incipit.Base: data Word
- Incipit.Base: data () => Word16
+ Incipit.Base: data Word16
- Incipit.Base: data () => Word32
+ Incipit.Base: data Word32
- Incipit.Base: data () => Word64
+ Incipit.Base: data Word64
- Incipit.Base: data () => Word8
+ Incipit.Base: data Word8
- Incipit.Base: error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => [Char] -> a
+ Incipit.Base: error :: HasCallStack => [Char] -> a
- Incipit.Base: infixr 3 &&
+ Incipit.Base: infixr 3 &&&
- Incipit.Base: infixr 9 `Compose`
+ Incipit.Base: infixr 9 .
- Incipit.Base: newtype () => Const a (b :: k)
+ Incipit.Base: newtype Const a (b :: k)
- Incipit.Base: newtype () => Down a
+ Incipit.Base: newtype Down a
- Incipit.Base: newtype () => ZipList a
+ Incipit.Base: newtype ZipList a
- Incipit.Base: seq :: forall {r :: RuntimeRep} a (b :: TYPE r). a -> b -> b
+ Incipit.Base: seq :: a -> b -> b
- Incipit.Base: undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
+ Incipit.Base: undefined :: HasCallStack => a
- Incipit.Debug: dbg :: HasCallStack => Monad m => Text -> m ()
+ Incipit.Debug: dbg :: (HasCallStack, Monad m) => Text -> m ()
- Incipit.Debug: dbgs :: forall a m. HasCallStack => Monad m => Show a => a -> m ()
+ Incipit.Debug: dbgs :: forall a m. (HasCallStack, Monad m, Show a) => a -> m ()
- Incipit.Debug: dbgs_ :: forall a m. HasCallStack => Monad m => Show a => a -> m a
+ Incipit.Debug: dbgs_ :: forall a m. (HasCallStack, Monad m, Show a) => a -> m a
- Incipit.Debug: trs :: forall b a. Show b => HasCallStack => b -> a -> a
+ Incipit.Debug: trs :: (Show b, HasCallStack) => b -> a -> a
- Incipit.Debug: trsi :: Show a => HasCallStack => a -> a
+ Incipit.Debug: trsi :: (Show a, HasCallStack) => a -> a
- Incipit.Fixed: div' :: Real a => Integral b => a -> a -> Maybe b
+ Incipit.Fixed: div' :: (Real a, Integral b) => a -> a -> Maybe b
- Incipit.Fixed: divMod' :: Real a => Integral b => a -> a -> Maybe (b, a)
+ Incipit.Fixed: divMod' :: (Real a, Integral b) => a -> a -> Maybe (b, a)
- Incipit.Foldable: class () => Foldable (t :: Type -> Type)
+ Incipit.Foldable: class Foldable (t :: Type -> Type)
- Incipit.Foldable: foldl :: forall t b a. Foldable t => (b -> a -> b) -> b -> t a -> b
+ Incipit.Foldable: foldl :: Foldable t => (b -> a -> b) -> b -> t a -> b
- Incipit.Foldable: maximum :: forall t a. Ord a => Foldable t => t a -> Maybe a
+ Incipit.Foldable: maximum :: forall t a. (Ord a, Foldable t) => t a -> Maybe a
- Incipit.Foldable: maximumBy :: forall t a. Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
+ Incipit.Foldable: maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
- Incipit.Foldable: minimum :: forall t a. Ord a => Foldable t => t a -> Maybe a
+ Incipit.Foldable: minimum :: forall t a. (Ord a, Foldable t) => t a -> Maybe a
- Incipit.Foldable: minimumBy :: forall t a. Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
+ Incipit.Foldable: minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
- Incipit.Fractional: (/) :: Eq a => Fractional a => a -> a -> Maybe a
+ Incipit.Fractional: (/) :: (Eq a, Fractional a) => a -> a -> Maybe a
- Incipit.Fractional: recip :: Eq a => Fractional a => a -> Maybe a
+ Incipit.Fractional: recip :: (Eq a, Fractional a) => a -> Maybe a
- Incipit.Integral: safeOp :: Eq a => Num a => (a -> a -> b) -> a -> a -> Maybe b
+ Incipit.Integral: safeOp :: (Eq a, Num a) => (a -> a -> b) -> a -> a -> Maybe b
- Incipit.String.Reexport: class () => IsString a
+ Incipit.String.Reexport: class IsString a
- Incipit.String.Reexport: class () => Read a
+ Incipit.String.Reexport: class Read a
- Incipit.String.Reexport: data () => ByteString
+ Incipit.String.Reexport: data ByteString
- Incipit.String.Reexport: data () => ShortByteString
+ Incipit.String.Reexport: data ShortByteString
- Incipit.String.Reexport: data () => Text
+ Incipit.String.Reexport: data Text
- Incipit.String.Reexport: data () => UnicodeException
+ Incipit.String.Reexport: data UnicodeException
- Incipit.TypeError: type family Undefined
+ Incipit.TypeError: type family Undefined :: k
Files
- incipit-base.cabal +6/−6
incipit-base.cabal view
@@ -1,11 +1,11 @@ cabal-version: 2.2 --- This file has been generated from package.yaml by hpack version 0.36.0.+-- This file has been generated from package.yaml by hpack version 0.36.1. -- -- see: https://github.com/sol/hpack name: incipit-base-version: 0.6.1.0+version: 0.6.1.1 synopsis: A Prelude for Polysemy – Base Reexports description: See https://hackage.haskell.org/package/incipit-base/docs/IncipitBase.html category: Prelude@@ -13,7 +13,7 @@ bug-reports: https://github.com/tek/incipit-core/issues author: Torsten Schmits maintainer: hackage@tryp.io-copyright: 2023 Torsten Schmits+copyright: 2025 Torsten Schmits license: BSD-2-Clause-Patent license-file: LICENSE build-type: Simple@@ -113,10 +113,10 @@ NoFieldSelectors ghc-options: -Wall -Widentities -Wincomplete-uni-patterns -Wmissing-deriving-strategies -Wredundant-constraints -Wunused-type-patterns -Wunused-packages build-depends:- base >=4.16.4.0 && <4.21+ base >=4.16.4.0 && <4.22 , bytestring >=0.11.1.0 && <0.13- , containers >=0.6.3.1 && <0.8- , data-default >=0.2 && <0.8+ , containers >=0.6.3.1 && <0.9+ , data-default >=0.2 && <0.9 , stm >=2.5.0.2 && <2.6 , text >=1.2.5.0 && <2.2 default-language: GHC2021