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
|
:(before "End Primitive Recipe Declarations")
RANDOM,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "random", RANDOM);
:(before "End Primitive Recipe Checks")
case RANDOM: {
break;
}
:(before "End Primitive Recipe Implementations")
case RANDOM: {
// todo: limited range of numbers, might be imperfectly random
// todo: thread state in extra ingredients and products
products.resize(1);
products.at(0).push_back(rand());
break;
}
:(before "End Primitive Recipe Declarations")
MAKE_RANDOM_NONDETERMINISTIC,
:(before "End Primitive Recipe Numbers")
put(Recipe_ordinal, "make-random-nondeterministic", MAKE_RANDOM_NONDETERMINISTIC);
:(before "End Primitive Recipe Checks")
case MAKE_RANDOM_NONDETERMINISTIC: {
break;
}
:(before "End Primitive Recipe Implementations")
case MAKE_RANDOM_NONDETERMINISTIC: {
srand(time(NULL));
break;
}
:(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_error << maybe(get(Recipe, r).name) << "'round' requires exactly one ingredient, but got " << inst.to_string() << '\n' << end();
break;
}
if (!is_mu_number(inst.ingredients.at(0))) {
raise_error << 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)
recipe main [
1:number <- round 12.2
]
+mem: storing 12 in location 1
:(before "End Includes")
#include<math.h>
|