Bump bitvec from 0.20.1 to 1.0.0

[dependabot]

Bumps bitvec from 0.20.1 to 1.0.0.

Changelog

Sourced from bitvec's changelog.

1.0.0

🚨 THIS IS A BREAKING CHANGE RELEASE! 🚨

Your code has broken. You will need to change it in order to use this. This work on your part is worth it.

This release has a great deal of changes from the 0.22 development series! Most breaking changes should have reasonable error messages indicating how they can be repaired.

Removed APIs do not have deprecation notices! Use of removed APIs will fail to compile. You must check this changelog, or the crate documentation, to find out appropriate replacements.

Type Parameter Reördering

The <O, T> type parameter pair that has existed since 0.10 is reversed to be <T, O>! This will cause all of your type definitions to fail, as suddenly all of your chosen type arguments do not satisfy the demanded traits.

This change was made in accordance with [Issue #136], requested by GitHub user [@​changhe3].

Additional Changes

• The MSRV is raised to 1.56.
• BitField now supports signed integers! BitMemory is completely removed.
• BitSlice::from_slice{,_mut} are now infallible constructors, and panic when the source is too long. The original fallible behavior is renamed to BitSlice::try_from_slice{,_mut}.
• the {Bit,}DomainMut types have been removed. The {Bit,}Domain types now take a Mutability type parameter instead. The .{bit_,}domain{,_mut}() methods on BitSlice exist as normal, but have changed their return types to specify a Const or Mut type parameter rather than {Bit,}Domain or {Bit,}DomainMut, respectively.
• Iter::by_{ref,val} are renamed to by_{ref,val}s, to prevent collision with Iterator::by_ref.
• The long-standing behavior of the &=, |=, and ^= operators has been changed! They now operate directly on data structures, rather than routing through iterators. If you want to perform boolean arithmetic using arbitrary bool streams, use iterator combinators like .iter_mut().zip(stream).for_each(|(mut orig, new)| *orig ^= new). This change allows the arithmetic implementations to be accelerated when working between bit-slices of equal types.
• BitSlice::set_all is removed, as the standard-library API [T]::fill replaces it.
• BitSlice::offset_from is removed. Use .as_bitptr().offset_from().
• BitSlice::as_raw_slice is removed. Use .domain() to access the underlying memory.

... (truncated)

Commits

• See full diff in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

• @dependabot rebase will rebase this PR
• @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
• @dependabot merge will merge this PR after your CI passes on it
• @dependabot squash and merge will squash and merge this PR after your CI passes on it
• @dependabot cancel merge will cancel a previously requested merge and block automerging
• @dependabot reopen will reopen this PR if it is closed
• @dependabot close will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually
• @dependabot ignore this major version will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this minor version will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this dependency will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)

[dependabot]

The following labels could not be found: A2-insubstantial, B0-silent, C1-low 📌.