Debian Codegraph @

.cargo/vendor/indexmap/RELEASES.md

raw
1 - 1.9.3
2
3 - Bump the `rustc-rayon` dependency, for compiler use only.
4
5 - 1.9.2
6
7 - `IndexMap` and `IndexSet` both implement `arbitrary::Arbitrary<'_>` and
8 `quickcheck::Arbitrary` if those optional dependency features are enabled.
9
10 - 1.9.1
11
12 - The MSRV now allows Rust 1.56.0 as well. However, currently `hashbrown`
13 0.12.1 requires 1.56.1, so users on 1.56.0 should downgrade that to 0.12.0
14 until there is a later published version relaxing its requirement.
15
16 - 1.9.0
17
18 - **MSRV**: Rust 1.56.1 or later is now required.
19
20 - The `hashbrown` dependency has been updated to version 0.12.
21
22 - `IterMut` and `ValuesMut` now implement `Debug`.
23
24 - The new `IndexMap::shrink_to` and `IndexSet::shrink_to` methods shrink
25 the capacity with a lower bound.
26
27 - The new `IndexMap::move_index` and `IndexSet::move_index` methods change
28 the position of an item from one index to another, shifting the items
29 between to accommodate the move.
30
31 - 1.8.2
32
33 - Bump the `rustc-rayon` dependency, for compiler use only.
34
35 - 1.8.1
36
37 - The new `IndexSet::replace_full` will return the index of the item along
38 with the replaced value, if any, by @zakcutner in PR [222].
39
40 [222]: https://github.com/bluss/indexmap/pull/222
41
42 - 1.8.0
43
44 - The new `IndexMap::into_keys` and `IndexMap::into_values` will consume
45 the map into keys or values, respectively, matching Rust 1.54's `HashMap`
46 methods, by @taiki-e in PR [195].
47
48 - More of the iterator types implement `Debug`, `ExactSizeIterator`, and
49 `FusedIterator`, by @cuviper in PR [196].
50
51 - `IndexMap` and `IndexSet` now implement rayon's `ParallelDrainRange`,
52 by @cuviper in PR [197].
53
54 - `IndexMap::with_hasher` and `IndexSet::with_hasher` are now `const`
55 functions, allowing static maps and sets, by @mwillsey in PR [203].
56
57 - `IndexMap` and `IndexSet` now implement `From` for arrays, matching
58 Rust 1.56's implementation for `HashMap`, by @rouge8 in PR [205].
59
60 - `IndexMap` and `IndexSet` now have methods `sort_unstable_keys`,
61 `sort_unstable_by`, `sorted_unstable_by`, and `par_*` equivalents,
62 which sort in-place without preserving the order of equal items, by
63 @bhgomes in PR [211].
64
65 [195]: https://github.com/bluss/indexmap/pull/195
66 [196]: https://github.com/bluss/indexmap/pull/196
67 [197]: https://github.com/bluss/indexmap/pull/197
68 [203]: https://github.com/bluss/indexmap/pull/203
69 [205]: https://github.com/bluss/indexmap/pull/205
70 [211]: https://github.com/bluss/indexmap/pull/211
71
72 - 1.7.0
73
74 - **MSRV**: Rust 1.49 or later is now required.
75
76 - The `hashbrown` dependency has been updated to version 0.11.
77
78 - 1.6.2
79
80 - Fixed to match `std` behavior, `OccupiedEntry::key` now references the
81 existing key in the map instead of the lookup key, by @cuviper in PR [170].
82
83 - The new `Entry::or_insert_with_key` matches Rust 1.50's `Entry` method,
84 passing `&K` to the callback to create a value, by @cuviper in PR [175].
85
86 [170]: https://github.com/bluss/indexmap/pull/170
87 [175]: https://github.com/bluss/indexmap/pull/175
88
89 - 1.6.1
90
91 - The new `serde_seq` module implements `IndexMap` serialization as a
92 sequence to ensure order is preserved, by @cuviper in PR [158].
93
94 - New methods on maps and sets work like the `Vec`/slice methods by the same name:
95 `truncate`, `split_off`, `first`, `first_mut`, `last`, `last_mut`, and
96 `swap_indices`, by @cuviper in PR [160].
97
98 [158]: https://github.com/bluss/indexmap/pull/158
99 [160]: https://github.com/bluss/indexmap/pull/160
100
101 - 1.6.0
102
103 - **MSRV**: Rust 1.36 or later is now required.
104
105 - The `hashbrown` dependency has been updated to version 0.9.
106
107 - 1.5.2
108
109 - The new "std" feature will force the use of `std` for users that explicitly
110 want the default `S = RandomState`, bypassing the autodetection added in 1.3.0,
111 by @cuviper in PR [145].
112
113 [145]: https://github.com/bluss/indexmap/pull/145
114
115 - 1.5.1
116
117 - Values can now be indexed by their `usize` position by @cuviper in PR [132].
118
119 - Some of the generic bounds have been relaxed to match `std` by @cuviper in PR [141].
120
121 - `drain` now accepts any `R: RangeBounds<usize>` by @cuviper in PR [142].
122
123 [132]: https://github.com/bluss/indexmap/pull/132
124 [141]: https://github.com/bluss/indexmap/pull/141
125 [142]: https://github.com/bluss/indexmap/pull/142
126
127 - 1.5.0
128
129 - **MSRV**: Rust 1.32 or later is now required.
130
131 - The inner hash table is now based on `hashbrown` by @cuviper in PR [131].
132 This also completes the method `reserve` and adds `shrink_to_fit`.
133
134 - Add new methods `get_key_value`, `remove_entry`, `swap_remove_entry`,
135 and `shift_remove_entry`, by @cuviper in PR [136]
136
137 - `Clone::clone_from` reuses allocations by @cuviper in PR [125]
138
139 - Add new method `reverse` by @linclelinkpart5 in PR [128]
140
141 [125]: https://github.com/bluss/indexmap/pull/125
142 [128]: https://github.com/bluss/indexmap/pull/128
143 [131]: https://github.com/bluss/indexmap/pull/131
144 [136]: https://github.com/bluss/indexmap/pull/136
145
146 - 1.4.0
147
148 - Add new method `get_index_of` by @Thermatrix in PR [115] and [120]
149
150 - Fix build script rebuild-if-changed configuration to use "build.rs";
151 fixes issue [123]. Fix by @cuviper.
152
153 - Dev-dependencies (rand and quickcheck) have been updated. The crate's tests
154 now run using Rust 1.32 or later (MSRV for building the crate has not changed).
155 by @kjeremy and @bluss
156
157 [123]: https://github.com/bluss/indexmap/issues/123
158 [115]: https://github.com/bluss/indexmap/pull/115
159 [120]: https://github.com/bluss/indexmap/pull/120
160
161 - 1.3.2
162
163 - Maintenance update to regenerate the published `Cargo.toml`.
164
165 - 1.3.1
166
167 - Maintenance update for formatting and `autocfg` 1.0.
168
169 - 1.3.0
170
171 - The deprecation messages in the previous version have been removed.
172 (The methods have not otherwise changed.) Docs for removal methods have been
173 improved.
174 - From Rust 1.36, this crate supports being built **without std**, requiring
175 `alloc` instead. This is enabled automatically when it is detected that
176 `std` is not available. There is no crate feature to enable/disable to
177 trigger this. The new build-dep `autocfg` enables this.
178
179 - 1.2.0
180
181 - Plain `.remove()` now has a deprecation message, it informs the user
182 about picking one of the removal functions `swap_remove` and `shift_remove`
183 which have different performance and order semantics.
184 Plain `.remove()` will not be removed, the warning message and method
185 will remain until further.
186
187 - Add new method `shift_remove` for order preserving removal on the map,
188 and `shift_take` for the corresponding operation on the set.
189
190 - Add methods `swap_remove`, `swap_remove_entry` to `Entry`.
191
192 - Fix indexset/indexmap to support full paths, like `indexmap::indexmap!()`
193
194 - Internal improvements: fix warnings, deprecations and style lints
195
196 - 1.1.0
197
198 - Added optional feature `"rayon"` that adds parallel iterator support
199 to `IndexMap` and `IndexSet` using Rayon. This includes all the regular
200 iterators in parallel versions, and parallel sort.
201
202 - Implemented `Clone` for `map::{Iter, Keys, Values}` and
203 `set::{Difference, Intersection, Iter, SymmetricDifference, Union}`
204
205 - Implemented `Debug` for `map::{Entry, IntoIter, Iter, Keys, Values}` and
206 `set::{Difference, Intersection, IntoIter, Iter, SymmetricDifference, Union}`
207
208 - Serde trait `IntoDeserializer` are implemented for `IndexMap` and `IndexSet`.
209
210 - Minimum Rust version requirement increased to Rust 1.30 for development builds.
211
212 - 1.0.2
213
214 - The new methods `IndexMap::insert_full` and `IndexSet::insert_full` are
215 both like `insert` with the index included in the return value.
216
217 - The new method `Entry::and_modify` can be used to modify occupied
218 entries, matching the new methods of `std` maps in Rust 1.26.
219
220 - The new method `Entry::or_default` inserts a default value in unoccupied
221 entries, matching the new methods of `std` maps in Rust 1.28.
222
223 - 1.0.1
224
225 - Document Rust version policy for the crate (see rustdoc)
226
227 - 1.0.0
228
229 - This is the 1.0 release for `indexmap`! (the crate and datastructure
230 formerly known as “ordermap”)
231 - `OccupiedEntry::insert` changed its signature, to use `&mut self` for
232 the method receiver, matching the equivalent method for a standard
233 `HashMap`. Thanks to @dtolnay for finding this bug.
234 - The deprecated old names from ordermap were removed: `OrderMap`,
235 `OrderSet`, `ordermap!{}`, `orderset!{}`. Use the new `IndexMap`
236 etc names instead.
237
238 - 0.4.1
239
240 - Renamed crate to `indexmap`; the `ordermap` crate is now deprecated
241 and the types `OrderMap/Set` now have a deprecation notice.
242
243 - 0.4.0
244
245 - This is the last release series for this `ordermap` under that name,
246 because the crate is **going to be renamed** to `indexmap` (with types
247 `IndexMap`, `IndexSet`) and no change in functionality!
248 - The map and its associated structs moved into the `map` submodule of the
249 crate, so that the map and set are symmetric
250
251 + The iterators, `Entry` and other structs are now under `ordermap::map::`
252
253 - Internally refactored `OrderMap<K, V, S>` so that all the main algorithms
254 (insertion, lookup, removal etc) that don't use the `S` parameter (the
255 hasher) are compiled without depending on `S`, which reduces generics bloat.
256
257 - `Entry<K, V>` no longer has a type parameter `S`, which is just like
258 the standard `HashMap`'s entry.
259
260 - Minimum Rust version requirement increased to Rust 1.18
261
262 - 0.3.5
263
264 - Documentation improvements
265
266 - 0.3.4
267
268 - The `.retain()` methods for `OrderMap` and `OrderSet` now
269 traverse the elements in order, and the retained elements **keep their order**
270 - Added new methods `.sort_by()`, `.sort_keys()` to `OrderMap` and
271 `.sort_by()`, `.sort()` to `OrderSet`. These methods allow you to
272 sort the maps in place efficiently.
273
274 - 0.3.3
275
276 - Document insertion behaviour better by @lucab
277 - Updated dependences (no feature changes) by @ignatenkobrain
278
279 - 0.3.2
280
281 - Add `OrderSet` by @cuviper!
282 - `OrderMap::drain` is now (too) a double ended iterator.
283
284 - 0.3.1
285
286 - In all ordermap iterators, forward the `collect` method to the underlying
287 iterator as well.
288 - Add crates.io categories.
289
290 - 0.3.0
291
292 - The methods `get_pair`, `get_pair_index` were both replaced by
293 `get_full` (and the same for the mutable case).
294 - Method `swap_remove_pair` replaced by `swap_remove_full`.
295 - Add trait `MutableKeys` for opt-in mutable key access. Mutable key access
296 is only possible through the methods of this extension trait.
297 - Add new trait `Equivalent` for key equivalence. This extends the
298 `Borrow` trait mechanism for `OrderMap::get` in a backwards compatible
299 way, just some minor type inference related issues may become apparent.
300 See [#10] for more information.
301 - Implement `Extend<(&K, &V)>` by @xfix.
302
303 [#10]: https://github.com/bluss/ordermap/pull/10
304
305 - 0.2.13
306
307 - Fix deserialization to support custom hashers by @Techcable.
308 - Add methods `.index()` on the entry types by @garro95.
309
310 - 0.2.12
311
312 - Add methods `.with_hasher()`, `.hasher()`.
313
314 - 0.2.11
315
316 - Support `ExactSizeIterator` for the iterators. By @Binero.
317 - Use `Box<[Pos]>` internally, saving a word in the `OrderMap` struct.
318 - Serde support, with crate feature `"serde-1"`. By @xfix.
319
320 - 0.2.10
321
322 - Add iterator `.drain(..)` by @stevej.
323
324 - 0.2.9
325
326 - Add method `.is_empty()` by @overvenus.
327 - Implement `PartialEq, Eq` by @overvenus.
328 - Add method `.sorted_by()`.
329
330 - 0.2.8
331
332 - Add iterators `.values()` and `.values_mut()`.
333 - Fix compatibility with 32-bit platforms.
334
335 - 0.2.7
336
337 - Add `.retain()`.
338
339 - 0.2.6
340
341 - Add `OccupiedEntry::remove_entry` and other minor entry methods,
342 so that it now has all the features of `HashMap`'s entries.
343
344 - 0.2.5
345
346 - Improved `.pop()` slightly.
347
348 - 0.2.4
349
350 - Improved performance of `.insert()` ([#3]) by @pczarn.
351
352 [#3]: https://github.com/bluss/ordermap/pull/3
353
354 - 0.2.3
355
356 - Generalize `Entry` for now, so that it works on hashmaps with non-default
357 hasher. However, there's a lingering compat issue since libstd `HashMap`
358 does not parameterize its entries by the hasher (`S` typarm).
359 - Special case some iterator methods like `.nth()`.
360
361 - 0.2.2
362
363 - Disable the verbose `Debug` impl by default.
364
365 - 0.2.1
366
367 - Fix doc links and clarify docs.
368
369 - 0.2.0
370
371 - Add more `HashMap` methods & compat with its API.
372 - Experimental support for `.entry()` (the simplest parts of the API).
373 - Add `.reserve()` (placeholder impl).
374 - Add `.remove()` as synonym for `.swap_remove()`.
375 - Changed `.insert()` to swap value if the entry already exists, and
376 return `Option`.
377 - Experimental support as an *indexed* hash map! Added methods
378 `.get_index()`, `.get_index_mut()`, `.swap_remove_index()`,
379 `.get_pair_index()`, `.get_pair_index_mut()`.
380
381 - 0.1.2
382
383 - Implement the 32/32 split idea for `Pos` which improves cache utilization
384 and lookup performance.
385
386 - 0.1.1
387
388 - Initial release.