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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
//: Transform to maintain multiple variants of a recipe depending on the
//: number and types of the ingredients and products. Allows us to use nice
//: names like 'print' or 'length' in many mutually extensible ways.
:(scenario static_dispatch)
recipe main [
7:number/raw <- test 3
]
recipe test a:number -> z:number [
z <- copy 1
]
recipe test a:number, b:number -> z:number [
z <- copy 2
]
+mem: storing 1 in location 7
//: When loading recipes, accumulate variants if headers don't collide, and
//: raise a warning if headers collide.
:(before "End Globals")
map<string, vector<recipe_ordinal> > Recipe_variants;
:(before "End One-time Setup")
put(Recipe_variants, "main", vector<recipe_ordinal>()); // since we manually added main to Recipe_ordinal
:(before "End Setup")
for (map<string, vector<recipe_ordinal> >::iterator p = Recipe_variants.begin(); p != Recipe_variants.end(); ++p) {
for (long long int i = 0; i < SIZE(p->second); ++i) {
if (p->second.at(i) >= Reserved_for_tests)
p->second.at(i) = -1; // just leave a ghost
}
}
:(before "End Load Recipe Header(result)")
if (contains_key(Recipe_ordinal, result.name)) {
const recipe_ordinal r = get(Recipe_ordinal, result.name);
//? if (variant_already_exists(result)) cerr << "AAAAAAAAAAAAAAAAAA variant already exists " << result.name << '\n';
if ((!contains_key(Recipe, r) || get(Recipe, r).has_header)
&& !variant_already_exists(result)) {
string new_name = next_unused_recipe_name(result.name);
put(Recipe_ordinal, new_name, Next_recipe_ordinal++);
get(Recipe_variants, result.name).push_back(get(Recipe_ordinal, new_name));
result.name = new_name;
}
}
else {
// save first variant
put(Recipe_ordinal, result.name, Next_recipe_ordinal++);
get_or_insert(Recipe_variants, result.name).push_back(get(Recipe_ordinal, result.name));
}
:(code)
bool variant_already_exists(const recipe& rr) {
const vector<recipe_ordinal>& variants = get(Recipe_variants, rr.name);
for (long long int i = 0; i < SIZE(variants); ++i) {
if (contains_key(Recipe, variants.at(i))
&& all_reagents_match(rr, get(Recipe, variants.at(i)))) {
return true;
}
}
return false;
}
bool all_reagents_match(const recipe& r1, const recipe& r2) {
if (SIZE(r1.ingredients) != SIZE(r2.ingredients)) return false;
if (SIZE(r1.products) != SIZE(r2.products)) return false;
for (long long int i = 0; i < SIZE(r1.ingredients); ++i) {
if (!deeply_equal_types(r1.ingredients.at(i).properties.at(0).second,
r2.ingredients.at(i).properties.at(0).second)) {
return false;
}
}
for (long long int i = 0; i < SIZE(r1.products); ++i) {
if (!deeply_equal_types(r1.products.at(i).properties.at(0).second,
r2.products.at(i).properties.at(0).second)) {
return false;
}
}
return true;
}
bool exact_match(type_tree* a, type_tree* b) {
if (a == b) return true;
return a->value == b->value
&& exact_match(a->left, b->left)
&& exact_match(a->right, b->right);
}
string next_unused_recipe_name(const string& recipe_name) {
for (long long int i = 2; ; ++i) {
ostringstream out;
out << recipe_name << '_' << i;
if (!contains_key(Recipe_ordinal, out.str()))
return out.str();
}
}
//: Once all the recipes are loaded, transform their bodies to replace each
//: call with the most suitable variant.
:(scenario static_dispatch_picks_most_similar_variant)
recipe main [
7:number/raw <- test 3, 4, 5
]
recipe test a:number -> z:number [
z <- copy 1
]
recipe test a:number, b:number -> z:number [
z <- copy 2
]
+mem: storing 2 in location 7
//: after insert_fragments (tangle) and before computing operation ids
//: after filling in all missing types (because we'll be introducing 'blank' types in this transform in a later layer, for shape-shifting recipes)
:(after "Transform.push_back(deduce_types_from_header)")
Transform.push_back(resolve_ambiguous_calls); // idempotent
:(code)
void resolve_ambiguous_calls(recipe_ordinal r) {
recipe& caller_recipe = get(Recipe, r);
trace(9991, "transform") << "--- resolve ambiguous calls for recipe " << caller_recipe.name << end();
for (long long int index = 0; index < SIZE(caller_recipe.steps); ++index) {
instruction& inst = caller_recipe.steps.at(index);
if (inst.is_label) continue;
if (!contains_key(Recipe_variants, inst.name)) continue;
assert(!get(Recipe_variants, inst.name).empty());
replace_best_variant(inst, caller_recipe);
}
//? if (caller_recipe.name == "main") cerr << "=============== " << debug_string(caller_recipe) << '\n';
}
void replace_best_variant(instruction& inst, const recipe& caller_recipe) {
trace(9992, "transform") << "instruction " << inst.name << end();
vector<recipe_ordinal>& variants = get(Recipe_variants, inst.name);
long long int best_score = variant_score(inst, get(Recipe_ordinal, inst.name));
for (long long int i = 0; i < SIZE(variants); ++i) {
long long int current_score = variant_score(inst, variants.at(i));
trace(9992, "transform") << "checking variant " << i << ": " << current_score << end();
if (current_score > best_score) {
inst.name = get(Recipe, variants.at(i)).name;
best_score = current_score;
}
}
// End Instruction Dispatch(inst, best_score)
}
long long int variant_score(const instruction& inst, recipe_ordinal variant) {
if (variant == -1) return -1; // ghost from a previous test
const vector<reagent>& header_ingredients = get(Recipe, variant).ingredients;
if (SIZE(inst.ingredients) < SIZE(header_ingredients)) {
trace(9993, "transform") << "too few ingredients" << end();
return -1;
}
for (long long int i = 0; i < SIZE(header_ingredients); ++i) {
if (!types_match(header_ingredients.at(i), inst.ingredients.at(i))) {
trace(9993, "transform") << "mismatch: ingredient " << i << end();
return -1;
}
}
if (SIZE(inst.products) > SIZE(get(Recipe, variant).products)) {
trace(9993, "transform") << "too few products" << end();
return -1;
}
const vector<reagent>& header_products = get(Recipe, variant).products;
for (long long int i = 0; i < SIZE(inst.products); ++i) {
if (!types_match(header_products.at(i), inst.products.at(i))) {
trace(9993, "transform") << "mismatch: product " << i << end();
return -1;
}
}
// the greater the number of unused ingredients, the lower the score
return 100 - (SIZE(get(Recipe, variant).products)-SIZE(inst.products))
- (SIZE(inst.ingredients)-SIZE(get(Recipe, variant).ingredients)); // ok to go negative
}
:(scenario static_dispatch_disabled_on_headerless_definition)
% Hide_warnings = true;
recipe test a:number -> z:number [
z <- copy 1
]
recipe test [
reply 34
]
+warn: redefining recipe test
:(scenario static_dispatch_disabled_on_headerless_definition_2)
% Hide_warnings = true;
recipe test [
reply 34
]
recipe test a:number -> z:number [
z <- copy 1
]
+warn: redefining recipe test
|