Simplify set creation code

This commit is contained in:
Rerumu 2022-05-19 03:02:04 -04:00
parent f528df9b9e
commit acc21fc9a6

View File

@ -239,11 +239,7 @@ fn build_func_list(wasm: &Module, type_info: &TypeInfo) -> Vec<Intermediate> {
} }
fn write_localize_used(func_list: &[Intermediate], w: &mut dyn Write) -> Result<()> { fn write_localize_used(func_list: &[Intermediate], w: &mut dyn Write) -> Result<()> {
let mut loc_set = BTreeSet::new(); let loc_set: BTreeSet<_> = func_list.iter().flat_map(localize::visit).collect();
for func in func_list {
loc_set.extend(localize::visit(func));
}
loc_set loc_set
.into_iter() .into_iter()
@ -251,12 +247,7 @@ fn write_localize_used(func_list: &[Intermediate], w: &mut dyn Write) -> Result<
} }
fn write_memory_used(func_list: &[Intermediate], w: &mut dyn Write) -> Result<Vec<usize>> { fn write_memory_used(func_list: &[Intermediate], w: &mut dyn Write) -> Result<Vec<usize>> {
let mut mem_set = BTreeSet::new(); let mem_set: BTreeSet<_> = func_list.iter().flat_map(memory::visit).collect();
for func in func_list {
mem_set.extend(memory::visit(func));
}
let list: Vec<_> = mem_set.into_iter().collect(); let list: Vec<_> = mem_set.into_iter().collect();
for mem in &list { for mem in &list {