vehicle-path2 3.0.0 → 4.0.0

package/dist/{index-BV93143R.js → index-okJUn3WJ.js}

@@ -1,29 +1,22 @@
 function y(t, e) {
-  const n = e.x - t.x, s = e.y - t.y;
-  return Math.sqrt(n * n + s * s);
+  const s = e.x - t.x, n = e.y - t.y;
+  return Math.sqrt(s * s + n * n);
 }
-function S(t, e) {
-  const n = e.x - t.x, s = e.y - t.y, i = Math.sqrt(n * n + s * s);
-  return i === 0 ? { x: 0, y: 0 } : { x: n / i, y: s / i };
+function V(t, e) {
+  const s = e.x - t.x, n = e.y - t.y, i = Math.sqrt(s * s + n * n);
+  return i === 0 ? { x: 0, y: 0 } : { x: s / i, y: n / i };
 }
-function k(t, e) {
+function F(t, e) {
   return e * (t === "proportional-40" ? 0.4 : 0.5522);
 }
-function W(t, e, n, s = !1, i) {
-  const { maxWheelbase: o, tangentMode: a } = n;
-  let r;
-  i?.fromOffset !== void 0 ? r = V(t, i.fromOffset, i.fromIsPercentage ?? !1) : r = t.end;
-  let f;
-  i?.toOffset !== void 0 ? f = V(e, i.toOffset, i.toIsPercentage ?? !1) : f = e.start;
-  const l = S(t.start, t.end), c = s ? {
-    // Transition with flip: kurva dimulai dari P (baseP0 - wheelbase in line direction)
-    x: r.x - l.x * o,
-    y: r.y - l.y * o
-  } : r, g = S(t.start, t.end), d = S(e.start, e.end), h = y(c, f), p = k(a, h), u = s ? { x: c.x - g.x * p, y: c.y - g.y * p } : { x: c.x + g.x * p, y: c.y + g.y * p }, v = {
-    x: f.x - d.x * p,
-    y: f.y - d.y * p
-  };
-  return { p0: c, p1: u, p2: v, p3: f };
+function q(t, e, s, n) {
+  const { tangentMode: i } = s;
+  let c;
+  n?.fromOffset !== void 0 ? c = z(t, n.fromOffset, n.fromIsPercentage ?? !1) : c = t.end;
+  let o;
+  n?.toOffset !== void 0 ? o = z(e, n.toOffset, n.toIsPercentage ?? !1) : o = e.start;
+  const r = V(t.start, t.end), f = V(e.start, e.end), l = y(c, o), a = F(i, l), g = { x: c.x + r.x * a, y: c.y + r.y * a }, d = { x: o.x - f.x * a, y: o.y - f.y * a };
+  return { p0: c, p1: g, p2: d, p3: o };
 }
 function K(t, e) {
   return {
@@ -31,126 +24,122 @@ function K(t, e) {
     y: t.start.y + (t.end.y - t.start.y) * e
   };
 }
-function V(t, e, n) {
-  const s = y(t.start, t.end);
+function z(t, e, s) {
+  const n = y(t.start, t.end);
   let i;
-  return n ? i = e : i = s > 0 ? e / s : 0, i = Math.max(0, Math.min(1, i)), K(t, i);
+  return s ? i = e : i = n > 0 ? e / n : 0, i = Math.max(0, Math.min(1, i)), K(t, i);
 }
-function b(t, e) {
-  const { p0: n, p1: s, p2: i, p3: o } = t, a = 1 - e, r = a * a, f = r * a, l = e * e, c = l * e;
+function A(t, e) {
+  const { p0: s, p1: n, p2: i, p3: c } = t, o = 1 - e, r = o * o, f = r * o, l = e * e, a = l * e;
   return {
-    x: f * n.x + 3 * r * e * s.x + 3 * a * l * i.x + c * o.x,
-    y: f * n.y + 3 * r * e * s.y + 3 * a * l * i.y + c * o.y
+    x: f * s.x + 3 * r * e * n.x + 3 * o * l * i.x + a * c.x,
+    y: f * s.y + 3 * r * e * n.y + 3 * o * l * i.y + a * c.y
   };
 }
-function ne(t, e, n = 10) {
-  return y(t, e) <= n;
+function ne(t, e, s = 10) {
+  return y(t, e) <= s;
 }
 function N(t, e = 100) {
-  const n = [{ t: 0, distance: 0 }];
-  let s = t.p0, i = 0;
-  for (let o = 1; o <= e; o++) {
-    const a = o / e, r = b(t, a);
-    i += y(s, r), n.push({ t: a, distance: i }), s = r;
+  const s = [{ t: 0, distance: 0 }];
+  let n = t.p0, i = 0;
+  for (let c = 1; c <= e; c++) {
+    const o = c / e, r = A(t, o);
+    i += y(n, r), s.push({ t: o, distance: i }), n = r;
   }
-  return n;
+  return s;
 }
-function _(t, e) {
+function G(t, e) {
   if (e <= 0) return 0;
-  const n = t[t.length - 1].distance;
-  if (e >= n) return 1;
-  let s = 0, i = t.length - 1;
-  for (; s < i - 1; ) {
-    const c = Math.floor((s + i) / 2);
-    t[c].distance < e ? s = c : i = c;
+  const s = t[t.length - 1].distance;
+  if (e >= s) return 1;
+  let n = 0, i = t.length - 1;
+  for (; n < i - 1; ) {
+    const a = Math.floor((n + i) / 2);
+    t[a].distance < e ? n = a : i = a;
   }
-  const o = t[s].distance, a = t[i].distance, r = t[s].t, f = t[i].t;
-  if (a === o) return r;
-  const l = (e - o) / (a - o);
+  const c = t[n].distance, o = t[i].distance, r = t[n].t, f = t[i].t;
+  if (o === c) return r;
+  const l = (e - c) / (o - c);
   return r + l * (f - r);
 }
 function se(t) {
   return t[t.length - 1].distance;
 }
-function F(t, e = 100) {
-  let n = 0, s = t.p0;
+function Q(t, e = 100) {
+  let s = 0, n = t.p0;
   for (let i = 1; i <= e; i++) {
-    const o = i / e, a = b(t, o);
-    n += y(s, a), s = a;
+    const c = i / e, o = A(t, c);
+    s += y(n, o), n = o;
   }
-  return n;
-}
-function q(t, e, n, s, i) {
-  const o = y(t.start, t.end);
-  return e === void 0 ? s * o : n ? Math.max(0, Math.min(e, 1)) * o : Math.max(0, Math.min(e, o));
-}
-function E(t, e, n, s, i) {
-  const o = y(t.start, t.end);
-  return e === void 0 ? s * o : n ? Math.max(0, Math.min(e, 1)) * o : Math.max(0, Math.min(e, o));
-}
-function I(t, e, n) {
-  const s = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map();
-  for (const a of t)
-    i.set(a.id, a), o.set(a.id, y(a.start, a.end)), s.set(a.id, []);
-  for (let a = 0; a < e.length; a++) {
-    const r = e[a], f = i.get(r.fromLineId), l = i.get(r.toLineId);
+  return s;
+}
+function E(t, e, s, n) {
+  const i = y(t.start, t.end);
+  return e === void 0 ? n * i : s ? Math.max(0, Math.min(e, 1)) * i : Math.max(0, Math.min(e, i));
+}
+function B(t, e, s, n) {
+  const i = y(t.start, t.end);
+  return e === void 0 ? n * i : s ? Math.max(0, Math.min(e, 1)) * i : Math.max(0, Math.min(e, i));
+}
+function I(t, e, s) {
+  const n = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map();
+  for (const o of t)
+    i.set(o.id, o), c.set(o.id, y(o.start, o.end)), n.set(o.id, []);
+  for (let o = 0; o < e.length; o++) {
+    const r = e[o], f = i.get(r.fromLineId), l = i.get(r.toLineId);
     if (!f || !l) continue;
-    const c = q(f, r.fromOffset, r.fromIsPercentage, 1, n.maxWheelbase), g = E(l, r.toOffset, r.toIsPercentage, 0, n.maxWheelbase), d = W(
+    const a = E(f, r.fromOffset, r.fromIsPercentage, 1), g = B(l, r.toOffset, r.toIsPercentage, 0), d = q(
       f,
       l,
-      n,
-      !1,
-      // willFlip is always false now
+      s,
       {
-        fromOffset: c,
+        fromOffset: a,
         fromIsPercentage: !1,
-        // Already resolved to absolute
         toOffset: g,
         toIsPercentage: !1
-        // Already resolved to absolute
       }
-    ), h = F(d), p = {
-      curveIndex: a,
+    ), h = Q(d), v = {
+      curveIndex: o,
       fromLineId: r.fromLineId,
       toLineId: r.toLineId,
-      fromOffset: c,
+      fromOffset: a,
       toOffset: g,
       curveLength: h
     };
-    s.get(r.fromLineId).push(p);
+    n.get(r.fromLineId).push(v);
   }
-  return { adjacency: s, lines: i, lineLengths: o };
+  return { adjacency: n, lines: i, lineLengths: c };
 }
-function z(t, e) {
+function b(t, e) {
   return t.curveCount !== e.curveCount ? t.curveCount - e.curveCount : t.totalDistance - e.totalDistance;
 }
-function G(t, e, n, s, i = !1) {
-  const { adjacency: o, lines: a, lineLengths: r } = t;
-  if (!a.get(n)) return null;
-  const l = r.get(n), c = i ? s / 100 * l : s, g = [], d = /* @__PURE__ */ new Map(), h = (u, v) => `${u}:${Math.round(v)}`;
-  if (e.lineId === n && c >= e.offset) {
-    const u = c - e.offset;
+function R(t, e, s, n, i = !1) {
+  const { adjacency: c, lines: o, lineLengths: r } = t;
+  if (!o.get(s)) return null;
+  const l = r.get(s), a = i ? n / 100 * l : n, g = [], d = /* @__PURE__ */ new Map(), h = (u, p) => `${u}:${Math.round(p)}`;
+  if (e.lineId === s && a >= e.offset) {
+    const u = a - e.offset;
     return {
       segments: [{
         type: "line",
         lineId: e.lineId,
         startOffset: e.offset,
-        endOffset: c,
+        endOffset: a,
         length: u
       }],
       totalDistance: u,
       curveCount: 0
     };
   }
-  const p = o.get(e.lineId) || [];
-  for (const u of p) {
+  const v = c.get(e.lineId) || [];
+  for (const u of v) {
     if (u.fromOffset < e.offset) continue;
-    const v = u.fromOffset - e.offset, x = v + u.curveLength, L = {
+    const p = u.fromOffset - e.offset, x = p + u.curveLength, L = {
       type: "line",
       lineId: e.lineId,
       startOffset: e.offset,
       endOffset: u.fromOffset,
-      length: v
+      length: p
     }, m = {
       type: "curve",
       curveIndex: u.curveIndex,
@@ -166,18 +155,18 @@ function G(t, e, n, s, i = !1) {
       path: [L, m]
     });
   }
-  for (g.sort(z); g.length > 0; ) {
-    const u = g.shift(), v = h(u.lineId, u.entryOffset), x = d.get(v);
+  for (g.sort(b); g.length > 0; ) {
+    const u = g.shift(), p = h(u.lineId, u.entryOffset), x = d.get(p);
     if (x !== void 0 && (x.curveCount < u.curveCount || x.curveCount === u.curveCount && x.distance <= u.totalDistance))
       continue;
-    if (d.set(v, { curveCount: u.curveCount, distance: u.totalDistance }), u.lineId === n) {
-      const m = Math.abs(c - u.entryOffset);
-      if (c >= u.entryOffset) {
+    if (d.set(p, { curveCount: u.curveCount, distance: u.totalDistance }), u.lineId === s) {
+      const m = Math.abs(a - u.entryOffset);
+      if (a >= u.entryOffset) {
         const C = {
           type: "line",
-          lineId: n,
+          lineId: s,
           startOffset: u.entryOffset,
-          endOffset: c,
+          endOffset: a,
           length: m
         };
         return {
@@ -187,19 +176,19 @@ function G(t, e, n, s, i = !1) {
         };
       }
     }
-    const L = o.get(u.lineId) || [];
+    const L = c.get(u.lineId) || [];
     for (const m of L) {
       if (m.fromOffset < u.entryOffset) continue;
-      const C = m.fromOffset - u.entryOffset, T = u.totalDistance + C + m.curveLength, P = u.curveCount + 1, B = h(m.toLineId, m.toOffset), D = d.get(B);
-      if (D !== void 0 && (D.curveCount < P || D.curveCount === P && D.distance <= T))
+      const C = m.fromOffset - u.entryOffset, T = u.totalDistance + C + m.curveLength, S = u.curveCount + 1, j = h(m.toLineId, m.toOffset), D = d.get(j);
+      if (D !== void 0 && (D.curveCount < S || D.curveCount === S && D.distance <= T))
         continue;
-      const j = {
+      const $ = {
         type: "line",
         lineId: u.lineId,
         startOffset: u.entryOffset,
         endOffset: m.fromOffset,
         length: C
-      }, $ = {
+      }, k = {
         type: "curve",
         curveIndex: m.curveIndex,
         startOffset: 0,
@@ -210,21 +199,21 @@ function G(t, e, n, s, i = !1) {
         lineId: m.toLineId,
         entryOffset: m.toOffset,
         totalDistance: T,
-        curveCount: P,
-        path: [...u.path, j, $]
+        curveCount: S,
+        path: [...u.path, $, k]
       });
     }
-    g.sort(z);
+    g.sort(b);
   }
   return null;
 }
-function A(t, e) {
-  const n = Math.sqrt(
+function P(t, e) {
+  const s = Math.sqrt(
     Math.pow(t.end.x - t.start.x, 2) + Math.pow(t.end.y - t.start.y, 2)
-  ), s = n > 0 ? e / n : 0;
+  ), n = s > 0 ? e / s : 0;
   return {
-    x: t.start.x + (t.end.x - t.start.x) * Math.min(1, Math.max(0, s)),
-    y: t.start.y + (t.end.y - t.start.y) * Math.min(1, Math.max(0, s))
+    x: t.start.x + (t.end.x - t.start.x) * Math.min(1, Math.max(0, n)),
+    y: t.start.y + (t.end.y - t.start.y) * Math.min(1, Math.max(0, n))
   };
 }
 function O(t) {
@@ -232,56 +221,56 @@ function O(t) {
     Math.pow(t.end.x - t.start.x, 2) + Math.pow(t.end.y - t.start.y, 2)
   );
 }
-function Q(t, e, n) {
-  let s = 0;
+function W(t, e, s) {
+  let n = 0;
   for (let i = 0; i < e; i++)
-    s += t.segments[i].length;
-  return s += n, s;
+    n += t.segments[i].length;
+  return n += s, n;
 }
-function R(t, e) {
-  let n = 0;
-  for (let s = 0; s < t.segments.length; s++) {
-    const i = t.segments[s], o = n + i.length;
-    if (e < o)
+function _(t, e) {
+  let s = 0;
+  for (let n = 0; n < t.segments.length; n++) {
+    const i = t.segments[n], c = s + i.length;
+    if (e < c)
       return {
-        segmentIndex: s,
-        segmentDistance: e - n
+        segmentIndex: n,
+        segmentDistance: e - s
       };
-    if (e === o)
-      return s + 1 < t.segments.length ? {
-        segmentIndex: s + 1,
+    if (e === c)
+      return n + 1 < t.segments.length ? {
+        segmentIndex: n + 1,
         segmentDistance: 0
       } : {
-        segmentIndex: s,
+        segmentIndex: n,
         segmentDistance: i.length
       };
-    n += i.length;
+    s += i.length;
   }
   return null;
 }
-function ie(t, e, n, s) {
-  const o = Q(
+function ie(t, e, s, n) {
+  const c = W(
     t,
     e,
-    n
-  ) + s;
-  return R(t, o);
+    s
+  ) + n;
+  return _(t, c);
 }
-function H(t, e, n, s) {
-  const i = O(s), o = n.length + 1, a = new Array(o);
-  a[o - 1] = {
+function H(t, e, s, n) {
+  const i = O(n), c = s.length + 1, o = new Array(c);
+  o[c - 1] = {
     lineId: t,
     absoluteOffset: e,
-    position: A(s, e)
+    position: P(n, e)
   };
   let r = e;
-  for (let f = o - 2; f >= 0; f--)
-    r = Math.min(r + n[f], i), a[f] = {
+  for (let f = c - 2; f >= 0; f--)
+    r = Math.min(r + s[f], i), o[f] = {
       lineId: t,
       absoluteOffset: r,
-      position: A(s, r)
+      position: P(n, r)
     };
-  return a;
+  return o;
 }
 function J(t, e) {
   return {
@@ -296,70 +285,70 @@ function U(t) {
   };
 }
 function re(t, e) {
-  const n = [], s = /* @__PURE__ */ new Map();
+  const s = [], n = /* @__PURE__ */ new Map();
   for (const i of t) {
     if (!e.get(i.lineId)) continue;
-    const a = J(i);
-    n.push(a);
-    const r = U(a);
-    s.set(i.id, r);
+    const o = J(i);
+    s.push(o);
+    const r = U(o);
+    n.set(i.id, r);
   }
-  return { movingVehicles: n, stateMap: s };
+  return { movingVehicles: s, stateMap: n };
 }
 function M(t, e) {
-  return { position: A(t, e), lineId: t.id, absoluteOffset: e };
+  return { position: P(t, e), lineId: t.id, absoluteOffset: e };
 }
 function w(t, e) {
-  const n = _(t.arcLengthTable, e);
-  return { position: b(t.bezier, n) };
+  const s = G(t.arcLengthTable, e);
+  return { position: A(t.bezier, s) };
 }
-function X(t, e, n, s, i, o, a) {
-  const r = n.segments[e.currentSegmentIndex], f = e.segmentDistance + s;
+function X(t, e, s, n, i, c, o) {
+  const r = s.segments[e.currentSegmentIndex], f = e.segmentDistance + n;
   if (f >= r.length) {
-    const c = f - r.length, g = e.currentSegmentIndex + 1;
-    if (g >= n.segments.length) {
-      if (a !== void 0 && r.type === "line") {
-        const u = i.get(r.lineId), v = r.startOffset + f;
-        if (v <= a) {
-          const L = M(u, v);
+    const a = f - r.length, g = e.currentSegmentIndex + 1;
+    if (g >= s.segments.length) {
+      if (o !== void 0 && r.type === "line") {
+        const u = i.get(r.lineId), p = r.startOffset + f;
+        if (p <= o) {
+          const L = M(u, p);
           return {
             axleState: { ...t, ...L },
             execution: { ...e, segmentDistance: f },
             completed: !1
           };
         }
-        const x = M(u, a);
+        const x = M(u, o);
         return {
           axleState: { ...t, ...x },
-          execution: { ...e, segmentDistance: a - r.startOffset },
+          execution: { ...e, segmentDistance: o - r.startOffset },
           completed: !0
         };
       }
-      const p = r.type === "line" ? M(
+      const v = r.type === "line" ? M(
         i.get(r.lineId),
         r.endOffset
       ) : w(
-        o.get(r.curveIndex),
+        c.get(r.curveIndex),
         r.length
       );
       return {
-        axleState: { ...t, ...p },
+        axleState: { ...t, ...v },
         execution: { ...e, segmentDistance: r.length },
         completed: !0
       };
     }
-    const d = n.segments[g], h = d.type === "line" ? M(
+    const d = s.segments[g], h = d.type === "line" ? M(
       i.get(d.lineId),
-      d.startOffset + c
+      d.startOffset + a
     ) : w(
-      o.get(d.curveIndex),
-      c
+      c.get(d.curveIndex),
+      a
     );
     return {
       axleState: { ...t, ...h },
       execution: {
         currentSegmentIndex: g,
-        segmentDistance: c
+        segmentDistance: a
       },
       completed: !1
     };
@@ -368,7 +357,7 @@ function X(t, e, n, s, i, o, a) {
     i.get(r.lineId),
     r.startOffset + f
   ) : w(
-    o.get(r.curveIndex),
+    c.get(r.curveIndex),
     f
   );
   return {
@@ -377,66 +366,59 @@ function X(t, e, n, s, i, o, a) {
     completed: !1
   };
 }
-function Y(t, e, n, s) {
+function Y(t, e, s, n) {
   const i = /* @__PURE__ */ new Map();
-  for (const o of t.segments)
-    if (o.type === "curve" && o.curveIndex !== void 0) {
-      const a = e[o.curveIndex];
-      if (a) {
-        const r = n.get(a.fromLineId), f = n.get(a.toLineId);
+  for (const c of t.segments)
+    if (c.type === "curve" && c.curveIndex !== void 0) {
+      const o = e[c.curveIndex];
+      if (o) {
+        const r = s.get(o.fromLineId), f = s.get(o.toLineId);
         if (r && f) {
-          const l = q(
+          const l = E(
             r,
-            a.fromOffset,
-            a.fromIsPercentage,
-            1,
-            // Default: 100% = 1.0
-            s.maxWheelbase
-          ), c = E(
+            o.fromOffset,
+            o.fromIsPercentage,
+            1
+          ), a = B(
             f,
-            a.toOffset,
-            a.toIsPercentage,
-            0,
-            s.maxWheelbase
-          ), g = W(
+            o.toOffset,
+            o.toIsPercentage,
+            0
+          ), g = q(
             r,
             f,
-            s,
-            !1,
-            // willFlip is always false now
+            n,
             {
               fromOffset: l,
               fromIsPercentage: !1,
-              // Already resolved to absolute
-              toOffset: c,
+              toOffset: a,
               toIsPercentage: !1
-              // Already resolved to absolute
             }
           ), d = N(g);
-          i.set(o.curveIndex, { bezier: g, arcLengthTable: d });
+          i.set(c.curveIndex, { bezier: g, arcLengthTable: d });
         }
       }
     }
   return i;
 }
-function Z(t, e, n) {
-  const { graph: s, linesMap: i, curves: o, config: a } = n, r = i.get(e.targetLineId);
+function Z(t, e, s) {
+  const { graph: n, linesMap: i, curves: c, config: o } = s, r = i.get(e.targetLineId);
   if (!r) return null;
-  const f = t.axleSpacings.reduce((u, v) => u + v, 0), c = O(r) - f;
-  if (c <= 0) return null;
-  const g = e.isPercentage ? e.targetOffset * c : Math.min(e.targetOffset, c), d = t.axles[t.axles.length - 1], h = G(
-    s,
+  const f = t.axleSpacings.reduce((u, p) => u + p, 0), a = O(r) - f;
+  if (a <= 0) return null;
+  const g = e.isPercentage ? e.targetOffset * a : Math.min(e.targetOffset, a), d = t.axles[t.axles.length - 1], h = R(
+    n,
     { lineId: d.lineId, offset: d.absoluteOffset },
     e.targetLineId,
     g,
     !1
   );
   if (!h) return null;
-  const p = Y(h, o, i, a);
-  return { path: h, curveDataMap: p };
+  const v = Y(h, c, i, o);
+  return { path: h, curveDataMap: v };
 }
 function oe(t, e) {
-  const n = t.execution, i = e.vehicleQueues.get(t.vehicle.id)?.[n.currentCommandIndex];
+  const s = t.execution, i = e.vehicleQueues.get(t.vehicle.id)?.[s.currentCommandIndex];
   return i && e.onCommandComplete && e.onCommandComplete({
     vehicleId: t.vehicle.id,
     command: i,
@@ -449,24 +431,24 @@ function oe(t, e) {
   }), {
     handled: !0,
     vehicle: { ...t.vehicle, state: "waiting" },
-    newExecution: n,
+    newExecution: s,
     // Keep execution state for resume
     isWaiting: !0
   };
 }
-function ee(t, e, n, s, i, o) {
-  let a;
+function ee(t, e, s, n, i, c) {
+  let o;
   const r = e[0];
-  if (r.currentSegmentIndex < n.segments.length) {
-    const l = n.segments[r.currentSegmentIndex];
+  if (r.currentSegmentIndex < s.segments.length) {
+    const l = s.segments[r.currentSegmentIndex];
     if (l.type === "line") {
-      const c = i.get(l.lineId);
-      c && (a = O(c));
+      const a = i.get(l.lineId);
+      a && (o = O(a));
     }
   }
-  const f = t.map((l, c) => {
-    const g = c === 0 ? a : void 0;
-    return X(l, e[c], n, s, i, o, g);
+  const f = t.map((l, a) => {
+    const g = a === 0 ? o : void 0;
+    return X(l, e[a], s, n, i, c, g);
   });
   return {
     axles: f.map((l) => l.axleState),
@@ -475,14 +457,13 @@ function ee(t, e, n, s, i, o) {
     // axles[N-1] = rearmost menentukan arrived
   };
 }
-class ae {
+class ce {
   graph = null;
   linesMap = /* @__PURE__ */ new Map();
   curves = [];
   config;
   constructor(e) {
     this.config = {
-      maxWheelbase: e.maxWheelbase,
       tangentMode: e.tangentMode
     };
   }
@@ -504,11 +485,11 @@ class ae {
   /**
    * Replace the entire scene and rebuild the graph.
    */
-  setScene(e, n) {
+  setScene(e, s) {
     this.linesMap.clear();
-    for (const s of e)
-      this.linesMap.set(s.id, s);
-    this.curves = n, this.graph = I(e, n, this.config);
+    for (const n of e)
+      this.linesMap.set(n.id, n);
+    this.curves = s, this.graph = I(e, s, this.config);
   }
   /**
    * Add a single line. Returns false if a line with the same ID already exists.
@@ -519,36 +500,36 @@ class ae {
   /**
    * Update start and/or end coordinates of an existing line.
    */
-  updateLine(e, n) {
-    const s = this.linesMap.get(e);
-    return s ? (n.start && (s.start = n.start), n.end && (s.end = n.end), this.graph = I(Array.from(this.linesMap.values()), this.curves, this.config), !0) : !1;
+  updateLine(e, s) {
+    const n = this.linesMap.get(e);
+    return n ? (s.start && (n.start = s.start), s.end && (n.end = s.end), this.graph = I(Array.from(this.linesMap.values()), this.curves, this.config), !0) : !1;
   }
   /**
    * Update a single endpoint ('start' or 'end') of a line.
    */
-  updateLineEndpoint(e, n, s) {
-    return this.updateLine(e, { [n]: s });
+  updateLineEndpoint(e, s, n) {
+    return this.updateLine(e, { [s]: n });
   }
   /**
    * Rename a line ID and cascade the change to all connected curves.
    */
-  renameLine(e, n) {
-    const s = n.trim();
-    if (!s) return { success: !1, error: "Name cannot be empty" };
-    if (s === e) return { success: !0 };
-    if (this.linesMap.has(s)) return { success: !1, error: `"${s}" already exists` };
+  renameLine(e, s) {
+    const n = s.trim();
+    if (!n) return { success: !1, error: "Name cannot be empty" };
+    if (n === e) return { success: !0 };
+    if (this.linesMap.has(n)) return { success: !1, error: `"${n}" already exists` };
     const i = this.linesMap.get(e);
     if (!i) return { success: !1, error: `Line "${e}" not found` };
-    i.id = s, this.linesMap.delete(e), this.linesMap.set(s, i);
-    for (const o of this.curves)
-      o.fromLineId === e && (o.fromLineId = s), o.toLineId === e && (o.toLineId = s);
+    i.id = n, this.linesMap.delete(e), this.linesMap.set(n, i);
+    for (const c of this.curves)
+      c.fromLineId === e && (c.fromLineId = n), c.toLineId === e && (c.toLineId = n);
     return this.graph = I(Array.from(this.linesMap.values()), this.curves, this.config), { success: !0 };
   }
   /**
    * Remove a line and all curves connected to it.
    */
   removeLine(e) {
-    return this.linesMap.has(e) ? (this.linesMap.delete(e), this.curves = this.curves.filter((n) => n.fromLineId !== e && n.toLineId !== e), this.graph = I(Array.from(this.linesMap.values()), this.curves, this.config), !0) : !1;
+    return this.linesMap.has(e) ? (this.linesMap.delete(e), this.curves = this.curves.filter((s) => s.fromLineId !== e && s.toLineId !== e), this.graph = I(Array.from(this.linesMap.values()), this.curves, this.config), !0) : !1;
   }
   /**
    * Add a directional curve (connection) from one line to another.
@@ -559,8 +540,8 @@ class ae {
   /**
    * Update a curve by index. Returns false if index is out of bounds.
    */
-  updateCurve(e, n) {
-    return e < 0 || e >= this.curves.length ? !1 : (this.curves[e] = { ...this.curves[e], ...n }, this.graph = I(Array.from(this.linesMap.values()), this.curves, this.config), !0);
+  updateCurve(e, s) {
+    return e < 0 || e >= this.curves.length ? !1 : (this.curves[e] = { ...this.curves[e], ...s }, this.graph = I(Array.from(this.linesMap.values()), this.curves, this.config), !0);
   }
   /**
    * Remove a curve by index. Returns false if index is out of bounds.
@@ -580,16 +561,16 @@ class ae {
    * @returns Initial VehiclePathState, or null if lineId does not exist
    * @throws if axleSpacings is empty
    */
-  initializeVehicle(e, n, s) {
+  initializeVehicle(e, s, n) {
     const i = this.linesMap.get(e);
     if (!i) return null;
-    const { axleSpacings: o } = s;
-    if (o.length === 0)
+    const { axleSpacings: c } = n;
+    if (c.length === 0)
       throw new Error("initializeVehicle: axleSpacings must have at least one entry (vehicle needs ≥2 axles)");
-    const a = o.reduce((c, g) => c + g, 0), r = O(i), f = Math.min(n, r - a);
+    const o = c.reduce((a, g) => a + g, 0), r = O(i), f = Math.min(s, r - o);
     return {
-      axles: H(e, f, o, i).map((c) => ({ lineId: c.lineId, offset: c.absoluteOffset, position: c.position })),
-      axleSpacings: o
+      axles: H(e, f, c, i).map((a) => ({ lineId: a.lineId, offset: a.absoluteOffset, position: a.position })),
+      axleSpacings: c
     };
   }
   /**
@@ -602,11 +583,11 @@ class ae {
    * @param targetOffset - Position on the target line
    * @param isPercentage - If true, targetOffset is 0-1 fraction; if false, absolute distance
    */
-  preparePath(e, n, s, i = !1) {
+  preparePath(e, s, n, i = !1) {
     if (!this.graph) return null;
-    const o = e.axleSpacings.reduce((h, p) => h + p, 0), a = e.axles[e.axles.length - 1], r = {
-      lineId: a.lineId,
-      offset: a.offset,
+    const c = e.axleSpacings.reduce((h, v) => h + v, 0), o = e.axles[e.axles.length - 1], r = {
+      lineId: o.lineId,
+      offset: o.offset,
       axles: e.axles.map((h) => ({
         lineId: h.lineId,
         position: h.position,
@@ -614,8 +595,8 @@ class ae {
       })),
       axleSpacings: e.axleSpacings
     }, f = Z(r, {
-      targetLineId: n,
-      targetOffset: s,
+      targetLineId: s,
+      targetOffset: n,
       isPercentage: i
     }, {
       graph: this.graph,
@@ -624,24 +605,24 @@ class ae {
       config: this.config
     });
     if (!f) return null;
-    let l = s;
-    const c = this.linesMap.get(n);
-    if (c) {
-      const h = Math.max(0, O(c) - o);
-      l = i ? s * h : Math.min(s, h);
+    let l = n;
+    const a = this.linesMap.get(s);
+    if (a) {
+      const h = Math.max(0, O(a) - c);
+      l = i ? n * h : Math.min(n, h);
     }
     let g = 0;
     const d = [
-      { segmentIndex: 0, segmentDistance: o }
+      { segmentIndex: 0, segmentDistance: c }
       // axles[0] = front
     ];
     for (let h = 0; h < e.axleSpacings.length; h++)
-      g += e.axleSpacings[h], d.push({ segmentIndex: 0, segmentDistance: o - g });
+      g += e.axleSpacings[h], d.push({ segmentIndex: 0, segmentDistance: c - g });
     return {
       path: f.path,
       curveDataMap: f.curveDataMap,
       axleExecutions: d,
-      targetLineId: n,
+      targetLineId: s,
       targetOffset: l
     };
   }
@@ -655,62 +636,62 @@ class ae {
    * @param execution - Current path execution (from preparePath or previous tick)
    * @param distance - Distance to advance this tick (speed × deltaTime)
    */
-  moveVehicle(e, n, s) {
+  moveVehicle(e, s, n) {
     const i = e.axles.map((r) => ({
       lineId: r.lineId,
       position: r.position,
       absoluteOffset: r.offset
-    })), o = n.axleExecutions.map((r) => ({
+    })), c = s.axleExecutions.map((r) => ({
       currentSegmentIndex: r.segmentIndex,
       segmentDistance: r.segmentDistance
-    })), a = ee(i, o, n.path, s, this.linesMap, n.curveDataMap);
+    })), o = ee(i, c, s.path, n, this.linesMap, s.curveDataMap);
     return {
       state: {
-        axles: a.axles.map((r) => ({ lineId: r.lineId, offset: r.absoluteOffset, position: r.position })),
+        axles: o.axles.map((r) => ({ lineId: r.lineId, offset: r.absoluteOffset, position: r.position })),
         axleSpacings: e.axleSpacings
       },
       execution: {
-        ...n,
-        axleExecutions: a.axleExecutions.map((r) => ({
+        ...s,
+        axleExecutions: o.axleExecutions.map((r) => ({
           segmentIndex: r.currentSegmentIndex,
           segmentDistance: r.segmentDistance
         }))
       },
-      arrived: a.arrived
+      arrived: o.arrived
     };
   }
 }
 export {
-  S as A,
+  V as A,
   Z as B,
-  q as C,
-  E as D,
+  E as C,
+  B as D,
   X as E,
-  ae as P,
-  R as a,
-  N as b,
-  I as c,
-  F as d,
-  ie as e,
-  H as f,
-  O as g,
-  w as h,
-  M as i,
-  k as j,
-  W as k,
-  U as l,
-  y as m,
-  _ as n,
-  G as o,
-  se as p,
-  Q as q,
-  b as r,
-  K as s,
-  V as t,
-  A as u,
-  oe as v,
-  re as w,
-  J as x,
-  ne as y,
-  ee as z
+  ce as P,
+  O as a,
+  _ as b,
+  N as c,
+  I as d,
+  Q as e,
+  ie as f,
+  W as g,
+  H as h,
+  w as i,
+  M as j,
+  F as k,
+  q as l,
+  ee as m,
+  U as n,
+  y as o,
+  G as p,
+  R as q,
+  se as r,
+  A as s,
+  K as t,
+  z as u,
+  P as v,
+  oe as w,
+  re as x,
+  J as y,
+  ne as z
 };