Lines Matching +full:build +full:- +full:msrv
1 - 1.9.2
3 - `IndexMap` and `IndexSet` both implement `arbitrary::Arbitrary<'_>` and
6 - 1.9.1
8 - The MSRV now allows Rust 1.56.0 as well. However, currently `hashbrown`
12 - 1.9.0
14 - **MSRV**: Rust 1.56.1 or later is now required.
16 - The `hashbrown` dependency has been updated to version 0.12.
18 - `IterMut` and `ValuesMut` now implement `Debug`.
20 - The new `IndexMap::shrink_to` and `IndexSet::shrink_to` methods shrink
23 - The new `IndexMap::move_index` and `IndexSet::move_index` methods change
27 - 1.8.2
29 - Bump the `rustc-rayon` dependency, for compiler use only.
31 - 1.8.1
33 - The new `IndexSet::replace_full` will return the index of the item along
38 - 1.8.0
40 - The new `IndexMap::into_keys` and `IndexMap::into_values` will consume
42 methods, by @taiki-e in PR [195].
44 - More of the iterator types implement `Debug`, `ExactSizeIterator`, and
47 - `IndexMap` and `IndexSet` now implement rayon's `ParallelDrainRange`,
50 - `IndexMap::with_hasher` and `IndexSet::with_hasher` are now `const`
53 - `IndexMap` and `IndexSet` now implement `From` for arrays, matching
56 - `IndexMap` and `IndexSet` now have methods `sort_unstable_keys`,
58 which sort in-place without preserving the order of equal items, by
68 - 1.7.0
70 - **MSRV**: Rust 1.49 or later is now required.
72 - The `hashbrown` dependency has been updated to version 0.11.
74 - 1.6.2
76 - Fixed to match `std` behavior, `OccupiedEntry::key` now references the
79 - The new `Entry::or_insert_with_key` matches Rust 1.50's `Entry` method,
85 - 1.6.1
87 - The new `serde_seq` module implements `IndexMap` serialization as a
90 - New methods on maps and sets work like the `Vec`/slice methods by the same name:
97 - 1.6.0
99 - **MSRV**: Rust 1.36 or later is now required.
101 - The `hashbrown` dependency has been updated to version 0.9.
103 - 1.5.2
105 - The new "std" feature will force the use of `std` for users that explicitly
111 - 1.5.1
113 - Values can now be indexed by their `usize` position by @cuviper in PR [132].
115 - Some of the generic bounds have been relaxed to match `std` by @cuviper in PR [141].
117 - `drain` now accepts any `R: RangeBounds<usize>` by @cuviper in PR [142].
123 - 1.5.0
125 - **MSRV**: Rust 1.32 or later is now required.
127 - The inner hash table is now based on `hashbrown` by @cuviper in PR [131].
130 - Add new methods `get_key_value`, `remove_entry`, `swap_remove_entry`,
133 - `Clone::clone_from` reuses allocations by @cuviper in PR [125]
135 - Add new method `reverse` by @linclelinkpart5 in PR [128]
142 - 1.4.0
144 - Add new method `get_index_of` by @Thermatrix in PR [115] and [120]
146 - Fix build script rebuild-if-changed configuration to use "build.rs";
149 - Dev-dependencies (rand and quickcheck) have been updated. The crate's tests
150 now run using Rust 1.32 or later (MSRV for building the crate has not changed).
157 - 1.3.2
159 - Maintenance update to regenerate the published `Cargo.toml`.
161 - 1.3.1
163 - Maintenance update for formatting and `autocfg` 1.0.
165 - 1.3.0
167 - The deprecation messages in the previous version have been removed.
170 - From Rust 1.36, this crate supports being built **without std**, requiring
173 trigger this. The new build-dep `autocfg` enables this.
175 - 1.2.0
177 - Plain `.remove()` now has a deprecation message, it informs the user
183 - Add new method `shift_remove` for order preserving removal on the map,
186 - Add methods `swap_remove`, `swap_remove_entry` to `Entry`.
188 - Fix indexset/indexmap to support full paths, like `indexmap::indexmap!()`
190 - Internal improvements: fix warnings, deprecations and style lints
192 - 1.1.0
194 - Added optional feature `"rayon"` that adds parallel iterator support
198 - Implemented `Clone` for `map::{Iter, Keys, Values}` and
201 - Implemented `Debug` for `map::{Entry, IntoIter, Iter, Keys, Values}` and
204 - Serde trait `IntoDeserializer` are implemented for `IndexMap` and `IndexSet`.
206 - Minimum Rust version requirement increased to Rust 1.30 for development builds.
208 - 1.0.2
210 - The new methods `IndexMap::insert_full` and `IndexSet::insert_full` are
213 - The new method `Entry::and_modify` can be used to modify occupied
216 - The new method `Entry::or_default` inserts a default value in unoccupied
219 - 1.0.1
221 - Document Rust version policy for the crate (see rustdoc)
223 - 1.0.0
225 - This is the 1.0 release for `indexmap`! (the crate and datastructure
227 - `OccupiedEntry::insert` changed its signature, to use `&mut self` for
230 - The deprecated old names from ordermap were removed: `OrderMap`,
234 - 0.4.1
236 - Renamed crate to `indexmap`; the `ordermap` crate is now deprecated
239 - 0.4.0
241 - This is the last release series for this `ordermap` under that name,
244 - The map and its associated structs moved into the `map` submodule of the
249 - Internally refactored `OrderMap<K, V, S>` so that all the main algorithms
253 - `Entry<K, V>` no longer has a type parameter `S`, which is just like
256 - Minimum Rust version requirement increased to Rust 1.18
258 - 0.3.5
260 - Documentation improvements
262 - 0.3.4
264 - The `.retain()` methods for `OrderMap` and `OrderSet` now
266 - Added new methods `.sort_by()`, `.sort_keys()` to `OrderMap` and
270 - 0.3.3
272 - Document insertion behaviour better by @lucab
273 - Updated dependences (no feature changes) by @ignatenkobrain
275 - 0.3.2
277 - Add `OrderSet` by @cuviper!
278 - `OrderMap::drain` is now (too) a double ended iterator.
280 - 0.3.1
282 - In all ordermap iterators, forward the `collect` method to the underlying
284 - Add crates.io categories.
286 - 0.3.0
288 - The methods `get_pair`, `get_pair_index` were both replaced by
290 - Method `swap_remove_pair` replaced by `swap_remove_full`.
291 - Add trait `MutableKeys` for opt-in mutable key access. Mutable key access
293 - Add new trait `Equivalent` for key equivalence. This extends the
297 - Implement `Extend<(&K, &V)>` by @xfix.
301 - 0.2.13
303 - Fix deserialization to support custom hashers by @Techcable.
304 - Add methods `.index()` on the entry types by @garro95.
306 - 0.2.12
308 - Add methods `.with_hasher()`, `.hasher()`.
310 - 0.2.11
312 - Support `ExactSizeIterator` for the iterators. By @Binero.
313 - Use `Box<[Pos]>` internally, saving a word in the `OrderMap` struct.
314 - Serde support, with crate feature `"serde-1"`. By @xfix.
316 - 0.2.10
318 - Add iterator `.drain(..)` by @stevej.
320 - 0.2.9
322 - Add method `.is_empty()` by @overvenus.
323 - Implement `PartialEq, Eq` by @overvenus.
324 - Add method `.sorted_by()`.
326 - 0.2.8
328 - Add iterators `.values()` and `.values_mut()`.
329 - Fix compatibility with 32-bit platforms.
331 - 0.2.7
333 - Add `.retain()`.
335 - 0.2.6
337 - Add `OccupiedEntry::remove_entry` and other minor entry methods,
340 - 0.2.5
342 - Improved `.pop()` slightly.
344 - 0.2.4
346 - Improved performance of `.insert()` ([#3]) by @pczarn.
350 - 0.2.3
352 - Generalize `Entry` for now, so that it works on hashmaps with non-default
355 - Special case some iterator methods like `.nth()`.
357 - 0.2.2
359 - Disable the verbose `Debug` impl by default.
361 - 0.2.1
363 - Fix doc links and clarify docs.
365 - 0.2.0
367 - Add more `HashMap` methods & compat with its API.
368 - Experimental support for `.entry()` (the simplest parts of the API).
369 - Add `.reserve()` (placeholder impl).
370 - Add `.remove()` as synonym for `.swap_remove()`.
371 - Changed `.insert()` to swap value if the entry already exists, and
373 - Experimental support as an *indexed* hash map! Added methods
377 - 0.1.2
379 - Implement the 32/32 split idea for `Pos` which improves cache utilization
382 - 0.1.1
384 - Initial release.