YoloDev / rstml-component

MIT License
4 stars 2 forks source link

deps: update rust crate indexmap to 2.2.6 - autoclosed #34

Closed renovate[bot] closed 6 months ago

renovate[bot] commented 6 months ago

Mend Renovate

This PR contains the following updates:

Package Type Update Change
indexmap dependencies minor 2 -> 2.2.6

Release Notes

indexmap-rs/indexmap (indexmap) ### [`v2.2.6`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#226) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.2.5...2.2.6) - Added trait `MutableValues` for opt-in mutable access to set values. ### [`v2.2.5`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#225) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.2.4...2.2.5) - Added optional `borsh` serialization support. ### [`v2.2.4`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#224) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.2.3...2.2.4) - Added an `insert_sorted` method on `IndexMap`, `IndexSet`, and `VacantEntry`. - Avoid hashing for lookups in single-entry maps. - Limit preallocated memory in `serde` deserializers. ### [`v2.2.3`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#223) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.2.2...2.2.3) - Added `move_index` and `swap_indices` methods to `IndexedEntry`, `OccupiedEntry`, and `RawOccupiedEntryMut`, functioning like the existing methods on `IndexMap`. - Added `shift_insert` methods on `VacantEntry` and `RawVacantEntryMut`, as well as `shift_insert_hashed_nocheck` on the latter, to insert the new entry at a particular index. - Added `shift_insert` methods on `IndexMap` and `IndexSet` to insert a new entry at a particular index, or else move an existing entry there. ### [`v2.2.2`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#222) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.2.1...2.2.2) - Added indexing methods to raw entries: `RawEntryBuilder::from_hash_full`, `RawEntryBuilder::index_from_hash`, and `RawEntryMut::index`. ### [`v2.2.1`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#221) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.2.0...2.2.1) - Corrected the signature of `RawOccupiedEntryMut::into_key(self) -> &'a mut K`, This a breaking change from 2.2.0, but that version was published for less than a day and has now been yanked. ### [`v2.2.0`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#220) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.1.0...2.2.0) - The new `IndexMap::get_index_entry` method finds an entry by its index for in-place manipulation. - The `Keys` iterator now implements `Index` for quick access to the entry's key, compared to indexing the map to get the value. - The new `IndexMap::splice` and `IndexSet::splice` methods will drain the given range as an iterator, and then replace that range with entries from an input iterator. - The new trait `RawEntryApiV1` offers opt-in access to a raw entry API for `IndexMap`, corresponding to the unstable API on `HashSet` as of Rust 1.75. - Many `IndexMap` and `IndexSet` methods have relaxed their type constraints, e.g. removing `K: Hash` on methods that don't actually need to hash. - Removal methods `remove`, `remove_entry`, and `take` are now deprecated in favor of their `shift_` or `swap_` prefixed variants, which are more explicit about their effect on the index and order of remaining items. The deprecated methods will remain to guide drop-in replacements from `HashMap` and `HashSet` toward the prefixed methods. ### [`v2.1.0`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#210) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.0.2...2.1.0) - Empty slices can now be created with `map::Slice::{new, new_mut}` and `set::Slice::new`. In addition, `Slice::new`, `len`, and `is_empty` are now `const` functions on both types. - `IndexMap`, `IndexSet`, and their respective `Slice`s all have binary search methods for sorted data: map `binary_search_keys` and set `binary_search` for plain comparison, `binary_search_by` for custom comparators, `binary_search_by_key` for key extraction, and `partition_point` for boolean conditions. ### [`v2.0.2`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#202) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.0.1...2.0.2) - The `hashbrown` dependency has been updated to version 0.14.1 to complete the support for Rust 1.63. ### [`v2.0.1`](https://togithub.com/indexmap-rs/indexmap/blob/HEAD/RELEASES.md#201) [Compare Source](https://togithub.com/indexmap-rs/indexmap/compare/2.0.0...2.0.1) - **MSRV**: Rust 1.63.0 is now supported as well, pending publication of `hashbrown`'s relaxed MSRV (or use cargo `--ignore-rust-version`).

Configuration

📅 Schedule: Branch creation - At any time (no schedule defined), Automerge - At any time (no schedule defined).

🚦 Automerge: Disabled by config. Please merge this manually once you are satisfied.

Rebasing: Whenever PR becomes conflicted, or you tick the rebase/retry checkbox.

🔕 Ignore: Close this PR and you won't be reminded about this update again.



This PR has been generated by Mend Renovate. View repository job log here.

kodiakhq[bot] commented 6 months ago

This PR currently has a merge conflict. Please resolve this and then re-add the automerge label.