namespace hr { namespace ads_game { color_t shipcolor = 0x2020FFFF; cross_result findflat(shiftpoint h) { return cross0(current * rgpushxto0(h)); } void draw_game_cell(cell *c, ads_matrix V, ld plev) { cross_result center; vector hlist; hybrid::in_actual([&]{ for(int i=0; i<=c->type; i++) { hyperpoint ha = hybrid::get_corner(c, i, 2, 0); hlist.push_back(findflat(V * ha)); } }); auto& ci = ci_at[c]; if(ci.mpd_terrain > 0) { if(!gen_budget) return; gen_budget--; } gen_terrain(c, ci); gen_rocks(c, ci, 0); auto& t = ci.type; if(t == wtGate) { ld minv = hlist[0].shift; ld maxv = hlist[0].shift; for(auto& h: hlist) { ld v = h.shift; if(v < minv) minv = v; if(v > maxv) maxv = v; } auto draw_slice = [&] (ld a, ld b, color_t col) { vector slice; for(int i=0; itype; i++) { if(hlist[i].shift >= a && hlist[i].shift <= b) slice.push_back(hlist[i].h); if((hlist[i].shift < a) ^ (hlist[i+1].shift < a)) { ld p = ilerp(hlist[i].shift, hlist[i+1].shift, a); hyperpoint h1 = lerp(hlist[i].h, hlist[i+1].h, p); slice.push_back(h1); } if((hlist[i].shift > b) ^ (hlist[i+1].shift > b)) { ld p = ilerp(hlist[i].shift, hlist[i+1].shift, b); hyperpoint h1 = lerp(hlist[i].h, hlist[i+1].h, p); slice.push_back(h1); } if(hlist[i+1].shift < a && hlist[i].shift > b) swap((&slice.back())[-1], slice.back()); } if(isize(slice) < 3) return; for(auto e: slice) curvepoint(e); curvepoint(slice[0]); queuecurve(shiftless(Id), 0xFFFFFFFF, col, PPR::LINE); }; for(int v=floor(minv); v> 8, 0); queuecurve(shiftless(Id), 0x101010FF, col, PPR::WALL); } if(view_proper_times) { string str = format(tformat, center.shift / time_unit); queuestr(shiftless(rgpushxto0(center.h)), .1, str, 0xFF4040, 8); } for(auto& r: ci.rocks) { auto& rock = *r; if(!paused) { if(rock.type == oRock && rock.expire < pdata.score) { rock.resource = rtNone; rock.col = rock_color[rtNone]; rock.expire = 999999; } if(rock.type == oResource && rock.expire < pdata.score) { rock.resource = rtNone; rock.col = rsrc_color[rtNone]; rock.shape = rsrc_shape[rtNone]; rock.expire = 999999; } } hybrid::in_actual([&]{ dynamicval b(geometry, gRotSpace); auto h = V * rock.at; rock.pt_main = cross0(current * h); }); if(rock.pt_main.shift < rock.life_start || rock.pt_main.shift > rock.life_end) continue; displayed.push_back(&rock); rock.pts.clear(); auto& shape = *rock.shape; for(int i=0; i b(geometry, gRotSpace); auto h = V * rock.at; t = cross0(current * h).shift; }); if(t < -1e-6 || t > rock.duration + 1e-6) continue; vector pts; auto& shape = shape_ship; for(int i=0; i pts; vector times; int ok = 0, bad = 0; for(int i=0; i<=360; i++) { hybrid::in_actual([&]{ auto h = ads_inverse(current_ship * vctrV_ship) * spin(i*degree) * lorentz(0, 2, 6); auto cr = cross0(current * V * h); pts.push_back(cr.h); times.push_back(cr.shift); if(cr.shift > 0 && cr.shift < 90*degree) ok++; else bad++; }); } if(bad == 0) { for(auto h: pts) curvepoint(h); queuecurve(shiftless(Id), 0x000000C0, 0x00000060, PPR::SUPERLINE); } } } void view_ads_game() { ld plev; displayed.clear(); hybrid::in_actual([&] { plev = cgi.plevel; /* we are in another CGI so we have no access to that... */ gen_budget = max_gen_per_frame; vctr = new_vctr; vctrV = new_vctrV; cross_result base; // todo rebase base = findflat(ads_point(C0, 0)); // println(hlog, base.h); ld ebase = 0; hybrid::in_underlying_geometry([&]{ ebase = hdist0(base.h); // println(hlog, "dist base pre = ", hdist0(base.h), " at ", base.shift); }); // println(hlog, base.h[2]*base.h[2] - base.h[1]*base.h[1] - base.h[0] * base.h[0]); for(int u=0; u<30; u++) { auto bcurrent = current; transmatrix T = spin(12*degree*u) * xpush(0.5); current.T = current.T * T; auto base1 = findflat(ads_point(C0, 0)); ld ebase1 = 0; hybrid::in_underlying_geometry([&] { ebase1 = hdist0(base1.h); }); if(ebase1 < ebase) { vctrV.T = inverse(T) * vctrV.T; } else { current = bcurrent; } } } ); if(1) { make_shape(); set visited; using key = tuple; auto cmp = [] (const key& a1, const key& a2) { return get<0>(a1) < get<0>(a2); }; std::priority_queue, decltype(cmp)> dq(cmp); auto visit = [&] (ld t, cell *c, const ads_matrix& V) { if(visited.count(c)) return; visited.insert(c); dq.emplace(t, c, V); }; hybrid::in_actual([&] { dynamicval b(geometry, gRotSpace); visit(0, vctr, vctrV); vctr_dist = HUGE_VAL; }); int i = 0; while(!dq.empty()) { i++; if(i > draw_per_frame) break; auto& p = dq.top(); cell *c = get<1>(p); ads_matrix V = get<2>(p); dq.pop(); draw_game_cell(c, V, plev); hybrid::in_actual([&] { auto csl = hybrid::get_at(c, 0); for(int i=0; itype; i++) { cell *csl2 = csl->cmove(i); auto V1 = V * currentmap->adj(csl, i); optimize_shift(V1); auto g = hybrid::get_where(csl2); adjust_to_zero(V1, g, plev); auto center = findflat(V1 * C0); center = findflat(V * C0); ld d = hdist0(center.h); if(d < vctr_dist) vctr_dist = d, new_vctr = c, new_vctrV = V; visit(-d, g.first, V1); } }); } if(!game_over && !paused) { poly_outline = 0xFF; if(ship_pt < invincibility_pt) { ld u = (invincibility_pt-ship_pt) / how_much_invincibility; poly_outline = gradient(shipcolor, rsrc_color[rtHull], 0, 0.5 + cos(5*u*TAU), 1); } queuepolyat(shiftless(spin(ang*degree) * Id), shShip, shipcolor, PPR::LINE); poly_outline = 0xFF; if(view_proper_times) { string str = format(tformat, ship_pt / time_unit); queuestr(shiftless(Id), .1, str, 0xFFFFFF, 8); } } if(paused && view_proper_times) { string str = format(tformat, view_pt / time_unit); queuestr(shiftless(Id), .1, str, 0xFFFF00, 8); } } } }}