waalge
/
aiken
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix and clean up tests and handle 

one edge case on rearrange clauses
This commit is contained in:
microproofs 2023-07-28 13:52:32 -04:00 committed by Kasey
parent 018453f6b1
commit 4e3ced5b75
2 changed files with 241 additions and 237 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
crates/aiken-lang/src/gen_uplc/builder.rs
View File

@ -784,10 +784,11 @@ pub fn rearrange_list_clauses(clauses: Vec<TypedClause>) -> Vec<TypedClause> {
is_wild_card_elems_clause && !pattern_has_conditions(element); is_wild_card_elems_clause && !pattern_has_conditions(element);
} }
if is_wild_card_elems_clause if is_wild_card_elems_clause {
&& wild_card_clause_elems < elements.len() + usize::from(tail.is_none()) if wild_card_clause_elems < elements.len() + usize::from(tail.is_none()) {
{
wild_card_clause_elems += 1; wild_card_clause_elems += 1;
}
if clause.guard.is_none() && tail.is_some() && !elements.is_empty() { if clause.guard.is_none() && tail.is_some() && !elements.is_empty() {
last_clause_index = index; last_clause_index = index;
last_clause_set = true; last_clause_set = true;
@ -820,7 +821,9 @@ pub fn rearrange_list_clauses(clauses: Vec<TypedClause>) -> Vec<TypedClause> {
// Encountered a tail so stop there with that as last clause // Encountered a tail so stop there with that as last clause
if last_clause_set { if last_clause_set {
final_clauses = final_clauses[0..last_clause_index].to_vec(); for _ in 0..(sorted_clauses.len() - 1 - last_clause_index) {
final_clauses.pop();
}
} }
// insert hole fillers into clauses // insert hole fillers into clauses

81
crates/aiken-project/src/tests/gen_uplc.rs
View File

@ -73,7 +73,6 @@ fn assert_uplc(source_code: &str, expected: Term<Name>, should_fail: bool) {
}; };
let expected = optimize::aiken_optimize_and_intern(expected); let expected = optimize::aiken_optimize_and_intern(expected);
// println!("expected: {}", expected.to_pretty());
let expected: Program<DeBruijn> = expected.try_into().unwrap(); let expected: Program<DeBruijn> = expected.try_into().unwrap();
@ -2858,8 +2857,7 @@ fn when_tuple_deconstruction() {
Term::un_i_data().apply( Term::un_i_data().apply(
Term::var(CONSTR_GET_FIELD) Term::var(CONSTR_GET_FIELD)
.apply( .apply(
Term::var(CONSTR_FIELDS_EXPOSER) Term::var(CONSTR_FIELDS_EXPOSER).apply(Term::var("a")),
.apply(Term::var("a")),
) )
.apply(Term::integer(0.into())), .apply(Term::integer(0.into())),
), ),
@ -2897,9 +2895,8 @@ fn when_tuple_deconstruction() {
.apply(Term::var("red")), .apply(Term::var("red")),
) )
.delayed_if_else(Term::unit(), Term::Error) .delayed_if_else(Term::unit(), Term::Error)
.lambda("red") .lambda("_")
.apply( .apply(
Term::var("red").lambda("_").apply(
Term::var("expect_RedSpend") Term::var("expect_RedSpend")
.lambda("expect_RedSpend") .lambda("expect_RedSpend")
.apply( .apply(
@ -2911,7 +2908,9 @@ fn when_tuple_deconstruction() {
.apply(Term::var("red_constr_fields")) .apply(Term::var("red_constr_fields"))
.delayed_choose_list( .delayed_choose_list(
Term::unit(), Term::unit(),
Term::Error.trace(Term::string("List/Tuple/Constr contains more items than expected")), Term::Error.trace(Term::string(
"List/Tuple/Constr contains more items than expected",
)),
) )
.lambda("field_1") .lambda("field_1")
.apply(Term::un_i_data().apply( .apply(Term::un_i_data().apply(
@ -2919,8 +2918,7 @@ fn when_tuple_deconstruction() {
)) ))
.lambda("red_constr_fields") .lambda("red_constr_fields")
.apply( .apply(
Term::var(CONSTR_FIELDS_EXPOSER) Term::var(CONSTR_FIELDS_EXPOSER).apply(Term::var("red")),
.apply(Term::var("red")),
), ),
Term::equals_integer() Term::equals_integer()
.apply(Term::integer(1.into())) .apply(Term::integer(1.into()))
@ -2930,10 +2928,13 @@ fn when_tuple_deconstruction() {
.apply(Term::var("red")) .apply(Term::var("red"))
.delayed_choose_list( .delayed_choose_list(
Term::unit(), Term::unit(),
Term::Error Term::Error.trace(Term::string(
.trace(Term::string("Expected no fields for Constr")) "Expected no fields for Constr",
)),
), ),
Term::Error.trace(Term::string("Constr index did not match any type variant")), Term::Error.trace(Term::string(
"Constr index did not match any type variant",
)),
), ),
) )
.lambda("subject") .lambda("subject")
@ -2941,11 +2942,11 @@ fn when_tuple_deconstruction() {
.lambda("red"), .lambda("red"),
) )
.apply(Term::var("red")), .apply(Term::var("red")),
),
) )
.lambda("dat") .lambda("red")
.apply(Term::var("red"))
.lambda("_")
.apply( .apply(
Term::var("dat").lambda("_").apply(
Term::var("expect_Datum") Term::var("expect_Datum")
.lambda("expect_Datum") .lambda("expect_Datum")
.apply( .apply(
@ -2957,19 +2958,17 @@ fn when_tuple_deconstruction() {
.apply(Term::var("dat_constr_fields")) .apply(Term::var("dat_constr_fields"))
.delayed_choose_list( .delayed_choose_list(
Term::unit().lambda("_").apply( Term::unit().lambda("_").apply(
Term::var("expect_Thing") Term::var("expect_Thing").apply(Term::var("field_1")),
.apply(Term::var("field_1")),
), ),
Term::Error.trace(Term::string("List/Tuple/Constr contains more items than expected")), Term::Error.trace(Term::string(
"List/Tuple/Constr contains more items than expected",
)),
) )
.lambda("field_1") .lambda("field_1")
.apply( .apply(Term::head_list().apply(Term::var("dat_constr_fields")))
Term::head_list().apply(Term::var("dat_constr_fields")),
)
.lambda("dat_constr_fields") .lambda("dat_constr_fields")
.apply( .apply(
Term::var(CONSTR_FIELDS_EXPOSER) Term::var(CONSTR_FIELDS_EXPOSER).apply(Term::var("dat")),
.apply(Term::var("dat")),
), ),
Term::equals_integer() Term::equals_integer()
.apply(Term::integer(1.into())) .apply(Term::integer(1.into()))
@ -2979,10 +2978,13 @@ fn when_tuple_deconstruction() {
.apply(Term::var("dat")) .apply(Term::var("dat"))
.delayed_choose_list( .delayed_choose_list(
Term::unit(), Term::unit(),
Term::Error Term::Error.trace(Term::string(
.trace(Term::string("Expected no fields for Constr")) "Expected no fields for Constr",
)),
), ),
Term::Error.trace(Term::string("Constr index did not match any type variant")), Term::Error.trace(Term::string(
"Constr index did not match any type variant",
)),
), ),
) )
.lambda("subject") .lambda("subject")
@ -2999,15 +3001,14 @@ fn when_tuple_deconstruction() {
.apply(Term::var("field_1_constr_fields")) .apply(Term::var("field_1_constr_fields"))
.delayed_choose_list( .delayed_choose_list(
Term::unit(), Term::unit(),
Term::Error.trace(Term::string("List/Tuple/Constr contains more items than expected")), Term::Error.trace(Term::string(
"List/Tuple/Constr contains more items than expected",
)),
) )
.lambda("idx") .lambda("idx")
.apply( .apply(Term::un_i_data().apply(
Term::un_i_data().apply( Term::head_list().apply(Term::var("field_1_constr_fields")),
Term::head_list() ))
.apply(Term::var("field_1_constr_fields")),
),
)
.lambda("field_1_constr_fields") .lambda("field_1_constr_fields")
.apply( .apply(
Term::var(CONSTR_FIELDS_EXPOSER) Term::var(CONSTR_FIELDS_EXPOSER)
@ -3018,14 +3019,13 @@ fn when_tuple_deconstruction() {
)), )),
) )
.lambda("subject") .lambda("subject")
.apply( .apply(Term::var(CONSTR_INDEX_EXPOSER).apply(Term::var("field_1")))
Term::var(CONSTR_INDEX_EXPOSER).apply(Term::var("field_1")),
)
.lambda("field_1"), .lambda("field_1"),
) )
.apply(Term::var("dat")), .apply(Term::var("dat")),
),
) )
.lambda("dat")
.apply(Term::var("dat"))
.lambda("ctx") .lambda("ctx")
.lambda("red") .lambda("red")
.lambda("dat") .lambda("dat")
@ -3211,9 +3211,7 @@ fn generic_validator_type_test() {
.lambda("subject") .lambda("subject")
.apply(Term::var(CONSTR_INDEX_EXPOSER).apply(Term::var("r"))) .apply(Term::var(CONSTR_INDEX_EXPOSER).apply(Term::var("r")))
.delayed_if_else(Term::unit(), Term::Error) .delayed_if_else(Term::unit(), Term::Error)
.lambda("r") .lambda("_").apply(
.apply(
Term::var("r").lambda("_").apply(
Term::var("__expect_A") Term::var("__expect_A")
.lambda("__expect_A") .lambda("__expect_A")
.apply( .apply(
@ -3318,7 +3316,10 @@ fn generic_validator_type_test() {
.lambda("field_B"), .lambda("field_B"),
) )
.apply(Term::var("r")), .apply(Term::var("r")),
), )
.lambda("r")
.apply(
Term::var("r"),
) )
.lambda("_ctx") .lambda("_ctx")
.lambda("r") .lambda("r")