:(scenario next_ingredient)
recipe main [
f 2
]
recipe f [
12:number <- next-ingredient
13:number <- add 1, 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 "call_housekeeping:")
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_ordinal["next-ingredient"] = NEXT_INGREDIENT;
:(before "End Primitive Recipe Implementations")
case NEXT_INGREDIENT: {
if (!ingredients.empty()) {
raise << current_recipe_name() << ": 'next-ingredient' didn't expect any ingredients in '" << current_instruction().to_string() << "'\n" << end();
break;
}
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);
products.at(1).push_back(1);
++Current_routine->calls.front().next_ingredient_to_process;
}
else {
products.resize(2);
products.at(0).push_back(0);
products.at(1).push_back(0);
}
break;
}
:(scenario rewind_ingredients)
recipe main [
f 2
]
recipe f [
12:number <- next-ingredient
_, 1:boolean <- next-ingredient
rewind-ingredients
13:number, 2:boolean <- next-ingredient
]
+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_ordinal["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, 2
]
recipe f [
12:number <- ingredient 1
13:number, 1:boolean <- next-ingredient
]
+mem: storing 2 in location 12
+mem: storing 0 in location 1
:(before "End Primitive Recipe Declarations")
INGREDIENT,
:(before "End Primitive Recipe Numbers")
Recipe_ordinal["ingredient"] = INGREDIENT;
:(before "End Primitive Recipe Implementations")
case INGREDIENT: {
if (SIZE(ingredients) != 1) {
raise << current_recipe_name() << ": 'ingredient' expects exactly one ingredient, but got '" << current_instruction().to_string() << "'\n" << end();
break;
}
if (!is_literal(current_instruction().ingredients.at(0))) {
raise << current_recipe_name() << ": 'ingredient' expects a literal ingredient, but got " << current_instruction().ingredients.at(0).original_string << '\n' << end();
break;
}
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);
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);
products.at(1).push_back(0);
}
}
break;
}