⬆️ Update itertools requirement from 0.11 to 0.12

[dependabot[bot]]

Updates the requirements on itertools to permit the latest version.

Changelog

Sourced from itertools's changelog.

0.12.0

Breaking

• Made take_while_inclusive consume iterator by value (#709)
• Added Clone bound to Unique (#777)

Added

• Added Itertools::try_len (#723)
• Added free function sort_unstable (#796)
• Added GroupMap::fold_with (#778, #785)
• Added PeekNth::{peek_mut, peek_nth_mut} (#716)
• Added PeekNth::{next_if, next_if_eq} (#734)
• Added conversion into (Option<A>,Option<B>) to EitherOrBoth (#713)
• Added conversion from Either<A, B> to EitherOrBoth<A, B> (#715)
• Implemented ExactSizeIterator for Tuples (#761)
• Implemented ExactSizeIterator for (Circular)TupleWindows (#752)
• Made EitherOrBoth<T> a shorthand for EitherOrBoth<T, T> (#719)

Changed

• Added missing #[must_use] annotations on iterator adaptors (#794)
• Made Combinations lazy (#795)
• Made Intersperse(With) lazy (#797)
• Made Permutations lazy (#793)
• Made Product lazy (#800)
• Made TupleWindows lazy (#602)
• Specialized Combinations::{count, size_hint} (#729)
• Specialized CombinationsWithReplacement::{count, size_hint} (#737)
• Specialized Powerset::fold (#765)
• Specialized Powerset::count (#735)
• Specialized TupleCombinations::{count, size_hint} (#763)
• Specialized TupleCombinations::fold (#775)
• Specialized WhileSome::fold (#780)
• Specialized WithPosition::fold (#772)
• Specialized ZipLongest::fold (#774)
• Changed {min, max}_set* operations require alloc feature, instead of std (#760)
• Improved documentation of tree_fold1 (#787)
• Improved documentation of permutations (#724)
• Fixed typo in documentation of multiunzip (#770)

Notable Internal Changes

• Improved specialization tests (#799, #786, #782)
• Simplified implementation of Permutations (#739, #748, #790)
• Combined Merge/MergeBy/MergeJoinBy implementations (#736)
• Simplified Permutations::size_hint (#739)
• Fix wrapping arithmetic in benchmarks (#770)
• Enforced rustfmt in CI (#751)
• Disallowed compile warnings in CI (#720)
• Used cargo hack to check MSRV (#754)

0.11.0

... (truncated)

Commits

• 98ecabb chore: Release itertools version 0.12.0
• 22fc427 prepare v0.12.0 release
• 6d29178 Document the field a_cur of Product
• bf2b012 Better Product::size_hint
• 8d07f6b Make Product lazy
• d7e6bab Document the field peek of IntersperseWith
• 9b01a11 Make IntersperseWith lazy
• 4f22173 Refactor IntersperseWith::next
• b76172b chore: adjust docs to reflect discussion in the PR
• 955927f chore: fixup docs of tree_fold1
• Additional commits viewable 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 show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @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)