From 104e521c04d1a0cad9c68fb11e250e12ad8917ef Mon Sep 17 00:00:00 2001 From: Kartik Agaram Date: Wed, 17 Oct 2018 07:08:47 -0700 Subject: 4709 --- html/045closure_name.cc.html | 30 +++++++++++++++--------------- 1 file changed, 15 insertions(+), 15 deletions(-) (limited to 'html/045closure_name.cc.html') diff --git a/html/045closure_name.cc.html b/html/045closure_name.cc.html index c72a8621..6dbc73c8 100644 --- a/html/045closure_name.cc.html +++ b/html/045closure_name.cc.html @@ -104,7 +104,7 @@ if ('onhashchange' in window) { 42 43 :(code) 44 void collect_surrounding_spaces(const recipe_ordinal r) { - 45 trace(9991, "transform") << "--- collect surrounding spaces for recipe " << get(Recipe, r).name << end(); + 45 trace(9991, "transform") << "--- collect surrounding spaces for recipe " << get(Recipe, r).name << end(); 46 for (int i = 0; i < SIZE(get(Recipe, r).steps); ++i) { 47 const instruction& inst = get(Recipe, r).steps.at(i); 48 if (inst.is_label) continue; @@ -112,28 +112,28 @@ if ('onhashchange' in window) { 50 if (is_literal(inst.products.at(j))) continue; 51 if (inst.products.at(j).name != "0") continue; 52 if (!is_mu_space(inst.products.at(j))) { - 53 raise << "slot 0 should always have type address:array:location, but is '" << to_string(inst.products.at(j)) << "'\n" << end(); + 53 raise << "slot 0 should always have type address:array:location, but is '" << to_string(inst.products.at(j)) << "'\n" << end(); 54 continue; 55 } 56 string_tree* s = property(inst.products.at(j), "names"); 57 if (!s) { - 58 raise << "slot 0 requires a /names property in recipe '" << get(Recipe, r).name << "'\n" << end(); + 58 raise << "slot 0 requires a /names property in recipe '" << get(Recipe, r).name << "'\n" << end(); 59 continue; 60 } - 61 if (!s->atom) raise << "slot 0 should have a single value in /names, but got '" << to_string(inst.products.at(j)) << "'\n" << end(); + 61 if (!s->atom) raise << "slot 0 should have a single value in /names, but got '" << to_string(inst.products.at(j)) << "'\n" << end(); 62 const string& surrounding_recipe_name = s->value; 63 if (surrounding_recipe_name.empty()) { - 64 raise << "slot 0 doesn't initialize its /names property in recipe '" << get(Recipe, r).name << "'\n" << end(); + 64 raise << "slot 0 doesn't initialize its /names property in recipe '" << get(Recipe, r).name << "'\n" << end(); 65 continue; 66 } 67 if (contains_key(Surrounding_space, r) 68 && get(Surrounding_space, r) != get(Recipe_ordinal, surrounding_recipe_name)) { - 69 raise << "recipe '" << get(Recipe, r).name << "' can have only one 'surrounding' recipe but has '" << get(Recipe, get(Surrounding_space, r)).name << "' and '" << surrounding_recipe_name << "'\n" << end(); + 69 raise << "recipe '" << get(Recipe, r).name << "' can have only one 'surrounding' recipe but has '" << get(Recipe, get(Surrounding_space, r)).name << "' and '" << surrounding_recipe_name << "'\n" << end(); 70 continue; 71 } - 72 trace(9993, "name") << "lexically surrounding space for recipe " << get(Recipe, r).name << " comes from " << surrounding_recipe_name << end(); + 72 trace(9993, "name") << "lexically surrounding space for recipe " << get(Recipe, r).name << " comes from " << surrounding_recipe_name << end(); 73 if (!contains_key(Recipe_ordinal, surrounding_recipe_name)) { - 74 raise << "can't find recipe providing surrounding space for '" << get(Recipe, r).name << "'; looking for '" << surrounding_recipe_name << "'\n" << end(); + 74 raise << "can't find recipe providing surrounding space for '" << get(Recipe, r).name << "'; looking for '" << surrounding_recipe_name << "'\n" << end(); 75 continue; 76 } 77 put(Surrounding_space, r, get(Recipe_ordinal, surrounding_recipe_name)); @@ -147,11 +147,11 @@ if ('onhashchange' in window) { 85 :(replace{} "int lookup_name(const reagent& r, const recipe_ordinal default_recipe)") 86 int lookup_name(const reagent& x, const recipe_ordinal default_recipe) { 87 if (!has_property(x, "space")) { - 88 if (Name[default_recipe].empty()) raise << "name not found: " << x.name << '\n' << end(); + 88 if (Name[default_recipe].empty()) raise << "name not found: " << x.name << '\n' << end(); 89 return Name[default_recipe][x.name]; 90 } 91 string_tree* p = property(x, "space"); - 92 if (!p || !p->atom) raise << "/space property should have exactly one (non-negative integer) value\n" << end(); + 92 if (!p || !p->atom) raise << "/space property should have exactly one (non-negative integer) value\n" << end(); 93 int n = to_integer(p->value); 94 assert(n >= 0); 95 recipe_ordinal surrounding_recipe = lookup_surrounding_recipe(default_recipe, n); @@ -166,11 +166,11 @@ if ('onhashchange' in window) { 104 int lookup_name(const reagent& x, const recipe_ordinal r, set<recipe_ordinal>& done, vector<recipe_ordinal>& path) { 105 if (!Name[r].empty()) return Name[r][x.name]; 106 if (contains_key(done, r)) { -107 raise << "can't compute address of '" << to_string(x) << "' because\n" << end(); +107 raise << "can't compute address of '" << to_string(x) << "' because\n" << end(); 108 for (int i = 1; i < SIZE(path); ++i) { -109 raise << path.at(i-1) << " requires computing names of " << path.at(i) << '\n' << end(); +109 raise << path.at(i-1) << " requires computing names of " << path.at(i) << '\n' << end(); 110 } -111 raise << path.at(SIZE(path)-1) << " requires computing names of " << r << "..ad infinitum\n" << end(); +111 raise << path.at(SIZE(path)-1) << " requires computing names of " << r << "..ad infinitum\n" << end(); 112 return -1; 113 } 114 done.insert(r); @@ -183,7 +183,7 @@ if ('onhashchange' in window) { 121 recipe_ordinal lookup_surrounding_recipe(const recipe_ordinal r, int n) { 122 if (n == 0) return r; 123 if (!contains_key(Surrounding_space, r)) { -124 raise << "don't know surrounding recipe of '" << get(Recipe, r).name << "'\n" << end(); +124 raise << "don't know surrounding recipe of '" << get(Recipe, r).name << "'\n" << end(); 125 return -1; 126 } 127 assert(contains_key(Surrounding_space, r)); @@ -196,7 +196,7 @@ if ('onhashchange' in window) { 134 if (has_property(r, "space")) { 135 string_tree* p = property(r, "space"); 136 if (!p || !p->atom) { -137 raise << "/space property should have exactly one (non-negative integer) value in '" << r.original_string << "'\n" << end(); +137 raise << "/space property should have exactly one (non-negative integer) value in '" << r.original_string << "'\n" << end(); 138 return false; 139 } 140 if (p->value != "0") return true; -- cgit 1.4.1-2-gfad0