@flighthq/collision 0.1.0

package/dist/index.d.ts

@@ -0,0 +1,6 @@
+export * from './manifold';
+export * from './pointContainment';
+export * from './segmentCollision';
+export * from './shapeCollision';
+export * from './testCollision';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,oBAAoB,CAAC;AACnC,cAAc,oBAAoB,CAAC;AACnC,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC"}

package/dist/index.js

@@ -0,0 +1,6 @@
+export * from './manifold';
+export * from './pointContainment';
+export * from './segmentCollision';
+export * from './shapeCollision';
+export * from './testCollision';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,oBAAoB,CAAC;AACnC,cAAc,oBAAoB,CAAC;AACnC,cAAc,kBAAkB,CAAC;AACjC,cAAc,iBAAiB,CAAC"}

package/dist/manifold.d.ts

@@ -0,0 +1,4 @@
+import type { CollisionManifold } from '@flighthq/types';
+export declare function clearCollisionManifold(out: CollisionManifold): void;
+export declare function createCollisionManifold(): CollisionManifold;
+//# sourceMappingURL=manifold.d.ts.map

package/dist/manifold.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"manifold.d.ts","sourceRoot":"","sources":["../src/manifold.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAKzD,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,iBAAiB,GAAG,IAAI,CAKnE;AAGD,wBAAgB,uBAAuB,IAAI,iBAAiB,CAE3D"}

package/dist/manifold.js

@@ -0,0 +1,14 @@
+// Clears a manifold to the non-overlapping state: `overlapping` false, normal and depth zero. The
+// narrow-phase tests call this on their disjoint path, so a reused `out` never carries a stale
+// normal into a miss.
+export function clearCollisionManifold(out) {
+    out.overlapping = false;
+    out.normalX = 0;
+    out.normalY = 0;
+    out.depth = 0;
+}
+// Allocates a fresh manifold in the non-overlapping state, ready to be passed as an `out` parameter.
+export function createCollisionManifold() {
+    return { overlapping: false, normalX: 0, normalY: 0, depth: 0 };
+}
+//# sourceMappingURL=manifold.js.map

package/dist/manifold.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"manifold.js","sourceRoot":"","sources":["../src/manifold.ts"],"names":[],"mappings":"AAEA,kGAAkG;AAClG,+FAA+F;AAC/F,sBAAsB;AACtB,MAAM,UAAU,sBAAsB,CAAC,GAAsB;IAC3D,GAAG,CAAC,WAAW,GAAG,KAAK,CAAC;IACxB,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC;IAChB,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC;IAChB,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC;AAChB,CAAC;AAED,qGAAqG;AACrG,MAAM,UAAU,uBAAuB;IACrC,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;AAClE,CAAC"}

package/dist/pointContainment.d.ts

@@ -0,0 +1,3 @@
+import type { CollisionShape } from '@flighthq/types';
+export declare function getCollisionShapeContainsPoint(shape: Readonly<CollisionShape>, x: number, y: number): boolean;
+//# sourceMappingURL=pointContainment.d.ts.map

package/dist/pointContainment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pointContainment.d.ts","sourceRoot":"","sources":["../src/pointContainment.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAQtD,wBAAgB,8BAA8B,CAAC,KAAK,EAAE,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CA2C7G"}

package/dist/pointContainment.js

@@ -0,0 +1,71 @@
+const EPS = 1e-9;
+// Whether the point (`x`,`y`) lies inside a collider. Boundary-inclusive: a point exactly on the
+// edge of any shape counts as contained. For the area-less kinds this degrades to an on-shape test —
+// `segment` returns true when the point lies on the segment (within epsilon), `point` when the two
+// points coincide (within epsilon). Unknown kinds return false. The polygon is assumed convex.
+export function getCollisionShapeContainsPoint(shape, x, y) {
+    switch (shape.kind) {
+        case 'circle': {
+            const dx = x - shape.x;
+            const dy = y - shape.y;
+            return dx * dx + dy * dy <= shape.radius * shape.radius;
+        }
+        case 'aabb':
+            return x >= shape.minX && x <= shape.maxX && y >= shape.minY && y <= shape.maxY;
+        case 'obb': {
+            const cos = Math.cos(shape.rotation);
+            const sin = Math.sin(shape.rotation);
+            const dx = x - shape.x;
+            const dy = y - shape.y;
+            const localX = dx * cos + dy * sin;
+            const localY = -dx * sin + dy * cos;
+            return Math.abs(localX) <= shape.halfW && Math.abs(localY) <= shape.halfH;
+        }
+        case 'polygon':
+            return isPointInConvexPolygon(x, y, shape.points, shape.points.length >> 1);
+        case 'segment': {
+            const dx = shape.x1 - shape.x0;
+            const dy = shape.y1 - shape.y0;
+            const lengthSquared = dx * dx + dy * dy;
+            let t = 0;
+            if (lengthSquared > EPS) {
+                t = ((x - shape.x0) * dx + (y - shape.y0) * dy) / lengthSquared;
+                t = t < 0 ? 0 : t > 1 ? 1 : t;
+            }
+            const closestX = shape.x0 + t * dx;
+            const closestY = shape.y0 + t * dy;
+            const ddx = x - closestX;
+            const ddy = y - closestY;
+            return ddx * ddx + ddy * ddy <= EPS;
+        }
+        case 'point': {
+            const dx = x - shape.x;
+            const dy = y - shape.y;
+            return dx * dx + dy * dy <= EPS;
+        }
+        default:
+            return false;
+    }
+}
+// Convex point-in-polygon by sign consistency of the edge cross products. Winding-agnostic: the
+// point is inside when it lies on the same side of (or on) every edge. `pn` is the vertex count.
+function isPointInConvexPolygon(x, y, px, pn) {
+    let positive = false;
+    let negative = false;
+    for (let i = 0; i < pn; i++) {
+        const j = (i + 1) % pn;
+        const x0 = px[i << 1];
+        const y0 = px[(i << 1) + 1];
+        const x1 = px[j << 1];
+        const y1 = px[(j << 1) + 1];
+        const cross = (x1 - x0) * (y - y0) - (y1 - y0) * (x - x0);
+        if (cross > EPS)
+            positive = true;
+        else if (cross < -EPS)
+            negative = true;
+        if (positive && negative)
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=pointContainment.js.map

package/dist/pointContainment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pointContainment.js","sourceRoot":"","sources":["../src/pointContainment.ts"],"names":[],"mappings":"AAEA,MAAM,GAAG,GAAG,IAAI,CAAC;AAEjB,iGAAiG;AACjG,qGAAqG;AACrG,mGAAmG;AACnG,+FAA+F;AAC/F,MAAM,UAAU,8BAA8B,CAAC,KAA+B,EAAE,CAAS,EAAE,CAAS;IAClG,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YACvB,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1D,CAAC;QACD,KAAK,MAAM;YACT,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC;QAClF,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YACvB,MAAM,MAAM,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;YACnC,MAAM,MAAM,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;YACpC,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC;QAC5E,CAAC;QACD,KAAK,SAAS;YACZ,OAAO,sBAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAC9E,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,aAAa,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YACxC,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,IAAI,aAAa,GAAG,GAAG,EAAE,CAAC;gBACxB,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,aAAa,CAAC;gBAChE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC;YACD,MAAM,QAAQ,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,CAAC,GAAG,QAAQ,CAAC;YACzB,MAAM,GAAG,GAAG,CAAC,GAAG,QAAQ,CAAC;YACzB,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC;QACtC,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YACvB,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,CAAC;QAClC,CAAC;QACD;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,gGAAgG;AAChG,iGAAiG;AACjG,SAAS,sBAAsB,CAAC,CAAS,EAAE,CAAS,EAAE,EAAqB,EAAE,EAAU;IACrF,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1D,IAAI,KAAK,GAAG,GAAG;YAAE,QAAQ,GAAG,IAAI,CAAC;aAC5B,IAAI,KAAK,GAAG,CAAC,GAAG;YAAE,QAAQ,GAAG,IAAI,CAAC;QACvC,IAAI,QAAQ,IAAI,QAAQ;YAAE,OAAO,KAAK,CAAC;IACzC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/segmentCollision.d.ts

@@ -0,0 +1,7 @@
+import type { CollisionAabb, CollisionCircle, CollisionObb, CollisionPolygon, CollisionSegment } from '@flighthq/types';
+export declare function testSegmentAabbCollision(a: Readonly<CollisionSegment>, b: Readonly<CollisionAabb>): boolean;
+export declare function testSegmentCircleCollision(a: Readonly<CollisionSegment>, b: Readonly<CollisionCircle>): boolean;
+export declare function testSegmentObbCollision(a: Readonly<CollisionSegment>, b: Readonly<CollisionObb>): boolean;
+export declare function testSegmentPolygonCollision(a: Readonly<CollisionSegment>, b: Readonly<CollisionPolygon>): boolean;
+export declare function testSegmentSegmentCollision(a: Readonly<CollisionSegment>, b: Readonly<CollisionSegment>): boolean;
+//# sourceMappingURL=segmentCollision.d.ts.map

package/dist/segmentCollision.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"segmentCollision.d.ts","sourceRoot":"","sources":["../src/segmentCollision.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,eAAe,EAAE,YAAY,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AASxH,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,aAAa,CAAC,GAAG,OAAO,CAE3G;AAGD,wBAAgB,0BAA0B,CAAC,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,eAAe,CAAC,GAAG,OAAO,CAgB/G;AAID,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,GAAG,OAAO,CAYzG;AAID,wBAAgB,2BAA2B,CAAC,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,GAAG,OAAO,CAuBjH;AAGD,wBAAgB,2BAA2B,CAAC,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,GAAG,OAAO,CAEjH"}

package/dist/segmentCollision.js

@@ -0,0 +1,161 @@
+// Segment-vs-shape overlap queries. Segments are area-less, so these return a boolean rather than a
+// manifold (a swept/contact answer is a later phase). All are boundary-inclusive: a segment that
+// just grazes a shape counts as overlapping.
+const EPS = 1e-9;
+// Whether a segment overlaps an axis-aligned box (Liang–Barsky slab clip; inclusive).
+export function testSegmentAabbCollision(a, b) {
+    return isSegmentOverlappingBox(a.x0, a.y0, a.x1, a.y1, b.minX, b.minY, b.maxX, b.maxY);
+}
+// Whether a segment overlaps a circle (nearest point on the segment within the radius; inclusive).
+export function testSegmentCircleCollision(a, b) {
+    const x0 = a.x0;
+    const y0 = a.y0;
+    const dx = a.x1 - x0;
+    const dy = a.y1 - y0;
+    const lengthSquared = dx * dx + dy * dy;
+    let t = 0;
+    if (lengthSquared > EPS) {
+        t = ((b.x - x0) * dx + (b.y - y0) * dy) / lengthSquared;
+        t = t < 0 ? 0 : t > 1 ? 1 : t;
+    }
+    const closestX = x0 + t * dx;
+    const closestY = y0 + t * dy;
+    const ddx = b.x - closestX;
+    const ddy = b.y - closestY;
+    return ddx * ddx + ddy * ddy <= b.radius * b.radius;
+}
+// Whether a segment overlaps an oriented box (transformed into the box's local frame, then tested as
+// segment-vs-AABB; inclusive).
+export function testSegmentObbCollision(a, b) {
+    const cos = Math.cos(b.rotation);
+    const sin = Math.sin(b.rotation);
+    const d0x = a.x0 - b.x;
+    const d0y = a.y0 - b.y;
+    const d1x = a.x1 - b.x;
+    const d1y = a.y1 - b.y;
+    const localX0 = d0x * cos + d0y * sin;
+    const localY0 = -d0x * sin + d0y * cos;
+    const localX1 = d1x * cos + d1y * sin;
+    const localY1 = -d1x * sin + d1y * cos;
+    return isSegmentOverlappingBox(localX0, localY0, localX1, localY1, -b.halfW, -b.halfH, b.halfW, b.halfH);
+}
+// Whether a segment overlaps a convex polygon: true if either endpoint is inside, or the segment
+// crosses any polygon edge (inclusive). The polygon is assumed convex.
+export function testSegmentPolygonCollision(a, b) {
+    const points = b.points;
+    const pn = points.length >> 1;
+    if (isPointInConvexPolygon(a.x0, a.y0, points, pn))
+        return true;
+    if (isPointInConvexPolygon(a.x1, a.y1, points, pn))
+        return true;
+    for (let i = 0; i < pn; i++) {
+        const j = (i + 1) % pn;
+        if (isSegmentsIntersecting(a.x0, a.y0, a.x1, a.y1, points[i << 1], points[(i << 1) + 1], points[j << 1], points[(j << 1) + 1])) {
+            return true;
+        }
+    }
+    return false;
+}
+// Whether two segments intersect, including touching endpoints and collinear overlap (inclusive).
+export function testSegmentSegmentCollision(a, b) {
+    return isSegmentsIntersecting(a.x0, a.y0, a.x1, a.y1, b.x0, b.y0, b.x1, b.y1);
+}
+// Convex point-in-polygon by sign consistency of the edge cross products (winding-agnostic,
+// boundary-inclusive). `pn` is the vertex count.
+function isPointInConvexPolygon(x, y, px, pn) {
+    let positive = false;
+    let negative = false;
+    for (let i = 0; i < pn; i++) {
+        const j = (i + 1) % pn;
+        const x0 = px[i << 1];
+        const y0 = px[(i << 1) + 1];
+        const x1 = px[j << 1];
+        const y1 = px[(j << 1) + 1];
+        const cross = (x1 - x0) * (y - y0) - (y1 - y0) * (x - x0);
+        if (cross > EPS)
+            positive = true;
+        else if (cross < -EPS)
+            negative = true;
+        if (positive && negative)
+            return false;
+    }
+    return true;
+}
+// Whether segment (a0,a1) intersects segment (b0,b1). Handles the parallel/collinear cases by
+// projecting onto the first segment and testing interval overlap.
+function isSegmentsIntersecting(ax0, ay0, ax1, ay1, bx0, by0, bx1, by1) {
+    const d1x = ax1 - ax0;
+    const d1y = ay1 - ay0;
+    const d2x = bx1 - bx0;
+    const d2y = by1 - by0;
+    const denom = d1x * d2y - d1y * d2x;
+    const ex = bx0 - ax0;
+    const ey = by0 - ay0;
+    if (Math.abs(denom) < EPS) {
+        // Parallel; intersect only if collinear and their projections onto d1 overlap.
+        if (Math.abs(ex * d1y - ey * d1x) > EPS)
+            return false;
+        const lengthSquared = d1x * d1x + d1y * d1y;
+        if (lengthSquared < EPS) {
+            // Segment A is degenerate (a point): true if it lies on B.
+            const bLengthSquared = d2x * d2x + d2y * d2y;
+            if (bLengthSquared < EPS) {
+                return Math.abs(ex) < EPS && Math.abs(ey) < EPS;
+            }
+            let tb = ((ax0 - bx0) * d2x + (ay0 - by0) * d2y) / bLengthSquared;
+            tb = tb < 0 ? 0 : tb > 1 ? 1 : tb;
+            const qx = bx0 + tb * d2x;
+            const qy = by0 + tb * d2y;
+            return (ax0 - qx) * (ax0 - qx) + (ay0 - qy) * (ay0 - qy) < EPS;
+        }
+        const t0 = (ex * d1x + ey * d1y) / lengthSquared;
+        const t1 = ((bx1 - ax0) * d1x + (by1 - ay0) * d1y) / lengthSquared;
+        const lo = t0 < t1 ? t0 : t1;
+        const hi = t0 < t1 ? t1 : t0;
+        return hi >= -EPS && lo <= 1 + EPS;
+    }
+    const t = (ex * d2y - ey * d2x) / denom;
+    const u = (ex * d1y - ey * d1x) / denom;
+    return t >= -EPS && t <= 1 + EPS && u >= -EPS && u <= 1 + EPS;
+}
+// Liang–Barsky segment-vs-AABB overlap (inclusive). Clips the segment parameter to [0,1] against the
+// four box slabs; overlap survives when the clipped interval stays non-empty.
+function isSegmentOverlappingBox(x0, y0, x1, y1, minX, minY, maxX, maxY) {
+    const dx = x1 - x0;
+    const dy = y1 - y0;
+    clipRange.t0 = 0;
+    clipRange.t1 = 1;
+    // Each slab contributes a `p*t <= q` constraint; `p === 0` means the segment is parallel to it.
+    if (!clipSegmentSlab(-dx, x0 - minX))
+        return false;
+    if (!clipSegmentSlab(dx, maxX - x0))
+        return false;
+    if (!clipSegmentSlab(-dy, y0 - minY))
+        return false;
+    if (!clipSegmentSlab(dy, maxY - y0))
+        return false;
+    return clipRange.t0 <= clipRange.t1;
+}
+// Narrows the shared clip range against one Liang–Barsky slab constraint `p*t <= q`. Returns false
+// when the constraint rejects the whole segment. Mutates `clipRange` in place (no allocation).
+function clipSegmentSlab(p, q) {
+    if (Math.abs(p) < EPS) {
+        return q >= 0;
+    }
+    const r = q / p;
+    if (p < 0) {
+        if (r > clipRange.t1)
+            return false;
+        if (r > clipRange.t0)
+            clipRange.t0 = r;
+    }
+    else {
+        if (r < clipRange.t0)
+            return false;
+        if (r < clipRange.t1)
+            clipRange.t1 = r;
+    }
+    return true;
+}
+const clipRange = { t0: 0, t1: 1 };
+//# sourceMappingURL=segmentCollision.js.map

package/dist/segmentCollision.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"segmentCollision.js","sourceRoot":"","sources":["../src/segmentCollision.ts"],"names":[],"mappings":"AAEA,oGAAoG;AACpG,iGAAiG;AACjG,6CAA6C;AAE7C,MAAM,GAAG,GAAG,IAAI,CAAC;AAEjB,sFAAsF;AACtF,MAAM,UAAU,wBAAwB,CAAC,CAA6B,EAAE,CAA0B;IAChG,OAAO,uBAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;AACzF,CAAC;AAED,mGAAmG;AACnG,MAAM,UAAU,0BAA0B,CAAC,CAA6B,EAAE,CAA4B;IACpG,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;IAChB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC;IACrB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC;IACrB,MAAM,aAAa,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACxC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,aAAa,GAAG,GAAG,EAAE,CAAC;QACxB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,aAAa,CAAC;QACxD,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;IAC3B,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;AACtD,CAAC;AAED,qGAAqG;AACrG,+BAA+B;AAC/B,MAAM,UAAU,uBAAuB,CAAC,CAA6B,EAAE,CAAyB;IAC9F,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACtC,MAAM,OAAO,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACvC,MAAM,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACtC,MAAM,OAAO,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACvC,OAAO,uBAAuB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;AAC3G,CAAC;AAED,iGAAiG;AACjG,uEAAuE;AACvE,MAAM,UAAU,2BAA2B,CAAC,CAA6B,EAAE,CAA6B;IACtG,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IACxB,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;IAC9B,IAAI,sBAAsB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAChE,IAAI,sBAAsB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC;IAChE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACvB,IACE,sBAAsB,CACpB,CAAC,CAAC,EAAE,EACJ,CAAC,CAAC,EAAE,EACJ,CAAC,CAAC,EAAE,EACJ,CAAC,CAAC,EAAE,EACJ,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,EACd,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EACpB,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,EACd,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CACrB,EACD,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,2BAA2B,CAAC,CAA6B,EAAE,CAA6B;IACtG,OAAO,sBAAsB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AAChF,CAAC;AAED,4FAA4F;AAC5F,iDAAiD;AACjD,SAAS,sBAAsB,CAAC,CAAS,EAAE,CAAS,EAAE,EAAqB,EAAE,EAAU;IACrF,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC1D,IAAI,KAAK,GAAG,GAAG;YAAE,QAAQ,GAAG,IAAI,CAAC;aAC5B,IAAI,KAAK,GAAG,CAAC,GAAG;YAAE,QAAQ,GAAG,IAAI,CAAC;QACvC,IAAI,QAAQ,IAAI,QAAQ;YAAE,OAAO,KAAK,CAAC;IACzC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8FAA8F;AAC9F,kEAAkE;AAClE,SAAS,sBAAsB,CAC7B,GAAW,EACX,GAAW,EACX,GAAW,EACX,GAAW,EACX,GAAW,EACX,GAAW,EACX,GAAW,EACX,GAAW;IAEX,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACtB,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACpC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;IACrB,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;IAErB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,EAAE,CAAC;QAC1B,+EAA+E;QAC/E,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;QACtD,MAAM,aAAa,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;QAC5C,IAAI,aAAa,GAAG,GAAG,EAAE,CAAC;YACxB,2DAA2D;YAC3D,MAAM,cAAc,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;YAC7C,IAAI,cAAc,GAAG,GAAG,EAAE,CAAC;gBACzB,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YAClD,CAAC;YACD,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,cAAc,CAAC;YAClE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;YAC1B,MAAM,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;YAC1B,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,CAAC;QACjE,CAAC;QACD,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,aAAa,CAAC;QACjD,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,aAAa,CAAC;QACnE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,IAAI,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;IACxC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;IACxC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;AAChE,CAAC;AAED,qGAAqG;AACrG,8EAA8E;AAC9E,SAAS,uBAAuB,CAC9B,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,IAAY,EACZ,IAAY,EACZ,IAAY,EACZ,IAAY;IAEZ,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC;IACjB,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC;IAEjB,gGAAgG;IAChG,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACnD,IAAI,CAAC,eAAe,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC;IAClD,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IACnD,IAAI,CAAC,eAAe,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC;IAClD,OAAO,SAAS,CAAC,EAAE,IAAI,SAAS,CAAC,EAAE,CAAC;AACtC,CAAC;AAED,mGAAmG;AACnG,+FAA+F;AAC/F,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS;IAC3C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC;QACtB,OAAO,CAAC,IAAI,CAAC,CAAC;IAChB,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACV,IAAI,CAAC,GAAG,SAAS,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC;QACnC,IAAI,CAAC,GAAG,SAAS,CAAC,EAAE;YAAE,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,GAAG,SAAS,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC;QACnC,IAAI,CAAC,GAAG,SAAS,CAAC,EAAE;YAAE,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,SAAS,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC"}

package/dist/shapeCollision.d.ts

@@ -0,0 +1,12 @@
+import type { CollisionAabb, CollisionCircle, CollisionManifold, CollisionObb, CollisionPolygon } from '@flighthq/types';
+export declare function testAabbAabbCollision(a: Readonly<CollisionAabb>, b: Readonly<CollisionAabb>, out: CollisionManifold): boolean;
+export declare function testAabbObbCollision(a: Readonly<CollisionAabb>, b: Readonly<CollisionObb>, out: CollisionManifold): boolean;
+export declare function testAabbPolygonCollision(a: Readonly<CollisionAabb>, b: Readonly<CollisionPolygon>, out: CollisionManifold): boolean;
+export declare function testCircleAabbCollision(a: Readonly<CollisionCircle>, b: Readonly<CollisionAabb>, out: CollisionManifold): boolean;
+export declare function testCircleCircleCollision(a: Readonly<CollisionCircle>, b: Readonly<CollisionCircle>, out: CollisionManifold): boolean;
+export declare function testCircleObbCollision(a: Readonly<CollisionCircle>, b: Readonly<CollisionObb>, out: CollisionManifold): boolean;
+export declare function testCirclePolygonCollision(a: Readonly<CollisionCircle>, b: Readonly<CollisionPolygon>, out: CollisionManifold): boolean;
+export declare function testObbObbCollision(a: Readonly<CollisionObb>, b: Readonly<CollisionObb>, out: CollisionManifold): boolean;
+export declare function testObbPolygonCollision(a: Readonly<CollisionObb>, b: Readonly<CollisionPolygon>, out: CollisionManifold): boolean;
+export declare function testPolygonPolygonCollision(a: Readonly<CollisionPolygon>, b: Readonly<CollisionPolygon>, out: CollisionManifold): boolean;
+//# sourceMappingURL=shapeCollision.d.ts.map

package/dist/shapeCollision.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shapeCollision.d.ts","sourceRoot":"","sources":["../src/shapeCollision.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,aAAa,EACb,eAAe,EACf,iBAAiB,EACjB,YAAY,EACZ,gBAAgB,EACjB,MAAM,iBAAiB,CAAC;AAqBzB,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,QAAQ,CAAC,aAAa,CAAC,EAC1B,CAAC,EAAE,QAAQ,CAAC,aAAa,CAAC,EAC1B,GAAG,EAAE,iBAAiB,GACrB,OAAO,CAkCT;AAGD,wBAAgB,oBAAoB,CAClC,CAAC,EAAE,QAAQ,CAAC,aAAa,CAAC,EAC1B,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,EACzB,GAAG,EAAE,iBAAiB,GACrB,OAAO,CAIT;AAGD,wBAAgB,wBAAwB,CACtC,CAAC,EAAE,QAAQ,CAAC,aAAa,CAAC,EAC1B,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAC7B,GAAG,EAAE,iBAAiB,GACrB,OAAO,CAIT;AAID,wBAAgB,uBAAuB,CACrC,CAAC,EAAE,QAAQ,CAAC,eAAe,CAAC,EAC5B,CAAC,EAAE,QAAQ,CAAC,aAAa,CAAC,EAC1B,GAAG,EAAE,iBAAiB,GACrB,OAAO,CAET;AAID,wBAAgB,yBAAyB,CACvC,CAAC,EAAE,QAAQ,CAAC,eAAe,CAAC,EAC5B,CAAC,EAAE,QAAQ,CAAC,eAAe,CAAC,EAC5B,GAAG,EAAE,iBAAiB,GACrB,OAAO,CA4BT;AAID,wBAAgB,sBAAsB,CACpC,CAAC,EAAE,QAAQ,CAAC,eAAe,CAAC,EAC5B,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,EACzB,GAAG,EAAE,iBAAiB,GACrB,OAAO,CAsBT;AAID,wBAAgB,0BAA0B,CACxC,CAAC,EAAE,QAAQ,CAAC,eAAe,CAAC,EAC5B,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAC7B,GAAG,EAAE,iBAAiB,GACrB,OAAO,CAGT;AAGD,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,EACzB,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,EACzB,GAAG,EAAE,iBAAiB,GACrB,OAAO,CAIT;AAGD,wBAAgB,uBAAuB,CACrC,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,EACzB,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAC7B,GAAG,EAAE,iBAAiB,GACrB,OAAO,CAIT;AAGD,wBAAgB,2BAA2B,CACzC,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAC7B,CAAC,EAAE,QAAQ,CAAC,gBAAgB,CAAC,EAC7B,GAAG,EAAE,iBAAiB,GACrB,OAAO,CAIT"}