@rxflow/manhattan 0.0.2-alpha.8 → 0.0.2

package/esm/obstacle/QuadTree.js

@@ -0,0 +1,488 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
+function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i]; return arr2; }
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }
+function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
+function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
+function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+/**
+ * QuadTree implementation for efficient spatial queries
+ * Feature: manhattan-optimization
+ *
+ * A QuadTree is a tree data structure that recursively subdivides 2D space
+ * into four quadrants. This enables O(log n) spatial queries instead of O(n).
+ */
+import { Rectangle } from "../geometry";
+
+/**
+ * Item stored in the QuadTree
+ */
+
+/**
+ * QuadTree configuration
+ */
+
+/**
+ * Default QuadTree configuration
+ */
+var DEFAULT_CONFIG = {
+  maxItems: 8,
+  maxDepth: 8,
+  minSize: 10
+};
+
+/**
+ * QuadTree node for spatial partitioning
+ */
+export var QuadTree = /*#__PURE__*/function () {
+  function QuadTree(bounds) {
+    var config = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    var depth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+    _classCallCheck(this, QuadTree);
+    _defineProperty(this, "bounds", void 0);
+    _defineProperty(this, "items", void 0);
+    _defineProperty(this, "children", void 0);
+    _defineProperty(this, "depth", void 0);
+    _defineProperty(this, "config", void 0);
+    this.bounds = bounds;
+    this.items = [];
+    this.children = null;
+    this.depth = depth;
+    this.config = _objectSpread(_objectSpread({}, DEFAULT_CONFIG), config);
+  }
+
+  /**
+   * Insert an item into the QuadTree
+   */
+  _createClass(QuadTree, [{
+    key: "insert",
+    value: function insert(item) {
+      // Check if item intersects this node's bounds
+      if (!this.intersects(item.bounds)) {
+        return false;
+      }
+
+      // If we have children, try to insert into them
+      if (this.children !== null) {
+        return this.insertIntoChildren(item);
+      }
+
+      // Add to this node
+      this.items.push(item);
+
+      // Check if we need to split
+      if (this.shouldSplit()) {
+        this.split();
+      }
+      return true;
+    }
+
+    /**
+     * Insert an item with just bounds and data
+     */
+  }, {
+    key: "insertRect",
+    value: function insertRect(bounds, data) {
+      return this.insert({
+        bounds: bounds,
+        data: data
+      });
+    }
+
+    /**
+     * Query all items that intersect with the given bounds
+     */
+  }, {
+    key: "query",
+    value: function query(bounds) {
+      var results = [];
+      this.queryInternal(bounds, results);
+      return results;
+    }
+
+    /**
+     * Query all items that contain the given point
+     */
+  }, {
+    key: "queryPoint",
+    value: function queryPoint(point) {
+      var results = [];
+      this.queryPointInternal(point, results);
+      return results;
+    }
+
+    /**
+     * Get all items in the tree
+     */
+  }, {
+    key: "getAllItems",
+    value: function getAllItems() {
+      var results = _toConsumableArray(this.items);
+      if (this.children !== null) {
+        var _iterator = _createForOfIteratorHelper(this.children),
+          _step;
+        try {
+          for (_iterator.s(); !(_step = _iterator.n()).done;) {
+            var child = _step.value;
+            results.push.apply(results, _toConsumableArray(child.getAllItems()));
+          }
+        } catch (err) {
+          _iterator.e(err);
+        } finally {
+          _iterator.f();
+        }
+      }
+      return results;
+    }
+
+    /**
+     * Clear all items from the tree
+     */
+  }, {
+    key: "clear",
+    value: function clear() {
+      this.items = [];
+      this.children = null;
+    }
+
+    /**
+     * Get the total number of items in the tree
+     */
+  }, {
+    key: "size",
+    get: function get() {
+      var count = this.items.length;
+      if (this.children !== null) {
+        var _iterator2 = _createForOfIteratorHelper(this.children),
+          _step2;
+        try {
+          for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+            var child = _step2.value;
+            count += child.size;
+          }
+        } catch (err) {
+          _iterator2.e(err);
+        } finally {
+          _iterator2.f();
+        }
+      }
+      return count;
+    }
+
+    /**
+     * Get the depth of the tree
+     */
+  }, {
+    key: "getMaxDepth",
+    value: function getMaxDepth() {
+      if (this.children === null) {
+        return this.depth;
+      }
+      var maxChildDepth = this.depth;
+      var _iterator3 = _createForOfIteratorHelper(this.children),
+        _step3;
+      try {
+        for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+          var child = _step3.value;
+          maxChildDepth = Math.max(maxChildDepth, child.getMaxDepth());
+        }
+      } catch (err) {
+        _iterator3.e(err);
+      } finally {
+        _iterator3.f();
+      }
+      return maxChildDepth;
+    }
+
+    /**
+     * Internal query implementation
+     */
+  }, {
+    key: "queryInternal",
+    value: function queryInternal(bounds, results) {
+      // Check if query bounds intersects this node
+      if (!this.intersects(bounds)) {
+        return;
+      }
+
+      // Check items in this node
+      var _iterator4 = _createForOfIteratorHelper(this.items),
+        _step4;
+      try {
+        for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
+          var item = _step4.value;
+          if (this.rectanglesIntersect(item.bounds, bounds)) {
+            results.push(item);
+          }
+        }
+
+        // Query children
+      } catch (err) {
+        _iterator4.e(err);
+      } finally {
+        _iterator4.f();
+      }
+      if (this.children !== null) {
+        var _iterator5 = _createForOfIteratorHelper(this.children),
+          _step5;
+        try {
+          for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
+            var child = _step5.value;
+            child.queryInternal(bounds, results);
+          }
+        } catch (err) {
+          _iterator5.e(err);
+        } finally {
+          _iterator5.f();
+        }
+      }
+    }
+
+    /**
+     * Internal point query implementation
+     */
+  }, {
+    key: "queryPointInternal",
+    value: function queryPointInternal(point, results) {
+      // Check if point is within this node's bounds
+      if (!this.containsPoint(point)) {
+        return;
+      }
+
+      // Check items in this node
+      var _iterator6 = _createForOfIteratorHelper(this.items),
+        _step6;
+      try {
+        for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
+          var item = _step6.value;
+          if (item.bounds.containsPoint(point)) {
+            results.push(item);
+          }
+        }
+
+        // Query children
+      } catch (err) {
+        _iterator6.e(err);
+      } finally {
+        _iterator6.f();
+      }
+      if (this.children !== null) {
+        var _iterator7 = _createForOfIteratorHelper(this.children),
+          _step7;
+        try {
+          for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {
+            var child = _step7.value;
+            child.queryPointInternal(point, results);
+          }
+        } catch (err) {
+          _iterator7.e(err);
+        } finally {
+          _iterator7.f();
+        }
+      }
+    }
+
+    /**
+     * Check if this node should split
+     */
+  }, {
+    key: "shouldSplit",
+    value: function shouldSplit() {
+      return this.items.length > this.config.maxItems && this.depth < this.config.maxDepth && this.bounds.width > this.config.minSize * 2 && this.bounds.height > this.config.minSize * 2;
+    }
+
+    /**
+     * Split this node into four children
+     */
+  }, {
+    key: "split",
+    value: function split() {
+      var halfWidth = this.bounds.width / 2;
+      var halfHeight = this.bounds.height / 2;
+      var x = this.bounds.x;
+      var y = this.bounds.y;
+      var nextDepth = this.depth + 1;
+      this.children = [
+      // Top-left
+      new QuadTree(new Rectangle(x, y, halfWidth, halfHeight), this.config, nextDepth),
+      // Top-right
+      new QuadTree(new Rectangle(x + halfWidth, y, halfWidth, halfHeight), this.config, nextDepth),
+      // Bottom-left
+      new QuadTree(new Rectangle(x, y + halfHeight, halfWidth, halfHeight), this.config, nextDepth),
+      // Bottom-right
+      new QuadTree(new Rectangle(x + halfWidth, y + halfHeight, halfWidth, halfHeight), this.config, nextDepth)];
+
+      // Redistribute items to children
+      var itemsToRedistribute = this.items;
+      this.items = [];
+      var _iterator8 = _createForOfIteratorHelper(itemsToRedistribute),
+        _step8;
+      try {
+        for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {
+          var item = _step8.value;
+          this.insertIntoChildren(item);
+        }
+      } catch (err) {
+        _iterator8.e(err);
+      } finally {
+        _iterator8.f();
+      }
+    }
+
+    /**
+     * Insert item into appropriate children
+     */
+  }, {
+    key: "insertIntoChildren",
+    value: function insertIntoChildren(item) {
+      if (this.children === null) {
+        return false;
+      }
+      var inserted = false;
+      var _iterator9 = _createForOfIteratorHelper(this.children),
+        _step9;
+      try {
+        for (_iterator9.s(); !(_step9 = _iterator9.n()).done;) {
+          var child = _step9.value;
+          if (child.insert(item)) {
+            inserted = true;
+          }
+        }
+
+        // If item doesn't fit in any child (spans multiple), keep in this node
+      } catch (err) {
+        _iterator9.e(err);
+      } finally {
+        _iterator9.f();
+      }
+      if (!inserted) {
+        this.items.push(item);
+        inserted = true;
+      }
+      return inserted;
+    }
+
+    /**
+     * Check if a rectangle intersects this node's bounds
+     */
+  }, {
+    key: "intersects",
+    value: function intersects(rect) {
+      return this.rectanglesIntersect(this.bounds, rect);
+    }
+
+    /**
+     * Check if two rectangles intersect
+     */
+  }, {
+    key: "rectanglesIntersect",
+    value: function rectanglesIntersect(a, b) {
+      return !(a.x + a.width <= b.x || b.x + b.width <= a.x || a.y + a.height <= b.y || b.y + b.height <= a.y);
+    }
+
+    /**
+     * Check if this node's bounds contain a point
+     */
+  }, {
+    key: "containsPoint",
+    value: function containsPoint(point) {
+      return point.x >= this.bounds.x && point.x <= this.bounds.x + this.bounds.width && point.y >= this.bounds.y && point.y <= this.bounds.y + this.bounds.height;
+    }
+
+    /**
+     * Get statistics about the tree
+     */
+  }, {
+    key: "getStats",
+    value: function getStats() {
+      var stats = {
+        totalItems: 0,
+        maxDepth: 0,
+        nodeCount: 0,
+        itemsPerNode: 0
+      };
+      this.collectStats(stats);
+      stats.itemsPerNode = stats.nodeCount > 0 ? stats.totalItems / stats.nodeCount : 0;
+      return stats;
+    }
+  }, {
+    key: "collectStats",
+    value: function collectStats(stats) {
+      stats.totalItems += this.items.length;
+      stats.maxDepth = Math.max(stats.maxDepth, this.depth);
+      stats.nodeCount++;
+      if (this.children !== null) {
+        var _iterator10 = _createForOfIteratorHelper(this.children),
+          _step10;
+        try {
+          for (_iterator10.s(); !(_step10 = _iterator10.n()).done;) {
+            var child = _step10.value;
+            child.collectStats(stats);
+          }
+        } catch (err) {
+          _iterator10.e(err);
+        } finally {
+          _iterator10.f();
+        }
+      }
+    }
+  }]);
+  return QuadTree;
+}();
+
+/**
+ * Create a QuadTree with bounds that cover all given rectangles
+ */
+export function createQuadTreeFromRects(items, config) {
+  if (items.length === 0) {
+    return new QuadTree(new Rectangle(0, 0, 1000, 1000), config);
+  }
+
+  // Calculate bounding box of all items
+  var minX = Infinity;
+  var minY = Infinity;
+  var maxX = -Infinity;
+  var maxY = -Infinity;
+  var _iterator11 = _createForOfIteratorHelper(items),
+    _step11;
+  try {
+    for (_iterator11.s(); !(_step11 = _iterator11.n()).done;) {
+      var item = _step11.value;
+      minX = Math.min(minX, item.bounds.x);
+      minY = Math.min(minY, item.bounds.y);
+      maxX = Math.max(maxX, item.bounds.x + item.bounds.width);
+      maxY = Math.max(maxY, item.bounds.y + item.bounds.height);
+    }
+
+    // Add some padding
+  } catch (err) {
+    _iterator11.e(err);
+  } finally {
+    _iterator11.f();
+  }
+  var padding = 100;
+  var bounds = new Rectangle(minX - padding, minY - padding, maxX - minX + padding * 2, maxY - minY + padding * 2);
+  var tree = new QuadTree(bounds, config);
+  var _iterator12 = _createForOfIteratorHelper(items),
+    _step12;
+  try {
+    for (_iterator12.s(); !(_step12 = _iterator12.n()).done;) {
+      var _item = _step12.value;
+      tree.insert(_item);
+    }
+  } catch (err) {
+    _iterator12.e(err);
+  } finally {
+    _iterator12.f();
+  }
+  return tree;
+}