blob: 33c85e4d74f40bd1519076db52411962e214d799 (
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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
//: Calls can take ingredients just like primitives. To access a recipe's
//: ingredients, use 'next-ingredient'.
:(scenario next_ingredient)
recipe main [
f 2:literal
]
recipe f [
12:number <- next-ingredient
13:number <- add 1:literal, 12:number
]
+mem: storing 3 in location 13
:(scenario next_ingredient_missing)
recipe main [
f
]
recipe f [
_, 12:number <- next-ingredient
]
+mem: storing 0 in location 12
:(before "End call Fields")
vector<vector<double> > ingredient_atoms;
long long int next_ingredient_to_process;
:(before "End call Constructor")
next_ingredient_to_process = 0;
:(after "complete_call:")
for (long long int i = 0; i < SIZE(ingredients); ++i) {
Current_routine->calls.front().ingredient_atoms.push_back(ingredients.at(i));
}
:(before "End Primitive Recipe Declarations")
NEXT_INGREDIENT,
:(before "End Primitive Recipe Numbers")
Recipe_number["next-ingredient"] = NEXT_INGREDIENT;
:(before "End Primitive Recipe Implementations")
case NEXT_INGREDIENT: {
assert(!Current_routine->calls.empty());
if (Current_routine->calls.front().next_ingredient_to_process < SIZE(Current_routine->calls.front().ingredient_atoms)) {
products.push_back(
Current_routine->calls.front().ingredient_atoms.at(Current_routine->calls.front().next_ingredient_to_process));
assert(SIZE(products) == 1); products.resize(2); // push a new vector
products.at(1).push_back(1);
++Current_routine->calls.front().next_ingredient_to_process;
}
else {
products.resize(2);
products.at(0).push_back(0); // todo: will fail noisily if we try to read a compound value
products.at(1).push_back(0);
}
break;
}
:(scenario rewind_ingredients)
recipe main [
f 2:literal
]
recipe f [
12:number <- next-ingredient # consume ingredient
_, 1:boolean <- next-ingredient # will not find any ingredients
rewind-ingredients
13:number, 2:boolean <- next-ingredient # will find ingredient again
]
+mem: storing 2 in location 12
+mem: storing 0 in location 1
+mem: storing 2 in location 13
+mem: storing 1 in location 2
:(before "End Primitive Recipe Declarations")
REWIND_INGREDIENTS,
:(before "End Primitive Recipe Numbers")
Recipe_number["rewind-ingredients"] = REWIND_INGREDIENTS;
:(before "End Primitive Recipe Implementations")
case REWIND_INGREDIENTS: {
Current_routine->calls.front().next_ingredient_to_process = 0;
break;
}
:(scenario ingredient)
recipe main [
f 1:literal, 2:literal
]
recipe f [
12:number <- ingredient 1:literal # consume second ingredient first
13:number, 1:boolean <- next-ingredient # next-ingredient tries to scan past that
]
+mem: storing 2 in location 12
+mem: storing 0 in location 1
:(before "End Primitive Recipe Declarations")
INGREDIENT,
:(before "End Primitive Recipe Numbers")
Recipe_number["ingredient"] = INGREDIENT;
:(before "End Primitive Recipe Implementations")
case INGREDIENT: {
assert(isa_literal(current_instruction().ingredients.at(0)));
assert(scalar(ingredients.at(0)));
if (static_cast<long long int>(ingredients.at(0).at(0)) < SIZE(Current_routine->calls.front().ingredient_atoms)) {
Current_routine->calls.front().next_ingredient_to_process = ingredients.at(0).at(0);
products.push_back(
Current_routine->calls.front().ingredient_atoms.at(Current_routine->calls.front().next_ingredient_to_process));
assert(SIZE(products) == 1); products.resize(2); // push a new vector
products.at(1).push_back(1);
++Current_routine->calls.front().next_ingredient_to_process;
}
else {
if (SIZE(current_instruction().products) > 1) {
products.resize(2);
products.at(0).push_back(0); // todo: will fail noisily if we try to read a compound value
products.at(1).push_back(0);
}
}
break;
}
|