-
Notifications
You must be signed in to change notification settings - Fork 1
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 rust crate itertools to 0.13.0 #89
Conversation
f82489d
to
4e11b89
Compare
4e11b89
to
fd5f196
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
|
fd5f196
to
38f40d5
Compare
38f40d5
to
70b1175
Compare
70b1175
to
410dbe8
Compare
410dbe8
to
bf27c35
Compare
|
Renovate Ignore NotificationBecause you closed this PR without merging, Renovate will ignore this update ( If you accidentally closed this PR, or if you changed your mind: rename this PR to get a fresh replacement PR. |
This PR contains the following updates:
0.10.5
->0.13.0
Release Notes
rust-itertools/itertools (itertools)
v0.13.0
Compare Source
Breaking
DoubleEndedIterator
forConsTuples
(#853)MultiProduct
fused and fixed on an empty iterator (#835, #834)iproduct!
to return tuples for maxi one iterator too (#870)PutBack::put_back
to return the old value (#880)repeat_call, Itertools::{foreach, step, map_results, fold_results}
(#878)TakeWhileInclusive::new
(#912)Added
Itertools::{smallest_by, smallest_by_key, largest, largest_by, largest_by_key}
(#654, #885)Itertools::tail
(#899)DoubleEndedIterator
forProcessResults
(#910)Debug
forFormatWith
(#931)Itertools::get
(#891)Changed
Itertools::group_by
(renamedchunk_by
) (#866, #879)unfold
(usestd::iter::from_fn
instead) (#871)GroupingMapBy
(#873, #876)Fn
bounds toFnMut
indiff_with, Itertools::into_group_map_by
(#886)Debug/Clone
bounds forMapInto
(#889)use_alloc
feature (#887)Itertools::set_from
(#888)README.md
(#890)Cargo.toml
(#894)Itertools::k_smallest
on short unfused iterators (#900)Itertools::tree_fold1
(renamedtree_reduce
) (#895)GroupingMap::fold_first
(renamedreduce
) (#902)Itertools::k_smallest(0)
to consume the iterator, optimizedItertools::k_smallest(1)
(#909)Combinations::nth
(#914)MergeBy::fold
(#920)CombinationsWithReplacement::nth
(#923)FlattenOk::{fold, rfold}
(#927)Powerset::nth
(#924)assert_equal
for iterators longer thani32::MAX
(#932)must_use
message of non-lazyKMergeBy
andTupleCombinations
(#939)Notable Internal Changes
CONTRIBUTING.md
(#767)v0.12.1
Compare Source
Added
Itertools::[tuple_]combinations
(#822)iterate
(#842)Clone
andDebug
forDiff
(#845)Debug
forWithPosition
(#859)Eq
forMinMaxResult
(#838)From<EitherOrBoth<A, B>>
forOption<Either<A, B>>
(#843)PeekingNext
forRepeatN
(#855)Changed
CoalesceBy
lazy (#801)Filter[Map]Ok::next
,Itertools::partition
,Unique[By]::next[_back]
(#818)Itertools::find_position
(#837)Positions::next[_back]
(#816)ZipLongest::fold
(#854)Debug
bounds forGroupingMapBy
(#860)ExactlyOneError::fold
(#826)Interleave[Shortest]::fold
(#849)MultiPeek::fold
(#820)PadUsing::[r]fold
(#825)PeekNth::fold
(#824)Positions::[r]fold
(#813)PutBackN::fold
(#823)RepeatN::[r]fold
(#821)TakeWhileInclusive::fold
(#851)ZipLongest::rfold
(#848)Notable Internal Changes
clippy
in CI (#740)rustdoc
in CI (#840)v0.12.0
Compare Source
Breaking
take_while_inclusive
consume iterator by value (#709)Clone
bound toUnique
(#777)Added
Itertools::try_len
(#723)sort_unstable
(#796)GroupMap::fold_with
(#778, #785)PeekNth::{peek_mut, peek_nth_mut}
(#716)PeekNth::{next_if, next_if_eq}
(#734)(Option<A>,Option<B>)
toEitherOrBoth
(#713)Either<A, B>
toEitherOrBoth<A, B>
(#715)ExactSizeIterator
forTuples
(#761)ExactSizeIterator
for(Circular)TupleWindows
(#752)EitherOrBoth<T>
a shorthand forEitherOrBoth<T, T>
(#719)Changed
#[must_use]
annotations on iterator adaptors (#794)Combinations
lazy (#795)Intersperse(With)
lazy (#797)Permutations
lazy (#793)Product
lazy (#800)TupleWindows
lazy (#602)Combinations::{count, size_hint}
(#729)CombinationsWithReplacement::{count, size_hint}
(#737)Powerset::fold
(#765)Powerset::count
(#735)TupleCombinations::{count, size_hint}
(#763)TupleCombinations::fold
(#775)WhileSome::fold
(#780)WithPosition::fold
(#772)ZipLongest::fold
(#774){min, max}_set*
operations requirealloc
feature, instead ofstd
(#760)tree_fold1
(#787)permutations
(#724)multiunzip
(#770)Notable Internal Changes
Permutations
(#739, #748, #790)Merge
/MergeBy
/MergeJoinBy
implementations (#736)Permutations::size_hint
(#739)rustfmt
in CI (#751)cargo hack
to check MSRV (#754)v0.11.0
Compare Source
Breaking
Itertools::merge_join_by
also accept functions returning bool (#704)PeekingNext
transitively over mutable references (#643)with_position
to yield(Position, Item)
instead ofPosition<Item>
(#699)Added
Itertools::take_while_inclusive
(#616)PeekingNext
forPeekingTakeWhile
(#644)EitherOrBoth::{just_left, just_right, into_left, into_right, as_deref, as_deref_mut, left_or_insert, right_or_insert, left_or_insert_with, right_or_insert_with, insert_left, insert_right, insert_both}
(#629)Clone
forCircularTupleWindows
(#686)Clone
forChunks
(#683)Itertools::process_results
(#680)Changed
Cell
instead ofRefCell
inFormat
andFormatWith
(#608)Itertools::max_set_by_key
(#692)Cargo.toml
(#672)equal
withIterator::eq
(#591)Configuration
📅 Schedule: Branch creation - "every weekend" (UTC), 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 was generated by Mend Renovate. View the repository job log.