OLD | NEW |
| 1 ## 1.14.1 |
| 2 |
| 3 * Make `Equality` implementations accept `null` as argument to `hash`. |
| 4 |
| 5 ## 1.14.0 |
| 6 |
| 7 * Add `CombinedListView`, a view of several lists concatenated together. |
| 8 * Add `CombinedIterableView`, a view of several iterables concatenated together. |
| 9 * Add `CombinedMapView`, a view of several maps concatenated together. |
| 10 |
| 11 ## 1.13.0 |
| 12 |
| 13 * Add `EqualityBy` |
| 14 |
| 15 ## 1.12.0 |
| 16 |
| 17 * Add `CaseInsensitiveEquality`. |
| 18 |
| 19 * Fix bug in `equalsIgnoreAsciiCase`. |
| 20 |
| 21 ## 1.11.0 |
| 22 |
| 23 * Add `EqualityMap` and `EqualitySet` classes which use `Equality` objects for |
| 24 key and element equality, respectively. |
| 25 |
| 26 ## 1.10.1 |
| 27 |
| 28 * `Set.difference` now takes a `Set<Object>` as argument. |
| 29 |
| 30 ## 1.9.1 |
| 31 |
| 32 * Fix some documentation bugs. |
| 33 |
| 34 ## 1.9.0 |
| 35 |
| 36 * Add a top-level `stronglyConnectedComponents()` function that returns the |
| 37 strongly connected components in a directed graph. |
| 38 |
| 39 ## 1.8.0 |
| 40 |
| 41 * Add a top-level `mapMap()` function that works like `Iterable.map()` on a |
| 42 `Map`. |
| 43 |
| 44 * Add a top-level `mergeMaps()` function that creates a new map with the |
| 45 combined contents of two existing maps. |
| 46 |
| 47 * Add a top-level `groupBy()` function that converts an `Iterable` to a `Map` by |
| 48 grouping its elements using a function. |
| 49 |
| 50 * Add top-level `minBy()` and `maxBy()` functions that return the minimum and |
| 51 maximum values in an `Iterable`, respectively, ordered by a derived value. |
| 52 |
| 53 * Add a top-level `transitiveClosure()` function that returns the transitive |
| 54 closure of a directed graph. |
| 55 |
| 56 ## 1.7.0 |
| 57 |
| 58 * Add a `const UnmodifiableSetView.empty()` constructor. |
| 59 |
| 60 ## 1.6.0 |
| 61 |
| 62 * Add a `UnionSet` class that provides a view of the union of a set of sets. |
| 63 |
| 64 * Add a `UnionSetController` class that provides a convenient way to manage the |
| 65 contents of a `UnionSet`. |
| 66 |
| 67 * Fix another incorrectly-declared generic type. |
| 68 |
| 69 ## 1.5.1 |
| 70 |
| 71 * Fix an incorrectly-declared generic type. |
| 72 |
| 73 ## 1.5.0 |
| 74 |
| 75 * Add `DelegatingIterable.typed()`, `DelegatingList.typed()`, |
| 76 `DelegatingSet.typed()`, `DelegatingMap.typed()`, and |
| 77 `DelegatingQueue.typed()` static methods. These wrap untyped instances of |
| 78 these classes with the correct type parameter, and assert the types of values |
| 79 as they're accessed. |
| 80 |
| 81 * Fix the types for `binarySearch()` and `lowerBound()` so they no longer |
| 82 require all arguments to be comparable. |
| 83 |
| 84 * Add generic annotations to `insertionSort()` and `mergeSort()`. |
| 85 |
| 86 ## 1.4.1 |
| 87 |
| 88 * Fix all strong mode warnings. |
| 89 |
| 90 ## 1.4.0 |
| 91 |
| 92 * Add a `new PriorityQueue()` constructor that forwards to `new |
| 93 HeapPriorityQueue()`. |
| 94 |
| 95 * Deprecate top-level libraries other than `package:collection/collection.dart`, |
| 96 which exports these libraries' interfaces. |
| 97 |
| 98 ## 1.3.0 |
| 99 |
| 100 * Add `lowerBound` to binary search for values that might not be present. |
| 101 |
| 102 * Verify that the is valid for `CanonicalMap.[]`. |
| 103 |
1 ## 1.2.0 | 104 ## 1.2.0 |
2 | 105 |
3 * Add string comparators that ignore ASCII case and sort numbers numerically. | 106 * Add string comparators that ignore ASCII case and sort numbers numerically. |
4 | 107 |
5 ## 1.1.3 | 108 ## 1.1.3 |
6 | 109 |
7 * Fix type inconsistencies with `Map` and `Set`. | 110 * Fix type inconsistencies with `Map` and `Set`. |
8 | 111 |
9 ## 1.1.2 | 112 ## 1.1.2 |
10 | 113 |
(...skipping 16 matching lines...) Expand all Loading... |
27 | 130 |
28 * Fix all analyzer hints. | 131 * Fix all analyzer hints. |
29 | 132 |
30 ## 0.9.3 | 133 ## 0.9.3 |
31 | 134 |
32 * Add a `MapKeySet` class that exposes an unmodifiable `Set` view of a `Map`'s | 135 * Add a `MapKeySet` class that exposes an unmodifiable `Set` view of a `Map`'s |
33 keys. | 136 keys. |
34 | 137 |
35 * Add a `MapValueSet` class that takes a function from values to keys and uses | 138 * Add a `MapValueSet` class that takes a function from values to keys and uses |
36 it to expose a `Set` view of a `Map`'s values. | 139 it to expose a `Set` view of a `Map`'s values. |
OLD | NEW |