@mlightcad/cad-simple-viewer 1.3.4 → 1.4.0

package/lib/i18n/en/command.js

@@ -3,6 +3,7 @@ export default {
         circle: 'Creates one circle by center and radius',
         csvg: 'Converts current drawing to SVG',
         dimlinear: 'Creates linear dimensions',
+        erase: 'Deletes selected entities from the drawing',
         line: 'Draws straight line segments between points',
         log: 'Logs debug information in console',
         open: 'Opens an existing drawing file',

package/lib/i18n/en/command.js.map

@@ -1 +1 @@
-{"version":3,"file":"command.js","sourceRoot":"","sources":["../../../src/i18n/en/command.ts"],"names":[],"mappings":"AAAA,eAAe;IACb,IAAI,EAAE;QACJ,MAAM,EAAE,yCAAyC;QACjD,IAAI,EAAE,iCAAiC;QACvC,SAAS,EAAE,2BAA2B;QACtC,IAAI,EAAE,6CAA6C;QACnD,GAAG,EAAE,mCAAmC;QACxC,IAAI,EAAE,gCAAgC;QACtC,GAAG,EAAE,yEAAyE;QAC9E,OAAO,EACL,qEAAqE;QACvE,IAAI,EAAE,sBAAsB;QAC5B,KAAK,EAAE,4BAA4B;QACnC,MAAM,EAAE,kBAAkB;QAC1B,IAAI,EAAE,sDAAsD;QAC5D,KAAK,EAAE,4DAA4D;KACpE;IACD,IAAI,EAAE,EAAE;CACT,CAAA"}
+{"version":3,"file":"command.js","sourceRoot":"","sources":["../../../src/i18n/en/command.ts"],"names":[],"mappings":"AAAA,eAAe;IACb,IAAI,EAAE;QACJ,MAAM,EAAE,yCAAyC;QACjD,IAAI,EAAE,iCAAiC;QACvC,SAAS,EAAE,2BAA2B;QACtC,KAAK,EAAE,4CAA4C;QACnD,IAAI,EAAE,6CAA6C;QACnD,GAAG,EAAE,mCAAmC;QACxC,IAAI,EAAE,gCAAgC;QACtC,GAAG,EAAE,yEAAyE;QAC9E,OAAO,EACL,qEAAqE;QACvE,IAAI,EAAE,sBAAsB;QAC5B,KAAK,EAAE,4BAA4B;QACnC,MAAM,EAAE,kBAAkB;QAC1B,IAAI,EAAE,sDAAsD;QAC5D,KAAK,EAAE,4DAA4D;KACpE;IACD,IAAI,EAAE,EAAE;CACT,CAAA"}

package/lib/i18n/zh/command.d.ts

@@ -3,6 +3,7 @@ declare const _default: {
         circle: string;
         csvg: string;
         dimlinear: string;
+        erase: string;
         line: string;
         log: string;
         open: string;

package/lib/i18n/zh/command.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"command.d.ts","sourceRoot":"","sources":["../../../src/i18n/zh/command.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;AAAA,wBAiBC"}
+{"version":3,"file":"command.d.ts","sourceRoot":"","sources":["../../../src/i18n/zh/command.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;AAAA,wBAkBC"}

package/lib/i18n/zh/command.js

@@ -3,6 +3,7 @@ export default {
         circle: '使用圆心和半径创建圆',
         csvg: '转换当前图纸为SVG格式',
         dimlinear: '创建线性尺寸标注',
+        erase: '从图纸中删除所选对象',
         line: '在指定点之间绘制直线段',
         log: '在控制台输出调试信息',
         open: '打开图纸',

package/lib/i18n/zh/command.js.map

@@ -1 +1 @@
-{"version":3,"file":"command.js","sourceRoot":"","sources":["../../../src/i18n/zh/command.ts"],"names":[],"mappings":"AAAA,eAAe;IACb,IAAI,EAAE;QACJ,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,cAAc;QACpB,SAAS,EAAE,UAAU;QACrB,IAAI,EAAE,aAAa;QACnB,GAAG,EAAE,YAAY;QACjB,IAAI,EAAE,MAAM;QACZ,GAAG,EAAE,MAAM;QACX,OAAO,EAAE,oBAAoB;QAC7B,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,MAAM;QACb,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,eAAe;KACvB;IACD,IAAI,EAAE,EAAE;CACT,CAAA"}
+{"version":3,"file":"command.js","sourceRoot":"","sources":["../../../src/i18n/zh/command.ts"],"names":[],"mappings":"AAAA,eAAe;IACb,IAAI,EAAE;QACJ,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,cAAc;QACpB,SAAS,EAAE,UAAU;QACrB,KAAK,EAAE,YAAY;QACnB,IAAI,EAAE,aAAa;QACnB,GAAG,EAAE,YAAY;QACjB,IAAI,EAAE,MAAM;QACZ,GAAG,EAAE,MAAM;QACX,OAAO,EAAE,oBAAoB;QAC7B,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,MAAM;QACb,MAAM,EAAE,MAAM;QACd,IAAI,EAAE,WAAW;QACjB,KAAK,EAAE,eAAe;KACvB;IACD,IAAI,EAAE,EAAE;CACT,CAAA"}

package/lib/spatialIndex/AcTrHierarchicalSpatialIndex.d.ts

@@ -0,0 +1,54 @@
+import { AcDbObjectId } from '@mlightcad/data-model';
+import { AcTrGroup } from '@mlightcad/three-renderer';
+import { AcEdSpatialQueryResultItem, AcEdSpatialQueryResultItemEx } from '../editor/view';
+import { AcTrSpatialIndex, AcTrSpatialIndexBBox } from './AcTrSpatialIndex';
+/**
+ * A two-level (hierarchical) spatial index designed for complex CAD
+ * scene structures such as blocks, groups, layers, or nested entities.
+ *
+ * The index consists of:
+ *
+ * 1. A first-level spatial index that stores coarse bounding boxes
+ *    (AcEdSpatialQueryResultItem) and maps each result to an `id`.
+ *
+ * 2. A second-level map from `id` to another spatial index, which
+ *    contains more detailed spatial data for that specific entity,
+ *    block, or group.
+ *
+ * Spatial queries are executed in two phases:
+ * - First, the query is performed against the root spatial index to
+ *   find candidate items.
+ * - Then, for each candidate, the corresponding second-level spatial
+ *   index (if present) is queried for more precise results.
+ * - Results from both levels are merged into a single query result.
+ *
+ * This design allows:
+ * - Mixing different spatial index implementations (e.g. R-tree and
+ *   linear scan) at different hierarchy levels
+ * - Efficient querying of large, nested CAD datasets
+ * - Lazy or selective construction of fine-grained spatial indexes
+ *
+ * This class is particularly suitable for CAD viewers and editors
+ * where entities are grouped hierarchically but still require fast
+ * spatial queries such as selection, picking, and hit-testing.
+ */
+export declare class AcTrHierarchicalSpatialIndex implements AcTrSpatialIndex {
+    static THRESHOLD: number;
+    private readonly rootIndex;
+    private readonly childIndexes;
+    constructor(rootIndex?: AcTrSpatialIndex<AcEdSpatialQueryResultItem>);
+    /** Register second-level index for an id */
+    setChildIndex(id: string, index: AcTrSpatialIndex): void;
+    /** Remove second-level index */
+    removeChildIndex(id: string): void;
+    insert(item: AcEdSpatialQueryResultItem): void;
+    load(items: readonly AcEdSpatialQueryResultItem[]): void;
+    remove(item: AcEdSpatialQueryResultItem, equals?: (a: AcEdSpatialQueryResultItem, b: AcEdSpatialQueryResultItem) => boolean): void;
+    removeById(id: AcDbObjectId): void;
+    clear(): void;
+    search(bbox: AcTrSpatialIndexBBox): AcEdSpatialQueryResultItemEx[];
+    collides(bbox: AcTrSpatialIndexBBox): boolean;
+    all(): AcEdSpatialQueryResultItem[];
+    createChildIndex(group: AcTrGroup): AcTrSpatialIndex<AcEdSpatialQueryResultItem> | undefined;
+}
+//# sourceMappingURL=AcTrHierarchicalSpatialIndex.d.ts.map

package/lib/spatialIndex/AcTrHierarchicalSpatialIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AcTrHierarchicalSpatialIndex.d.ts","sourceRoot":"","sources":["../../src/spatialIndex/AcTrHierarchicalSpatialIndex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AACpD,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAA;AAErD,OAAO,EACL,0BAA0B,EAC1B,4BAA4B,EAC7B,MAAM,gBAAgB,CAAA;AAGvB,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAA;AAE3E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,qBAAa,4BAA6B,YAAW,gBAAgB;IACnE,MAAM,CAAC,SAAS,SAAM;IACtB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA8C;IACxE,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAsC;gBAEvD,SAAS,CAAC,EAAE,gBAAgB,CAAC,0BAA0B,CAAC;IAIpE,4CAA4C;IAC5C,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,gBAAgB,GAAG,IAAI;IAIxD,gCAAgC;IAChC,gBAAgB,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAIlC,MAAM,CAAC,IAAI,EAAE,0BAA0B,GAAG,IAAI;IAK9C,IAAI,CAAC,KAAK,EAAE,SAAS,0BAA0B,EAAE,GAAG,IAAI;IAIxD,MAAM,CACJ,IAAI,EAAE,0BAA0B,EAChC,MAAM,CAAC,EAAE,CACP,CAAC,EAAE,0BAA0B,EAC7B,CAAC,EAAE,0BAA0B,KAC1B,OAAO,GACX,IAAI;IAKP,UAAU,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI;IAKlC,KAAK,IAAI,IAAI;IAKb,MAAM,CAAC,IAAI,EAAE,oBAAoB,GAAG,4BAA4B,EAAE;IAqBlE,QAAQ,CAAC,IAAI,EAAE,oBAAoB,GAAG,OAAO;IAU7C,GAAG,IAAI,0BAA0B,EAAE;IAYnC,gBAAgB,CAAC,KAAK,EAAE,SAAS;CAiBlC"}

package/lib/spatialIndex/AcTrHierarchicalSpatialIndex.js

@@ -0,0 +1,191 @@
+var __assign = (this && this.__assign) || function () {
+    __assign = Object.assign || function(t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+                t[p] = s[p];
+        }
+        return t;
+    };
+    return __assign.apply(this, arguments);
+};
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
+import { AcTrLinearSpatialIndex } from './AcTrLinearSpatialIndex';
+import { AcTrRBushSpatialIndex } from './AcTrRBushSpatialIndex';
+/**
+ * A two-level (hierarchical) spatial index designed for complex CAD
+ * scene structures such as blocks, groups, layers, or nested entities.
+ *
+ * The index consists of:
+ *
+ * 1. A first-level spatial index that stores coarse bounding boxes
+ *    (AcEdSpatialQueryResultItem) and maps each result to an `id`.
+ *
+ * 2. A second-level map from `id` to another spatial index, which
+ *    contains more detailed spatial data for that specific entity,
+ *    block, or group.
+ *
+ * Spatial queries are executed in two phases:
+ * - First, the query is performed against the root spatial index to
+ *   find candidate items.
+ * - Then, for each candidate, the corresponding second-level spatial
+ *   index (if present) is queried for more precise results.
+ * - Results from both levels are merged into a single query result.
+ *
+ * This design allows:
+ * - Mixing different spatial index implementations (e.g. R-tree and
+ *   linear scan) at different hierarchy levels
+ * - Efficient querying of large, nested CAD datasets
+ * - Lazy or selective construction of fine-grained spatial indexes
+ *
+ * This class is particularly suitable for CAD viewers and editors
+ * where entities are grouped hierarchically but still require fast
+ * spatial queries such as selection, picking, and hit-testing.
+ */
+var AcTrHierarchicalSpatialIndex = /** @class */ (function () {
+    function AcTrHierarchicalSpatialIndex(rootIndex) {
+        this.childIndexes = new Map();
+        this.rootIndex = rootIndex !== null && rootIndex !== void 0 ? rootIndex : new AcTrRBushSpatialIndex();
+    }
+    /** Register second-level index for an id */
+    AcTrHierarchicalSpatialIndex.prototype.setChildIndex = function (id, index) {
+        this.childIndexes.set(id, index);
+    };
+    /** Remove second-level index */
+    AcTrHierarchicalSpatialIndex.prototype.removeChildIndex = function (id) {
+        this.childIndexes.delete(id);
+    };
+    AcTrHierarchicalSpatialIndex.prototype.insert = function (item) {
+        var _a;
+        this.rootIndex.insert(item);
+        (_a = this.childIndexes.get(item.id)) === null || _a === void 0 ? void 0 : _a.insert(item);
+    };
+    AcTrHierarchicalSpatialIndex.prototype.load = function (items) {
+        this.rootIndex.load(items);
+    };
+    AcTrHierarchicalSpatialIndex.prototype.remove = function (item, equals) {
+        this.rootIndex.remove(item, equals);
+        this.childIndexes.delete(item.id);
+    };
+    AcTrHierarchicalSpatialIndex.prototype.removeById = function (id) {
+        this.rootIndex.removeById(id);
+        this.childIndexes.delete(id);
+    };
+    AcTrHierarchicalSpatialIndex.prototype.clear = function () {
+        this.rootIndex.clear();
+        this.childIndexes.forEach(function (i) { return i.clear(); });
+    };
+    AcTrHierarchicalSpatialIndex.prototype.search = function (bbox) {
+        var e_1, _a;
+        var level1 = this.rootIndex.search(bbox);
+        var result = [];
+        try {
+            for (var level1_1 = __values(level1), level1_1_1 = level1_1.next(); !level1_1_1.done; level1_1_1 = level1_1.next()) {
+                var hit = level1_1_1.value;
+                var child = this.childIndexes.get(hit.id);
+                if (!child) {
+                    result.push(hit);
+                    continue;
+                }
+                var level2 = child.search(bbox);
+                result.push(__assign(__assign({}, hit), { children: level2 }));
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (level1_1_1 && !level1_1_1.done && (_a = level1_1.return)) _a.call(level1_1);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
+        return result;
+    };
+    AcTrHierarchicalSpatialIndex.prototype.collides = function (bbox) {
+        var _this = this;
+        if (!this.rootIndex.collides(bbox))
+            return false;
+        var level1 = this.rootIndex.search(bbox);
+        return level1.some(function (hit) {
+            var child = _this.childIndexes.get(hit.id);
+            return child ? child.collides(bbox) : true;
+        });
+    };
+    AcTrHierarchicalSpatialIndex.prototype.all = function () {
+        var e_2, _a;
+        var result = [];
+        try {
+            for (var _b = __values(this.rootIndex.all()), _c = _b.next(); !_c.done; _c = _b.next()) {
+                var hit = _c.value;
+                var child = this.childIndexes.get(hit.id);
+                if (child)
+                    result.push.apply(result, __spreadArray([], __read(child.all()), false));
+                else
+                    result.push(hit);
+            }
+        }
+        catch (e_2_1) { e_2 = { error: e_2_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_2) throw e_2.error; }
+        }
+        return result;
+    };
+    AcTrHierarchicalSpatialIndex.prototype.createChildIndex = function (group) {
+        var size = group.boxes.length;
+        var spatialIndex = undefined;
+        if (size > AcTrHierarchicalSpatialIndex.THRESHOLD) {
+            spatialIndex = new AcTrRBushSpatialIndex();
+        }
+        else if (size > 0) {
+            spatialIndex = new AcTrLinearSpatialIndex();
+        }
+        if (spatialIndex) {
+            group.boxes.forEach(function (box) {
+                spatialIndex.insert(box);
+            });
+            this.setChildIndex(group.objectId, spatialIndex);
+        }
+        return spatialIndex;
+    };
+    AcTrHierarchicalSpatialIndex.THRESHOLD = 100;
+    return AcTrHierarchicalSpatialIndex;
+}());
+export { AcTrHierarchicalSpatialIndex };
+//# sourceMappingURL=AcTrHierarchicalSpatialIndex.js.map

package/lib/spatialIndex/AcTrHierarchicalSpatialIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AcTrHierarchicalSpatialIndex.js","sourceRoot":"","sources":["../../src/spatialIndex/AcTrHierarchicalSpatialIndex.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAA;AACjE,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAA;AAG/D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH;IAKE,sCAAY,SAAwD;QAFnD,iBAAY,GAAG,IAAI,GAAG,EAA4B,CAAA;QAGjE,IAAI,CAAC,SAAS,GAAG,SAAS,aAAT,SAAS,cAAT,SAAS,GAAI,IAAI,qBAAqB,EAAE,CAAA;IAC3D,CAAC;IAED,4CAA4C;IAC5C,oDAAa,GAAb,UAAc,EAAU,EAAE,KAAuB;QAC/C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;IAClC,CAAC;IAED,gCAAgC;IAChC,uDAAgB,GAAhB,UAAiB,EAAU;QACzB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IAC9B,CAAC;IAED,6CAAM,GAAN,UAAO,IAAgC;;QACrC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC3B,MAAA,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,MAAM,CAAC,IAAI,CAAC,CAAA;IAC9C,CAAC;IAED,2CAAI,GAAJ,UAAK,KAA4C;QAC/C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAC5B,CAAC;IAED,6CAAM,GAAN,UACE,IAAgC,EAChC,MAGY;QAEZ,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;QACnC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACnC,CAAC;IAED,iDAAU,GAAV,UAAW,EAAgB;QACzB,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;QAC7B,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IAC9B,CAAC;IAED,4CAAK,GAAL;QACE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAA;QACtB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,KAAK,EAAE,EAAT,CAAS,CAAC,CAAA;IAC3C,CAAC;IAED,6CAAM,GAAN,UAAO,IAA0B;;QAC/B,IAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC1C,IAAM,MAAM,GAAmC,EAAE,CAAA;;YAEjD,KAAkB,IAAA,WAAA,SAAA,MAAM,CAAA,8BAAA,kDAAE,CAAC;gBAAtB,IAAM,GAAG,mBAAA;gBACZ,IAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBAC3C,IAAI,CAAC,KAAK,EAAE,CAAC;oBACX,MAAM,CAAC,IAAI,CAAC,GAAiC,CAAC,CAAA;oBAC9C,SAAQ;gBACV,CAAC;gBAED,IAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACjC,MAAM,CAAC,IAAI,uBACN,GAAG,KACN,QAAQ,EAAE,MAAM,IAChB,CAAA;YACJ,CAAC;;;;;;;;;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED,+CAAQ,GAAR,UAAS,IAA0B;QAAnC,iBAQC;QAPC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAA;QAEhD,IAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QAC1C,OAAO,MAAM,CAAC,IAAI,CAAC,UAAA,GAAG;YACpB,IAAM,KAAK,GAAG,KAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YAC3C,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QAC5C,CAAC,CAAC,CAAA;IACJ,CAAC;IAED,0CAAG,GAAH;;QACE,IAAM,MAAM,GAAiC,EAAE,CAAA;;YAE/C,KAAkB,IAAA,KAAA,SAAA,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,CAAA,gBAAA,4BAAE,CAAC;gBAApC,IAAM,GAAG,WAAA;gBACZ,IAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBAC3C,IAAI,KAAK;oBAAE,MAAM,CAAC,IAAI,OAAX,MAAM,2BAAS,KAAK,CAAC,GAAG,EAAE,WAAC;;oBACjC,MAAM,CAAC,IAAI,CAAC,GAAiC,CAAC,CAAA;YACrD,CAAC;;;;;;;;;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED,uDAAgB,GAAhB,UAAiB,KAAgB;QAC/B,IAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAA;QAC/B,IAAI,YAAY,GAAiC,SAAS,CAAA;QAC1D,IAAI,IAAI,GAAG,4BAA4B,CAAC,SAAS,EAAE,CAAC;YAClD,YAAY,GAAG,IAAI,qBAAqB,EAAE,CAAA;QAC5C,CAAC;aAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACpB,YAAY,GAAG,IAAI,sBAAsB,EAAE,CAAA;QAC7C,CAAC;QAED,IAAI,YAAY,EAAE,CAAC;YACjB,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,UAAA,GAAG;gBACrB,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC1B,CAAC,CAAC,CAAA;YACF,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAA;QAClD,CAAC;QACD,OAAO,YAAY,CAAA;IACrB,CAAC;IA3GM,sCAAS,GAAG,GAAG,AAAN,CAAM;IA4GxB,mCAAC;CAAA,AA7GD,IA6GC;SA7GY,4BAA4B"}

package/lib/spatialIndex/AcTrLinearSpatialIndex.d.ts

@@ -0,0 +1,36 @@
+import { AcDbObjectId } from '@mlightcad/data-model';
+import { AcEdSpatialQueryResultItem } from '../editor/view';
+import { AcTrSpatialIndex, AcTrSpatialIndexBBox } from './AcTrSpatialIndex';
+/**
+ * A simple spatial index implementation that performs linear scanning
+ * over all stored bounding boxes.
+ *
+ * This index does not build any spatial acceleration structure. All
+ * spatial queries are executed by iterating through the full item list
+ * and testing bounding-box intersection one by one.
+ *
+ * Typical use cases:
+ * - Small datasets where index construction overhead is unnecessary
+ * - Highly dynamic data with frequent insert/remove operations
+ * - Debugging or validation of spatial query correctness
+ * - Fallback implementation when spatial indexing is not available
+ *
+ * Time complexity:
+ * - Insert / Remove: O(1)
+ * - Search / Collides: O(n)
+ *
+ * This implementation is memory-efficient and predictable, but does
+ * not scale well for large numbers of items.
+ */
+export declare class AcTrLinearSpatialIndex implements AcTrSpatialIndex {
+    private items;
+    insert(item: AcEdSpatialQueryResultItem): void;
+    load(items: readonly AcEdSpatialQueryResultItem[]): void;
+    remove(item: AcEdSpatialQueryResultItem): void;
+    removeById(id: AcDbObjectId): void;
+    clear(): void;
+    search(bbox: AcTrSpatialIndexBBox): AcEdSpatialQueryResultItem[];
+    collides(bbox: AcTrSpatialIndexBBox): boolean;
+    all(): AcEdSpatialQueryResultItem[];
+}
+//# sourceMappingURL=AcTrLinearSpatialIndex.d.ts.map

package/lib/spatialIndex/AcTrLinearSpatialIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AcTrLinearSpatialIndex.d.ts","sourceRoot":"","sources":["../../src/spatialIndex/AcTrLinearSpatialIndex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AAEpD,OAAO,EAAE,0BAA0B,EAAE,MAAM,gBAAgB,CAAA;AAC3D,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAA;AAE3E;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,sBAAuB,YAAW,gBAAgB;IAC7D,OAAO,CAAC,KAAK,CAAmC;IAEhD,MAAM,CAAC,IAAI,EAAE,0BAA0B,GAAG,IAAI;IAI9C,IAAI,CAAC,KAAK,EAAE,SAAS,0BAA0B,EAAE,GAAG,IAAI;IAIxD,MAAM,CAAC,IAAI,EAAE,0BAA0B,GAAG,IAAI;IAI9C,UAAU,CAAC,EAAE,EAAE,YAAY;IAI3B,KAAK,IAAI,IAAI;IAIb,MAAM,CAAC,IAAI,EAAE,oBAAoB,GAAG,0BAA0B,EAAE;IAIhE,QAAQ,CAAC,IAAI,EAAE,oBAAoB,GAAG,OAAO;IAI7C,GAAG,IAAI,0BAA0B,EAAE;CAGpC"}

package/lib/spatialIndex/AcTrLinearSpatialIndex.js

@@ -0,0 +1,85 @@
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
+/**
+ * A simple spatial index implementation that performs linear scanning
+ * over all stored bounding boxes.
+ *
+ * This index does not build any spatial acceleration structure. All
+ * spatial queries are executed by iterating through the full item list
+ * and testing bounding-box intersection one by one.
+ *
+ * Typical use cases:
+ * - Small datasets where index construction overhead is unnecessary
+ * - Highly dynamic data with frequent insert/remove operations
+ * - Debugging or validation of spatial query correctness
+ * - Fallback implementation when spatial indexing is not available
+ *
+ * Time complexity:
+ * - Insert / Remove: O(1)
+ * - Search / Collides: O(n)
+ *
+ * This implementation is memory-efficient and predictable, but does
+ * not scale well for large numbers of items.
+ */
+var AcTrLinearSpatialIndex = /** @class */ (function () {
+    function AcTrLinearSpatialIndex() {
+        this.items = [];
+    }
+    AcTrLinearSpatialIndex.prototype.insert = function (item) {
+        this.items.push(item);
+    };
+    AcTrLinearSpatialIndex.prototype.load = function (items) {
+        var _a;
+        (_a = this.items).push.apply(_a, __spreadArray([], __read(items), false));
+    };
+    AcTrLinearSpatialIndex.prototype.remove = function (item) {
+        this.items = this.items.filter(function (i) { return i.id !== item.id; });
+    };
+    AcTrLinearSpatialIndex.prototype.removeById = function (id) {
+        this.items = this.items.filter(function (i) { return i.id !== id; });
+    };
+    AcTrLinearSpatialIndex.prototype.clear = function () {
+        this.items.length = 0;
+    };
+    AcTrLinearSpatialIndex.prototype.search = function (bbox) {
+        return this.items.filter(function (i) { return intersects(i, bbox); });
+    };
+    AcTrLinearSpatialIndex.prototype.collides = function (bbox) {
+        return this.items.some(function (i) { return intersects(i, bbox); });
+    };
+    AcTrLinearSpatialIndex.prototype.all = function () {
+        return __spreadArray([], __read(this.items), false);
+    };
+    return AcTrLinearSpatialIndex;
+}());
+export { AcTrLinearSpatialIndex };
+function intersects(a, b) {
+    return !(a.maxX < b.minX ||
+        a.minX > b.maxX ||
+        a.maxY < b.minY ||
+        a.minY > b.maxY);
+}
+//# sourceMappingURL=AcTrLinearSpatialIndex.js.map

package/lib/spatialIndex/AcTrLinearSpatialIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AcTrLinearSpatialIndex.js","sourceRoot":"","sources":["../../src/spatialIndex/AcTrLinearSpatialIndex.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAKA;;;;;;;;;;;;;;;;;;;;GAoBG;AACH;IAAA;QACU,UAAK,GAAiC,EAAE,CAAA;IAiClD,CAAC;IA/BC,uCAAM,GAAN,UAAO,IAAgC;QACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;IAED,qCAAI,GAAJ,UAAK,KAA4C;;QAC/C,CAAA,KAAA,IAAI,CAAC,KAAK,CAAA,CAAC,IAAI,oCAAI,KAAK,WAAC;IAC3B,CAAC;IAED,uCAAM,GAAN,UAAO,IAAgC;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,EAAhB,CAAgB,CAAC,CAAA;IACvD,CAAC;IAED,2CAAU,GAAV,UAAW,EAAgB;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,EAAE,KAAK,EAAE,EAAX,CAAW,CAAC,CAAA;IAClD,CAAC;IAED,sCAAK,GAAL;QACE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;IACvB,CAAC;IAED,uCAAM,GAAN,UAAO,IAA0B;QAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAA,CAAC,IAAI,OAAA,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,EAAnB,CAAmB,CAAC,CAAA;IACpD,CAAC;IAED,yCAAQ,GAAR,UAAS,IAA0B;QACjC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAA,CAAC,IAAI,OAAA,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,EAAnB,CAAmB,CAAC,CAAA;IAClD,CAAC;IAED,oCAAG,GAAH;QACE,gCAAW,IAAI,CAAC,KAAK,UAAC;IACxB,CAAC;IACH,6BAAC;AAAD,CAAC,AAlCD,IAkCC;;AAED,SAAS,UAAU,CAAC,CAAuB,EAAE,CAAuB;IAClE,OAAO,CAAC,CACN,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QACf,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QACf,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;QACf,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAChB,CAAA;AACH,CAAC"}

package/lib/spatialIndex/AcTrRBushSpatialIndex.d.ts

@@ -0,0 +1,16 @@
+import { AcDbObjectId } from '@mlightcad/data-model';
+import { AcEdSpatialQueryResultItem } from '../editor/view';
+import { AcTrSpatialIndex, AcTrSpatialIndexBBox } from './AcTrSpatialIndex';
+export declare class AcTrRBushSpatialIndex implements AcTrSpatialIndex {
+    private readonly tree;
+    constructor(maxEntries?: number);
+    insert(item: AcEdSpatialQueryResultItem): void;
+    load(items: readonly AcEdSpatialQueryResultItem[]): void;
+    remove(item: AcEdSpatialQueryResultItem, equals?: (a: AcEdSpatialQueryResultItem, b: AcEdSpatialQueryResultItem) => boolean): void;
+    removeById(id: AcDbObjectId): void;
+    clear(): void;
+    search(bbox: AcTrSpatialIndexBBox): AcEdSpatialQueryResultItem[];
+    collides(bbox: AcTrSpatialIndexBBox): boolean;
+    all(): AcEdSpatialQueryResultItem[];
+}
+//# sourceMappingURL=AcTrRBushSpatialIndex.d.ts.map

package/lib/spatialIndex/AcTrRBushSpatialIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AcTrRBushSpatialIndex.d.ts","sourceRoot":"","sources":["../../src/spatialIndex/AcTrRBushSpatialIndex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AAGpD,OAAO,EAAE,0BAA0B,EAAE,MAAM,gBAAgB,CAAA;AAC3D,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAA;AAE3E,qBAAa,qBAAsB,YAAW,gBAAgB;IAC5D,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAmC;gBAE5C,UAAU,CAAC,EAAE,MAAM;IAI/B,MAAM,CAAC,IAAI,EAAE,0BAA0B;IAIvC,IAAI,CAAC,KAAK,EAAE,SAAS,0BAA0B,EAAE;IAIjD,MAAM,CACJ,IAAI,EAAE,0BAA0B,EAChC,MAAM,CAAC,EAAE,CACP,CAAC,EAAE,0BAA0B,EAC7B,CAAC,EAAE,0BAA0B,KAC1B,OAAO,GACX,IAAI;IAIP,UAAU,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI;IAclC,KAAK;IAIL,MAAM,CAAC,IAAI,EAAE,oBAAoB,GAAG,0BAA0B,EAAE;IAIhE,QAAQ,CAAC,IAAI,EAAE,oBAAoB,GAAG,OAAO;IAI7C,GAAG,IAAI,0BAA0B,EAAE;CAGpC"}

package/lib/spatialIndex/AcTrRBushSpatialIndex.js

@@ -0,0 +1,40 @@
+import RBush from 'rbush';
+var AcTrRBushSpatialIndex = /** @class */ (function () {
+    function AcTrRBushSpatialIndex(maxEntries) {
+        this.tree = new RBush(maxEntries);
+    }
+    AcTrRBushSpatialIndex.prototype.insert = function (item) {
+        this.tree.insert(item);
+    };
+    AcTrRBushSpatialIndex.prototype.load = function (items) {
+        this.tree.load(items);
+    };
+    AcTrRBushSpatialIndex.prototype.remove = function (item, equals) {
+        this.tree.remove(item, equals);
+    };
+    AcTrRBushSpatialIndex.prototype.removeById = function (id) {
+        // Set minX, minY, maxX, and maxY to 0 in order to pass build
+        this.tree.remove({
+            minX: 0,
+            minY: 0,
+            maxX: 0,
+            maxY: 0,
+            id: id
+        }, function (a, b) { return a.id === b.id; });
+    };
+    AcTrRBushSpatialIndex.prototype.clear = function () {
+        this.tree.clear();
+    };
+    AcTrRBushSpatialIndex.prototype.search = function (bbox) {
+        return this.tree.search(bbox);
+    };
+    AcTrRBushSpatialIndex.prototype.collides = function (bbox) {
+        return this.tree.collides(bbox);
+    };
+    AcTrRBushSpatialIndex.prototype.all = function () {
+        return this.tree.all();
+    };
+    return AcTrRBushSpatialIndex;
+}());
+export { AcTrRBushSpatialIndex };
+//# sourceMappingURL=AcTrRBushSpatialIndex.js.map

package/lib/spatialIndex/AcTrRBushSpatialIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AcTrRBushSpatialIndex.js","sourceRoot":"","sources":["../../src/spatialIndex/AcTrRBushSpatialIndex.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,MAAM,OAAO,CAAA;AAKzB;IAGE,+BAAY,UAAmB;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAA6B,UAAU,CAAC,CAAA;IAC/D,CAAC;IAED,sCAAM,GAAN,UAAO,IAAgC;QACrC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACxB,CAAC;IAED,oCAAI,GAAJ,UAAK,KAA4C;QAC/C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACvB,CAAC;IAED,sCAAM,GAAN,UACE,IAAgC,EAChC,MAGY;QAEZ,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IAChC,CAAC;IAED,0CAAU,GAAV,UAAW,EAAgB;QACzB,6DAA6D;QAC7D,IAAI,CAAC,IAAI,CAAC,MAAM,CACd;YACE,IAAI,EAAE,CAAC;YACP,IAAI,EAAE,CAAC;YACP,IAAI,EAAE,CAAC;YACP,IAAI,EAAE,CAAC;YACP,EAAE,EAAE,EAAE;SACP,EACD,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAb,CAAa,CACxB,CAAA;IACH,CAAC;IAED,qCAAK,GAAL;QACE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;IACnB,CAAC;IAED,sCAAM,GAAN,UAAO,IAA0B;QAC/B,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC/B,CAAC;IAED,wCAAQ,GAAR,UAAS,IAA0B;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IACjC,CAAC;IAED,mCAAG,GAAH;QACE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;IACxB,CAAC;IACH,4BAAC;AAAD,CAAC,AAtDD,IAsDC"}

package/lib/spatialIndex/AcTrSpatialIndex.d.ts

@@ -0,0 +1,77 @@
+import { AcDbObjectId } from '@mlightcad/data-model';
+import { AcEdSpatialQueryResultItem } from '../editor/view';
+export type AcTrSpatialIndexBBox = {
+    minX: number;
+    minY: number;
+    maxX: number;
+    maxY: number;
+};
+export interface AcTrSpatialIndex<T extends AcEdSpatialQueryResultItem = AcEdSpatialQueryResultItem> {
+    /**
+     * Inserts an item. To insert many items at once, use `load()`.
+     *
+     * @param item The item to insert.
+     */
+    insert(item: T): void;
+    /**
+     * Bulk-inserts the given items into the tree.
+     *
+     * Bulk insertion is usually ~2-3 times faster than inserting items one by
+     * one. After bulk loading (bulk insertion into an empty tree), subsequent
+     * query performance is also ~20-30% better.
+     *
+     * Note that when you do bulk insertion into an existing tree, it bulk-loads
+     * the given data into a separate tree and inserts the smaller tree into the
+     * larger tree. This means that bulk insertion works very well for clustered
+     * data (where items in one update are close to each other), but makes query
+     * performance worse if the data is scattered.
+     *
+     * @param items The items to load.
+     */
+    load(items: readonly T[]): void;
+    /**
+     * Removes a previously inserted item, comparing by reference.
+     *
+     * To remove all items, use `clear()`.
+     *
+     * @param item The item to remove.
+     * @param equals A custom function that allows comparing by value instead.
+     *               Useful when you have only a copy of the object you need
+     *               removed (e.g. loaded from server).
+     */
+    remove(item: T, equals?: (a: T, b: T) => boolean): void;
+    /**
+     * Removes a previously inserted item by its id.
+     *
+     * To remove all items, use `clear()`.
+     *
+     * @param id The id of a previously inserted item
+     */
+    removeById(id: AcDbObjectId): void;
+    /**
+     * Removes all items.
+     */
+    clear(): void;
+    /**
+     * Returns an array of data items (points or rectangles) that the given
+     * bounding box intersects.
+     *
+     * Note that the search method accepts a bounding box in `{minX, minY, maxX,
+     * maxY}` format regardless of the data format.
+     *
+     * @param box The bounding box in which to search.
+     */
+    search(box: AcTrSpatialIndexBBox): T[];
+    /**
+     * Returns all items contained in the tree.
+     */
+    all(): T[];
+    /**
+     * Returns `true` if there are any items intersecting the given bounding
+     * box, otherwise `false`.
+     *
+     * @param box The bounding box in which to search.
+     */
+    collides(box: AcTrSpatialIndexBBox): boolean;
+}
+//# sourceMappingURL=AcTrSpatialIndex.d.ts.map

package/lib/spatialIndex/AcTrSpatialIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AcTrSpatialIndex.d.ts","sourceRoot":"","sources":["../../src/spatialIndex/AcTrSpatialIndex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AAEpD,OAAO,EAAE,0BAA0B,EAAE,MAAM,gBAAgB,CAAA;AAE3D,MAAM,MAAM,oBAAoB,GAAG;IACjC,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,MAAM,CAAA;CACb,CAAA;AAED,MAAM,WAAW,gBAAgB,CAC/B,CAAC,SAAS,0BAA0B,GAAG,0BAA0B;IAEjE;;;;OAIG;IACH,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAA;IAErB;;;;;;;;;;;;;;OAcG;IACH,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,CAAA;IAE/B;;;;;;;;;OASG;IACH,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,IAAI,CAAA;IAEvD;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,EAAE,YAAY,GAAG,IAAI,CAAA;IAElC;;OAEG;IACH,KAAK,IAAI,IAAI,CAAA;IAEb;;;;;;;;OAQG;IACH,MAAM,CAAC,GAAG,EAAE,oBAAoB,GAAG,CAAC,EAAE,CAAA;IAEtC;;OAEG;IACH,GAAG,IAAI,CAAC,EAAE,CAAA;IAEV;;;;;OAKG;IACH,QAAQ,CAAC,GAAG,EAAE,oBAAoB,GAAG,OAAO,CAAA;CAC7C"}

package/lib/spatialIndex/AcTrSpatialIndex.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=AcTrSpatialIndex.js.map

package/lib/spatialIndex/AcTrSpatialIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AcTrSpatialIndex.js","sourceRoot":"","sources":["../../src/spatialIndex/AcTrSpatialIndex.ts"],"names":[],"mappings":""}

package/lib/spatialIndex/index.d.ts

@@ -0,0 +1,3 @@
+export * from './AcTrHierarchicalSpatialIndex';
+export * from './AcTrSpatialIndex';
+//# sourceMappingURL=index.d.ts.map

package/lib/spatialIndex/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/spatialIndex/index.ts"],"names":[],"mappings":"AAAA,cAAc,gCAAgC,CAAA;AAC9C,cAAc,oBAAoB,CAAA"}

package/lib/spatialIndex/index.js

@@ -0,0 +1,3 @@
+export * from './AcTrHierarchicalSpatialIndex';
+export * from './AcTrSpatialIndex';
+//# sourceMappingURL=index.js.map

package/lib/spatialIndex/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/spatialIndex/index.ts"],"names":[],"mappings":"AAAA,cAAc,gCAAgC,CAAA;AAC9C,cAAc,oBAAoB,CAAA"}

package/lib/view/AcTrLayer.d.ts

@@ -129,7 +129,7 @@ export declare class AcTrLayer {
      * @param objectId Input the object id of the entity to remove
      * @returns Return true if remove the specified entity successfully. Otherwise, return false.
      */
-    removeEntity(_objectId: AcDbObjectId): boolean;
+    removeEntity(objectId: AcDbObjectId): boolean;
     /**
      * Update the specified entity in this layer.
      * @param entity Input the entity to update

package/lib/view/AcTrLayer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"AcTrLayer.d.ts","sourceRoot":"","sources":["../../src/view/AcTrLayer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AACpD,OAAO,EACL,gBAAgB,EAChB,qBAAqB,EACrB,UAAU,EACX,MAAM,2BAA2B,CAAA;AAClC,OAAO,KAAK,KAAK,MAAM,OAAO,CAAA;AAE9B,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAA;AAEzC;;;;GAIG;AACH,MAAM,MAAM,cAAc,GAAG,qBAAqB,GAAG;IACnD,4BAA4B;IAC5B,IAAI,EAAE,MAAM,CAAA;CACb,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,qBAAa,SAAS;IACpB;;OAEG;IACH,OAAO,CAAC,KAAK,CAAQ;IACrB;;OAEG;IACH,OAAO,CAAC,MAAM,CAAkB;IAEhC;;OAEG;IACH,OAAO,CAAC,IAAI,CAAY;IAExB;;;OAGG;gBACS,KAAK,EAAE,aAAa;IAOhC;;OAEG;IACH,IAAI,IAAI,IAGQ,MAAM,CADrB;IACD,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,EAErB;IAED;;;;OAIG;IACH,IAAI,GAAG,eAEN;IAED,IAAI,OAAO,IAGQ,OAAO,CADzB;IACD,IAAI,OAAO,CAAC,KAAK,EAAE,OAAO,EAEzB;IAED,IAAI,cAAc,qBAEjB;IAED;;OAEG;IACH,IAAI,KAAK,IAKF,cAAc,CACpB;IAED;;OAEG;IACH,IAAI,WAAW,WAEd;IAED;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,aAAa;IAK3B;;;;OAIG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ;IAItD;;;OAGG;IACH,cAAc,CAAC,WAAW,EAAE,MAAM;IAIlC;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,EAAE,YAAY;IAIhC;;;;;OAKG;IACH,SAAS,CAAC,MAAM,EAAE,UAAU,EAAE,UAAU,GAAE,OAAc;IAOxD;;;;OAIG;IACH,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS;IAI5D;;;;OAIG;IACH,YAAY,CAAC,SAAS,EAAE,YAAY,GAAG,OAAO;IAK9C;;;;OAIG;IACH,YAAY,CAAC,MAAM,EAAE,UAAU,GAAG,OAAO;IAMzC;;OAEG;IACH,KAAK,CAAC,GAAG,EAAE,YAAY,EAAE;IAMzB;;OAEG;IACH,OAAO,CAAC,GAAG,EAAE,YAAY,EAAE;IAM3B;;OAEG;IACH,MAAM,CAAC,GAAG,EAAE,YAAY,EAAE;IAM1B;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,YAAY,EAAE;CAK7B"}
+{"version":3,"file":"AcTrLayer.d.ts","sourceRoot":"","sources":["../../src/view/AcTrLayer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAA;AACpD,OAAO,EACL,gBAAgB,EAChB,qBAAqB,EACrB,UAAU,EACX,MAAM,2BAA2B,CAAA;AAClC,OAAO,KAAK,KAAK,MAAM,OAAO,CAAA;AAE9B,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAA;AAEzC;;;;GAIG;AACH,MAAM,MAAM,cAAc,GAAG,qBAAqB,GAAG;IACnD,4BAA4B;IAC5B,IAAI,EAAE,MAAM,CAAA;CACb,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,qBAAa,SAAS;IACpB;;OAEG;IACH,OAAO,CAAC,KAAK,CAAQ;IACrB;;OAEG;IACH,OAAO,CAAC,MAAM,CAAkB;IAEhC;;OAEG;IACH,OAAO,CAAC,IAAI,CAAY;IAExB;;;OAGG;gBACS,KAAK,EAAE,aAAa;IAOhC;;OAEG;IACH,IAAI,IAAI,IAGQ,MAAM,CADrB;IACD,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,EAErB;IAED;;;;OAIG;IACH,IAAI,GAAG,eAEN;IAED,IAAI,OAAO,IAGQ,OAAO,CADzB;IACD,IAAI,OAAO,CAAC,KAAK,EAAE,OAAO,EAEzB;IAED,IAAI,cAAc,qBAEjB;IAED;;OAEG;IACH,IAAI,KAAK,IAKF,cAAc,CACpB;IAED;;OAEG;IACH,IAAI,WAAW,WAEd;IAED;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,aAAa;IAK3B;;;;OAIG;IACH,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ;IAItD;;;OAGG;IACH,cAAc,CAAC,WAAW,EAAE,MAAM;IAIlC;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,EAAE,YAAY;IAIhC;;;;;OAKG;IACH,SAAS,CAAC,MAAM,EAAE,UAAU,EAAE,UAAU,GAAE,OAAc;IAOxD;;;;OAIG;IACH,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS;IAI5D;;;;OAIG;IACH,YAAY,CAAC,QAAQ,EAAE,YAAY,GAAG,OAAO;IAI7C;;;;OAIG;IACH,YAAY,CAAC,MAAM,EAAE,UAAU,GAAG,OAAO;IAMzC;;OAEG;IACH,KAAK,CAAC,GAAG,EAAE,YAAY,EAAE;IAMzB;;OAEG;IACH,OAAO,CAAC,GAAG,EAAE,YAAY,EAAE;IAM3B;;OAEG;IACH,MAAM,CAAC,GAAG,EAAE,YAAY,EAAE;IAM1B;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,YAAY,EAAE;CAK7B"}

package/lib/view/AcTrLayer.js

@@ -181,9 +181,8 @@ var AcTrLayer = /** @class */ (function () {
      * @param objectId Input the object id of the entity to remove
      * @returns Return true if remove the specified entity successfully. Otherwise, return false.
      */
-    AcTrLayer.prototype.removeEntity = function (_objectId) {
-        // TODO: Finish it
-        throw new Error('Not implemented yet!');
+    AcTrLayer.prototype.removeEntity = function (objectId) {
+        return this._group.removeEntity(objectId);
     };
     /**
      * Update the specified entity in this layer.