@code3d/core 0.0.1-alpha.0 → 0.0.1-alpha.2

package/bld/library/sketch-curves.js

@@ -1,89 +0,0 @@
-import { sketchRelativePrecision } from './sketch-precision.js';
-const tau = Math.PI * 2;
-export const sketchPositiveAngle = (angle) => ((angle % tau) + tau) % tau;
-export function sketchArcGeometry(center, start, end, direction) {
-    const angle = Math.atan2(start[1] - center[1], start[0] - center[0]);
-    const endAngle = Math.atan2(end[1] - center[1], end[0] - center[0]);
-    const sign = direction === 'ccw' ? 1 : -1;
-    return {
-        kind: 'arc',
-        center,
-        radius: Math.hypot(start[0] - center[0], start[1] - center[1]),
-        start: angle,
-        sweep: sign * sketchPositiveAngle(sign * (endAngle - angle)),
-    };
-}
-export function sketchCurveGeometry(entity, point) {
-    switch (entity.kind) {
-        case 'point':
-            return undefined;
-        case 'line':
-            return {
-                kind: 'line',
-                points: [point(entity.points[0]), point(entity.points[1])],
-            };
-        case 'circle':
-            return {
-                kind: 'circle',
-                center: point(entity.center),
-                radius: entity.radius,
-            };
-        case 'arc':
-            return {
-                ...sketchArcGeometry(point(entity.center), point(entity.points[0]), point(entity.points[1]), entity.direction),
-                radius: entity.radius,
-            };
-    }
-}
-export function sketchCurvePosition(curve, t) {
-    if (curve.kind === 'line') {
-        const [a, b] = curve.points;
-        return [a[0] + t * (b[0] - a[0]), a[1] + t * (b[1] - a[1])];
-    }
-    const angle = curve.kind === 'circle' ? t * tau : curve.start + t * curve.sweep;
-    return [
-        curve.center[0] + curve.radius * Math.cos(angle),
-        curve.center[1] + curve.radius * Math.sin(angle),
-    ];
-}
-/** Nearest point on the finite curve, including arc endpoints (not its full circle). */
-export function sketchCurveClosestParameter(curve, position) {
-    if (curve.kind === 'line') {
-        const [a, b] = curve.points, dx = b[0] - a[0], dy = b[1] - a[1];
-        return Math.max(0, Math.min(1, ((position[0] - a[0]) * dx + (position[1] - a[1]) * dy) /
-            (dx * dx + dy * dy) || 0));
-    }
-    const angle = Math.atan2(position[1] - curve.center[1], position[0] - curve.center[0]);
-    if (curve.kind === 'circle')
-        return sketchPositiveAngle(angle) / tau;
-    const sign = Math.sign(curve.sweep), sweep = Math.abs(curve.sweep);
-    const distance = sketchPositiveAngle(sign * (angle - curve.start));
-    if (distance <= sweep)
-        return sweep ? distance / sweep : 0;
-    return distance - sweep < tau - distance ? 1 : 0;
-}
-export function sketchCurveBounds(curve) {
-    if (curve.kind === 'line')
-        return curve.points;
-    const candidates = [0, Math.PI / 2, Math.PI, (3 * Math.PI) / 2].filter(angle => curve.kind === 'circle' ||
-        sketchPositiveAngle(Math.sign(curve.sweep) * (angle - curve.start)) <=
-            Math.abs(curve.sweep));
-    return [
-        ...(curve.kind === 'arc'
-            ? [sketchCurvePosition(curve, 0), sketchCurvePosition(curve, 1)]
-            : []),
-        ...candidates.map((angle) => [
-            curve.center[0] + curve.radius * Math.cos(angle),
-            curve.center[1] + curve.radius * Math.sin(angle),
-        ]),
-    ];
-}
-export function sketchCurveTolerance(curve) {
-    const size = curve.kind === 'line'
-        ? Math.hypot(curve.points[1][0] - curve.points[0][0], curve.points[1][1] - curve.points[0][1])
-        : curve.radius;
-    return Math.max(size * sketchRelativePrecision, Number.EPSILON *
-        16 *
-        Math.max(...sketchCurveBounds(curve).flatMap(p => p.map(Math.abs))));
-}
-//# sourceMappingURL=sketch-curves.js.map

package/bld/library/sketch-curves.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sketch-curves.js","sourceRoot":"","sources":["../../src/library/sketch-curves.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,uBAAuB,EAAC,MAAM,uBAAuB,CAAC;AAoB9D,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;AACxB,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,KAAa,EAAE,EAAE,CACnD,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;AAE9B,MAAM,UAAU,iBAAiB,CAC/B,MAAsB,EACtB,KAAqB,EACrB,GAAmB,EACnB,SAA6B;IAE7B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,IAAI,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,OAAO;QACL,IAAI,EAAE,KAAK;QACX,MAAM;QACN,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9D,KAAK,EAAE,KAAK;QACZ,KAAK,EAAE,IAAI,GAAG,mBAAmB,CAAC,IAAI,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;KAC7D,CAAC;AACJ,CAAC;AAQD,MAAM,UAAU,mBAAmB,CACjC,MAA4B,EAC5B,KAAsD;IAEtD,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,KAAK,MAAM;YACT,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,MAAM,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3D,CAAC;QACJ,KAAK,QAAQ;YACX,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC;gBAC5B,MAAM,EAAE,MAAM,CAAC,MAAM;aACtB,CAAC;QACJ,KAAK,KAAK;YACR,OAAO;gBACL,GAAG,iBAAiB,CAClB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,EACpB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACvB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACvB,MAAM,CAAC,SAAS,CACjB;gBACD,MAAM,EAAE,MAAM,CAAC,MAAM;aACtB,CAAC;IACN,CAAC;AACH,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,KAAkB,EAClB,CAAS;IAET,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC1B,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QAC5B,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,KAAK,GACT,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IACpE,OAAO;QACL,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;QAChD,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;KACjD,CAAC;AACJ,CAAC;AAED,wFAAwF;AACxF,MAAM,UAAU,2BAA2B,CACzC,KAAkB,EAClB,QAAwB;IAExB,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC1B,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EACzB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAChB,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC,GAAG,CACb,CAAC,EACD,IAAI,CAAC,GAAG,CACN,CAAC,EACD,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACrD,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAC3B,CACF,CAAC;IACJ,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CACtB,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAC7B,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAC9B,CAAC;IACF,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,mBAAmB,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;IACrE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EACjC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAChC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;IACnE,IAAI,QAAQ,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,OAAO,QAAQ,GAAG,KAAK,GAAG,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,KAAkB;IAElB,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,KAAK,CAAC,MAAM,CAAC;IAC/C,MAAM,UAAU,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CACpE,KAAK,CAAC,EAAE,CACN,KAAK,CAAC,IAAI,KAAK,QAAQ;QACvB,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YACjE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAC1B,CAAC;IACF,OAAO;QACL,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK;YACtB,CAAC,CAAC,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,mBAAmB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChE,CAAC,CAAC,EAAE,CAAC;QACP,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAkB,EAAE,CAAC;YAC3C,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAChD,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;SACjD,CAAC;KACH,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,KAAkB;IACrD,MAAM,IAAI,GACR,KAAK,CAAC,IAAI,KAAK,MAAM;QACnB,CAAC,CAAC,IAAI,CAAC,KAAK,CACR,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACvC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACxC;QACH,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACnB,OAAO,IAAI,CAAC,GAAG,CACb,IAAI,GAAG,uBAAuB,EAC9B,MAAM,CAAC,OAAO;QACZ,EAAE;QACF,IAAI,CAAC,GAAG,CAAC,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CACtE,CAAC;AACJ,CAAC"}

package/bld/library/sketch-drag-rules.js

@@ -1,522 +0,0 @@
-import { solveSketchProblem, } from './sketch-solver.js';
-import { sketchIncidences, sketchIncidenceGeometry, sketchIncidencePoints, sketchIncidenceCurve, sketchIncidenceBoundary, } from './sketch-incidence.js';
-import { sketchCurveClosestParameter, sketchCurvePosition, } from './sketch-curves.js';
-/** Dispatch knows neither point roles nor connected components. */
-export function createSketchDragSession(context, rules = dragRules) {
-    for (const rule of rules) {
-        const session = rule(context);
-        if (session)
-            return session;
-    }
-    throw new Error('No sketch drag rule matched the gesture.');
-}
-export function solveSketchDrag(current, target, reference, geometry) {
-    const plan = createSketchDragSession({ reference, target, geometry })(current, target);
-    // Resolve remaining freedom only after every gesture-specific preference.
-    // Earlier stages' achieved positions stay fixed; references never follow
-    // the iterative seed. Solver points are canonical, so aliases add no weight.
-    const stages = [
-        ...plan.stages,
-        {
-            objectives: reached => reference.points.flatMap((_, point) => (target.kind === 'point' && point === target.point) ||
-                reached.points[point].locked.every(Boolean)
-                ? []
-                : [anchor(reference, point)]),
-        },
-    ];
-    const bounds = new Map();
-    for (;;) {
-        const problem = {
-            ...plan.problem,
-            constraints: [
-                ...plan.problem.constraints,
-                ...[...bounds].map(([contact, endpoint]) => ({
-                    kind: 'coincident',
-                    points: [contact.point, endpoint],
-                })),
-            ],
-        };
-        const result = solveSketchDragPlan({ ...plan, problem, stages });
-        const solved = sketchIncidenceGeometry(problem, result);
-        const outside = plan.incidences?.flatMap(contact => {
-            const endpoint = bounds.has(contact)
-                ? undefined
-                : sketchIncidenceBoundary(solved, contact);
-            return endpoint === undefined ? [] : [{ contact, endpoint }];
-        })[0];
-        if (!outside)
-            return result;
-        bounds.set(outside.contact, outside.endpoint);
-    }
-}
-/** Each stage keeps the preceding stage's chosen parameter values, not all
- * equivalent optima. These locks belong to this solve, never the next frame. */
-export function solveSketchDragPlan(plan) {
-    let problem = plan.problem;
-    let result;
-    for (const stage of plan.stages) {
-        const objectives = stage.objectives(problem);
-        if (result && !objectives.length)
-            continue;
-        // Stage output is an iterative seed, not a new authored exact value.
-        // Otherwise cleanup can undo a later hard solve to restore an earlier tail.
-        const solved = solveSketchProblem(stage.seed?.(problem, objectives) ?? problem, objectives, plan.problem);
-        result = solved;
-        const points = new Set(objectives.filter(o => o.kind === 'point').map(o => o.point));
-        const radii = objectives.filter(o => o.kind === 'radius');
-        problem = {
-            ...problem,
-            points: problem.points.map((point, index) => ({
-                position: solved.positions[index],
-                locked: points.has(index) ? [true, true] : point.locked,
-            })),
-            circles: problem.circles.map((circle, index) => ({
-                ...circle,
-                radius: solved.radii[index],
-                locked: circle.locked ||
-                    radii.some(o => o.curve === 'circle' && o.index === index),
-            })),
-            arcs: problem.arcs.map((arc, index) => ({
-                ...arc,
-                radius: solved.arcRadii[index],
-                locked: arc.locked || radii.some(o => o.curve === 'arc' && o.index === index),
-            })),
-        };
-    }
-    return result;
-}
-const radiusRule = ({ reference, target }) => {
-    if (target.kind !== 'radius')
-        return;
-    const curve = (target.curve === 'arc' ? reference.arcs : reference.circles)[target.index];
-    return (current, updated) => {
-        const next = updated;
-        const suggestions = new Map();
-        const dimension = reference.constraints.find(c => c.kind === 'radius' && c.curve === next.curve && c.index === next.index);
-        const radius = curve.locked
-            ? curve.radius
-            : dimension?.kind === 'radius'
-                ? dimension.value
-                : next.value;
-        const center = reference.points[curve.center].position;
-        if (next.curve === 'arc') {
-            const arc = reference.arcs[next.index];
-            for (const point of arc.points)
-                suggest(suggestions, point, radialPosition(center, reference.points[point].position, radius));
-        }
-        for (const c of reference.constraints)
-            if (c.kind === 'pointOnCircle' &&
-                c.curve === next.curve &&
-                c.index === next.index)
-                suggest(suggestions, c.points[0], radialPosition(center, reference.points[c.points[0]].position, radius));
-        return {
-            problem: seed(current, suggestions, next.curve === 'arc' ? new Map([[next.index, radius]]) : new Map()),
-            stages: [
-                { objectives: () => [{ ...next, weight: 1 }] },
-                {
-                    objectives: () => [
-                        anchor(reference, curve.center),
-                        ...[...suggestions].map(([point, positions]) => ({
-                            ...anchor(reference, point),
-                            position: positions[0],
-                        })),
-                    ],
-                },
-            ],
-        };
-    };
-};
-const centerRule = context => {
-    if (context.target.kind !== 'point')
-        return;
-    const scope = connected(neighbors(context.reference), context.target.point);
-    const policy = translationPolicy(context.reference, context.target.point, scope);
-    if (policy)
-        return pointSession(context, [policy]);
-    return;
-};
-const junctionRule = context => {
-    const { reference, target } = context;
-    if (target.kind !== 'point' ||
-        reference.points[target.point].locked.some(Boolean))
-        return;
-    // This rule, not the dispatcher, defines an unconstrained articulation point.
-    if (reference.constraints.some(c => !(c.kind === 'pointOnCircle' && c.points[1] === target.point) &&
-        constraintPoints(reference, c).includes(target.point)))
-        return;
-    const scope = connected(neighbors(reference), target.point);
-    const remaining = new Set([...scope].filter(p => p !== target.point));
-    const graph = neighbors(reference, target.point);
-    const parts = [];
-    for (const point of remaining) {
-        const part = connected(graph, point);
-        for (const member of part)
-            remaining.delete(member);
-        part.add(target.point);
-        parts.push(part);
-    }
-    if (parts.length < 2)
-        return;
-    return pointSession(context, parts.map(part => translationPolicy(reference, target.point, part) ??
-        endpointPolicy(reference, target.point, part)));
-};
-const endpointRule = context => {
-    if (context.target.kind !== 'point')
-        return;
-    const scope = connected(neighbors(context.reference), context.target.point);
-    return pointSession(context, [
-        endpointPolicy(context.reference, context.target.point, scope),
-    ]);
-};
-const motionRules = [
-    radiusRule,
-    centerRule,
-    junctionRule,
-    endpointRule,
-];
-/** This rule supplies geometric connections; the dispatcher still knows no roles. */
-const incidenceRule = ({ reference, target, geometry }) => {
-    const original = geometry ?? sketchIncidenceGeometry(reference);
-    const contacts = sketchIncidences(original);
-    if (!contacts.length)
-        return;
-    const constraints = contacts.map((contact) => contact.kind === 'line'
-        ? {
-            kind: 'pointOnLine',
-            points: [contact.point, ...original.lines[contact.index]],
-        }
-        : {
-            kind: 'pointOnCircle',
-            points: [
-                contact.point,
-                (contact.kind === 'circle' ? original.circles : original.arcs)[contact.index].center,
-            ],
-            curve: contact.kind,
-            index: contact.index,
-        });
-    const session = createSketchDragSession({
-        reference: {
-            ...reference,
-            constraints: [...reference.constraints, ...constraints],
-        },
-        target,
-    }, motionRules);
-    return (current, updated) => {
-        // A polar seed follows the requested angle, including an exact half-turn,
-        // where a distance equation's local derivative alone cannot pick a branch.
-        const suggestions = new Map();
-        const currentGeometry = sketchIncidenceGeometry(current);
-        for (const contact of contacts) {
-            if (contact.kind === 'line' ||
-                updated.kind !== 'point' ||
-                contact.point !== updated.point)
-                continue;
-            const curve = sketchIncidenceCurve(currentGeometry, contact);
-            if (curve.kind !== 'line' &&
-                updated.position.every((v, i) => v === curve.center[i]))
-                continue;
-            const t = sketchCurveClosestParameter(curve, updated.position);
-            // Finite endpoints already have authoritative coordinates. Re-evaluating
-            // sin/cos would introduce a new seed such as cos(pi/2) instead of exact 0.
-            const position = contact.kind === 'arc' && (t === 0 || t === 1)
-                ? currentGeometry.points[currentGeometry.arcs[contact.index].points[t]]
-                : sketchCurvePosition(curve, t);
-            suggest(suggestions, contact.point, position);
-        }
-        const plan = session({
-            ...seed(current, suggestions, new Map()),
-            constraints: [...current.constraints, ...constraints],
-        }, updated);
-        // An interior point can slide without moving either end. Both endpoints
-        // are soft references, so they can yield when the point moves off the line.
-        const preferences = updated.kind === 'point'
-            ? new Set(contacts
-                .filter(c => c.point === updated.point)
-                .flatMap(c => sketchIncidencePoints(original, c).slice(1)))
-            : new Set();
-        // Incidence leaves a tangential freedom. Keep followers near their
-        // gesture-start positions instead of accepting an arbitrary slide.
-        for (const { point } of contacts)
-            preferences.add(point);
-        const stages = [...plan.stages];
-        const last = stages.at(-1);
-        stages[stages.length - 1] = {
-            ...last,
-            objectives: current => {
-                const objectives = last.objectives(current);
-                const present = new Set(objectives.filter(o => o.kind === 'point').map(o => o.point));
-                if (updated.kind === 'point')
-                    present.add(updated.point);
-                return [
-                    ...objectives,
-                    ...[...preferences]
-                        .filter(p => !present.has(p) && !current.points[p].locked.every(Boolean))
-                        .map(p => anchor(reference, p)),
-                ];
-            },
-        };
-        return {
-            ...plan,
-            incidences: contacts,
-            stages,
-        };
-    };
-};
-const dragRules = [incidenceRule, ...motionRules];
-function pointSession(context, policies) {
-    const { reference } = context;
-    const translations = policies.filter(p => p.kind === 'translation');
-    const endpoints = policies.filter(p => p.kind === 'endpoint');
-    // An endpoint can also be another curve's center. Its incident arcs retain
-    // their center preference regardless of the point's other motion roles.
-    const arcs = reference.arcs.flatMap((arc, index) => context.target.kind === 'point' && arc.points.includes(context.target.point)
-        ? [index]
-        : []);
-    const centers = new Set(arcs.map(index => reference.arcs[index].center));
-    const anchors = [...new Set(endpoints.flatMap(p => p.anchors))].filter(point => !centers.has(point));
-    const translated = [...new Set(translations.flatMap(p => p.points))];
-    const preservedRadii = translations.flatMap(p => p.radii);
-    return (current, updated) => {
-        const target = updated;
-        const suggestions = new Map();
-        const radii = new Map();
-        const from = reference.points[target.point].position;
-        for (const index of arcs) {
-            const arc = reference.arcs[index];
-            const center = reference.points[arc.center].position;
-            const dimension = reference.constraints.find(c => c.kind === 'radius' && c.curve === 'arc' && c.index === index);
-            const radius = arc.locked
-                ? arc.radius
-                : dimension?.kind === 'radius'
-                    ? dimension.value
-                    : Math.hypot(target.position[0] - center[0], target.position[1] - center[1]);
-            if (radius === 0)
-                continue;
-            radii.set(index, radius);
-            const sweep = reference.constraints.some(c => c.kind === 'sweep' && c.index === index);
-            // A mouse target at the center has no radial direction. For a fixed
-            // radius keep the current endpoint direction as the seed; the mouse
-            // objective still participates in the constrained solve.
-            const direction = target.position.every((v, axis) => v === center[axis])
-                ? current.points[target.point].position
-                : target.position;
-            const turn = Math.atan2(direction[1] - center[1], direction[0] - center[0]) -
-                Math.atan2(from[1] - center[1], from[0] - center[0]);
-            for (const point of arc.points) {
-                let position = point === target.point ? direction : reference.points[point].position;
-                if (sweep && point !== target.point) {
-                    const [x, y] = [position[0] - center[0], position[1] - center[1]];
-                    position = [
-                        center[0] + x * Math.cos(turn) - y * Math.sin(turn),
-                        center[1] + x * Math.sin(turn) + y * Math.cos(turn),
-                    ];
-                }
-                suggest(suggestions, point, radialPosition(center, position, radius));
-            }
-        }
-        // Seed a center's followers from the same proposed position as the center.
-        // Mixing a projected arc endpoint with a raw mouse translation distorts
-        // the attached arc before its translation stage can preserve its shape.
-        const endpoint = suggestions.get(target.point);
-        const destination = endpoint ? averagePosition(endpoint) : target.position;
-        for (const point of translated) {
-            if (point === target.point && endpoint)
-                continue;
-            suggest(suggestions, point, reference.points[point].position.map((v, axis) => v + destination[axis] - from[axis]));
-        }
-        const stages = [
-            { objectives: () => [{ ...target, weight: 1 }] },
-            {
-                objectives: reached => [
-                    ...anchors.map(point => anchor(reference, point)),
-                    ...translated
-                        .filter(p => p !== target.point)
-                        .map(p => ({
-                        ...anchor(reference, p),
-                        position: reference.points[p].position.map((v, axis) => v - from[axis] + reached.points[target.point].position[axis]),
-                    })),
-                ],
-                // Earlier radius/mouse stages may leave arbitrary follower angles.
-                // Start local translation at its actual, now-known destination rather
-                // than asking a near-singular soft solve to remove that inherited pose.
-                seed: (reached, objectives) => seed(reached, new Map(objectives.flatMap(o => o.kind === 'point' && translated.includes(o.point)
-                    ? [[o.point, [o.position]]]
-                    : [])), new Map()),
-            },
-            ...(translations.length
-                ? [{ objectives: () => translations.flatMap(p => p.exterior) }]
-                : []),
-        ];
-        // A center's radii take precedence over following the mouse. A shared
-        // endpoint still retains its incident centers before these radius goals.
-        if (preservedRadii.length)
-            stages.unshift({ objectives: () => preservedRadii });
-        if (centers.size)
-            stages.unshift({
-                objectives: () => [...centers].map(point => anchor(reference, point)),
-            });
-        return { problem: seed(current, suggestions, radii), stages };
-    };
-}
-function translationPolicy(problem, point, scope) {
-    const curves = problem.arcs.filter(a => a.center === point && a.points.every(p => scope.has(p)));
-    const owned = new Set([point, ...curves.flatMap(a => [...a.points])]);
-    for (const c of problem.constraints)
-        if (c.kind === 'pointOnCircle' && c.points[1] === point)
-            owned.add(c.points[0]);
-    const rectangle = rectanglePoints(problem, point, scope);
-    const isCenter = curves.length > 0 ||
-        problem.circles.some(c => c.center === point) ||
-        !!rectangle;
-    if (!isCenter)
-        return;
-    if (rectangle)
-        for (const p of rectangle)
-            owned.add(p);
-    const radii = ['circle', 'arc'].flatMap(curve => (curve === 'circle' ? problem.circles : problem.arcs).flatMap((c, index) => scope.has(c.center)
-        ? [{ kind: 'radius', curve, index, value: c.radius, weight: 1 }]
-        : []));
-    const ownRadius = (o) => (o.curve === 'circle' ? problem.circles : problem.arcs)[o.index].center ===
-        point;
-    return {
-        kind: 'translation',
-        points: [...owned],
-        radii: radii.filter(ownRadius),
-        exterior: [
-            ...[...scope].filter(p => !owned.has(p)).map(p => anchor(problem, p)),
-            ...radii.filter(o => !ownRadius(o)),
-        ],
-    };
-}
-function endpointPolicy(problem, point, scope) {
-    const arcs = problem.arcs.flatMap((a, index) => a.points.includes(point) &&
-        scope.has(a.center) &&
-        a.points.every(p => scope.has(p))
-        ? [index]
-        : []);
-    const controls = new Set(arcs.map(i => problem.arcs[i].center));
-    for (const c of problem.constraints)
-        if (c.kind === 'pointOnCircle' && c.points[0] === point)
-            controls.add(c.points[1]);
-    for (const c of problem.constraints)
-        if (c.kind === 'midpoint' &&
-            c.points[0] !== point &&
-            rectanglePoints(problem, c.points[0], scope))
-            controls.add(c.points[0]);
-    controls.delete(point);
-    if (controls.size)
-        return { kind: 'endpoint', anchors: [...controls] };
-    const graph = neighbors(problem);
-    const distance = new Map([[point, 0]]);
-    for (const [p, d] of distance)
-        for (const next of graph[p])
-            if (scope.has(next) && !distance.has(next))
-                distance.set(next, d + 1);
-    let farthest = -1, max = 0;
-    for (const p of scope)
-        if ((distance.get(p) ?? 0) > max) {
-            farthest = p;
-            max = distance.get(p);
-        }
-    return { kind: 'endpoint', anchors: farthest < 0 ? [] : [farthest] };
-}
-/** Recognize the actual four-edge/midpoint structure, not tool creation history. */
-function rectanglePoints(problem, center, scope) {
-    const midpoint = problem.constraints.find(c => c.kind === 'midpoint' && c.points[0] === center);
-    if (midpoint?.kind !== 'midpoint')
-        return;
-    const lines = problem.lines.filter(line => line.every(p => scope.has(p)) && !line.includes(center));
-    const corners = new Set(lines.flatMap(line => [...line]));
-    if (lines.length !== 4 ||
-        corners.size !== 4 ||
-        !midpoint.points.slice(1).every(p => corners.has(p)))
-        return;
-    if ([...corners].some(p => lines.filter(line => line.includes(p)).length !== 2))
-        return;
-    if (!lines.every(line => problem.constraints.some(c => (c.kind === 'horizontal' || c.kind === 'vertical') &&
-        c.points.every(p => line.includes(p)))))
-        return;
-    return [...corners];
-}
-function constraintPoints(problem, c) {
-    if ('points' in c)
-        return c.points;
-    if ('point' in c)
-        return [c.point];
-    if (c.kind === 'sweep' || c.curve === 'arc') {
-        const arc = problem.arcs[c.index];
-        return [arc.center, ...arc.points];
-    }
-    return [problem.circles[c.index].center];
-}
-function neighbors(problem, excluded = -1) {
-    const graph = problem.points.map(() => new Set());
-    const connect = (vertices) => {
-        const included = vertices.filter(p => p !== excluded);
-        for (const a of included)
-            for (const b of included)
-                if (a !== b)
-                    graph[a].add(b);
-    };
-    problem.lines.forEach(connect);
-    problem.arcs.forEach(a => connect([a.center, ...a.points]));
-    problem.constraints.forEach(c => connect(constraintPoints(problem, c)));
-    return graph;
-}
-function connected(graph, start) {
-    const result = new Set([start]);
-    for (const point of result)
-        for (const next of graph[point])
-            result.add(next);
-    return result;
-}
-function anchor(problem, point) {
-    return {
-        kind: 'point',
-        point,
-        position: problem.points[point].position,
-        weight: 1,
-    };
-}
-function suggest(suggestions, point, position) {
-    const values = suggestions.get(point) ?? [];
-    values.push(position);
-    suggestions.set(point, values);
-}
-function radialPosition(center, position, radius) {
-    // Rescale the actual direction: atan2 -> sin/cos would turn an exact
-    // horizontal/vertical coordinate into a tail that is then kept as a seed.
-    const dx = position[0] - center[0], dy = position[1] - center[1];
-    const length = Math.hypot(dx, dy);
-    return [
-        center[0] + (dx / length) * radius,
-        center[1] + (dy / length) * radius,
-    ];
-}
-function seed(problem, suggestions, radii) {
-    return {
-        ...problem,
-        points: problem.points.map((p, index) => {
-            const values = suggestions.get(index);
-            if (!values)
-                return p;
-            const position = averagePosition(values);
-            return {
-                ...p,
-                position: p.position.map((v, axis) => p.locked[axis] ||
-                    problem.constraints.some(c => 'point' in c &&
-                        c.point === index &&
-                        (c.kind === 'fixed' || c.kind === (axis === 0 ? 'x' : 'y')))
-                    ? v
-                    : position[axis]),
-            };
-        }),
-        arcs: problem.arcs.map((arc, index) => arc.locked || !radii.has(index)
-            ? arc
-            : { ...arc, radius: radii.get(index) }),
-    };
-}
-function averagePosition(values) {
-    return [0, 1].map(axis => values.reduce((sum, value) => sum + value[axis], 0) / values.length);
-}
-//# sourceMappingURL=sketch-drag-rules.js.map