packages feed

sized 0.4.0.0 → 0.5.0.0

raw patch · 2 files changed

+21/−19 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

- Data.Sized: empty :: forall f a. (HasOrdinal nat, ListLike (f a) a) => Sized f (Zero nat :: nat) a
+ Data.Sized: empty :: forall f nat a. (HasOrdinal nat, ListLike (f a) a) => Sized f (Zero nat :: nat) a
- Data.Sized: fromList :: forall f n a. (HasOrdinal nat, ListLike (f a) a) => Sing (n :: nat) -> [a] -> Maybe (Sized f n a)
+ Data.Sized: fromList :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> [a] -> Maybe (Sized f n a)
- Data.Sized: fromListWithDefault :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> [a] -> Sized f n a
+ Data.Sized: fromListWithDefault :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> [a] -> Sized f n a
- Data.Sized: replicate :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> Sized f n a
+ Data.Sized: replicate :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> Sized f n a
- Data.Sized: sElemIndex :: forall (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
+ Data.Sized: sElemIndex :: forall nat (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
- Data.Sized: sLength :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> Sing n
+ Data.Sized: sLength :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> Sing n
- Data.Sized: sUnsafeElemIndex :: forall (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
+ Data.Sized: sUnsafeElemIndex :: forall nat (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
- Data.Sized: viewCons :: forall f a (n :: nat). (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> ConsView f n a
+ Data.Sized: viewCons :: forall f a nat (n :: nat). (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> ConsView f n a
- Data.Sized: viewSnoc :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> SnocView f n a
+ Data.Sized: viewSnoc :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> SnocView f n a
- Data.Sized.Builtin: empty :: forall f a. (HasOrdinal nat, ListLike (f a) a) => Sized f (Zero nat :: nat) a
+ Data.Sized.Builtin: empty :: forall f nat a. (HasOrdinal nat, ListLike (f a) a) => Sized f (Zero nat :: nat) a
- Data.Sized.Builtin: fromList :: forall f n a. (HasOrdinal nat, ListLike (f a) a) => Sing (n :: nat) -> [a] -> Maybe (Sized f n a)
+ Data.Sized.Builtin: fromList :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> [a] -> Maybe (Sized f n a)
- Data.Sized.Builtin: fromListWithDefault :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> [a] -> Sized f n a
+ Data.Sized.Builtin: fromListWithDefault :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> [a] -> Sized f n a
- Data.Sized.Builtin: replicate :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> Sized f n a
+ Data.Sized.Builtin: replicate :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> Sized f n a
- Data.Sized.Builtin: sElemIndex :: forall (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
+ Data.Sized.Builtin: sElemIndex :: forall nat (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
- Data.Sized.Builtin: sLength :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> Sing n
+ Data.Sized.Builtin: sLength :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> Sing n
- Data.Sized.Builtin: sUnsafeElemIndex :: forall (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
+ Data.Sized.Builtin: sUnsafeElemIndex :: forall nat (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
- Data.Sized.Builtin: viewCons :: forall f a (n :: nat). (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> ConsView f n a
+ Data.Sized.Builtin: viewCons :: forall f a nat (n :: nat). (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> ConsView f n a
- Data.Sized.Builtin: viewSnoc :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> SnocView f n a
+ Data.Sized.Builtin: viewSnoc :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> SnocView f n a
- Data.Sized.Peano: empty :: forall f a. (HasOrdinal nat, ListLike (f a) a) => Sized f (Zero nat :: nat) a
+ Data.Sized.Peano: empty :: forall f nat a. (HasOrdinal nat, ListLike (f a) a) => Sized f (Zero nat :: nat) a
- Data.Sized.Peano: fromList :: forall f n a. (HasOrdinal nat, ListLike (f a) a) => Sing (n :: nat) -> [a] -> Maybe (Sized f n a)
+ Data.Sized.Peano: fromList :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> [a] -> Maybe (Sized f n a)
- Data.Sized.Peano: fromListWithDefault :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> [a] -> Sized f n a
+ Data.Sized.Peano: fromListWithDefault :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> [a] -> Sized f n a
- Data.Sized.Peano: replicate :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> Sized f n a
+ Data.Sized.Peano: replicate :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sing n -> a -> Sized f n a
- Data.Sized.Peano: sElemIndex :: forall (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
+ Data.Sized.Peano: sElemIndex :: forall nat (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
- Data.Sized.Peano: sLength :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> Sing n
+ Data.Sized.Peano: sLength :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> Sing n
- Data.Sized.Peano: sUnsafeElemIndex :: forall (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
+ Data.Sized.Peano: sUnsafeElemIndex :: forall nat (n :: nat) f a. (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat) => a -> Sized f n a -> Maybe (Ordinal n)
- Data.Sized.Peano: viewCons :: forall f a (n :: nat). (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> ConsView f n a
+ Data.Sized.Peano: viewCons :: forall f a nat (n :: nat). (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> ConsView f n a
- Data.Sized.Peano: viewSnoc :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> SnocView f n a
+ Data.Sized.Peano: viewSnoc :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a) => Sized f n a -> SnocView f n a

Files

Data/Sized.hs view
@@ -167,8 +167,8 @@  -- | @Sing@ version of 'length'. ----- Since 0.2.0.0-sLength :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a)+-- Since 0.5.0.0 (type changed)+sLength :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a)         => Sized f n a -> Sing n sLength (Sized xs) =   case fromNatural (P.fromIntegral $ LL.length xs) of@@ -413,8 +413,8 @@  -- | Empty sequence. ----- Since 0.1.0.0-empty :: forall f a. (HasOrdinal nat, ListLike (f a) a) => Sized f (Zero nat :: nat) a+-- Since 0.5.0.0 (type changed)+empty :: forall f nat a. (HasOrdinal nat, ListLike (f a) a) => Sized f (Zero nat :: nat) a empty = Sized LL.empty {-# INLINE empty #-} @@ -439,7 +439,7 @@ -- | Replicates the same value. -- -- Since 0.1.0.0-replicate :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a)+replicate :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a)           => Sing n -> a -> Sized f n a replicate sn a = Sized $ LL.genericReplicate (toNatural sn) a {-# INLINE replicate #-}@@ -734,9 +734,9 @@ --   Otherwise returns @Sized f n a@ consisting of initial @n@ element --   of given list. ----- Since 0.1.0.0-fromList :: forall f n a. (HasOrdinal nat, ListLike (f a) a)-         => Sing (n :: nat) -> [a] -> Maybe (Sized f n a)+--   Since 0.5.0.0 (type changed)+fromList :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a)+         => Sing n -> [a] -> Maybe (Sized f n a) fromList Zero _ = Just $ Sized (LL.empty :: f a) fromList sn xs =   let len = P.fromIntegral $ toNatural sn@@ -794,8 +794,8 @@  -- | Construct a @Sized f n a@ by padding default value if the given list is short. ----- Since 0.1.0.0-fromListWithDefault :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a)+--   Since 0.5.0.0 (type changed)+fromListWithDefault :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a)                     => Sing n -> a -> [a] -> Sized f n a fromListWithDefault sn def xs =   let len = toNatural sn@@ -1101,8 +1101,8 @@ --   then @'sUnsafeElemIndex'@ is much faster and --   also safe for most cases. -----   Since 0.1.0.0-sElemIndex :: forall (n :: nat) f a.+--   Since 0.5.0.0 (type changed)+sElemIndex :: forall nat (n :: nat) f a.               (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat)            => a -> Sized f n a -> Maybe (Ordinal n) sElemIndex a (Sized xs) = do@@ -1114,7 +1114,8 @@         SFalse -> Nothing {-# INLINE sElemIndex #-} -sUnsafeElemIndex :: forall (n :: nat) f a.+-- | Since 0.5.0.0 (type changed)+sUnsafeElemIndex :: forall nat (n :: nat) f a.                     (SingI n, ListLike (f a) a, Eq a, HasOrdinal nat)                  => a -> Sized f n a -> Maybe (Ordinal n) sUnsafeElemIndex a (Sized xs) =@@ -1185,8 +1186,8 @@  -- | Case analysis for the cons-side of sequence. ----- Since 0.1.0.0-viewCons :: forall f a (n :: nat). (HasOrdinal nat, ListLike (f a) a)+-- Since 0.5.0.0 (type changed)+viewCons :: forall f a nat (n :: nat). (HasOrdinal nat, ListLike (f a) a)          => Sized f n a          -> ConsView f n a viewCons sz = case zeroOrSucc (sLength sz) of@@ -1203,8 +1204,8 @@  -- | Case analysis for the snoc-side of sequence. ----- Since 0.1.0.0-viewSnoc :: forall f (n :: nat) a. (HasOrdinal nat, ListLike (f a) a)+-- Since 0.5.0.0 (type changed)+viewSnoc :: forall f nat (n :: nat) a. (HasOrdinal nat, ListLike (f a) a)          => Sized f n a          -> SnocView f n a viewSnoc sz = case zeroOrSucc (sLength sz) of
sized.cabal view
@@ -2,7 +2,7 @@ -- documentation, see http://haskell.org/cabal/users-guide/  name:                sized-version:             0.4.0.0+version:             0.5.0.0 synopsis:            Sized sequence data-types description:         A wrapper to make length-parametrized data-type from ListLike data-types. license:             BSD3@@ -14,7 +14,8 @@ build-type:          Simple -- extra-source-files:   cabal-version:       >=1.10-tested-with:         GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.2, GHC == 8.6.5, GHC == 8.8.2+tested-with:         GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.2,+                     GHC == 8.6.5, GHC == 8.8.3, GHC == 8.10.1  source-repository head   Type: git