base-prelude 1.6.1 → 1.6.1.1
raw patch · 2 files changed
+20/−22 lines, 2 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- BasePrelude: getOption :: Option a -> Maybe a
- BasePrelude: option :: b -> (a -> b) -> Option a -> b
+ BasePrelude: And :: a -> And a
+ BasePrelude: Iff :: a -> Iff a
+ BasePrelude: Ior :: a -> Ior a
+ BasePrelude: Xor :: a -> Xor a
+ BasePrelude: [UnsafeRefl] :: forall {k} (a :: k). UnsafeEquality a a
+ BasePrelude: [getAnd] :: And a -> a
+ BasePrelude: [getIff] :: Iff a -> a
+ BasePrelude: [getIor] :: Ior a -> a
+ BasePrelude: [getXor] :: Xor a -> a
+ BasePrelude: clamp :: Ord a => (a, a) -> a -> a
+ BasePrelude: data UnsafeEquality (a :: k) (b :: k)
+ BasePrelude: flushEventLog :: IO ()
+ BasePrelude: getContents' :: IO String
+ BasePrelude: hGetContents' :: Handle -> IO String
+ BasePrelude: mkConstrTag :: DataType -> String -> Int -> [String] -> Fixity -> Constr
+ BasePrelude: newtype And a
+ BasePrelude: newtype Iff a
+ BasePrelude: newtype Ior a
+ BasePrelude: newtype Xor a
+ BasePrelude: oneBits :: FiniteBits a => a
+ BasePrelude: readBin :: (Eq a, Num a) => ReadS a
+ BasePrelude: readFile' :: FilePath -> IO String
+ BasePrelude: showBin :: (Integral a, Show a) => a -> ShowS
+ BasePrelude: singleton :: a -> [a]
+ BasePrelude: trLiftedRep :: TypeRep ('BoxedRep 'Lifted)
+ BasePrelude: unsafeCoerce# :: forall (q :: RuntimeRep) (r :: RuntimeRep) (a :: TYPE q) (b :: TYPE r). a -> b
+ BasePrelude: unsafeCoerceAddr :: forall (a :: TYPE 'AddrRep) (b :: TYPE 'AddrRep). a -> b
+ BasePrelude: unsafeCoerceUnlifted :: forall (a :: UnliftedType) (b :: UnliftedType). a -> b
+ BasePrelude: unsafeEqualityProof :: forall {k} (a :: k) (b :: k). UnsafeEquality a b
- BasePrelude: (<<<) :: forall k cat (b :: k) (c :: k) (a :: k). Category cat => cat b c -> cat a b -> cat a c
+ BasePrelude: (<<<) :: forall {k} cat (b :: k) (c :: k) (a :: k). Category cat => cat b c -> cat a b -> cat a c
- BasePrelude: (>>>) :: forall k cat (a :: k) (b :: k) (c :: k). Category cat => cat a b -> cat b c -> cat a c
+ BasePrelude: (>>>) :: forall {k} cat (a :: k) (b :: k) (c :: k). Category cat => cat a b -> cat b c -> cat a c
- BasePrelude: [HRefl] :: forall k1 (a :: k1). a :~~: a
+ BasePrelude: [HRefl] :: forall {k1} (a :: k1). a :~~: a
- BasePrelude: [Refl] :: forall k (a :: k). a :~: a
+ BasePrelude: [Refl] :: forall {k} (a :: k). a :~: a
- BasePrelude: class Category a => Arrow (a :: Type -> Type -> Type)
+ BasePrelude: class Category a => Arrow (a :: TYPE LiftedRep -> TYPE LiftedRep -> Type)
- BasePrelude: class Arrow a => ArrowApply (a :: Type -> Type -> Type)
+ BasePrelude: class Arrow a => ArrowApply (a :: TYPE LiftedRep -> TYPE LiftedRep -> Type)
- BasePrelude: class Arrow a => ArrowChoice (a :: Type -> Type -> Type)
+ BasePrelude: class Arrow a => ArrowChoice (a :: TYPE LiftedRep -> TYPE LiftedRep -> Type)
- BasePrelude: class Arrow a => ArrowLoop (a :: Type -> Type -> Type)
+ BasePrelude: class Arrow a => ArrowLoop (a :: TYPE LiftedRep -> TYPE LiftedRep -> Type)
- BasePrelude: class ArrowZero a => ArrowPlus (a :: Type -> Type -> Type)
+ BasePrelude: class ArrowZero a => ArrowPlus (a :: TYPE LiftedRep -> TYPE LiftedRep -> Type)
- BasePrelude: class Arrow a => ArrowZero (a :: Type -> Type -> Type)
+ BasePrelude: class Arrow a => ArrowZero (a :: TYPE LiftedRep -> TYPE LiftedRep -> Type)
- BasePrelude: class Foldable (t :: Type -> Type)
+ BasePrelude: class Foldable (t :: TYPE LiftedRep -> Type)
- BasePrelude: class Show1 (f :: Type -> Type)
+ BasePrelude: class Show1 (f :: TYPE LiftedRep -> TYPE LiftedRep)
- BasePrelude: class Show2 (f :: Type -> Type -> Type)
+ BasePrelude: class Show2 (f :: TYPE LiftedRep -> TYPE LiftedRep -> TYPE LiftedRep)
- BasePrelude: coerce :: forall (k :: RuntimeRep) (a :: TYPE k) (b :: TYPE k). Coercible a b => a -> b
+ BasePrelude: coerce :: forall {k :: RuntimeRep} (a :: TYPE k) (b :: TYPE k). Coercible a b => a -> b
- BasePrelude: contramap :: Contravariant f => (a -> b) -> f b -> f a
+ BasePrelude: contramap :: Contravariant f => (a' -> a) -> f a -> f a'
- BasePrelude: data (a :: k1) :~~: (b :: k2)
+ BasePrelude: data (a :: k) :~: (b :: k)
- BasePrelude: eqT :: forall k (a :: k) (b :: k). (Typeable a, Typeable b) => Maybe (a :~: b)
+ BasePrelude: eqT :: forall {k} (a :: k) (b :: k). (Typeable a, Typeable b) => Maybe (a :~: b)
- BasePrelude: gcast :: forall k (a :: k) (b :: k) c. (Typeable a, Typeable b) => c a -> Maybe (c b)
+ BasePrelude: gcast :: forall {k} (a :: k) (b :: k) c. (Typeable a, Typeable b) => c a -> Maybe (c b)
- BasePrelude: gcast1 :: forall k1 k2 c (t :: k2 -> k1) (t' :: k2 -> k1) (a :: k2). (Typeable t, Typeable t') => c (t a) -> Maybe (c (t' a))
+ BasePrelude: gcast1 :: forall {k1} {k2} c (t :: k2 -> k1) (t' :: k2 -> k1) (a :: k2). (Typeable t, Typeable t') => c (t a) -> Maybe (c (t' a))
- BasePrelude: gcast2 :: forall k1 k2 k3 c (t :: k2 -> k3 -> k1) (t' :: k2 -> k3 -> k1) (a :: k2) (b :: k3). (Typeable t, Typeable t') => c (t a b) -> Maybe (c (t' a b))
+ BasePrelude: gcast2 :: forall {k1} {k2} {k3} c (t :: k2 -> k3 -> k1) (t' :: k2 -> k3 -> k1) (a :: k2) (b :: k3). (Typeable t, Typeable t') => c (t a b) -> Maybe (c (t' a b))
- BasePrelude: infix 4 :~~:
+ BasePrelude: infix 4 :~:
- BasePrelude: infixl 8 `shift`
+ BasePrelude: infixl 8 `rotate`
- BasePrelude: infixr 5 :|
+ BasePrelude: infixr 5 <+>
- BasePrelude: mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
+ BasePrelude: mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
- BasePrelude: mapAccumR :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
+ BasePrelude: mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
- BasePrelude: seq :: forall (r :: RuntimeRep) a (b :: TYPE r). a -> b -> b
+ BasePrelude: seq :: forall {r :: RuntimeRep} a (b :: TYPE r). a -> b -> b
- BasePrelude: showFixed :: forall k (a :: k). HasResolution a => Bool -> Fixed a -> String
+ BasePrelude: showFixed :: forall {k} (a :: k). HasResolution a => Bool -> Fixed a -> String
- BasePrelude: typeRep :: forall k proxy (a :: k). Typeable a => proxy a -> TypeRep
+ BasePrelude: typeRep :: forall {k} proxy (a :: k). Typeable a => proxy a -> TypeRep
Files
- base-prelude.cabal +17/−21
- library/BasePrelude.hs +3/−1
base-prelude.cabal view
@@ -1,46 +1,42 @@-cabal-version: 3.0--name: base-prelude-version: 1.6.1-synopsis: Featureful preludes formed solely from the "base" package+cabal-version: 3.0+name: base-prelude+version: 1.6.1.1+synopsis: Featureful preludes formed solely from the "base" package description: A library which aims to reexport all the non-conflicting and most general definitions from the \"base\" package. This includes APIs for applicatives, arrows, monoids, foldables, traversables, exceptions, generics, ST, MVars and STM.- This package will never have any dependencies other than \"base\".- Besides a rich prelude it provides limited ones like "BasePrelude.DataTypes", which only exports the data-types defined across the \"base\" package, and "BasePrelude.Operators", which only exports the common operators.- /Versioning policy/- The versioning policy of this package deviates from PVP in the sense that its exports in part are transitively determined by the version of \"base\". Therefore it's recommended for the users of \"base-prelude\" to specify the bounds of \"base\" as well.-category: Prelude-homepage: https://github.com/nikita-volkov/base-prelude-bug-reports: https://github.com/nikita-volkov/base-prelude/issues-author: Nikita Volkov <nikita.y.volkov@mail.ru>-maintainer: Nikita Volkov <nikita.y.volkov@mail.ru>-copyright: (c) 2014, Nikita Volkov-license: MIT-license-file: LICENSE++category: Prelude+homepage: https://github.com/nikita-volkov/base-prelude+bug-reports: https://github.com/nikita-volkov/base-prelude/issues+author: Nikita Volkov <nikita.y.volkov@mail.ru>+maintainer: Nikita Volkov <nikita.y.volkov@mail.ru>+copyright: (c) 2014, Nikita Volkov+license: MIT+license-file: LICENSE extra-source-files: CHANGELOG.md source-repository head- type: git+ type: git location: git://github.com/nikita-volkov/base-prelude.git library- hs-source-dirs: library+ hs-source-dirs: library default-language: Haskell2010 exposed-modules: BasePrelude BasePrelude.DataTypes BasePrelude.Operators- build-depends:- base >=4.12 && <5++ build-depends: base >=4.12 && <5
library/BasePrelude.hs view
@@ -1,3 +1,5 @@+{-# OPTIONS_GHC -Wno-dodgy-imports -Wno-unused-imports #-}+ -- | -- Reexports of most of the definitions from the \"base\" package, -- which it is a common practice to import unqualified.@@ -30,7 +32,7 @@ import Data.Fixed as Exports import Data.Foldable as Exports hiding (toList) import Data.Function as Exports hiding (id, (.))-import Data.Functor as Exports+import Data.Functor as Exports hiding (unzip) import Data.Functor.Classes as Exports import Data.Functor.Compose as Exports import Data.Functor.Contravariant as Exports