|
22 | 22 | least 2 entries with equal keys. (Soumik Sarkar)
|
23 | 23 | ([#1023](https://github.com/haskell/containers/pull/1023))
|
24 | 24 |
|
25 |
| -* `Data.Set.fold` and `Data.IntSet.fold` have long been documented as |
26 |
| - deprecated and are now marked as such. They will be removed in a future |
27 |
| - release. (Soumik Sarkar) |
| 25 | +* `Data.Set.fold` and `Data.IntSet.fold` are deprecated. One should instead use |
| 26 | + `Data.Set.foldr` and `Data.IntSet.foldr`. (Soumik Sarkar) |
28 | 27 | ([#1049](https://github.com/haskell/containers/pull/1049))
|
29 | 28 |
|
30 | 29 | * For `Data.IntMap.{Lazy,Strict}`, `updateMin`, `updateMax`, `updateMinWithKey`,
|
|
37 | 36 | structures in the library. (Soumik Sarkar)
|
38 | 37 | ([#1077](https://github.com/haskell/containers/pull/1077))
|
39 | 38 |
|
40 |
| -* Various deprecated functions, whose definitions currently cause type errors, |
| 39 | +* Some long deprecated functions, whose definitions currently cause type errors, |
41 | 40 | have been removed. (Soumik Sarkar)
|
42 | 41 | ([#1046](https://github.com/haskell/containers/pull/1046))
|
43 | 42 |
|
|
104 | 103 | ### Performance improvements
|
105 | 104 |
|
106 | 105 | * The internal representations of `IntMap` and `IntSet` have been changed
|
107 |
| - to be a little more memory efficient. (Soumik Sarkar) |
| 106 | + to be a little more memory efficient. Consequently, many functions on |
| 107 | + `IntMap`s and `IntSet`s are a little faster now. (Soumik Sarkar) |
108 | 108 | ([#995](https://github.com/haskell/containers/pull/995),
|
109 | 109 | [#998](https://github.com/haskell/containers/pull/998))
|
110 | 110 |
|
111 | 111 | * Improved performance for `Data.Map`'s `minViewSure` and `maxViewSure`.
|
112 | 112 | (Soumik Sarkar) ([#1001](https://github.com/haskell/containers/pull/1001))
|
113 | 113 |
|
114 | 114 | * For `Data.Graph.SCC`, `Foldable.toList` and `Foldable1.toNonEmpty` now
|
115 |
| - do not perform a copy. (Soumik Sarkar) |
| 115 | + do not perform an unnecessary copy. (Soumik Sarkar) |
116 | 116 | ([#1057](https://github.com/haskell/containers/pull/1057))
|
117 | 117 |
|
118 | 118 | * Improved performance for `Data.Intset`'s `foldr`, `foldl'`, `foldl`, `foldr'`.
|
|
191 | 191 | [#1094](https://github.com/haskell/containers/pull/1094),
|
192 | 192 | [#1095](https://github.com/haskell/containers/pull/1095),
|
193 | 193 | [#1097](https://github.com/haskell/containers/pull/1097),
|
194 |
| - [#1103](https://github.com/haskell/containers/pull/1103)) |
| 194 | + [#1103](https://github.com/haskell/containers/pull/1103), |
| 195 | + [#1117](https://github.com/haskell/containers/pull/1117)) |
195 | 196 |
|
196 | 197 | * Add new tests and benchmarks (Soumik Sarkar)
|
197 | 198 | ([#962](https://github.com/haskell/containers/pull/962),
|
|
0 commit comments