@woosh/meep-engine 2.118.5 → 2.118.7

package/src/view/tooltip/TooltipView.js

@@ -1,12 +1,10 @@
-import View from "../View.js";
+import { rectangle_to_aabb } from "../../core/geom/2d/rectangle_to_aabb.js";
 import Vector2 from "../../core/geom/Vector2.js";
-import AABB2 from "../../core/geom/2d/aabb/AABB2.js";
+import { position_box_next_to_box } from "../../core/graph/layout/box/position_box_next_to_box.js";
 import { CompassArrowView } from "../elements/CompassArrowView.js";
 import EmptyView from "../elements/EmptyView.js";
-import { forceIntoBox } from "../../core/graph/layout/box/forceIntoBox.js";
-import { pullBoxTowardsPoint } from "../../core/graph/layout/box/pullBoxTowardsPoint.js";
-import { resolveAABB2Overlap } from "../../core/graph/layout/box/resolveAABB2Overlap.js";
-import { EPSILON } from "../../core/math/EPSILON.js";
+import { html_element_to_aabb } from "../html_element_to_aabb.js";
+import View from "../View.js";
 
 
 class TooltipView extends View {
@@ -51,7 +49,7 @@ class TooltipView extends View {
      * @param {AABB2} bounds
      */
     layout(bounds) {
-        const tipBox = element2aabb(this.contentView.el);
+        const tipBox = html_element_to_aabb(this.contentView.el);
 
         const SPACING = 16;
 
@@ -65,17 +63,17 @@ class TooltipView extends View {
 
         const tipTarget = tip.target;
 
-        const target = rectangle2aabb(tipTarget);
+        const target = rectangle_to_aabb(tipTarget);
 
-        const box = positionBoxNextToBox(tipBox, target, bounds);
+        const box = position_box_next_to_box(tipBox, target, bounds);
 
         box.shrink(SPACING);
 
         const compass = this.compass;
 
-        function setCompas() {
+        function setCompass() {
 
-            const targetCenter = new Vector2(target.midX(), target.midY());
+            const targetCenter = target.getCenter();
 
             const tipPoint = new Vector2();
 
@@ -86,279 +84,11 @@ class TooltipView extends View {
             compass.position.copy(tipPoint)._add(-box.x0, -box.y0);
         }
 
-        setCompas();
+        setCompass();
 
         this.position.set(box.x0, box.y0)
     }
 }
 
 
-/**
- *
- * @param {Element} el
- * @returns {AABB2}
- */
-function element2aabb(el) {
-    const clientRect = el.getBoundingClientRect();
-
-    let x0 = clientRect.left;
-    let y0 = clientRect.top;
-    let x1 = clientRect.right;
-    let y1 = clientRect.bottom;
-
-    // sanitize bounds
-
-    if (Number.isNaN(x1)) {
-        x1 = x0;
-    }
-
-    if (Number.isNaN(y1)) {
-        y1 = y0;
-    }
-
-    // write bounds
-
-    return new AABB2(x0, y0, x1, y1);
-}
-
-/**
- *
- * @param {Rectangle} rect
- * @returns {AABB2}
- */
-function rectangle2aabb(rect) {
-    const position = rect.position;
-
-    const x0 = position.x;
-    const y0 = position.y;
-
-    const size = rect.size;
-
-    let x1 = x0;
-    let y1 = y0;
-
-    // sanitize bounds
-    if (size.x > 0) {
-        x1 += size.x;
-    }
-
-    if (size.y > 0) {
-        y1 += size.y;
-    }
-
-    return new AABB2(x0, y0, x1, y1);
-}
-
-/**
- *
- * @param {AABB2} box
- * @param {AABB2} target
- * @param {AABB2} bounds
- * @returns {Vector2}
- */
-function computeInitialPlacement(box, target, bounds) {
-    /**
-     * list of preferred directions, ordered. First direction is higher priority than the next, last is lowest priority
-     * @type {Vector2[]}
-     */
-    const preferredDirections = [
-        Vector2.up,
-        Vector2.right,
-        Vector2.down,
-        Vector2.left
-    ];
-
-    const targetCenter = new Vector2(target.midX(), target.midY());
-
-    const targetH = target.getHeight();
-    const targetW = target.getWidth();
-
-    const targetDiagonal = Math.sqrt(targetH * targetH + targetW * targetW);
-
-    const boxWidth = box.getWidth();
-    const boxHeight = box.getHeight();
-
-    const boxWidth_2 = boxWidth / 2;
-    const boxHeight_2 = boxHeight / 2;
-
-    const intersectionPoint = new Vector2();
-
-    const placements = preferredDirections.map(function (direction) {
-        //invert Y axis, screen-space direction is Down(+) and Up(-)
-        const viewportDirection = direction.clone()._multiply(1, -1);
-
-        const pointOutside = viewportDirection.clone();
-        //scale vector to be larger than the box diagonal so it would intersect the boundary when placed in the middle
-        pointOutside.multiplyScalar(targetDiagonal + 1);
-        //move vector to the middle od the box
-        pointOutside.add(targetCenter);
-
-        target.lineIntersectionPoint(targetCenter, pointOutside, intersectionPoint);
-
-        //align placement to the opposite edge of the box
-        const offset = new Vector2(boxWidth_2, boxHeight_2);
-
-        offset.multiply(viewportDirection);
-
-        offset._sub(boxWidth_2, boxHeight_2);
-
-        offset.add(intersectionPoint);
-
-        return offset;
-    });
-
-    /**
-     *
-     * @param {Vector2} placement
-     * @returns {number}
-     */
-    function computePlacementScore(placement) {
-        //find space for the tip between bounds and the target
-        const availableSpace = new AABB2();
-
-        const px0 = placement.x;
-        const px1 = px0 + boxWidth;
-        const py0 = placement.y;
-        const py1 = py0 + boxHeight;
-
-        if (px1 <= target.x0) {
-            //left
-            availableSpace.set(
-                bounds.x0,
-                bounds.y0,
-                target.x0,
-                bounds.y1
-            );
-        } else if (px0 >= target.x1) {
-            //right
-            availableSpace.set(
-                target.x1,
-                bounds.y0,
-                bounds.x1,
-                bounds.y1
-            );
-        } else if (py1 <= target.y0) {
-            //up
-            availableSpace.set(
-                bounds.x0,
-                bounds.y0,
-                bounds.x1,
-                target.y0
-            );
-        } else if (py0 >= target.y1) {
-            //bottom
-            availableSpace.set(
-                bounds.x0,
-                target.y1,
-                bounds.x1,
-                bounds.y1
-            );
-        } else {
-            //tip is inside, no arbitration
-        }
-
-        let score = 0;
-
-        const availableWidth = availableSpace.getWidth();
-        const availableHeight = availableSpace.getHeight();
-
-        const spareWidth = availableWidth - boxWidth;
-        const spareHeight = availableHeight - boxHeight;
-
-        if (spareHeight < 0) {
-            score--;
-        }
-
-        if (spareWidth < 0) {
-            score--;
-        }
-
-        return score;
-    }
-
-    //score placements
-    const scores = placements.map(computePlacementScore);
-
-    //find best placement
-    let bestIndex = 0;
-    let bestScore = scores[0];
-
-    for (let i = 1; i < scores.length; i++) {
-        const score = scores[i];
-
-        if (score > bestScore + EPSILON) {
-            bestScore = score;
-            bestIndex = i;
-        }
-    }
-
-    return placements[bestIndex];
-}
-
-
-/**
- *
- * @param {AABB2} box
- * @param {AABB2} target
- * @param {AABB2} bounds
- */
-function positionBoxNextToBox(box, target, bounds) {
-    const b = box.clone();
-    const t = target.clone();
-
-    //center box inside the bounds
-    const y0 = (bounds.getHeight() + b.getHeight()) / 2;
-    const x0 = (bounds.getWidth() + b.getWidth()) / 2;
-    b.set(x0, y0, x0 + b.getWidth(), y0 + b.getHeight());
-
-
-    const targetCenter = new Vector2(t.midX(), t.midY());
-
-    t.locked = true;
-
-    function touch() {
-
-        const bC = new Vector2(b.midX(), b.midY());
-
-        const bE = new Vector2();
-        const tE = new Vector2();
-
-
-        t.lineIntersectionPoint(bC, targetCenter, tE);
-        const delta = new Vector2();
-
-        if (b.lineIntersectionPoint(bC, targetCenter, bE)) {
-            delta.copy(tE).sub(bE);
-        } else {
-            delta.copy(tE).sub(bC);
-        }
-
-        b.move(delta.x, delta.y);
-    }
-
-
-    const initialPosition = computeInitialPlacement(b, t, bounds);
-    //set bounds to initial position
-    b.set(initialPosition.x, initialPosition.y, initialPosition.x + b.getWidth(), initialPosition.y + b.getHeight());
-
-    // touch();
-
-    function step() {
-        //pull
-        pullBoxTowardsPoint(b, initialPosition.x + b.getWidth() / 2, initialPosition.y + b.getHeight() / 2, 0.1);
-
-        resolveAABB2Overlap([b, t], 10);
-
-        forceIntoBox(bounds, [b]);
-    }
-
-    for (let i = 0; i < 5; i++) {
-        step();
-    }
-
-    box.copy(b);
-
-    return box;
-}
-
 export default TooltipView;

package/src/view/tooltip/gml/TooltipParser.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TooltipParser.d.ts","sourceRoot":"","sources":["../../../../../src/view/tooltip/gml/TooltipParser.js"],"names":[],"mappings":"AAOA;IAkBI;;;;OAIG;IACH,YAHW,MAAM,GACJ,OAAO,CAkBnB;;CACJ"}
+{"version":3,"file":"TooltipParser.d.ts","sourceRoot":"","sources":["../../../../../src/view/tooltip/gml/TooltipParser.js"],"names":[],"mappings":"AAOA;IAkBI;;;;OAIG;IACH,YAHW,MAAM,GACJ,OAAO,CAMnB;;CACJ"}

package/src/view/tooltip/gml/TooltipParser.js

@@ -30,19 +30,7 @@ export class TooltipParser {
      */
     parse(code) {
 
-        const existing = this.#cache.get(code);
+        return this.#cache.getOrCompute(code, parseTooltipString);
 
-        if (existing !== null) {
-            // result is cached, reuse
-            return existing;
-        }
-
-        // no cached result, parse
-        const tokens = parseTooltipString(code);
-
-        // cache result
-        this.#cache.put(code, tokens);
-
-        return tokens;
     }
 }

package/src/core/binary/Base64.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Base64.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/Base64.js"],"names":[],"mappings":"AAgOA;IACI;;;;OAIG;IACH,qBAHW,WAAW,GACT,MAAM,CAOlB;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACJ,WAAW,CAUvB;CACJ"}

package/src/core/collection/array/typed/largest_common_alignment_uint32.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"largest_common_alignment_uint32.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/largest_common_alignment_uint32.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,0DALW,MAAM,YACN,MAAM,eACN,MAAM,GACJ,MAAM,CAoBlB"}

package/src/core/graph/SquareMatrix.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SquareMatrix.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/SquareMatrix.js"],"names":[],"mappings":"AAIA;IACI;;;;OAIG;IACH,kBAHW,MAAM,QACN,iBAAe,MAAM,EA2B/B;IAhBG;;;OAGG;IACH,MAFU,MAAM,CAEA;IAEhB;;;OAGG;IACH,qBAAgB;IAEhB;;OAEG;IACH,MAFU,MAAM,EAAE,CAEqB;IAG3C,gBAEC;IAED,qBAEC;IAED,oBAEC;IAED,mBAEC;IAED;;;OAGG;IACH,gBAFW,YAAY,QAItB;IAED;;;;OAIG;IACH,oBAHW,YAAY,KACZ,YAAY,QAiBtB;IAED;;OAEG;IACH,eAMC;IAED;;OAEG;IACH,cAEC;IAED;;OAEG;IACH,YAMC;IAED;;;OAGG;IACH,YAFW,YAAY,QAMtB;IAED;;;OAGG;IACH,SAFY,YAAY,CAQvB;IAED;;OAEG;IACH,kBAcC;IAED;;;OAGG;IACH,eAFW,MAAM,EAAE,QAIlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,EAAE,WACR,MAAM,YAMhB;IAED;;;;;OAKG;IACH,wBAJW,MAAM,gBACN,MAAM,SACN,MAAM,QAYhB;IAED;;;;;OAKG;IACH,wBAJW,MAAM,gBACN,MAAM,GACL,MAAM,CAWjB;IAED;;;OAGG;IACH,qBAFW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,QAU5C;CACJ"}

package/src/engine/simulation/DormandPrince.d.ts

@@ -1,19 +0,0 @@
-export class StepResult {
-    step: number;
-    yDelta: number;
-    error: number;
-    iterations: number;
-}
-/**
- *
- * @param {function(x:number, y:number):number} fxy derivative function
- * @param {number} x value of X
- * @param {number} y value of Y
- * @param {number} suggestedStepSize Suggested step size
- * @param {number} tolerance tolerable error size
- * @param {number} maxIterations maximum number of iterations allowed to find step
- * @param {StepResult} result
- * @returns {boolean} true if result is found, false otherwise
- */
-export function computeStepSize(fxy: any, x: number, y: number, suggestedStepSize: number, tolerance: number, maxIterations: number, result: StepResult): boolean;
-//# sourceMappingURL=DormandPrince.d.ts.map

package/src/engine/simulation/DormandPrince.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"DormandPrince.d.ts","sourceRoot":"","sources":["../../../../src/engine/simulation/DormandPrince.js"],"names":[],"mappings":"AAoGA;IACQ,aAAS;IACT,eAAW;IACX,cAAU;IACV,mBAAe;CACtB;AAED;;;;;;;;;;GAUG;AACH,6CARW,MAAM,KACN,MAAM,qBACN,MAAM,aACN,MAAM,iBACN,MAAM,UACN,UAAU,GACR,OAAO,CAwCnB"}

package/src/engine/simulation/DormandPrince.js

@@ -1,242 +0,0 @@
-import { clamp } from "../../core/math/clamp.js";
-
-/*
-File                    odedopri.py
-
-Synopsis
-double odedopri(double (*fxy)(double x, double y),
-double x0, double y0, double x1, double tol,
-    double hmax,  double hmin, int maxiter)
-
-Parameters
-fxy               Input: derivative function y' = f(x, y)
-y is the dependent variable, x is the independent
-variable
-x0, y0            Input: initial points, x0 <= x <= x1    y(x0) = y0
-x1                Input: final value of x
-tol               Input: tolerance
-hmax              Input: maximum step size
-hmin              Input: minimum step size
-maxiter           Input: maximum number of iterations
-flag              Input: return flag
-0   no errors
-1   hmin exceeded
-2   maximum iterations exceeded
-
-Return value
-value of y at last step x
-
-Description
-The routine odedopri() implements the Dormand-Prince method of
-solving an ordinary differential equation of the first order
-y' = f(x,y).
-
-Reference
-The coefficients were obtained from
-
-E.Hairer, S.P.Norsett and G.Wanner[1991],
-    "Solving Differential Equations I, Nonstiff Problems",
-    2e, Springer-Verlag, p. 178
-
-WARNING
-Check the flag after calling this routine!
-
-    Revisions
-1998.05.02      first version
-2018.05.04      Javascript port from python
-@source https://web.archive.org/web/20150907215914/http://adorio-research.org/wordpress/?p=6565
-@author ? [original author]
-@author Alex Goldring
-*/
-
-// we trust that the compiler is smart enough to pre-evaluate the
-// value of the constants.
-
-const a21 = (1.0 / 5.0),
-    a31 = (3.0 / 40.0),
-    a32 = (9.0 / 40.0),
-    a41 = (44.0 / 45.0),
-    a42 = (-56.0 / 15.0),
-    a43 = (32.0 / 9.0),
-    a51 = (19372.0 / 6561.0),
-    a52 = (-25360.0 / 2187.0),
-    a53 = (64448.0 / 6561.0),
-    a54 = (-212.0 / 729.0),
-    a61 = (9017.0 / 3168.0),
-    a62 = (-355.0 / 33.0),
-    a63 = (46732.0 / 5247.0),
-    a64 = (49.0 / 176.0),
-    a65 = (-5103.0 / 18656.0),
-    a71 = (35.0 / 384.0),
-    a72 = (0.0),
-    a73 = (500.0 / 1113.0),
-    a74 = (125.0 / 192.0),
-    a75 = (-2187.0 / 6784.0),
-    a76 = (11.0 / 84.0),
-
-    c2 = (1.0 / 5.0),
-    c3 = (3.0 / 10.0),
-    c4 = (4.0 / 5.0),
-    c5 = (8.0 / 9.0),
-    c6 = (1.0),
-    c7 = (1.0),
-
-    b1 = (35.0 / 384.0),
-    b2 = (0.0),
-    b3 = (500.0 / 1113.0),
-    b4 = (125.0 / 192.0),
-    b5 = (-2187.0 / 6784.0),
-    b6 = (11.0 / 84.0),
-    b7 = (0.0),
-
-    b1p = (5179.0 / 57600.0),
-    b2p = (0.0),
-    b3p = (7571.0 / 16695.0),
-    b4p = (393.0 / 640.0),
-    b5p = (-92097.0 / 339200.0),
-    b6p = (187.0 / 2100.0),
-    b7p = (1.0 / 40.0);
-
-
-export class StepResult {
-        step = 0;
-        yDelta = 0;
-        error = 0;
-        iterations = 0;
-}
-
-/**
- *
- * @param {function(x:number, y:number):number} fxy derivative function
- * @param {number} x value of X
- * @param {number} y value of Y
- * @param {number} suggestedStepSize Suggested step size
- * @param {number} tolerance tolerable error size
- * @param {number} maxIterations maximum number of iterations allowed to find step
- * @param {StepResult} result
- * @returns {boolean} true if result is found, false otherwise
- */
-function computeStepSize(fxy, x, y, suggestedStepSize, tolerance, maxIterations, result) {
-    let i;
-
-    let h = suggestedStepSize;
-
-    for (i = 0; i < maxIterations; i++) {
-        /* Compute the function values */
-        const K1 = fxy(x, y);
-        const K2 = fxy(x + c2 * h, y + h * (a21 * K1));
-        const K3 = fxy(x + c3 * h, y + h * (a31 * K1 + a32 * K2));
-        const K4 = fxy(x + c4 * h, y + h * (a41 * K1 + a42 * K2 + a43 * K3));
-        const K5 = fxy(x + c5 * h, y + h * (a51 * K1 + a52 * K2 + a53 * K3 + a54 * K4));
-        const K6 = fxy(x + h, y + h * (a61 * K1 + a62 * K2 + a63 * K3 + a64 * K4 + a65 * K5));
-        const K7 = fxy(x + h, y + h * (a71 * K1 + a72 * K2 + a73 * K3 + a74 * K4 + a75 * K5 + a76 * K6));
-
-        const error = Math.abs((b1 - b1p) * K1 + (b3 - b3p) * K3 + (b4 - b4p) * K4 + (b5 - b5p) * K5 + (b6 - b6p) * K6 + (b7 - b7p) * K7);
-
-        // error control
-        const delta = 0.84 * Math.pow(tolerance / error, (1.0 / 5.0));
-
-        if (error < tolerance) {
-            // error within tolerance
-
-            result.step = h;
-            result.error = error;
-            result.iterations = i + 1;
-            result.yDelta = h * (b1 * K1 + b3 * K3 + b4 * K4 + b5 * K5 + b6 * K6);
-
-            return true;
-        }
-
-        const clamped_delta = clamp(delta, 0.1, 4.0);
-
-        h = clamped_delta * h;
-    }
-
-    //failed to compute step
-    return false;
-}
-
-/**
- *
- * @param {function(x:number, y:number):number} fxy derivative function
- * @param {number} x0 starting X value
- * @param {number} y0 starting Y value
- * @param {number} x1 end X value
- * @param {number} tol tolerance
- * @param {number} hmax max step size
- * @param {number} hmin min step size
- * @param {number} max_iteration maximum number of iterations
- * @returns {Array.<number>}
- */
-function odedopri(fxy, x0, y0, x1, tol, hmax, hmin, max_iteration) {
-
-
-    let x = x0;
-    let y = y0;
-    //step size
-    let h = hmax;
-
-    let flag;
-    const stepResult = new StepResult();
-
-    let iterations_remaining = max_iteration;
-
-    while (iterations_remaining > 0) {
-
-        iterations_remaining--;
-
-        if (computeStepSize(fxy, x, y, h, tol, 100, stepResult)) {
-            h = stepResult.step;
-            x += h;
-            y += stepResult.yDelta;
-        } else {
-            //failed to find a good step, take a conservative smallest possible step
-            h = hmin;
-        }
-
-        if (h > hmax) {
-            h = hmax;
-        }
-
-
-        if (x >= x1) {
-            flag = 0;
-            break;
-        } else if (x + h > x1) {
-            h = x1 - x;
-        } else if (h < hmin) {
-            h = hmin;
-        }
-    }
-
-    if (iterations_remaining <= 0) {
-        flag = 2;
-    }
-
-    return [y, x, flag, iterations_remaining];
-}
-
-function main() {
-    function fxy(x, y) {
-        return Math.abs(Math.sin(x));
-    }
-
-    const x0 = 0,
-        y0 = 1.24,
-        x1 = 1000.0,
-        tol = 1.0e-5,
-        hmax = 1.0,
-        hmin = 0.001,
-        maxiter = 1000000;
-
-    console.log(odedopri(fxy, x0, y0, x1, tol, hmax, hmin, maxiter));
-}
-
-console.time('solver');
-main();
-console.timeEnd('solver');
-
-export {
-    StepResult,
-    computeStepSize
-};