data-cycle 0.1.0 → 0.1.1

raw patch · 2 files changed

+5/−8 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• Data/Cycle.hs +4/−7
• data-cycle.cabal +1/−1

@@ -34,13 +34,9 @@ --   To extract all cycle elements, use 'Data.Collections.toList'. You can --   also create an infinite list with 'cycleToInfiniteList'. -----   The functions 'Data.Collections.front' and 'Data.Collections.back' ---   fail with 'error' for empty cycles.------   'Data.Collections.take', 'Data.Collections.drop' and---   'Data.Collections.splitAt' fail with 'error' for empty cycles if their---   first argument is not 0. They also accept negative values for working---   backwards (see 'takeLR' and 'dropLR' for details).+--   'Data.Collections.take', 'Data.Collections.drop' and 'Data.Collections.splitAt'+--   also accept negative values for working backwards (see 'takeLR' and 'dropLR' +--   for details). -- --   In general, any function @f@ working on --   @[a]@ can be adapted for @Cycle a@ by writing @fromList . f . toList@.@@ -183,6 +179,7 @@ --   > take n = fromList . takeLR n takeLR :: Int -> Cycle a -> [a] takeLR n c+  | null c = []   | n < 0 = takeLeft (negate n) c   | otherwise = takeRight n c 

@@ -7,7 +7,7 @@ -- The package version. See the Haskell package versioning policy -- (http://www.haskell.org/haskellwiki/Package_versioning_policy) for -- standards guiding when and how versions should be incremented.-Version:             0.1.0+Version:             0.1.1  -- A short (one-line) description of the package. Synopsis:            a cyclic doubly linked list