diff options
Diffstat (limited to 'archive/1.vm/025compare.cc')
| -rw-r--r-- | archive/1.vm/025compare.cc | 624 |
1 files changed, 624 insertions, 0 deletions
diff --git a/archive/1.vm/025compare.cc b/archive/1.vm/025compare.cc new file mode 100644 index 00000000..bade3c9c --- /dev/null +++ b/archive/1.vm/025compare.cc @@ -0,0 +1,624 @@ +//: Comparison primitives + +:(before "End Primitive Recipe Declarations") +EQUAL, +:(before "End Primitive Recipe Numbers") +put(Recipe_ordinal, "equal", EQUAL); +:(before "End Primitive Recipe Checks") +case EQUAL: { + if (SIZE(inst.ingredients) <= 1) { + raise << maybe(get(Recipe, r).name) << "'equal' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); + break; + } + const reagent& exemplar = inst.ingredients.at(0); + for (int i = /*skip exemplar*/1; i < SIZE(inst.ingredients); ++i) { + if (!types_match(inst.ingredients.at(i), exemplar) && !types_match(exemplar, inst.ingredients.at(i))) { + raise << maybe(get(Recipe, r).name) << "'equal' expects ingredients to be all of the same type, but got '" << to_original_string(inst) << "'\n" << end(); + goto finish_checking_instruction; + } + } + if (SIZE(inst.products) > 1) { + raise << maybe(get(Recipe, r).name) << "'equal' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); + break; + } + if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { + raise << maybe(get(Recipe, r).name) << "'equal' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); + break; + } + break; +} +:(before "End Primitive Recipe Implementations") +case EQUAL: { + vector<double>& exemplar = ingredients.at(0); + bool result = true; + for (int i = /*skip exemplar*/1; i < SIZE(ingredients); ++i) { + if (SIZE(ingredients.at(i)) != SIZE(exemplar)) { + result = false; + break; + } + if (!equal(ingredients.at(i).begin(), ingredients.at(i).end(), exemplar.begin())) { + result = false; + break; + } + } + products.resize(1); + products.at(0).push_back(result); + break; +} + +:(code) +void test_equal() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 33\n" + " 3:bool <- equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: location 1 is 34\n" + "mem: location 2 is 33\n" + "mem: storing 0 in location 3\n" + ); +} + +void test_equal_2() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 34\n" + " 3:bool <- equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: location 1 is 34\n" + "mem: location 2 is 34\n" + "mem: storing 1 in location 3\n" + ); +} + +void test_equal_multiple() { + run( + "def main [\n" + " 1:bool <- equal 34, 34, 34\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 1\n" + ); +} + +void test_equal_multiple_2() { + run( + "def main [\n" + " 1:bool <- equal 34, 34, 35\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 0 in location 1\n" + ); +} + +:(before "End Primitive Recipe Declarations") +NOT_EQUAL, +:(before "End Primitive Recipe Numbers") +put(Recipe_ordinal, "not-equal", NOT_EQUAL); +:(before "End Primitive Recipe Checks") +case NOT_EQUAL: { + if (SIZE(inst.ingredients) != 2) { + raise << maybe(get(Recipe, r).name) << "'equal' needs two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); + break; + } + const reagent& exemplar = inst.ingredients.at(0); + if (!types_match(inst.ingredients.at(1), exemplar) && !types_match(exemplar, inst.ingredients.at(1))) { + raise << maybe(get(Recipe, r).name) << "'equal' expects ingredients to be all of the same type, but got '" << to_original_string(inst) << "'\n" << end(); + goto finish_checking_instruction; + } + if (SIZE(inst.products) > 1) { + raise << maybe(get(Recipe, r).name) << "'equal' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); + break; + } + if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { + raise << maybe(get(Recipe, r).name) << "'equal' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); + break; + } + break; +} +:(before "End Primitive Recipe Implementations") +case NOT_EQUAL: { + vector<double>& exemplar = ingredients.at(0); + products.resize(1); + if (SIZE(ingredients.at(1)) != SIZE(exemplar)) { + products.at(0).push_back(true); + break; + } + bool equal_ingredients = equal(ingredients.at(1).begin(), ingredients.at(1).end(), exemplar.begin()); + products.at(0).push_back(!equal_ingredients); + break; +} + +:(code) +void test_not_equal() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 33\n" + " 3:bool <- not-equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: location 1 is 34\n" + "mem: location 2 is 33\n" + "mem: storing 1 in location 3\n" + ); +} + +void test_not_equal_2() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 34\n" + " 3:bool <- not-equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: location 1 is 34\n" + "mem: location 2 is 34\n" + "mem: storing 0 in location 3\n" + ); +} + +:(before "End Primitive Recipe Declarations") +GREATER_THAN, +:(before "End Primitive Recipe Numbers") +put(Recipe_ordinal, "greater-than", GREATER_THAN); +:(before "End Primitive Recipe Checks") +case GREATER_THAN: { + if (SIZE(inst.ingredients) <= 1) { + raise << maybe(get(Recipe, r).name) << "'greater-than' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); + break; + } + for (int i = 0; i < SIZE(inst.ingredients); ++i) { + if (!is_mu_number(inst.ingredients.at(i))) { + raise << maybe(get(Recipe, r).name) << "'greater-than' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); + goto finish_checking_instruction; + } + } + if (SIZE(inst.products) > 1) { + raise << maybe(get(Recipe, r).name) << "'greater-than' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); + break; + } + if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { + raise << maybe(get(Recipe, r).name) << "'greater-than' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); + break; + } + break; +} +:(before "End Primitive Recipe Implementations") +case GREATER_THAN: { + bool result = true; + for (int i = /**/1; i < SIZE(ingredients); ++i) { + if (ingredients.at(i-1).at(0) <= ingredients.at(i).at(0)) { + result = false; + } + } + products.resize(1); + products.at(0).push_back(result); + break; +} + +:(code) +void test_greater_than() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 33\n" + " 3:bool <- greater-than 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 3\n" + ); +} + +void test_greater_than_2() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 34\n" + " 3:bool <- greater-than 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 0 in location 3\n" + ); +} + +void test_greater_than_multiple() { + run( + "def main [\n" + " 1:bool <- greater-than 36, 35, 34\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 1\n" + ); +} + +void test_greater_than_multiple_2() { + run( + "def main [\n" + " 1:bool <- greater-than 36, 35, 35\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 0 in location 1\n" + ); +} + +:(before "End Primitive Recipe Declarations") +LESSER_THAN, +:(before "End Primitive Recipe Numbers") +put(Recipe_ordinal, "lesser-than", LESSER_THAN); +:(before "End Primitive Recipe Checks") +case LESSER_THAN: { + if (SIZE(inst.ingredients) <= 1) { + raise << maybe(get(Recipe, r).name) << "'lesser-than' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); + break; + } + for (int i = 0; i < SIZE(inst.ingredients); ++i) { + if (!is_mu_number(inst.ingredients.at(i))) { + raise << maybe(get(Recipe, r).name) << "'lesser-than' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); + goto finish_checking_instruction; + } + } + if (SIZE(inst.products) > 1) { + raise << maybe(get(Recipe, r).name) << "'lesser-than' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); + break; + } + if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { + raise << maybe(get(Recipe, r).name) << "'lesser-than' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); + break; + } + break; +} +:(before "End Primitive Recipe Implementations") +case LESSER_THAN: { + bool result = true; + for (int i = /**/1; i < SIZE(ingredients); ++i) { + if (ingredients.at(i-1).at(0) >= ingredients.at(i).at(0)) { + result = false; + } + } + products.resize(1); + products.at(0).push_back(result); + break; +} + +:(code) +void test_lesser_than() { + run( + "def main [\n" + " 1:num <- copy 32\n" + " 2:num <- copy 33\n" + " 3:bool <- lesser-than 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 3\n" + ); +} + +void test_lesser_than_2() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 33\n" + " 3:bool <- lesser-than 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 0 in location 3\n" + ); +} + +void test_lesser_than_multiple() { + run( + "def main [\n" + " 1:bool <- lesser-than 34, 35, 36\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 1\n" + ); +} + +void test_lesser_than_multiple_2() { + run( + "def main [\n" + " 1:bool <- lesser-than 34, 35, 35\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 0 in location 1\n" + ); +} +:(before "End Primitive Recipe Declarations") +GREATER_OR_EQUAL, +:(before "End Primitive Recipe Numbers") +put(Recipe_ordinal, "greater-or-equal", GREATER_OR_EQUAL); +:(before "End Primitive Recipe Checks") +case GREATER_OR_EQUAL: { + if (SIZE(inst.ingredients) <= 1) { + raise << maybe(get(Recipe, r).name) << "'greater-or-equal' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); + break; + } + for (int i = 0; i < SIZE(inst.ingredients); ++i) { + if (!is_mu_number(inst.ingredients.at(i))) { + raise << maybe(get(Recipe, r).name) << "'greater-or-equal' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); + goto finish_checking_instruction; + } + } + if (SIZE(inst.products) > 1) { + raise << maybe(get(Recipe, r).name) << "'greater-or-equal' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); + break; + } + if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { + raise << maybe(get(Recipe, r).name) << "'greater-or-equal' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); + break; + } + break; +} +:(before "End Primitive Recipe Implementations") +case GREATER_OR_EQUAL: { + bool result = true; + for (int i = /**/1; i < SIZE(ingredients); ++i) { + if (ingredients.at(i-1).at(0) < ingredients.at(i).at(0)) { + result = false; + } + } + products.resize(1); + products.at(0).push_back(result); + break; +} + +:(code) +void test_greater_or_equal() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 33\n" + " 3:bool <- greater-or-equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 3\n" + ); +} + +void test_greater_or_equal_2() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 34\n" + " 3:bool <- greater-or-equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 3\n" + ); +} + +void test_greater_or_equal_3() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 35\n" + " 3:bool <- greater-or-equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 0 in location 3\n" + ); +} + +void test_greater_or_equal_multiple() { + run( + "def main [\n" + " 1:bool <- greater-or-equal 36, 35, 35\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 1\n" + ); +} + +void test_greater_or_equal_multiple_2() { + run( + "def main [\n" + " 1:bool <- greater-or-equal 36, 35, 36\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 0 in location 1\n" + ); +} + +:(before "End Primitive Recipe Declarations") +LESSER_OR_EQUAL, +:(before "End Primitive Recipe Numbers") +put(Recipe_ordinal, "lesser-or-equal", LESSER_OR_EQUAL); +:(before "End Primitive Recipe Checks") +case LESSER_OR_EQUAL: { + if (SIZE(inst.ingredients) <= 1) { + raise << maybe(get(Recipe, r).name) << "'lesser-or-equal' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); + break; + } + for (int i = 0; i < SIZE(inst.ingredients); ++i) { + if (!is_mu_number(inst.ingredients.at(i))) { + raise << maybe(get(Recipe, r).name) << "'lesser-or-equal' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); + goto finish_checking_instruction; + } + } + if (SIZE(inst.products) > 1) { + raise << maybe(get(Recipe, r).name) << "'greater-or-equal' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); + break; + } + if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_boolean(inst.products.at(0))) { + raise << maybe(get(Recipe, r).name) << "'greater-or-equal' should yield a boolean, but got '" << inst.products.at(0).original_string << "'\n" << end(); + break; + } + break; +} +:(before "End Primitive Recipe Implementations") +case LESSER_OR_EQUAL: { + bool result = true; + for (int i = /**/1; i < SIZE(ingredients); ++i) { + if (ingredients.at(i-1).at(0) > ingredients.at(i).at(0)) { + result = false; + } + } + products.resize(1); + products.at(0).push_back(result); + break; +} + +:(code) +void test_lesser_or_equal() { + run( + "def main [\n" + " 1:num <- copy 32\n" + " 2:num <- copy 33\n" + " 3:bool <- lesser-or-equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 3\n" + ); +} + +void test_lesser_or_equal_2() { + run( + "def main [\n" + " 1:num <- copy 33\n" + " 2:num <- copy 33\n" + " 3:bool <- lesser-or-equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 3\n" + ); +} + +void test_lesser_or_equal_3() { + run( + "def main [\n" + " 1:num <- copy 34\n" + " 2:num <- copy 33\n" + " 3:bool <- lesser-or-equal 1:num, 2:num\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 0 in location 3\n" + ); +} + +void test_lesser_or_equal_multiple() { + run( + "def main [\n" + " 1:bool <- lesser-or-equal 34, 35, 35\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 1 in location 1\n" + ); +} + +void test_lesser_or_equal_multiple_2() { + run( + "def main [\n" + " 1:bool <- lesser-or-equal 34, 35, 34\n" + "]\n" + ); + CHECK_TRACE_CONTENTS( + "mem: storing 0 in location 1\n" + ); +} + +:(before "End Primitive Recipe Declarations") +MAX, +:(before "End Primitive Recipe Numbers") +put(Recipe_ordinal, "max", MAX); +:(before "End Primitive Recipe Checks") +case MAX: { + if (SIZE(inst.ingredients) <= 1) { + raise << maybe(get(Recipe, r).name) << "'max' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); + break; + } + for (int i = 0; i < SIZE(inst.ingredients); ++i) { + if (!is_mu_number(inst.ingredients.at(i))) { + raise << maybe(get(Recipe, r).name) << "'max' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); + goto finish_checking_instruction; + } + } + if (SIZE(inst.products) > 1) { + raise << maybe(get(Recipe, r).name) << "'max' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); + break; + } + if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { + raise << maybe(get(Recipe, r).name) << "'max' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); + break; + } + break; +} +:(before "End Primitive Recipe Implementations") +case MAX: { + int result = ingredients.at(0).at(0); + for (int i = /**/1; i < SIZE(ingredients); ++i) { + if (ingredients.at(i).at(0) > result) { + result = ingredients.at(i).at(0); + } + } + products.resize(1); + products.at(0).push_back(result); + break; +} + +:(before "End Primitive Recipe Declarations") +MIN, +:(before "End Primitive Recipe Numbers") +put(Recipe_ordinal, "min", MIN); +:(before "End Primitive Recipe Checks") +case MIN: { + if (SIZE(inst.ingredients) <= 1) { + raise << maybe(get(Recipe, r).name) << "'min' needs at least two ingredients to compare in '" << to_original_string(inst) << "'\n" << end(); + break; + } + for (int i = 0; i < SIZE(inst.ingredients); ++i) { + if (!is_mu_number(inst.ingredients.at(i))) { + raise << maybe(get(Recipe, r).name) << "'min' can only compare numbers; got '" << inst.ingredients.at(i).original_string << "'\n" << end(); + goto finish_checking_instruction; + } + } + if (SIZE(inst.products) > 1) { + raise << maybe(get(Recipe, r).name) << "'min' yields exactly one product in '" << to_original_string(inst) << "'\n" << end(); + break; + } + if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { + raise << maybe(get(Recipe, r).name) << "'min' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); + break; + } + break; +} +:(before "End Primitive Recipe Implementations") +case MIN: { + int result = ingredients.at(0).at(0); + for (int i = /**/1; i < SIZE(ingredients); ++i) { + if (ingredients.at(i).at(0) < result) { + result = ingredients.at(i).at(0); + } + } + products.resize(1); + products.at(0).push_back(result); + break; +} |