fix(deps): update rust crate itertools to 0.14.0 #22
No Assignees
Notifications
Due Date
No due date set.
Dependencies
No dependencies set.
Reference: wathiede/letterbox#22
Loading…
x
Reference in New Issue
Block a user
No description provided.
Delete Branch "renovate/itertools-0.x"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
This PR contains the following updates:
0.10.5->0.14.00.10.1->0.14.0Release Notes
rust-itertools/itertools (itertools)
v0.14.0Compare Source
Breaking
cons_tuples(#988)Added
array_combinations(#991)k_smallest_relaxedand variants (#925)next_arrayandcollect_array(#560)DoubleEndedIteratorforFilterOk(#948)DoubleEndedIteratorforFilterMapOk(#950)Changed
Q: ?SizedinItertools::contains(#971)chain!(#943)into_group_map_bydocumentation (#1000)tree_reducedocumentation (#955)merge_join_by(#966)take_while_inclusive(#972)find_or_lastandfind_or_first(#984)tuple_combinations(#945)track_callerattr forasser_equal(#976)Notable Internal Changes
default_featuresinCargo.tomltodefault-features(#985)v0.13.0Compare Source
Breaking
DoubleEndedIteratorforConsTuples(#853)MultiProductfused and fixed on an empty iterator (#835, #834)iproduct!to return tuples for maxi one iterator too (#870)PutBack::put_backto 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)DoubleEndedIteratorforProcessResults(#910)DebugforFormatWith(#931)Itertools::get(#891)Changed
Itertools::group_by(renamedchunk_by) (#866, #879)unfold(usestd::iter::from_fninstead) (#871)GroupingMapBy(#873, #876)Fnbounds toFnMutindiff_with, Itertools::into_group_map_by(#886)Debug/Clonebounds forMapInto(#889)use_allocfeature (#887)Itertools::set_from(#888)README.md(#890)Cargo.toml(#894)Itertools::k_smalleston 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_equalfor iterators longer thani32::MAX(#932)must_usemessage of non-lazyKMergeByandTupleCombinations(#939)Notable Internal Changes
CONTRIBUTING.md(#767)v0.12.1Compare Source
Added
Itertools::[tuple_]combinations(#822)iterate(#842)CloneandDebugforDiff(#845)DebugforWithPosition(#859)EqforMinMaxResult(#838)From<EitherOrBoth<A, B>>forOption<Either<A, B>>(#843)PeekingNextforRepeatN(#855)Changed
CoalesceBylazy (#801)Filter[Map]Ok::next,Itertools::partition,Unique[By]::next[_back](#818)Itertools::find_position(#837)Positions::next[_back](#816)ZipLongest::fold(#854)Debugbounds 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
clippyin CI (#740)rustdocin CI (#840)v0.12.0Compare Source
Breaking
take_while_inclusiveconsume iterator by value (#709)Clonebound 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)ExactSizeIteratorforTuples(#761)ExactSizeIteratorfor(Circular)TupleWindows(#752)EitherOrBoth<T>a shorthand forEitherOrBoth<T, T>(#719)Changed
#[must_use]annotations on iterator adaptors (#794)Combinationslazy (#795)Intersperse(With)lazy (#797)Permutationslazy (#793)Productlazy (#800)TupleWindowslazy (#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 requireallocfeature, instead ofstd(#760)tree_fold1(#787)permutations(#724)multiunzip(#770)Notable Internal Changes
Permutations(#739, #748, #790)Merge/MergeBy/MergeJoinByimplementations (#736)Permutations::size_hint(#739)rustfmtin CI (#751)cargo hackto check MSRV (#754)v0.11.0Compare Source
Breaking
Itertools::merge_join_byalso accept functions returning bool (#704)PeekingNexttransitively over mutable references (#643)with_positionto yield(Position, Item)instead ofPosition<Item>(#699)Added
Itertools::take_while_inclusive(#616)PeekingNextforPeekingTakeWhile(#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)CloneforCircularTupleWindows(#686)CloneforChunks(#683)Itertools::process_results(#680)Changed
Cellinstead ofRefCellinFormatandFormatWith(#608)Itertools::max_set_by_key(#692)Cargo.toml(#672)equalwithIterator::eq(#591)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 these updates again.
This PR has been generated by Renovate Bot.