1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173
|
4.3.16
* Fix example code for `every`
* Improved documentation for `ListT`
4.3.15
* Build against `ghc-9.0`
4.3.14
* Add `mapMaybe` and `wither`, and more laws for `filter` and `filterM`.
4.3.13
* Add `MonadFail` instance for `Proxy`
4.3.12
* Fix space leak introduced in version 4.3.10
* This leak primarily affects the use of `forever`
4.3.11
* Fix documentation for `scanM`
4.3.10
* Relax `Monad` constraints to `Functor`
* Support GHC 8.8
4.3.9
* Increase upper bound on `exceptions`
4.3.8
* Increase upper bound on `exceptions`
4.3.7
* Documentation fix
4.3.6
* Fix implementation of `pass` in `MonadWriter` instance for `Proxy`
4.3.5
* Support `Semigroup` being a super-class of `Monoid`
4.3.4
* Increase upper bound on `mmorph`
4.3.3
* Make `X` a synonym for `Data.Void.Void`
4.3.2
* BUG FIX: Fix `MMonad` instance for `ListT`
* The old instance was an infinite loop
4.3.1
* Support building against `ghc-7.4`
4.3.0
* BREAKING CHANGE: Remove `Alternative`/`MonadPlus` instances for `Proxy`
* See commit 08e7302f43dbf2a40bd367c5ee73ee3367e17768 which explains why
* Add `Traversable` instance for `ListT`
* New `MonadThrow`/`MonadCatch`/`MMonad`/`Semigroup`/`MonadZip` instances for
`ListT`
* New `MonadThrow`/`MonadCatch` instances for `Proxy`
* Fix lower bound on `mtl`
* Increase upper bound on `optparse-applicative`
4.2.0
* BREAKING CHANGE: Switch from `ErrorT` to `ExceptT`
* Add `Foldable` instance for `ListT`
* Fix all warnings
* Enable foldr/build fusion for `toList`
4.1.9
* Increase lower bound on `criterion`
* Increase upper bound on `transformers` for tests/benchmarks
* Optimize code by delaying `INLINABLE` annotations
4.1.8
* Increase upper bound on `transformers`
* Prepare for MRP (Monad of no Return Proposal)
4.1.7
* Increase lower bound on `deepseq`
* Add `unfoldr`
* Add `loop`
* Add `toListM'`
* Improve efficiency of `drop`
* License tutorial under Creative Commons license
4.1.6
* Increase lower bound on `base`
* Add diagrams to `Pipes.Core` documentation
* Add `mapM_`
* Add `takeWhile'`
* Add `seq`
* Improve efficiency of `toListM`
4.1.5
* Increase upper bound on `criterion`
4.1.4
* Increase upper bound on `criterion`
* Add `Monoid` instance for `Proxy`
4.1.3
* Increase lower bound on `mtl`
* Re-export `void`
* Add `fold'`
* Add `foldM'`
4.1.2
* Increase upper bounds on `transformers` and `mtl`
4.1.1
* Add `runListT`
* Add `MMonad` instance for `Proxy`
* Add `repeatM`
* Add laws to documentation of `Pipes.Prelude` utilities
4.1.0
* Remove Haskell98 support
* Use internal `X` type instead of `Data.Void`
* Document `Pipes.Lift` module:w
* Add `drain`
* Add `sequence`
4.0.2
* Improve performance of `each`
* Add tutorial appendix explaining how to work around quadratic time complexity
4.0.1
* Remove `WriterT` and `RWST` benchmarks
* Add `Enumerable` instance for `ErrorT`
* Add cabal flag for Haskell98 compilation
* Add several rewrite rules
* Add `mtl` instances for `ListT`
* Fix implementation of `pass`, which did not satisfy `Writer` laws
* Implement `fail` for `ListT`
* Add type synonym table to tutorial appendix
* Add QuickCheck tests for `pipes` laws
* Add `mapFoldable`
* Add `Monoid` instance for `ListT`
* Add manual proofs of `pipes` laws in `laws.md`
4.0.0
Major upgrade of `pipes` to no longer use `Proxy` type class
|