-
Notifications
You must be signed in to change notification settings - Fork 9
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
chore(deps): update dependencies (major changes) (major) #61
base: main
Are you sure you want to change the base?
Conversation
345cbb0
to
1858a04
Compare
1858a04
to
b1ec2bc
Compare
b1ec2bc
to
8a31fdd
Compare
8a31fdd
to
3c0f0dd
Compare
⚠ Artifact update problemRenovate failed to update an artifact related to this branch. You probably do not want to merge this PR as-is. ♻ Renovate will retry this branch, including artifacts, only when one of the following happens:
The artifact failure details are included below: File name: Cargo.lock
|
e05d0a3
to
8e63d84
Compare
8e63d84
to
84ecc51
Compare
666ef46
to
205bff2
Compare
205bff2
to
6206c91
Compare
6206c91
to
96d1e9e
Compare
96d1e9e
to
fc98dfe
Compare
|
fc98dfe
to
19152a2
Compare
This PR contains the following updates:
1.9.3
->2.0.0
~1.0.40
->~2.0.0
~4.4
->~7.0.0
Release Notes
indexmap-rs/indexmap (indexmap)
v2.6.0
Compare Source
Clone
formap::IntoIter
andset::IntoIter
.hashbrown
dependency to version 0.15.v2.5.0
Compare Source
insert_before
method toIndexMap
andIndexSet
, as analternative to
shift_insert
with different behavior on existing entries.first_entry
andlast_entry
methods toIndexMap
.From
implementations betweenIndexedEntry
andOccupiedEntry
.v2.4.0
Compare Source
IndexMap::append
andIndexSet::append
, moving all items fromone map or set into another, and leaving the original capacity for reuse.
v2.3.0
Compare Source
MutableEntryKey
for opt-in mutable access to map entry keys.MutableKeys::iter_mut2
for opt-in mutable iteration of mapkeys and values.
v2.2.6
Compare Source
MutableValues
for opt-in mutable access to set values.v2.2.5
Compare Source
borsh
serialization support.v2.2.4
Compare Source
insert_sorted
method onIndexMap
,IndexSet
, andVacantEntry
.serde
deserializers.v2.2.3
Compare Source
move_index
andswap_indices
methods toIndexedEntry
,OccupiedEntry
, andRawOccupiedEntryMut
, functioning like the existingmethods on
IndexMap
.shift_insert
methods onVacantEntry
andRawVacantEntryMut
, aswell as
shift_insert_hashed_nocheck
on the latter, to insert the new entryat a particular index.
shift_insert
methods onIndexMap
andIndexSet
to insert a newentry at a particular index, or else move an existing entry there.
v2.2.2
Compare Source
RawEntryBuilder::from_hash_full
,RawEntryBuilder::index_from_hash
, andRawEntryMut::index
.v2.2.1
Compare Source
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
Compare Source
The new
IndexMap::get_index_entry
method finds an entry by its index forin-place manipulation.
The
Keys
iterator now implementsIndex<usize>
for quick access to theentry's key, compared to indexing the map to get the value.
The new
IndexMap::splice
andIndexSet::splice
methods will drain thegiven 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 forIndexMap
, corresponding to the unstable API onHashSet
as of Rust 1.75.Many
IndexMap
andIndexSet
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
, andtake
are now deprecatedin favor of their
shift_
orswap_
prefixed variants, which are moreexplicit about their effect on the index and order of remaining items.
The deprecated methods will remain to guide drop-in replacements from
HashMap
andHashSet
toward the prefixed methods.v2.1.0
Compare Source
Empty slices can now be created with
map::Slice::{new, new_mut}
andset::Slice::new
. In addition,Slice::new
,len
, andis_empty
arenow
const
functions on both types.IndexMap
,IndexSet
, and their respectiveSlice
s all have binarysearch methods for sorted data: map
binary_search_keys
and setbinary_search
for plain comparison,binary_search_by
for customcomparators,
binary_search_by_key
for key extraction, andpartition_point
for boolean conditions.v2.0.2
Compare Source
hashbrown
dependency has been updated to version 0.14.1 tocomplete the support for Rust 1.63.
v2.0.1
Compare Source
hashbrown
's relaxed MSRV (or use cargo--ignore-rust-version
).v2.0.0
Compare Source
MSRV: Rust 1.64.0 or later is now required.
The
"std"
feature is no longer auto-detected. It is included in thedefault feature set, or else can be enabled like any other Cargo feature.
The
"serde-1"
feature has been removed, leaving just the optional"serde"
dependency to be enabled like a feature itself.IndexMap::get_index_mut
now returnsOption<(&K, &mut V)>
, changingthe key part from
&mut K
to&K
. There is also a new alternativeMutableKeys::get_index_mut2
to access the former behavior.The new
map::Slice<K, V>
andset::Slice<T>
offer a linear view of mapsand sets, behaving a lot like normal
[(K, V)]
and[T]
slices. Notably,comparison traits like
Eq
only consider items in order, rather than hashlookups, and slices even implement
Hash
.IndexMap
andIndexSet
now havesort_by_cached_key
andpar_sort_by_cached_key
methods which perform stable sorts in placeusing a key extraction function.
IndexMap
andIndexSet
now havereserve_exact
,try_reserve
, andtry_reserve_exact
methods that correspond to the same methods onVec
.However, exactness only applies to the direct capacity for items, while the
raw hash table still follows its own rules for capacity and load factor.
The
Equivalent
trait is now re-exported from theequivalent
crate,intended as a common base to allow types to work with multiple map types.
The
hashbrown
dependency has been updated to version 0.14.The
serde_seq
module has been moved from the crate root to below themap
module.dtolnay/thiserror (thiserror)
v2.0.0
Compare Source
Breaking changes
Referencing keyword-named fields by a raw identifier like
{r#type}
inside a format string is no longer accepted; simply use the unraw name like{type}
(#347)This aligns thiserror with the standard library's formatting macros, which gained support for implicit argument capture later than the release of this feature in thiserror 1.x.
Trait bounds are no longer inferred on fields whose value is shadowed by an explicit named argument in a format message (#345)
Tuple structs and tuple variants can no longer use numerical
{0}
{1}
access at the same time as supplying extra positional arguments for a format message, as this makes it ambiguous whether the number refers to a tuple field vs a different positional arg (#354)Code containing invocations of thiserror's
derive(Error)
must now have a direct dependency on thethiserror
crate regardless of the error data structure's contents (#368, #369, #370, #372)Features
Support disabling thiserror's standard library dependency by disabling the default "std" Cargo feature:
thiserror = { version = "2", default-features = false }
(#373)Support using
r#source
as field name to opt out of a field named "source" being treated as an error'sError::source()
(#350)Infinite recursion in a generated Display impl now produces an
unconditional_recursion
warning (#359)A new attribute
#[error(fmt = path::to::myfmt)]
can be used to write formatting logic for an enum variant out-of-line (#367)Enums with an enum-level format message are now able to have individual variants that are
transparent
to supersede the enum-level message (#366)v1.0.68
Compare Source
v1.0.67
Compare Source
v1.0.66
Compare Source
v1.0.65
Compare Source
v1.0.64
Compare Source
v1.0.63
Compare Source
v1.0.62
Compare Source
#[error("…", …)]
attribute (#309)v1.0.61
Compare Source
core::fmt
andcore::panic
to facilitateerror_in_core
support (#299, thanks @jordens)v1.0.60
Compare Source
v1.0.59
Compare Source
debug-fmt-detail
option (#297)v1.0.58
Compare Source
v1.0.57
Compare Source
Display
impl for error message which do not contain any interpolated value (#286, thanks @nyurik)v1.0.56
Compare Source
v1.0.55
Compare Source
v1.0.54
Compare Source
v1.0.53
Compare Source
v1.0.52
Compare Source
v1.0.51
Compare Source
Error
impl (#266)v1.0.50
Compare Source
v1.0.49
Compare Source
::core
in generated code (#255, thanks @mina86)v1.0.48
Compare Source
v1.0.47
Compare Source
v1.0.46
Compare Source
v1.0.45
Compare Source
v1.0.44
Compare Source
v1.0.43
Compare Source
v1.0.42
Compare Source
write!
macro in scope (#239)v1.0.41
Compare Source
harryfei/which-rs (which)
v7.0.0
Compare Source
WhichConfig
for a user provided closure that will be called whenever a nonfatal error occurs.This technically breaks a few APIs due to the need to add more generics and lifetimes. Most code will compile
without changes.
v6.0.3
Compare Source
tracing
feature with somedebug
level logs for higher level logic.v6.0.2
Compare Source
tracing
feature which outputs debugging information to thetracing
ecosystem.v6.0.1
Compare Source
once_cell
for Windows users, replace withstd::sync::OnceLock
.v6.0.0
Compare Source
v5.0.0
Compare Source
Error::CannotGetCurrentDirAndPathListEmpty
v4.4.2
Compare Source
dirs
crate due to MPL licensing in its tree. Usehome
crate instead. (@Xaeroxe)v4.4.1
Compare Source
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.
👻 Immortal: This PR will be recreated if closed unmerged. Get config help if that's undesired.
This PR was generated by Mend Renovate. View the repository job log.