From e74d79583b67ed1d9c8ae11de56fe92de8f1ec95 Mon Sep 17 00:00:00 2001
From: Zeno Rogue <zeno@attnam.com>
Date: Fri, 9 Sep 2022 12:30:20 +0200
Subject: [PATCH] fixed faster virtualRebase for sol

---
 geometry2.cpp | 38 +++++++++++++++++++-------------------
 1 file changed, 19 insertions(+), 19 deletions(-)

diff --git a/geometry2.cpp b/geometry2.cpp
index 66677280..76f4b2af 100644
--- a/geometry2.cpp
+++ b/geometry2.cpp
@@ -335,35 +335,35 @@ void virtualRebase(cell*& base, T& at, const U& check) {
     /** the general algorithm sometimes makes much more iterations than needed... try to approximate the geodesic */
     hyperpoint h = check(at);
     auto step = [&] (int i) {
-      at = currentmap->adj(base, i) * at;
+      at = currentmap->iadj(base, i) * at;
       base = base->cmove(i);
       h = check(at);
       };
 
     auto nw = vid.binary_width * log(2);
-    while(abs(h[0]) > 2) step(2);
-    while(h[0] < -0.5 * nw) step(0);
-    while(h[0] > +0.5 * nw) step(4);
+    while(abs(h[0]) > 2) step(6);
+    while(h[0] < -0.5 * nw) step(4);
+    while(h[0] > +0.5 * nw) step(0);
     while(abs(h[1]) > 2) {
-      step(6);
-      while(h[0] < -0.5 * nw) step(0);
-      while(h[0] > +0.5 * nw) step(4);
+      step(2);
+      while(h[0] < -0.5 * nw) step(4);
+      while(h[0] > +0.5 * nw) step(0);
       }
-    while(h[1] < -0.5 * nw) step(1);
-    while(h[1] > +0.5 * nw) step(5);
+    while(h[1] < -0.5 * nw) step(5);
+    while(h[1] > +0.5 * nw) step(1);
     while(h[2] > 1) {
-      step(6);
-      while(h[0] < -0.5 * nw) step(0);
-      while(h[0] > +0.5 * nw) step(4);
-      while(h[1] < -0.5 * nw) step(1);
-      while(h[1] > +0.5 * nw) step(5);
+      step(2);
+      while(h[0] < -0.5 * nw) step(4);
+      while(h[0] > +0.5 * nw) step(0);
+      while(h[1] < -0.5 * nw) step(5);
+      while(h[1] > +0.5 * nw) step(1);
       }
     while(h[2] < -1) {
-      step(2);
-      while(h[0] < -0.5 * nw) step(0);
-      while(h[0] > +0.5 * nw) step(4);
-      while(h[1] < -0.5 * nw) step(1);
-      while(h[1] > +0.5 * nw) step(5);
+      step(6);
+      while(h[0] < -0.5 * nw) step(4);
+      while(h[0] > +0.5 * nw) step(0);
+      while(h[1] < -0.5 * nw) step(5);
+      while(h[1] > +0.5 * nw) step(1);
       }
     }
   /* todo variants of sol */