EdisonAPI 1.3 → 1.3.1

raw patch · 2 files changed

+6/−6 lines, 2 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Data.Edison.Seq.ListSeq: foldr1' :: (a -> a -> a) -> [a] -> a

+ Data.Edison.Seq.ListSeq: foldr1' :: (t -> t -> t) -> [t] -> t

- Data.Edison.Seq.ListSeq: foldrWithIndex' :: (Enum a1, Num a1) => (a1 -> t -> a -> a) -> a -> [t] -> a

+ Data.Edison.Seq.ListSeq: foldrWithIndex' :: (Num t2, Enum t2) => (t2 -> t1 -> t -> t) -> t -> [t1] -> t

Files

EdisonAPI.cabal +5/−5
src/Data/Edison.hs +1/−1

EdisonAPI.cabal view

@@ -1,19 +1,19 @@ Build-type:     Simple Name:           EdisonAPI-Cabal-Version:  >= 1.22-Version:        1.3-License:        OtherLicense+Cabal-Version:  >= 1.10+Version:        1.3.1+License:        MIT License-File:   COPYRIGHT Author:         Chris Okasaki Maintainer:     robdockins AT fastmail DOT fm-Synopsis:       A library of efficent, purely-functional data structures (API)+Synopsis:       A library of efficient, purely-functional data structures (API) Category:       Data Structures Homepage:	http://rwd.rdockins.name/edison/home/ Stability:      Stable Description:    Edison is a library of purely functional data structures written by    Chris Okasaki.  It is named after Thomas Alva Edison and for the-   mnemonic value EDiSon (Efficent Data Structures).+   mnemonic value EDiSon (Efficient Data Structures).    Edison provides several families of abstractions, each with    multiple implementations.  The main abstractions provided by Edison are:    Sequences such as stacks, queues, and dequeues;

src/Data/Edison.hs view

@@ -143,7 +143,7 @@ --   information.  Unless otherwise stated, these are amortized time complexities, assuming --   persistent usage of the datastructure.  Much of this data comes from: -----   Martin Holters. /Efficent Data Structures in a Lazy Functional Language/.  Master's Thesis.+--   Martin Holters. /Efficient Data Structures in a Lazy Functional Language/.  Master's Thesis. --   Chalmers University of Technology, Sweden. 2003. -- --   /Notes on unsafe functions:/