@ccpc/math 0.1.0 → 0.1.3

package/dist/intersections/solvers/bspline_self_solver.js

@@ -1,308 +0,0 @@
-import { Precision } from '../../utils/precision';
-import { collectIntervalClipSeeds } from '../internal/interval_clipping';
-import { sampleCurveAdaptive } from '../internal/sampling';
-import { curvePointTolerance } from '../internal/tolerance';
-import { intersectSegments, lerp, makeSegment, segmentBoxesMayIntersect, segmentDistance } from '../internal/segment';
-export class BSplineSelfSolver {
-    intersect(curve) {
-        const pointTol = curvePointTolerance(curve);
-        const acceptTol = selfAcceptTol(curve, pointTol);
-        const seedNearTol = Math.max(acceptTol * 0.5, pointTol * 16);
-        const sepTol = Math.max(Precision.CURVE_PARAM_EPS * 64, curve.getRange().length() * 1e-6);
-        const adaptiveSegments = buildSegmentSamples(curve, 512);
-        if (adaptiveSegments.length < 4)
-            return [];
-        // Primary pipeline uses dual seeding:
-        // 1) adaptive geometric segments (shape-aware)
-        // 2) uniform parameter segments (coverage-aware)
-        // This is not a fallback; it addresses seed completeness for oscillatory spans.
-        const uniformSegments = buildUniformSegmentSamples(curve, 1200);
-        const seedsA = collectSelfSeeds(adaptiveSegments, seedNearTol, sepTol);
-        const seedsU = collectSelfSeeds(uniformSegments, seedNearTol, sepTol);
-        const seedsB = collectSelfSeedsByIntervalClip(curve, acceptTol, sepTol);
-        const seeds = mergeSeeds(mergeSeeds(seedsA, seedsU, sepTol), seedsB, sepTol);
-        return refineSeedsToResults(curve, seeds, acceptTol, pointTol, sepTol);
-    }
-}
-const defaultBSplineSelfSolver = new BSplineSelfSolver();
-export function intersectBSplineSelf(curve) {
-    return defaultBSplineSelfSolver.intersect(curve);
-}
-function refineSeedsToResults(curve, seeds, acceptTol, pointTol, sepTol) {
-    const out = [];
-    const diagonalParamTol = Math.max(sepTol * 8, curve.getRange().length() * 1e-3);
-    const dedupPointTol = Math.max(pointTol * 16, acceptTol * 1.5);
-    for (const seed of seeds) {
-        const refined = refineSelfPairLM(curve, seed.u1, seed.u2, acceptTol, sepTol);
-        if (!refined)
-            continue;
-        if (isTrivialDiagonalPair(curve, refined.u1, refined.u2, diagonalParamTol))
-            continue;
-        const p1 = curve.pointAt(refined.u1);
-        const p2 = curve.pointAt(refined.u2);
-        const point = p1.added(p2).scale(0.5);
-        pushUnique(out, {
-            point,
-            u1: refined.u1,
-            u2: refined.u2,
-            isOverlap: false,
-        }, dedupPointTol, sepTol);
-    }
-    return out;
-}
-function buildSegmentSamples(curve, targetSegments) {
-    const samples = sampleCurveAdaptive(curve, targetSegments, {
-        chordErrorTol: curvePointTolerance(curve) * 0.75,
-        maxSamples: targetSegments * 8,
-    });
-    const ret = [];
-    for (let i = 0; i < samples.length - 1; i++) {
-        const a = samples[i];
-        const b = samples[i + 1];
-        ret.push({
-            i,
-            u0: a.u,
-            u1: b.u,
-            seg: makeSegment(a.p, b.p),
-        });
-    }
-    return ret;
-}
-function buildUniformSegmentSamples(curve, segmentCount) {
-    const range = curve.getRange();
-    const n = Math.max(64, segmentCount);
-    const ret = [];
-    let p0 = curve.pointAt(range.start);
-    let u0 = range.start;
-    for (let i = 1; i <= n; i++) {
-        const t = i / n;
-        const u1 = range.start + (range.end - range.start) * t;
-        const p1 = curve.pointAt(u1);
-        ret.push({
-            i: i - 1,
-            u0,
-            u1,
-            seg: makeSegment(p0, p1),
-        });
-        u0 = u1;
-        p0 = p1;
-    }
-    return ret;
-}
-function collectSelfSeedsByIntervalClip(curve, pointTol, sepTol) {
-    const clip = collectIntervalClipSeeds(curve, curve, {
-        pointTol,
-        seedParamTol: Precision.CURVE_PARAM_EPS * 16,
-        maxDepth: 14,
-        maxNodes: 12000,
-        pointSeedLimit: 4096,
-        overlapSeedLimit: 64,
-    });
-    const seeds = [];
-    const pushSeed = (u1, u2) => {
-        const a = Math.min(u1, u2);
-        const b = Math.max(u1, u2);
-        if (Math.abs(a - b) <= sepTol)
-            return;
-        for (const seed of seeds) {
-            if (Math.abs(seed.u1 - a) <= Precision.CURVE_PARAM_EPS * 16 &&
-                Math.abs(seed.u2 - b) <= Precision.CURVE_PARAM_EPS * 16) {
-                return;
-            }
-        }
-        seeds.push({ u1: a, u2: b });
-    };
-    for (const seed of clip.pointSeeds) {
-        pushSeed(seed.u1, seed.u2);
-    }
-    for (const overlap of clip.overlapSeeds) {
-        const u1 = 0.5 * (overlap.range1.start + overlap.range1.end);
-        const u2 = 0.5 * (overlap.range2.start + overlap.range2.end);
-        pushSeed(u1, u2);
-    }
-    return seeds;
-}
-function collectSelfSeeds(segments, nearTol, sepTol) {
-    const seeds = [];
-    const pushSeed = (u1, u2) => {
-        const a = Math.min(u1, u2);
-        const b = Math.max(u1, u2);
-        if (Math.abs(a - b) <= sepTol)
-            return;
-        for (const seed of seeds) {
-            if (Math.abs(seed.u1 - a) <= Precision.CURVE_PARAM_EPS * 16 &&
-                Math.abs(seed.u2 - b) <= Precision.CURVE_PARAM_EPS * 16) {
-                return;
-            }
-        }
-        seeds.push({ u1: a, u2: b });
-    };
-    for (let i = 0; i < segments.length; i++) {
-        const a = segments[i];
-        for (let j = i + 2; j < segments.length; j++) {
-            // Open polyline endpoint adjacency.
-            if (i === 0 && j === segments.length - 1)
-                continue;
-            const b = segments[j];
-            if (!segmentBoxesMayIntersect(a.seg, b.seg, nearTol * 2))
-                continue;
-            const hit = intersectSegments(a.seg, b.seg);
-            if (hit.kind === 'point') {
-                pushSeed(lerp(a.u0, a.u1, hit.t1), lerp(b.u0, b.u1, hit.t2));
-                continue;
-            }
-            if (hit.kind === 'overlap') {
-                pushSeed(lerp(a.u0, a.u1, 0.5 * (hit.t1s + hit.t1e)), lerp(b.u0, b.u1, 0.5 * (hit.t2s + hit.t2e)));
-                continue;
-            }
-            const near = segmentDistance(a.seg, b.seg);
-            if (near <= nearTol) {
-                pushSeed(0.5 * (a.u0 + a.u1), 0.5 * (b.u0 + b.u1));
-            }
-        }
-    }
-    return seeds;
-}
-function refineSelfPairLM(curve, u1Seed, u2Seed, pointTol, sepTol) {
-    const range = curve.getRange();
-    let u1 = range.clamp(u1Seed);
-    let u2 = range.clamp(u2Seed);
-    let best = measure(curve, u1, u2);
-    let lambda = 1e-6;
-    for (let i = 0; i < 40; i++) {
-        const p1 = curve.pointAt(u1);
-        const p2 = curve.pointAt(u2);
-        const diff = p1.subtracted(p2);
-        const residual = diff.len();
-        if (residual < best.pointDist)
-            best = { u1, u2, pointDist: residual };
-        if (residual <= pointTol && Math.abs(u1 - u2) > sepTol)
-            break;
-        const t1 = curve.derivativeAt(u1, 1);
-        const t2 = curve.derivativeAt(u2, 1);
-        // Solve damped normal equation:
-        // (J^T J + lambda I) d = -J^T r, J=[t1, -t2], r = p1-p2.
-        const a11 = t1.dot(t1) + lambda;
-        const a22 = t2.dot(t2) + lambda;
-        const a12 = -t1.dot(t2);
-        const b1 = -t1.dot(diff);
-        const b2 = t2.dot(diff);
-        const det = a11 * a22 - a12 * a12;
-        if (!Number.isFinite(det) || Math.abs(det) <= Precision.CURVE_NEWTON_EPS) {
-            lambda *= 10;
-            continue;
-        }
-        let du = (b1 * a22 - b2 * a12) / det;
-        let dv = (a11 * b2 - a12 * b1) / det;
-        if (!Number.isFinite(du) || !Number.isFinite(dv)) {
-            lambda *= 10;
-            continue;
-        }
-        const maxStep = range.length() * 0.2;
-        du = clamp(du, -maxStep, maxStep);
-        dv = clamp(dv, -maxStep, maxStep);
-        let accepted = false;
-        let alpha = 1.0;
-        for (let ls = 0; ls < 8; ls++) {
-            const nu1 = range.clamp(u1 + du * alpha);
-            const nu2 = range.clamp(u2 + dv * alpha);
-            const cand = measure(curve, nu1, nu2);
-            if (cand.pointDist <= best.pointDist + pointTol * 0.05) {
-                u1 = nu1;
-                u2 = nu2;
-                if (cand.pointDist < best.pointDist)
-                    best = cand;
-                accepted = true;
-                lambda = Math.max(1e-10, lambda * 0.3);
-                break;
-            }
-            alpha *= 0.5;
-        }
-        if (!accepted) {
-            lambda *= 8;
-        }
-        if (Math.abs(du) + Math.abs(dv) <= Precision.CURVE_PARAM_EPS * 8) {
-            break;
-        }
-    }
-    if (best.pointDist > pointTol * 4)
-        return undefined;
-    if (Math.abs(best.u1 - best.u2) <= sepTol)
-        return undefined;
-    return best;
-}
-function measure(curve, u1, u2) {
-    const p1 = curve.pointAt(u1);
-    const p2 = curve.pointAt(u2);
-    return {
-        u1,
-        u2,
-        pointDist: p1.distanceTo(p2),
-    };
-}
-function pushUnique(out, next, pointTol, sepTol) {
-    const a1 = Math.min(next.u1, next.u2);
-    const a2 = Math.max(next.u1, next.u2);
-    if (Math.abs(a1 - a2) <= sepTol)
-        return;
-    for (const item of out) {
-        const b1 = Math.min(item.u1, item.u2);
-        const b2 = Math.max(item.u1, item.u2);
-        if (Math.abs(a1 - b1) <= Precision.CURVE_PARAM_EPS * 16 &&
-            Math.abs(a2 - b2) <= Precision.CURVE_PARAM_EPS * 16) {
-            return;
-        }
-        if (item.point.distanceTo(next.point) <= pointTol * 0.5)
-            return;
-    }
-    out.push({
-        ...next,
-        u1: a1,
-        u2: a2,
-    });
-}
-function selfAcceptTol(curve, pointTol) {
-    const box = curve.boundingBox();
-    const diag = Math.hypot(box.width(), box.height());
-    return Math.max(pointTol * 32, diag * 2e-6, Precision.CURVE_LENGTH_EPS * 16);
-}
-function clamp(x, min, max) {
-    return Math.min(max, Math.max(min, x));
-}
-function mergeSeeds(a, b, sepTol) {
-    const ret = [];
-    const push = (seed) => {
-        const u1 = Math.min(seed.u1, seed.u2);
-        const u2 = Math.max(seed.u1, seed.u2);
-        if (Math.abs(u1 - u2) <= sepTol)
-            return;
-        for (const s of ret) {
-            if (Math.abs(s.u1 - u1) <= Precision.CURVE_PARAM_EPS * 16 &&
-                Math.abs(s.u2 - u2) <= Precision.CURVE_PARAM_EPS * 16) {
-                return;
-            }
-        }
-        ret.push({ u1, u2 });
-    };
-    for (const seed of a)
-        push(seed);
-    for (const seed of b)
-        push(seed);
-    return ret;
-}
-function isTrivialDiagonalPair(curve, u1, u2, diagonalParamTol) {
-    const du = Math.abs(u1 - u2);
-    if (du > diagonalParamTol)
-        return false;
-    const t1 = curve.tangentAt(u1);
-    const t2 = curve.tangentAt(u2);
-    const l1 = t1.len();
-    const l2 = t2.len();
-    if (l1 <= Precision.CURVE_NEWTON_EPS || l2 <= Precision.CURVE_NEWTON_EPS)
-        return true;
-    const inv = 1 / (l1 * l2);
-    const crossN = Math.abs(t1.cross(t2)) * inv;
-    const dotN = t1.dot(t2) * inv;
-    // Near-diagonal same-direction pair is not a real self intersection.
-    return crossN <= 1e-3 && dotN >= 0.95;
-}

package/dist/intersections/solvers/line_line_pair_solver.d.ts

@@ -1,7 +0,0 @@
-import type { Curve2 } from '../../curves/curve2';
-import type { ICurvePairIntersector } from '../intersector';
-import type { CurveXInfo } from '../types';
-export declare class LineLinePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-//# sourceMappingURL=line_line_pair_solver.d.ts.map

package/dist/intersections/solvers/line_line_pair_solver.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"line_line_pair_solver.d.ts","sourceRoot":"","sources":["../../../src/intersections/solvers/line_line_pair_solver.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAA;AAGjD,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAA;AAE3D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAE1C,qBAAa,kBAAmB,YAAW,qBAAqB;IACrD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAmCzD"}

package/dist/intersections/solvers/line_line_pair_solver.js

@@ -1,35 +0,0 @@
-import { Interval } from '../../curves/interval';
-import { MathError } from '../../utils/math_error';
-import { Precision } from '../../utils/precision';
-import { intersectSegments, makeSegment, pointAtSegmentUnit } from '../internal/segment';
-export class LineLinePairSolver {
-    intersect(c1, c2) {
-        MathError.assert(c1.isLine() && c2.isLine(), 'LineLinePairSolver: input curves must both be Line2');
-        const l1 = c1;
-        const l2 = c2;
-        const s1 = makeSegment(l1.start, l1.end);
-        const s2 = makeSegment(l2.start, l2.end);
-        MathError.assert(s1.len > Precision.CURVE_LENGTH_EPS && s2.len > Precision.CURVE_LENGTH_EPS, 'LineLinePairSolver: degenerate line segment');
-        const hit = intersectSegments(s1, s2);
-        if (hit.kind === 'none')
-            return [];
-        if (hit.kind === 'point') {
-            const point = pointAtSegmentUnit(s1, hit.t1);
-            return [{
-                    point,
-                    u1: hit.t1 * s1.len,
-                    u2: hit.t2 * s2.len,
-                    isOverlap: false,
-                }];
-        }
-        const point = pointAtSegmentUnit(s1, hit.t1s);
-        return [{
-                point,
-                u1: hit.t1s * s1.len,
-                u2: hit.t2s * s2.len,
-                isOverlap: true,
-                range1: new Interval(hit.t1s * s1.len, hit.t1e * s1.len),
-                range2: new Interval(hit.t2s * s2.len, hit.t2e * s2.len),
-            }];
-    }
-}

package/dist/intersections/solvers/pair_solvers.d.ts

@@ -1,94 +0,0 @@
-import { Vec2 } from '../../core/vec2';
-import type { Arc2 } from '../../curves/arc2';
-import type { Circle2 } from '../../curves/circle2';
-import type { Curve2 } from '../../curves/curve2';
-import type { Ellipse2 } from '../../curves/ellipse2';
-import type { EllipseArc2 } from '../../curves/ellipse_arc2';
-import type { ICurvePairIntersector } from '../intersector';
-import type { CurveXInfo } from '../types';
-import { LineLinePairSolver } from './line_line_pair_solver';
-type ImplicitEval = {
-    value: number;
-    grad: Vec2;
-};
-declare abstract class ParametricImplicitPairSolver<TParam extends Curve2, TTarget extends Curve2> implements ICurvePairIntersector {
-    protected abstract asParam(curve: Curve2): TParam;
-    protected abstract asTarget(curve: Curve2): TTarget;
-    protected abstract makeImplicit(target: TTarget): (p: Vec2) => ImplicitEval;
-    protected abstract valueTolScale(target: TTarget): number;
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class LineCirclePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class LineArcPairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class LineEllipsePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class LineEllipseArcPairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class LineBSplinePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class CircleCirclePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class CircleArcPairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class CircleEllipsePairSolver extends ParametricImplicitPairSolver<Circle2, Ellipse2> {
-    protected asParam(curve: Curve2): Circle2;
-    protected asTarget(curve: Curve2): Ellipse2;
-    protected makeImplicit(target: Ellipse2): (p: Vec2) => ImplicitEval;
-    protected valueTolScale(target: Ellipse2): number;
-}
-export declare class CircleEllipseArcPairSolver extends ParametricImplicitPairSolver<Circle2, EllipseArc2> {
-    protected asParam(curve: Curve2): Circle2;
-    protected asTarget(curve: Curve2): EllipseArc2;
-    protected makeImplicit(target: EllipseArc2): (p: Vec2) => ImplicitEval;
-    protected valueTolScale(target: EllipseArc2): number;
-}
-export declare class CircleBSplinePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class ArcArcPairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class ArcEllipsePairSolver extends ParametricImplicitPairSolver<Arc2, Ellipse2> {
-    protected asParam(curve: Curve2): Arc2;
-    protected asTarget(curve: Curve2): Ellipse2;
-    protected makeImplicit(target: Ellipse2): (p: Vec2) => ImplicitEval;
-    protected valueTolScale(target: Ellipse2): number;
-}
-export declare class ArcEllipseArcPairSolver extends ParametricImplicitPairSolver<Arc2, EllipseArc2> {
-    protected asParam(curve: Curve2): Arc2;
-    protected asTarget(curve: Curve2): EllipseArc2;
-    protected makeImplicit(target: EllipseArc2): (p: Vec2) => ImplicitEval;
-    protected valueTolScale(target: EllipseArc2): number;
-}
-export declare class ArcBSplinePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class EllipseEllipsePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class EllipseEllipseArcPairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class EllipseBSplinePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class EllipseArcEllipseArcPairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class EllipseArcBSplinePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export declare class BSplineBSplinePairSolver implements ICurvePairIntersector {
-    intersect(c1: Curve2, c2: Curve2): CurveXInfo[];
-}
-export { LineLinePairSolver };
-//# sourceMappingURL=pair_solvers.d.ts.map

package/dist/intersections/solvers/pair_solvers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"pair_solvers.d.ts","sourceRoot":"","sources":["../../../src/intersections/solvers/pair_solvers.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAA;AACtC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAA;AAE7C,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAA;AACnD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAA;AACjD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAA;AACrD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAA;AAK5D,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAA;AAG3D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAC1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAA;AAsa5D,KAAK,YAAY,GAAG;IAChB,KAAK,EAAE,MAAM,CAAA;IACb,IAAI,EAAE,IAAI,CAAA;CACb,CAAA;AA6iBD,uBAAe,4BAA4B,CAAC,MAAM,SAAS,MAAM,EAAE,OAAO,SAAS,MAAM,CAAE,YAAW,qBAAqB;IACvH,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IACjD,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IACnD,SAAS,CAAC,QAAQ,CAAC,YAAY,CAAC,MAAM,EAAE,OAAO,GAAG,CAAC,CAAC,EAAE,IAAI,KAAK,YAAY;IAC3E,SAAS,CAAC,QAAQ,CAAC,aAAa,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM;IAElD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAYzD;AAED,qBAAa,oBAAqB,YAAW,qBAAqB;IACvD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAKzD;AAED,qBAAa,iBAAkB,YAAW,qBAAqB;IACpD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAKzD;AAED,qBAAa,qBAAsB,YAAW,qBAAqB;IACxD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAKzD;AAED,qBAAa,wBAAyB,YAAW,qBAAqB;IAC3D,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAKzD;AAED,qBAAa,qBAAsB,YAAW,qBAAqB;IACxD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAKzD;AAED,qBAAa,sBAAuB,YAAW,qBAAqB;IACzD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAkBzD;AAED,qBAAa,mBAAoB,YAAW,qBAAqB;IACtD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CA0BzD;AAED,qBAAa,uBAAwB,SAAQ,4BAA4B,CAAC,OAAO,EAAE,QAAQ,CAAC;IACxF,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM;IAC/B,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM;IAChC,SAAS,CAAC,YAAY,CAAC,MAAM,EAAE,QAAQ,OAjP5B,IAAI,KAAG,YAAY;IAkP9B,SAAS,CAAC,aAAa,CAAC,MAAM,EAAE,QAAQ;CAC3C;AACD,qBAAa,0BAA2B,SAAQ,4BAA4B,CAAC,OAAO,EAAE,WAAW,CAAC;IAC9F,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM;IAC/B,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM;IAChC,SAAS,CAAC,YAAY,CAAC,MAAM,EAAE,WAAW,OAvP/B,IAAI,KAAG,YAAY;IAwP9B,SAAS,CAAC,aAAa,CAAC,MAAM,EAAE,WAAW;CAC9C;AACD,qBAAa,uBAAwB,YAAW,qBAAqB;IAC1D,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAKzD;AAED,qBAAa,gBAAiB,YAAW,qBAAqB;IACnD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAwCzD;AAED,qBAAa,oBAAqB,SAAQ,4BAA4B,CAAC,IAAI,EAAE,QAAQ,CAAC;IAClF,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM;IAC/B,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM;IAChC,SAAS,CAAC,YAAY,CAAC,MAAM,EAAE,QAAQ,OAhT5B,IAAI,KAAG,YAAY;IAiT9B,SAAS,CAAC,aAAa,CAAC,MAAM,EAAE,QAAQ;CAC3C;AACD,qBAAa,uBAAwB,SAAQ,4BAA4B,CAAC,IAAI,EAAE,WAAW,CAAC;IACxF,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM;IAC/B,SAAS,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM;IAChC,SAAS,CAAC,YAAY,CAAC,MAAM,EAAE,WAAW,OAtT/B,IAAI,KAAG,YAAY;IAuT9B,SAAS,CAAC,aAAa,CAAC,MAAM,EAAE,WAAW;CAC9C;AACD,qBAAa,oBAAqB,YAAW,qBAAqB;IACvD,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAKzD;AACD,qBAAa,wBAAyB,YAAW,qBAAqB;IAC3D,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAYzD;AACD,qBAAa,2BAA4B,YAAW,qBAAqB;IAC9D,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAYzD;AACD,qBAAa,wBAAyB,YAAW,qBAAqB;IAC3D,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAUzD;AACD,qBAAa,8BAA+B,YAAW,qBAAqB;IACjE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAYzD;AACD,qBAAa,2BAA4B,YAAW,qBAAqB;IAC9D,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAUzD;AACD,qBAAa,wBAAyB,YAAW,qBAAqB;IAC3D,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU,EAAE;CAKzD;AAED,OAAO,EAAE,kBAAkB,EAAE,CAAA"}