sublists 0.1.0.0 → 0.1.0.1

raw patch · 3 files changed

+7/−4 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• ChangeLog.md +5/−0
• Sublists.hs +0/−2
• sublists.cabal +2/−2

@@ -3,3 +3,8 @@ ## 0.1.0.0 -- 2021-03-03  * First version. Released on an unsuspecting world.++## 0.1.0.1 -- 2021-03-03++* First version revised A. Fixed issue with the incorrect statement in the documentation.+

@@ -16,8 +16,6 @@ the second argument being not already processed then the function reinitializes itself with the prior first argument and the rest of the unprocessed elements in the second argument. This leads to the *cycling behaviour*. -If the first argument is less than 1 then returns an infinite lazy list of the [] as its elements (probably not the needed case).- Similar functions are in the @list-grouping@ and @split@ packages, but they do not have cycling behaviour and have another realization. -} intoRegularSublists :: [Int] -> [a] -> [[a]] intoRegularSublists (n:ns) xs 

@@ -2,9 +2,9 @@ -- documentation, see http://haskell.org/cabal/users-guide/  name:                sublists-version:             0.1.0.0+version:             0.1.0.1 synopsis:            Allows to split lists into sublists with some patterns by quantity.-description:         This patterns can be a number, a list of numbers or obtained from the monadic function. Leads to somewhat cycling or regularized structures from the length perspective (this can be transformed into other variativity types).+description:         This patterns can be a list of numbers or obtained from the monadic function. Leads to somewhat cycling or regularized structures from the length perspective (this can be transformed into other variativity types). homepage:            https://hackage.haskell.org/package/sublists license:             MIT license-file:        LICENSE