packages feed

incipit-base 0.1.0.1 → 0.1.0.2

raw patch · 3 files changed

+32/−8 lines, 3 filesdep +stmdep ~basePVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependencies added: stm

Dependency ranges changed: base

API changes (from Hackage documentation)

- Incipit.Base: byteSwap16 :: Word16 -> Word16
- Incipit.Base: byteSwap32 :: Word32 -> Word32
- Incipit.Base: byteSwap64 :: Word64 -> Word64
- Incipit.Base: foldl :: Foldable t => (b -> a -> b) -> b -> t a -> b
+ Incipit.Misc: foldl :: forall b t a. Foldable t => (b -> a -> b) -> b -> t a -> b

Files

incipit-base.cabal view
@@ -5,8 +5,8 @@ -- see: https://github.com/sol/hpack  name:           incipit-base-version:        0.1.0.1-synopsis:       A Prelude for Polysemy+version:        0.1.0.2+synopsis:       A Prelude for Polysemy – Base Reexports description:    See <https://hackage.haskell.org/package/incipit-base/docs/Incipit-Prelude.html> category:       Prelude homepage:       https://github.com/tek/incipit#readme@@ -38,7 +38,16 @@       Incipit.String.Conversion       Incipit.String.Reexport   reexported-modules:-      Data.ByteString+      Control.Concurrent.STM+    , Control.Concurrent.STM.TArray+    , Control.Concurrent.STM.TBQueue+    , Control.Concurrent.STM.TChan+    , Control.Concurrent.STM.TMVar+    , Control.Concurrent.STM.TQueue+    , Control.Concurrent.STM.TSem+    , Control.Concurrent.STM.TVar+    , Control.Monad.STM+    , Data.ByteString     , Data.ByteString.Builder     , Data.ByteString.Lazy     , Data.ByteString.Short@@ -118,10 +127,11 @@       ViewPatterns   ghc-options: -Wall -Wredundant-constraints -Wincomplete-uni-patterns -Wmissing-deriving-strategies -Widentities   build-depends:-      base ==4.*+      base >=4.13 && <4.17     , bytestring     , containers     , data-default >=0.2+    , stm     , text   if impl(ghc >= 8.10)     ghc-options: -Wunused-packages
lib/Incipit/Base.hs view
@@ -1,10 +1,9 @@-{-# options_haddock ignore-exports #-}- -- |Reexports from @base@. module Incipit.Base (   module Control.Applicative,   module Control.Arrow,   module Control.Category,+  module Control.Concurrent.MVar,   module Control.Exception,   module Control.Monad,   module Control.Monad.Fail,@@ -62,6 +61,7 @@   ) import Control.Arrow ((&&&)) import Control.Category ((<<<), (>>>))+import Control.Concurrent.MVar import Control.Exception (Exception, SomeException (..)) import Control.Monad (   Monad ((>>), (>>=)),@@ -91,7 +91,7 @@ import Data.Either import Data.Eq (Eq (..)) import Data.Foldable (-  Foldable (..),+  Foldable (elem, fold, foldMap, foldMap', foldl', foldl1, foldr, foldr', foldr1, length, maximum, minimum, null, product, sum, toList),   all,   and,   any,@@ -170,7 +170,7 @@ import Data.Tuple (curry, fst, snd, swap, uncurry) import Data.Typeable (Typeable) import Data.Void (Void)-import Data.Word (Word, Word16, Word32, Word64, Word8, byteSwap16, byteSwap32, byteSwap64)+import Data.Word (Word, Word16, Word32, Word64, Word8) import GHC.Base (maxInt, minInt, ord, seq, ($!)) import GHC.Enum (Bounded (..), Enum (..)) import GHC.Err (error, undefined)
lib/Incipit/Misc.hs view
@@ -1,6 +1,8 @@ -- |Misc combinators. module Incipit.Misc where +import qualified Data.Foldable as Foldable+ import Incipit.Base  -- |Convenience alias for @pure ()@.@@ -41,3 +43,15 @@ ifM condM onTrue onFalse =   condM >>= \ cond -> if cond then onTrue else onFalse {-# inline ifM #-}++-- |Default to using the strict version since the lazy one is so controversial.+foldl ::+  ∀ b t a .+  Foldable t =>+  (b -> a -> b) ->+  b ->+  t a ->+  b+foldl =+  Foldable.foldl'+{-# inline foldl #-}