language-servers/roc
1
0
Fork 0
mirror of https://github.com/roc-lang/roc.git synced 2025-10-01 07:41:12 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 6

fix bug in decision_tree

Browse source
This commit is contained in:
Folkert 2020-11-13 01:39:39 +01:00
parent ed26b07916
commit 70cba33fe4
4 changed files with 16 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

14
compiler/mono/src/decision_tree.rs
View file

@ -979,7 +979,7 @@ fn path_to_expr_help<'a>(
break;
}
Some(wrapped) => {
let field_layouts = match layout {
let field_layouts = match &layout {
Layout::Union(layouts) | Layout::RecursiveUnion(layouts) => {
layouts[*tag_id as usize].to_vec()
}
@ -987,9 +987,10 @@ fn path_to_expr_help<'a>(
other => vec![other.clone()],
};
debug_assert!(*index < field_layouts.len() as u64);
let inner_layout = field_layouts[*index as usize].clone();
let inner_layout = match &field_layouts[*index as usize] {
Layout::RecursivePointer => layout.clone(),
other => other.clone(),
};
let inner_expr = Expr::AccessAtIndex {
index: *index,
@ -1057,7 +1058,7 @@ fn test_to_equality<'a>(
let rhs_symbol = env.unique_symbol();
stores.push((lhs_symbol, Layout::Builtin(Builtin::Int64), lhs));
stores.insert(0, (rhs_symbol, Layout::Builtin(Builtin::Int64), rhs));
stores.push((rhs_symbol, Layout::Builtin(Builtin::Int64), rhs));
(
stores,
@ -1324,7 +1325,8 @@ fn decide_to_branching<'a>(
arena.alloc(cond),
);
for (symbol, layout, expr) in new_stores.into_iter() {
// stores are in top-to-bottom order, so we have to add them in reverse
for (symbol, layout, expr) in new_stores.into_iter().rev() {
cond = Stmt::Let(symbol, expr, layout, arena.alloc(cond));
}