bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

remove more redundant into() conversions

Browse source
This commit is contained in:
Matthias Krüger 2025-01-10 07:08:28 +01:00
parent 88ab2d8acb
commit 1c619373f9
3 changed files with 4 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

2
compiler/rustc_hir_analysis/src/collect/predicates_of.rs
View file

@ -1036,7 +1036,7 @@ pub(super) fn const_conditions<'tcx>(
icx.lowerer().lower_bounds( icx.lowerer().lower_bounds(
tcx.types.self_param, tcx.types.self_param,
supertraits.into_iter(), supertraits,
&mut bounds, &mut bounds,
ty::List::empty(), ty::List::empty(),
PredicateFilter::ConstIfConst, PredicateFilter::ConstIfConst,

5
compiler/rustc_mir_transform/src/coverage/mappings.rs
View file

@ -367,9 +367,8 @@ fn calc_test_vectors_index(conditions: &mut Vec<MCDCBranch>) -> usize {
}) })
.collect::<FxIndexMap<_, _>>(); .collect::<FxIndexMap<_, _>>();
let mut queue = std::collections::VecDeque::from_iter( let mut queue =
next_conditions.swap_remove(&ConditionId::START).into_iter(), std::collections::VecDeque::from_iter(next_conditions.swap_remove(&ConditionId::START));
);
num_paths_stats[ConditionId::START] = 1; num_paths_stats[ConditionId::START] = 1;
let mut decision_end_nodes = Vec::new(); let mut decision_end_nodes = Vec::new();
while let Some(branch) = queue.pop_front() { while let Some(branch) = queue.pop_front() {

2
compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs
View file

@ -691,7 +691,7 @@ impl Subdiagnostic for LocalLabel<'_> {
for dtor in self.destructors { for dtor in self.destructors {
dtor.add_to_diag_with(diag, f); dtor.add_to_diag_with(diag, f);
} }
let msg = f(diag, crate::fluent_generated::mir_transform_label_local_epilogue.into()); let msg = f(diag, crate::fluent_generated::mir_transform_label_local_epilogue);
diag.span_label(self.span, msg); diag.span_label(self.span, msg);
} }
} }