about summary refs log tree commit diff stats
path: root/html/continuation3.mu.html
blob: 47b59801b184e4b7c6983382417f6f039b8f6f80 (plain) (blame) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<title>Mu - continuation3.mu</title>
<meta name="Generator" content="Vim/8.0">
<meta name="plugin-version" content="vim7.4_v2">
<meta name="syntax" content="none">
<meta name="settings" content="number_lines,use_css,pre_wrap,no_foldcolumn,expand_tabs,line_ids,prevent_copy=">
<meta name="colorscheme" content="minimal-light">
<style type="text/css">
<!--
pre { white-space: pre-wrap; font-family: monospace; color: #000000; background-color: #c6c6c6; }
body { font-size:12pt; font-family: monospace; color: #000000; background-color: #c6c6c6; }
a { color:inherit; }
* { font-size:12pt; font-size: 1em; }
.muControl { color: #804000; }
.muRecipe { color: #ff8700; }
.LineNr { }
.Constant { color: #008787; }
.Special { color: #ff6060; }
.Comment { color: #005faf; }
-->
</style>

<script type='text/javascript'>
<!--

/* function to open any folds containing a jumped-to line before jumping to it */
function JumpToLine()
{
  var lineNum;
  lineNum = window.location.hash;
  lineNum = lineNum.substr(1); /* strip off '#' */

  if (lineNum.indexOf('L') == -1) {
    lineNum = 'L'+lineNum;
  }
  lineElem = document.getElementById(lineNum);
  /* Always jump to new location even if the line was hidden inside a fold, or
   * we corrected the raw number to a line ID.
   */
  if (lineElem) {
    lineElem.scrollIntoView(true);
  }
  return true;
}
if ('onhashchange' in window) {
  window.onhashchange = JumpToLine;
}

-->
</script>
</head>
<body onload='JumpToLine();'>
<a href='https://github.com/akkartik/mu/blob/master/continuation3.mu'>https://github.com/akkartik/mu/blob/master/continuation3.mu</a>
<pre id='vimCodeElement'>
<span id="L1" class="LineNr"> 1 </span><span class="Comment"># Example program showing that a function call can be 'paused' multiple times,</span>
<span id="L2" class="LineNr"> 2 </span><span class="Comment"># creating different continuation values.</span>
<span id="L3" class="LineNr"> 3 </span><span class="Comment">#</span>
<span id="L4" class="LineNr"> 4 </span><span class="Comment"># To run:</span>
<span id="L5" class="LineNr"> 5 </span><span class="Comment">#   $ git clone <a href="https://github.com/akkartik/mu">https://github.com/akkartik/mu</a></span>
<span id="L6" class="LineNr"> 6 </span><span class="Comment">#   $ cd mu</span>
<span id="L7" class="LineNr"> 7 </span><span class="Comment">#   $ ./mu continuation3.mu</span>
<span id="L8" class="LineNr"> 8 </span><span class="Comment">#</span>
<span id="L9" class="LineNr"> 9 </span><span class="Comment"># Expected output:</span>
<span id="L10" class="LineNr">10 </span><span class="Comment">#   caller 0</span>
<span id="L11" class="LineNr">11 </span><span class="Comment">#   callee 0</span>
<span id="L12" class="LineNr">12 </span><span class="Comment">#   caller 1</span>
<span id="L13" class="LineNr">13 </span><span class="Comment">#   callee 1</span>
<span id="L14" class="LineNr">14 </span><span class="Comment">#   caller 2</span>
<span id="L15" class="LineNr">15 </span><span class="Comment">#   callee 2</span>
<span id="L16" class="LineNr">16 </span>
<span id="L17" class="LineNr">17 </span><span class="muRecipe">def</span> <a href='continuation3.mu.html#L17'>main</a> [
<span id="L18" class="LineNr">18 </span>  <span class="Constant">local-scope</span>
<span id="L19" class="LineNr">19 </span>  $print <span class="Constant">[caller 0]</span> <span class="Constant">10/newline</span>
<span id="L20" class="LineNr">20 </span>  k:continuation <span class="Special">&lt;-</span> <span class="muControl">call-with-continuation-mark</span> <span class="Constant">100/mark</span>, <a href='continuation3.mu.html#L27'>f</a>
<span id="L21" class="LineNr">21 </span>  $print <span class="Constant">[caller 1]</span> <span class="Constant">10/newline</span>
<span id="L22" class="LineNr">22 </span>  k <span class="Special">&lt;-</span> call k
<span id="L23" class="LineNr">23 </span>  $print <span class="Constant">[caller 2]</span> <span class="Constant">10/newline</span>
<span id="L24" class="LineNr">24 </span>  call k
<span id="L25" class="LineNr">25 </span>]
<span id="L26" class="LineNr">26 </span>
<span id="L27" class="LineNr">27 </span><span class="muRecipe">def</span> <a href='continuation3.mu.html#L27'>f</a> [
<span id="L28" class="LineNr">28 </span>  <span class="Constant">local-scope</span>
<span id="L29" class="LineNr">29 </span>  $print <span class="Constant">[callee 0]</span> <span class="Constant">10/newline</span>
<span id="L30" class="LineNr">30 </span>  <span class="muControl">return-continuation-until-mark</span> <span class="Constant">100/mark</span>
<span id="L31" class="LineNr">31 </span>  $print <span class="Constant">[callee 1]</span> <span class="Constant">10/newline</span>
<span id="L32" class="LineNr">32 </span>  <span class="muControl">return-continuation-until-mark</span> <span class="Constant">100/mark</span>
<span id="L33" class="LineNr">33 </span>  $print <span class="Constant">[callee 2]</span> <span class="Constant">10/newline</span>
<span id="L34" class="LineNr">34 </span>]
</pre>
</body>
</html>
<!-- vim: set foldmethod=manual : -->
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-11-03 11:30:04 +0000
span>storing 57 in location 1 :(scenario add) def main [ 1:num <- copy 23 2:num <- copy 34 3:num <- add 1:num, 2:num ] +mem: storing 57 in location 3 :(scenario add_multiple) def main [ 1:num <- add 3, 4, 5 ] +mem: storing 12 in location 1 :(scenario add_checks_type) % Hide_errors = true; def main [ 1:num <- add 2:bool, 1 ] +error: main: 'add' requires number ingredients, but got '2:bool' :(scenario add_checks_return_type) % Hide_errors = true; def main [ 1:address:num <- add 2, 2 ] +error: main: 'add' should yield a number, but got '1:address:num' :(before "End Primitive Recipe Declarations") SUBTRACT, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "subtract", SUBTRACT); :(before "End Primitive Recipe Checks") case SUBTRACT: { if (inst.ingredients.empty()) { raise << maybe(get(Recipe, r).name) << "'subtract' has no ingredients\n" << end(); break; } for (int i = 0; i < SIZE(inst.ingredients); ++i) { if (is_raw(inst.ingredients.at(i))) continue; // permit address offset computations in tests if (!is_mu_number(inst.ingredients.at(i))) { raise << maybe(get(Recipe, r).name) << "'subtract' requires number ingredients, but got '" << inst.ingredients.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'subtract' 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) << "'subtract' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case SUBTRACT: { double result = ingredients.at(0).at(0); for (int i = 1; i < SIZE(ingredients); ++i) result -= ingredients.at(i).at(0); products.resize(1); products.at(0).push_back(result); break; } :(code) bool is_raw(const reagent& r) { return has_property(r, "raw"); } :(scenario subtract_literal) def main [ 1:num <- subtract 5, 2 ] +mem: storing 3 in location 1 :(scenario subtract) def main [ 1:num <- copy 23 2:num <- copy 34 3:num <- subtract 1:num, 2:num ] +mem: storing -11 in location 3 :(scenario subtract_multiple) def main [ 1:num <- subtract 6, 3, 2 ] +mem: storing 1 in location 1 :(before "End Primitive Recipe Declarations") MULTIPLY, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "multiply", MULTIPLY); :(before "End Primitive Recipe Checks") case MULTIPLY: { for (int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise << maybe(get(Recipe, r).name) << "'multiply' requires number ingredients, but got '" << inst.ingredients.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'multiply' 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) << "'multiply' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case MULTIPLY: { double result = 1; for (int i = 0; i < SIZE(ingredients); ++i) { result *= ingredients.at(i).at(0); } products.resize(1); products.at(0).push_back(result); break; } :(scenario multiply_literal) def main [ 1:num <- multiply 2, 3 ] +mem: storing 6 in location 1 :(scenario multiply) def main [ 1:num <- copy 4 2:num <- copy 6 3:num <- multiply 1:num, 2:num ] +mem: storing 24 in location 3 :(scenario multiply_multiple) def main [ 1:num <- multiply 2, 3, 4 ] +mem: storing 24 in location 1 :(before "End Primitive Recipe Declarations") DIVIDE, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "divide", DIVIDE); :(before "End Primitive Recipe Checks") case DIVIDE: { if (inst.ingredients.empty()) { raise << maybe(get(Recipe, r).name) << "'divide' has no ingredients\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) << "'divide' requires number ingredients, but got '" << inst.ingredients.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'divide' 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) << "'divide' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case DIVIDE: { double result = ingredients.at(0).at(0); for (int i = 1; i < SIZE(ingredients); ++i) result /= ingredients.at(i).at(0); products.resize(1); products.at(0).push_back(result); break; } :(scenario divide_literal) def main [ 1:num <- divide 8, 2 ] +mem: storing 4 in location 1 :(scenario divide) def main [ 1:num <- copy 27 2:num <- copy 3 3:num <- divide 1:num, 2:num ] +mem: storing 9 in location 3 :(scenario divide_multiple) def main [ 1:num <- divide 12, 3, 2 ] +mem: storing 2 in location 1 //: Integer division :(before "End Primitive Recipe Declarations") DIVIDE_WITH_REMAINDER, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "divide-with-remainder", DIVIDE_WITH_REMAINDER); :(before "End Primitive Recipe Checks") case DIVIDE_WITH_REMAINDER: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'divide-with-remainder' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'divide-with-remainder' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 2) { raise << maybe(get(Recipe, r).name) << "'divide-with-remainder' yields two products in '" << to_original_string(inst) << "'\n" << end(); break; } for (int i = 0; i < SIZE(inst.products); ++i) { if (!is_dummy(inst.products.at(i)) && !is_mu_number(inst.products.at(i))) { raise << maybe(get(Recipe, r).name) << "'divide-with-remainder' should yield a number, but got '" << inst.products.at(i).original_string << "'\n" << end(); goto finish_checking_instruction; } } break; } :(before "End Primitive Recipe Implementations") case DIVIDE_WITH_REMAINDER: { products.resize(2); // fractions will be dropped; very large numbers will overflow long long int a = static_cast<long long int>(ingredients.at(0).at(0)); long long int b = static_cast<long long int>(ingredients.at(1).at(0)); if (b == 0) { raise << maybe(current_recipe_name()) << "divide by zero in '" << to_original_string(current_instruction()) << "'\n" << end(); products.resize(2); products.at(0).push_back(0); products.at(1).push_back(0); break; } long long int quotient = a / b; long long int remainder = a % b; products.at(0).push_back(static_cast<double>(quotient)); products.at(1).push_back(static_cast<double>(remainder)); break; } :(scenario divide_with_remainder_literal) def main [ 1:num, 2:num <- divide-with-remainder 9, 2 ] +mem: storing 4 in location 1 +mem: storing 1 in location 2 :(scenario divide_with_remainder) def main [ 1:num <- copy 27 2:num <- copy 11 3:num, 4:num <- divide-with-remainder 1:num, 2:num ] +mem: storing 2 in location 3 +mem: storing 5 in location 4 :(scenario divide_with_decimal_point) def main [ 1:num <- divide 5, 2 ] +mem: storing 2.5 in location 1 :(scenario divide_by_zero) def main [ 1:num <- divide 4, 0 ] +mem: storing inf in location 1 :(scenario divide_by_zero_2) % Hide_errors = true; def main [ 1:num <- divide-with-remainder 4, 0 ] # integer division can't return floating-point infinity +error: main: divide by zero in '1:num <- divide-with-remainder 4, 0' //: Bitwise shifts :(before "End Primitive Recipe Declarations") SHIFT_LEFT, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "shift-left", SHIFT_LEFT); :(before "End Primitive Recipe Checks") case SHIFT_LEFT: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'shift-left' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'shift-left' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'shift-left' yields 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) << "'shift-left' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case SHIFT_LEFT: { // ingredients must be integers int a = static_cast<int>(ingredients.at(0).at(0)); int b = static_cast<int>(ingredients.at(1).at(0)); products.resize(1); if (b < 0) { raise << maybe(current_recipe_name()) << "second ingredient can't be negative in '" << to_original_string(current_instruction()) << "'\n" << end(); products.at(0).push_back(0); break; } products.at(0).push_back(a<<b); break; } :(scenario shift_left_by_zero) def main [ 1:num <- shift-left 1, 0 ] +mem: storing 1 in location 1 :(scenario shift_left_1) def main [ 1:num <- shift-left 1, 4 ] +mem: storing 16 in location 1 :(scenario shift_left_2) def main [ 1:num <- shift-left 3, 2 ] +mem: storing 12 in location 1 :(scenario shift_left_by_negative) % Hide_errors = true; def main [ 1:num <- shift-left 3, -1 ] +error: main: second ingredient can't be negative in '1:num <- shift-left 3, -1' :(scenario shift_left_ignores_fractional_part) def main [ 1:num <- divide 3, 2 2:num <- shift-left 1:num, 1 ] +mem: storing 2 in location 2 :(before "End Primitive Recipe Declarations") SHIFT_RIGHT, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "shift-right", SHIFT_RIGHT); :(before "End Primitive Recipe Checks") case SHIFT_RIGHT: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'shift-right' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'shift-right' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'shift-right' yields 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) << "'shift-right' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case SHIFT_RIGHT: { // ingredients must be integers int a = static_cast<int>(ingredients.at(0).at(0)); int b = static_cast<int>(ingredients.at(1).at(0)); products.resize(1); if (b < 0) { raise << maybe(current_recipe_name()) << "second ingredient can't be negative in '" << to_original_string(current_instruction()) << "'\n" << end(); products.at(0).push_back(0); break; } products.at(0).push_back(a>>b); break; } :(scenario shift_right_by_zero) def main [ 1:num <- shift-right 1, 0 ] +mem: storing 1 in location 1 :(scenario shift_right_1) def main [ 1:num <- shift-right 1024, 1 ] +mem: storing 512 in location 1 :(scenario shift_right_2) def main [ 1:num <- shift-right 3, 1 ] +mem: storing 1 in location 1 :(scenario shift_right_by_negative) % Hide_errors = true; def main [ 1:num <- shift-right 4, -1 ] +error: main: second ingredient can't be negative in '1:num <- shift-right 4, -1' :(scenario shift_right_ignores_fractional_part) def main [ 1:num <- divide 3, 2 2:num <- shift-right 1:num, 1 ] +mem: storing 0 in location 2 :(before "End Primitive Recipe Declarations") AND_BITS, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "and-bits", AND_BITS); :(before "End Primitive Recipe Checks") case AND_BITS: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'and-bits' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'and-bits' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'and-bits' yields 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) << "'and-bits' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case AND_BITS: { // ingredients must be integers int a = static_cast<int>(ingredients.at(0).at(0)); int b = static_cast<int>(ingredients.at(1).at(0)); products.resize(1); products.at(0).push_back(a&b); break; } :(scenario and_bits_1) def main [ 1:num <- and-bits 8, 3 ] +mem: storing 0 in location 1 :(scenario and_bits_2) def main [ 1:num <- and-bits 3, 2 ] +mem: storing 2 in location 1 :(scenario and_bits_3) def main [ 1:num <- and-bits 14, 3 ] +mem: storing 2 in location 1 :(scenario and_bits_negative) def main [ 1:num <- and-bits -3, 4 ] +mem: storing 4 in location 1 :(before "End Primitive Recipe Declarations") OR_BITS, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "or-bits", OR_BITS); :(before "End Primitive Recipe Checks") case OR_BITS: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'or-bits' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'or-bits' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'or-bits' yields 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) << "'or-bits' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case OR_BITS: { // ingredients must be integers int a = static_cast<int>(ingredients.at(0).at(0)); int b = static_cast<int>(ingredients.at(1).at(0)); products.resize(1); products.at(0).push_back(a|b); break; } :(scenario or_bits_1) def main [ 1:num <- or-bits 3, 8 ] +mem: storing 11 in location 1 :(scenario or_bits_2) def main [ 1:num <- or-bits 3, 10 ] +mem: storing 11 in location 1 :(scenario or_bits_3) def main [ 1:num <- or-bits 4, 6 ] +mem: storing 6 in location 1 :(before "End Primitive Recipe Declarations") XOR_BITS, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "xor-bits", XOR_BITS); :(before "End Primitive Recipe Checks") case XOR_BITS: { if (SIZE(inst.ingredients) != 2) { raise << maybe(get(Recipe, r).name) << "'xor-bits' requires exactly two ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0)) || !is_mu_number(inst.ingredients.at(1))) { raise << maybe(get(Recipe, r).name) << "'xor-bits' requires number ingredients, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'xor-bits' yields 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) << "'xor-bits' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case XOR_BITS: { // ingredients must be integers int a = static_cast<int>(ingredients.at(0).at(0)); int b = static_cast<int>(ingredients.at(1).at(0)); products.resize(1); products.at(0).push_back(a^b); break; } :(scenario xor_bits_1) def main [ 1:num <- xor-bits 3, 8 ] +mem: storing 11 in location 1 :(scenario xor_bits_2) def main [ 1:num <- xor-bits 3, 10 ] +mem: storing 9 in location 1 :(scenario xor_bits_3) def main [ 1:num <- xor-bits 4, 6 ] +mem: storing 2 in location 1 :(before "End Primitive Recipe Declarations") FLIP_BITS, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "flip-bits", FLIP_BITS); :(before "End Primitive Recipe Checks") case FLIP_BITS: { if (SIZE(inst.ingredients) != 1) { raise << maybe(get(Recipe, r).name) << "'flip-bits' requires exactly one ingredient, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0))) { raise << maybe(get(Recipe, r).name) << "'flip-bits' requires a number ingredient, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (SIZE(inst.products) > 1) { raise << maybe(get(Recipe, r).name) << "'flip-bits' yields 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) << "'flip-bits' should yield a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); goto finish_checking_instruction; } break; } :(before "End Primitive Recipe Implementations") case FLIP_BITS: { // ingredient must be integer int a = static_cast<int>(ingredients.at(0).at(0)); products.resize(1); products.at(0).push_back(~a); break; } :(scenario flip_bits_zero) def main [ 1:num <- flip-bits 0 ] +mem: storing -1 in location 1 :(scenario flip_bits_negative) def main [ 1:num <- flip-bits -1 ] +mem: storing 0 in location 1 :(scenario flip_bits_1) def main [ 1:num <- flip-bits 3 ] +mem: storing -4 in location 1 :(scenario flip_bits_2) def main [ 1:num <- flip-bits 12 ] +mem: storing -13 in location 1 :(before "End Primitive Recipe Declarations") ROUND, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "round", ROUND); :(before "End Primitive Recipe Checks") case ROUND: { if (SIZE(inst.ingredients) != 1) { raise << maybe(get(Recipe, r).name) << "'round' requires exactly one ingredient, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0))) { raise << maybe(get(Recipe, r).name) << "first ingredient of 'round' should be a number, but got '" << inst.ingredients.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case ROUND: { products.resize(1); products.at(0).push_back(rint(ingredients.at(0).at(0))); break; } :(scenario round_to_nearest_integer) def main [ 1:num <- round 12.2 ] +mem: storing 12 in location 1 :(scenario round_halves_toward_zero) def main [ 1:num <- round 12.5 ] +mem: storing 12 in location 1 :(scenario round_halves_toward_zero_2) def main [ 1:num <- round -12.5 ] +mem: storing -12 in location 1 :(before "End Primitive Recipe Declarations") TRUNCATE, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "truncate", TRUNCATE); :(before "End Primitive Recipe Checks") case TRUNCATE: { if (SIZE(inst.ingredients) != 1) { raise << maybe(get(Recipe, r).name) << "'truncate' requires exactly one ingredient, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0))) { raise << maybe(get(Recipe, r).name) << "first ingredient of 'truncate' should be a number, but got '" << inst.ingredients.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case TRUNCATE: { products.resize(1); products.at(0).push_back(trunc(ingredients.at(0).at(0))); break; } :(scenario truncate_to_nearest_integer) def main [ 1:num <- truncate 12.2 ] +mem: storing 12 in location 1 :(scenario truncate_negative) def main [ 1:num <- truncate -12.2 ] +mem: storing -12 in location 1 :(before "End Primitive Recipe Declarations") SQUARE_ROOT, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "square-root", SQUARE_ROOT); :(before "End Primitive Recipe Checks") case SQUARE_ROOT: { if (SIZE(inst.ingredients) != 1) { raise << maybe(get(Recipe, r).name) << "'square-root' requires exactly one ingredient, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.ingredients.at(0))) { raise << maybe(get(Recipe, r).name) << "first ingredient of 'square-root' should be a number, but got '" << inst.ingredients.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case SQUARE_ROOT: { products.resize(1); products.at(0).push_back(sqrt(ingredients.at(0).at(0))); break; } :(before "End Primitive Recipe Declarations") CHARACTER_TO_CODE, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "character-to-code", CHARACTER_TO_CODE); :(before "End Primitive Recipe Checks") case CHARACTER_TO_CODE: { if (SIZE(inst.ingredients) != 1) { raise << maybe(get(Recipe, r).name) << "'character-to-code' requires exactly one ingredient, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_character(inst.ingredients.at(0))) { raise << maybe(get(Recipe, r).name) << "first ingredient of 'character-to-code' should be a character, but got '" << inst.ingredients.at(0).original_string << "'\n" << end(); break; } if (SIZE(inst.products) != 1) { raise << maybe(get(Recipe, r).name) << "'character-to-code' requires exactly one product, but got '" << to_original_string(inst) << "'\n" << end(); break; } if (!is_mu_number(inst.products.at(0))) { raise << maybe(get(Recipe, r).name) << "first product of 'character-to-code' should be a number, but got '" << inst.products.at(0).original_string << "'\n" << end(); break; } break; } :(before "End Primitive Recipe Implementations") case CHARACTER_TO_CODE: { double result = 0; for (int i = 0; i < SIZE(ingredients); ++i) { result += ingredients.at(i).at(0); } products.resize(1); products.at(0).push_back(result); break; } :(before "End Includes") #include <math.h>
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-11-03 11:29:58 +0000