@visuallyjs/browser-ui 1.2.10 → 1.2.11

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@visuallyjs/browser-ui",
-  "version": "1.2.10",
+  "version": "1.2.11",
   "license": "Commercial",
   "main": "js/visuallyjs.browser-ui.cjs.js",
   "module": "js/visuallyjs.browser-ui.esm.js",

package/types/browser-ui/surface-renderer/diagrams/definitions.d.ts

@@ -150,6 +150,20 @@ export interface DiagramOptions {
          * Defaults to false. If true, edges will attempt to avoid vertices wherever possible.
          */
         avoidVertices?: boolean;
+        /**
+         * Size of each cell in the grid that the AStar routine uses to calculate paths that avoid vertices. This defaults to 10 pixels.If you do change it, keep in mind that a) a smaller grid size increases the runtime of the routine, and b) a large grid size will render the UI unusable.
+         */
+        astarGridCellSize?: number;
+        /**
+         * Number of cells to pad each vertex with that act as its border: edges will be routed around the border wherever possible. Defaults to 2
+         *
+         */
+        astarVertexBorder?: number;
+        /**
+         * Number of cells to pad each vertex with that act as its buffer: edges will be routed around the buffer wherever possible. Defaults to 2 - but note this value is added the vertex border, whose default is 2, so the computed default is 4 grid cells.
+         *
+         */
+        astarVertexBuffer?: number;
         /**
          * Defaults to true - edges are editable when the user taps on them.
          */

package/types/core/rtree/hilbert.d.ts

@@ -4,6 +4,7 @@ import { RectangleXY } from "../util";
  */
 export declare const HilbertCurves: {
     sortRect: <T extends RectangleXY>(listOfRectangles: Array<T>) => Array<T>;
-    toHilbertCoordinates: (maxCoordinate: number, x: number, y: number) => number;
+    /** Convert integer coordinates on a 2^order square to an unsigned Hilbert key (orders 1–16). */
+    toHilbertCoordinates: (order: number, x: number, y: number) => number;
     hilbertInterleaveBits: (odd: number, even: number) => number;
 };

package/types/core/rtree/rtree.d.ts

@@ -87,7 +87,8 @@ export declare class RTree<DataPayload extends ObjectData = ObjectData> {
      */
     searchById(id: string): RTreeRegion;
     /**
-     * Update the position of the given record. Internally this just removes the record and re-inserts it.
+     * Update the position of the given record without condensing nonempty branches.
+     * Only the updated record is reinserted; its old ancestor bounds are refitted once.
      * @param id
      * @param x
      * @param y

package/types/core/rtree/util.d.ts

@@ -8,6 +8,12 @@ export declare function _growToFit(rectToGrow: RTreeRegion, otherRect: RTreeRegi
  * @private
  */
 export declare function _updateRTreeRegionBounds(rect: RTreeRegion): void;
+/**
+ * Refit only this region to its immediate children. Empty regions use the same
+ * bounds as `_emptyRTreeRegion`; callers prune empty branches before refitting parents.
+ * @internal
+ */
+export declare function _refitRTreeRegionBounds(rect: RTreeRegion): void;
 export declare function _areaIfGrownBy(rectToGrow: RTreeRegion, otherRect: RTreeRegion): number;
 export declare function splitIntoSiblings(r: RTreeRegion): [RTreeRegion, RTreeRegion];
 /**

package/types/version.d.ts

@@ -1 +1 @@
-export declare const VERSION = "1.2.10";
+export declare const VERSION = "1.2.11";