strict-list 1.0.0.0 → 1.0.0.1

raw patch · 3 files changed

+6/−3 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• README.md +3/−0
• library/StrictList.hs +2/−2
• strict-list.cabal +1/−1

@@ -1,5 +1,8 @@ # strict-list +[![Hackage](https://img.shields.io/hackage/v/strict-list.svg)](https://hackage.haskell.org/package/strict-list)+[![Continuous Haddock](https://img.shields.io/badge/haddock-master-blue)](https://nikita-volkov.github.io/strict-list/)+ Strict linked lists for Haskell, with stack-safe operations and reversed-order helpers for efficient intermediate work.  ## Example

@@ -2,8 +2,8 @@ -- Definitions of strict linked list. -- -- Most basic operations like `fmap`, `filter`, `<*>`--- can only be implemented efficiently by producing an intermediate list in reversed order--- and then reversing it to the original order.+-- are implemented efficiently by producing an intermediate list in reversed order+-- and then reversing it to the original order to avoid stack recursion. -- These intermediate reversed functions are exposed by the API, -- because they very well may be useful for efficient implementations of data-structures built on top of list. -- E.g., the <http://hackage.haskell.org/package/deque "deque"> package exploits them heavily.

@@ -1,6 +1,6 @@ cabal-version: 3.0 name: strict-list-version: 1.0.0.0+version: 1.0.0.1 synopsis: Strict linked list with stack-safe operations description:   A strict linked list with stack-safe operations and reversed-order helpers.