@woosh/meep-engine 2.118.4 → 2.118.6

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/core/math/random/MersenneTwister.d.ts

@@ -1,19 +0,0 @@
-export class MersenneTwister {
-    constructor(seed?: number);
-    N: number;
-    M: number;
-    MATRIX_A: number;
-    UPPER_MASK: number;
-    LOWER_MASK: number;
-    mt: any[];
-    mti: number;
-    init_genrand(s: any): void;
-    init_by_array(init_key: any, key_length: any): void;
-    genrand_int32(): number;
-    genrand_int31(): number;
-    genrand_real1(): number;
-    random(): number;
-    genrand_real3(): number;
-    genrand_res53(): number;
-}
-//# sourceMappingURL=MersenneTwister.d.ts.map

package/src/core/math/random/MersenneTwister.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"MersenneTwister.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/random/MersenneTwister.js"],"names":[],"mappings":"AA8DA;IACI,2BAkBC;IAfG,UAAY;IACZ,UAAY;IACZ,iBAA0B;IAE1B,mBAA4B;IAE5B,mBAA4B;IAG5B,UAA2B;IAE3B,YAAqB;IAOzB,2BAaC;IAOD,oDAqCC;IAGD,wBAmCC;IAGD,wBAEC;IAGD,wBAGC;IAGD,iBAGC;IAGD,wBAGC;IAGD,wBAGC;CACJ"}

package/src/core/math/random/MersenneTwister.js

@@ -1,212 +0,0 @@
-/*
-  I've wrapped Makoto Matsumoto and Takuji Nishimura's code in a namespace
-  so it's better encapsulated. Now you can have multiple random number generators
-  and they won't stomp all over eachother's state.
-
-  If you want to use this as a substitute for Math.random(), use the random()
-  method like so:
-
-  var m = new MersenneTwister();
-  var randomNumber = m.random();
-
-  You can also call the other genrand_{foo}() methods on the instance.
-  If you want to use a specific seed in order to get a repeatable random
-  sequence, pass an integer into the constructor:
-  var m = new MersenneTwister(123);
-  and that will always produce the same random sequence.
-  Sean McCullough (banksean@gmail.com)
-*/
-
-/*
-   A C-program for MT19937, with initialization improved 2002/1/26.
-   Coded by Takuji Nishimura and Makoto Matsumoto.
-
-   Before using, initialize the state by using init_genrand(seed)
-   or init_by_array(init_key, key_length).
-
-   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
-   All rights reserved.
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions
-   are met:
-
-     1. Redistributions of source code must retain the above copyright
-        notice, this list of conditions and the following disclaimer.
-
-     2. Redistributions in binary form must reproduce the above copyright
-        notice, this list of conditions and the following disclaimer in the
-        documentation and/or other materials provided with the distribution.
-
-     3. The names of its contributors may not be used to endorse or promote
-        products derived from this software without specific prior written
-        permission.
-
-   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
-   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-
-   Any feedback is very welcome.
-   http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
-   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
-*/
-
-export class MersenneTwister {
-    constructor(seed = new Date().getTime()) {
-
-        /* Period parameters */
-        this.N = 624;
-        this.M = 397;
-        this.MATRIX_A = 0x9908b0df;
-        /* constant vector a */
-        this.UPPER_MASK = 0x80000000;
-        /* most significant w-r bits */
-        this.LOWER_MASK = 0x7fffffff;
-        /* least significant r bits */
-
-        this.mt = new Array(this.N);
-        /* the array for the state vector */
-        this.mti = this.N + 1;
-        /* mti==N+1 means mt[N] is not initialized */
-
-        this.init_genrand(seed);
-    }
-
-    /* initializes mt[N] with a seed */
-    init_genrand(s) {
-        this.mt[0] = s >>> 0;
-        for (this.mti = 1; this.mti < this.N; this.mti++) {
-            const s = this.mt[this.mti - 1] ^ (this.mt[this.mti - 1] >>> 30);
-            this.mt[this.mti] = (((((s & 0xffff0000) >>> 16) * 1812433253) << 16) + (s & 0x0000ffff) * 1812433253)
-                + this.mti;
-            /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
-            /* In the previous versions, MSBs of the seed affect   */
-            /* only MSBs of the array mt[].                        */
-            /* 2002/01/09 modified by Makoto Matsumoto             */
-            this.mt[this.mti] >>>= 0;
-            /* for >32 bit machines */
-        }
-    }
-
-    /* initialize by an array with array-length */
-    /* init_key is the array for initializing keys */
-    /* key_length is its length */
-
-    /* slight change for C++, 2004/2/26 */
-    init_by_array(init_key, key_length) {
-        let i, j, k;
-        this.init_genrand(19650218);
-        i = 1;
-        j = 0;
-        k = (this.N > key_length ? this.N : key_length);
-        for (; k; k--) {
-            const s = this.mt[i - 1] ^ (this.mt[i - 1] >>> 30)
-            this.mt[i] = (this.mt[i] ^ (((((s & 0xffff0000) >>> 16) * 1664525) << 16) + ((s & 0x0000ffff) * 1664525)))
-                + init_key[j] + j;
-            /* non linear */
-            this.mt[i] >>>= 0;
-            /* for WORDSIZE > 32 machines */
-            i++;
-            j++;
-            if (i >= this.N) {
-                this.mt[0] = this.mt[this.N - 1];
-                i = 1;
-            }
-            if (j >= key_length) j = 0;
-        }
-        for (k = this.N - 1; k; k--) {
-            const s = this.mt[i - 1] ^ (this.mt[i - 1] >>> 30);
-            this.mt[i] = (this.mt[i] ^ (((((s & 0xffff0000) >>> 16) * 1566083941) << 16) + (s & 0x0000ffff) * 1566083941))
-                - i;
-            /* non linear */
-            this.mt[i] >>>= 0;
-            /* for WORDSIZE > 32 machines */
-            i++;
-            if (i >= this.N) {
-                this.mt[0] = this.mt[this.N - 1];
-                i = 1;
-            }
-        }
-
-        this.mt[0] = 0x80000000;
-        /* MSB is 1; assuring non-zero initial array */
-    }
-
-    /* generates a random number on [0,0xffffffff]-interval */
-    genrand_int32() {
-        let y;
-        const mag01 = new Array(0x0, this.MATRIX_A);
-        /* mag01[x] = x * MATRIX_A  for x=0,1 */
-
-        if (this.mti >= this.N) { /* generate N words at one time */
-            let kk;
-
-            if (this.mti === this.N + 1)   /* if init_genrand() has not been called, */
-                this.init_genrand(5489);
-            /* a default initial seed is used */
-
-            for (kk = 0; kk < this.N - this.M; kk++) {
-                y = (this.mt[kk] & this.UPPER_MASK) | (this.mt[kk + 1] & this.LOWER_MASK);
-                this.mt[kk] = this.mt[kk + this.M] ^ (y >>> 1) ^ mag01[y & 0x1];
-            }
-            for (; kk < this.N - 1; kk++) {
-                y = (this.mt[kk] & this.UPPER_MASK) | (this.mt[kk + 1] & this.LOWER_MASK);
-                this.mt[kk] = this.mt[kk + (this.M - this.N)] ^ (y >>> 1) ^ mag01[y & 0x1];
-            }
-            y = (this.mt[this.N - 1] & this.UPPER_MASK) | (this.mt[0] & this.LOWER_MASK);
-            this.mt[this.N - 1] = this.mt[this.M - 1] ^ (y >>> 1) ^ mag01[y & 0x1];
-
-            this.mti = 0;
-        }
-
-        y = this.mt[this.mti++];
-
-        /* Tempering */
-        y ^= (y >>> 11);
-        y ^= (y << 7) & 0x9d2c5680;
-        y ^= (y << 15) & 0xefc60000;
-        y ^= (y >>> 18);
-
-        return y >>> 0;
-    }
-
-    /* generates a random number on [0,0x7fffffff]-interval */
-    genrand_int31() {
-        return (this.genrand_int32() >>> 1);
-    }
-
-    /* generates a random number on [0,1]-real-interval */
-    genrand_real1() {
-        return this.genrand_int32() * (1.0 / 4294967295.0);
-        /* divided by 2^32-1 */
-    }
-
-    /* generates a random number on [0,1)-real-interval */
-    random() {
-        return this.genrand_int32() * (1.0 / 4294967296.0);
-        /* divided by 2^32 */
-    }
-
-    /* generates a random number on (0,1)-real-interval */
-    genrand_real3() {
-        return (this.genrand_int32() + 0.5) * (1.0 / 4294967296.0);
-        /* divided by 2^32 */
-    }
-
-    /* generates a random number on [0,1) with 53-bit resolution*/
-    genrand_res53() {
-        const a = this.genrand_int32() >>> 5, b = this.genrand_int32() >>> 6;
-        return (a * 67108864.0 + b) * (1.0 / 9007199254740992.0);
-    }
-}
-
-/* These real versions are due to Isaku Wada, 2002/01/09 added */

package/src/core/math/random/seededRandomMersenneTwister.d.ts

@@ -1,7 +0,0 @@
-/**
- * https://gist.github.com/banksean/300494
- * @param {number} seed
- * @returns {function():number} RNG
- */
-export function seededRandomMersenneTwister(seed: number): () => number;
-//# sourceMappingURL=seededRandomMersenneTwister.d.ts.map

package/src/core/math/random/seededRandomMersenneTwister.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"seededRandomMersenneTwister.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/random/seededRandomMersenneTwister.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,kDAHW,MAAM,SACO,MAAM,CAiF7B"}

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"}