mirrors/hyperrogue
1
0
Fork 0
mirror of https://github.com/zenorogue/hyperrogue.git synced 2025-10-31 14:02:59 +00:00
Code Issues Releases Wiki Activity

rulegen:: more fixes in reporting

Browse Source
This commit is contained in:
Zeno Rogue
2021-08-21 23:40:50 +02:00
parent 7f33024321
commit 3654ca58aa
1 changed files with 7 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
rulegen.cpp
View File

@@ -339,7 +339,6 @@ EX void shortcut_found(tcell *c, tcell *alt, const vector<twalker> &walkers, con
reverse(pre.begin(), pre.end()); reverse(pre.begin(), pre.end());
reverse(post.begin(), post.end()); reverse(post.begin(), post.end());
println(hlog, "now at1 is ", at1);
int delta = at1.to_spin(walkers2.back().spin); int delta = at1.to_spin(walkers2.back().spin);
for(auto& s: shortcuts[c->id]) if(s->pre == pre && s->post == post) { for(auto& s: shortcuts[c->id]) if(s->pre == pre && s->post == post) {
@@ -500,6 +499,7 @@ void be_solid(tcell *c) {
look_for_shortcuts(c); look_for_shortcuts(c);
ufindc(c); ufindc(c);
if(c->dist == MYSTERY) { if(c->dist == MYSTERY) {
if(debugflags & DF_GEOM)
println(hlog, "set solid but no dist ", c); println(hlog, "set solid but no dist ", c);
debuglist = { c }; debuglist = { c };
throw rulegen_failure("set solid but no dist"); throw rulegen_failure("set solid but no dist");
@@ -818,6 +818,7 @@ int get_side(twalker what) {
ufind(cw); ufind(cw);
if(cw.at->move(d)->dist >= cw.at->dist) { if(cw.at->move(d)->dist >= cw.at->dist) {
handle_distance_errors(); handle_distance_errors();
if(debugflags & DF_GEOM)
println(hlog, "get_parent_dir error at ", cw, " and ", cw.at->move(d), ": ", cw.at->dist, "::", cw.at->move(d)->dist); println(hlog, "get_parent_dir error at ", cw, " and ", cw.at->move(d), ": ", cw.at->dist, "::", cw.at->move(d)->dist);
throw rulegen_failure("get_parent_dir error"); throw rulegen_failure("get_parent_dir error");
} }
@@ -994,6 +995,7 @@ vector<int> gen_rule(twalker cwmain, int id) {
int val = treestates[id].code.second[i+1]; int val = treestates[id].code.second[i+1];
if(val < 2 || val >= 8) { if(val < 2 || val >= 8) {
debuglist = { cwmain }; debuglist = { cwmain };
if(debugflags & DF_GEOM)
println(hlog, "i = ", i, " val = ", val, " code = ", treestates[id].code); println(hlog, "i = ", i, " val = ", val, " code = ", treestates[id].code);
throw rulegen_retry("wrong code in gen_rule"); throw rulegen_retry("wrong code in gen_rule");
} }
@@ -1224,7 +1226,7 @@ void verified_treewalk(twalker& tw, int id, int dir) {
if(debugflags & DF_GEOM) if(debugflags & DF_GEOM)
println(hlog, "expected ", make_pair((tw+wstep).spin,id), " found ", co); println(hlog, "expected ", make_pair((tw+wstep).spin,id), " found ", co);
} }
else else if(debugflags & DF_GEOM)
println(hlog, "expected ", make_pair((tw+wstep).spin,id), " found ", co, " again"); println(hlog, "expected ", make_pair((tw+wstep).spin,id), " found ", co, " again");
debuglist = {tw, tw+wstep}; debuglist = {tw, tw+wstep};
throw verify_advance_failed(); throw verify_advance_failed();