@math.gl/geometry 5.0.0-alpha.17 → 5.0.0-alpha.19

package/dist/spatial-index/index.cjs

@@ -0,0 +1,494 @@
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// dist/spatial-index/index.js
+var index_exports = {};
+__export(index_exports, {
+  BoxIndex: () => BoxIndex,
+  PointIndex: () => PointIndex,
+  TriangleBVH: () => TriangleBVH
+});
+module.exports = __toCommonJS(index_exports);
+
+// dist/culling/queries.js
+function validateQueryPoint(point, dimension) {
+  if (point.length !== dimension)
+    throw new RangeError("Query dimension must match the index");
+  for (let i = 0; i < dimension; i++) {
+    if (!Number.isFinite(point[i]))
+      throw new RangeError("Coordinates must be finite");
+  }
+}
+function validateQueryDistance(distance) {
+  if (Number.isNaN(distance) || distance < 0)
+    throw new RangeError("Distance must be nonnegative");
+}
+function normalizeQueryDirection(direction, dimension) {
+  validateQueryPoint(direction, dimension);
+  const scale = Math.max(...Array.from(direction, Math.abs));
+  if (scale === 0)
+    throw new RangeError("Ray direction must be nonzero");
+  const scaled = Array.from(direction, (x) => x / scale);
+  const length = Math.hypot(...scaled);
+  return scaled.map((x) => x / length);
+}
+function intersectRayBounds(origin, direction, minimum, maximum, maxT = Infinity) {
+  const dimension = origin.length;
+  if (dimension !== 2 && dimension !== 3)
+    throw new RangeError("Bounds must be 2D or 3D");
+  validateQueryPoint(origin, dimension);
+  validateQueryPoint(direction, dimension);
+  validateQueryPoint(minimum, dimension);
+  validateQueryPoint(maximum, dimension);
+  validateQueryDistance(maxT);
+  let near = 0, far = maxT, nonzero = false;
+  for (let i = 0; i < dimension; i++) {
+    if (minimum[i] > maximum[i])
+      throw new RangeError("Bounds must be ordered");
+    nonzero || (nonzero = direction[i] !== 0);
+  }
+  if (!nonzero)
+    throw new RangeError("Ray direction must be nonzero");
+  for (let i = 0; i < dimension; i++) {
+    if (direction[i] === 0) {
+      if (origin[i] < minimum[i] || origin[i] > maximum[i])
+        return null;
+      continue;
+    }
+    let a = (minimum[i] - origin[i]) / direction[i];
+    let b = (maximum[i] - origin[i]) / direction[i];
+    if (a > b)
+      [a, b] = [b, a];
+    near = Math.max(near, a);
+    far = Math.min(far, b);
+    if (near > far)
+      return null;
+  }
+  return Number.isFinite(near) ? near : null;
+}
+function intersectRayTriangle(origin, direction, a, b, c, options = {}) {
+  for (const point of [origin, direction, a, b, c])
+    validateQueryPoint(point, 3);
+  if (direction[0] === 0 && direction[1] === 0 && direction[2] === 0) {
+    throw new RangeError("Ray direction must be nonzero");
+  }
+  const maxT = options.maxT ?? Infinity;
+  validateQueryDistance(maxT);
+  const e1 = [b[0] - a[0], b[1] - a[1], b[2] - a[2]];
+  const e2 = [c[0] - a[0], c[1] - a[1], c[2] - a[2]];
+  const p = cross(direction, e2);
+  const determinant = dot(e1, p);
+  if (determinant === 0 || options.backfaceCulling && determinant < 0)
+    return null;
+  const offset = [origin[0] - a[0], origin[1] - a[1], origin[2] - a[2]];
+  const u = dot(offset, p) / determinant;
+  if (u < 0 || u > 1)
+    return null;
+  const q = cross(offset, e1);
+  const v = dot(direction, q) / determinant;
+  if (v < 0 || u + v > 1)
+    return null;
+  const t = dot(e2, q) / determinant;
+  if (!Number.isFinite(t) || t < 0 || t > maxT)
+    return null;
+  return { t: Math.max(0, t), barycentric: [1 - u - v, u, v] };
+}
+function getClosestPointOnTriangle(point, a, b, c) {
+  for (const value of [point, a, b, c])
+    validateQueryPoint(value, 3);
+  const ab = [b[0] - a[0], b[1] - a[1], b[2] - a[2]];
+  const ac = [c[0] - a[0], c[1] - a[1], c[2] - a[2]];
+  const ap = [point[0] - a[0], point[1] - a[1], point[2] - a[2]];
+  const aa = dot(ab, ab), bb = dot(ac, ac), cc = dot(ab, ac);
+  const denominator = aa * bb - cc * cc;
+  if (denominator > 0 && Number.isFinite(denominator)) {
+    const u = (bb * dot(ap, ab) - cc * dot(ap, ac)) / denominator;
+    const v = (aa * dot(ap, ac) - cc * dot(ap, ab)) / denominator;
+    if (u >= 0 && v >= 0 && u + v <= 1) {
+      return [
+        a[0] + u * ab[0] + v * ac[0],
+        a[1] + u * ab[1] + v * ac[1],
+        a[2] + u * ab[2] + v * ac[2]
+      ];
+    }
+  }
+  let best = [a[0], a[1], a[2]];
+  let distance = Infinity;
+  for (const [start, end] of [
+    [a, b],
+    [b, c],
+    [c, a]
+  ]) {
+    const edge = [end[0] - start[0], end[1] - start[1], end[2] - start[2]];
+    const offset = [point[0] - start[0], point[1] - start[1], point[2] - start[2]];
+    const squared = dot(edge, edge);
+    const t = squared > 0 ? Math.max(0, Math.min(1, dot(offset, edge) / squared)) : 0;
+    const candidate = [
+      start[0] + t * edge[0],
+      start[1] + t * edge[1],
+      start[2] + t * edge[2]
+    ];
+    const d = Math.hypot(point[0] - candidate[0], point[1] - candidate[1], point[2] - candidate[2]);
+    if (d < distance) {
+      distance = d;
+      best = candidate;
+    }
+  }
+  return best;
+}
+function dot(a, b) {
+  return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
+}
+function cross(a, b) {
+  return [a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]];
+}
+
+// dist/spatial-index/box-index.js
+var BoxIndex = class {
+  constructor(options) {
+    const { dimension, bounds, leafSize = 8 } = options;
+    if (dimension !== 2 && dimension !== 3)
+      throw new RangeError("Index dimension must be 2 or 3");
+    if (!Number.isSafeInteger(leafSize) || leafSize < 1)
+      throw new RangeError("leafSize must be positive");
+    if (bounds.length % (dimension * 2))
+      throw new RangeError("Incomplete bounds record");
+    this.dimension = dimension;
+    this.bounds = Float64Array.from(bounds);
+    this.size = bounds.length / (dimension * 2);
+    if (this.size > 2147483647)
+      throw new RangeError("Index exceeds 32-bit capacity");
+    const stride = dimension * 2;
+    for (let i = 0; i < this.size; i++)
+      this.validateBounds(this.bounds.subarray(i * stride, i * stride + dimension), this.bounds.subarray(i * stride + dimension, (i + 1) * stride));
+    const records = [];
+    const ids = Array.from({ length: this.size }, (_, i) => i);
+    const build = (start, end) => {
+      const node = records.length;
+      const bound = [
+        ...new Array(dimension).fill(Infinity),
+        ...new Array(dimension).fill(-Infinity)
+      ];
+      for (let i = start; i < end; i++)
+        for (let axis = 0; axis < dimension; axis++) {
+          bound[axis] = Math.min(bound[axis], this.bounds[ids[i] * stride + axis]);
+          bound[axis + dimension] = Math.max(bound[axis + dimension], this.bounds[ids[i] * stride + axis + dimension]);
+        }
+      const record = { bounds: bound, left: -1, right: -1, start, count: end - start };
+      records.push(record);
+      if (end - start > leafSize) {
+        let axis = 0;
+        for (let i = 1; i < dimension; i++) {
+          if (bound[i + dimension] - bound[i] > bound[axis + dimension] - bound[axis])
+            axis = i;
+        }
+        const center = (i) => this.bounds[i * stride + axis] / 2 + this.bounds[i * stride + axis + dimension] / 2;
+        const sorted = ids.slice(start, end).sort((a, b) => center(a) - center(b) || a - b);
+        for (let i = 0; i < sorted.length; i++)
+          ids[start + i] = sorted[i];
+        const middle = Math.floor((start + end) / 2);
+        record.left = build(start, middle);
+        record.right = build(middle, end);
+        record.count = 0;
+      }
+      return node;
+    };
+    if (this.size)
+      build(0, this.size);
+    this.nodeBounds = new Float64Array(records.length * stride);
+    this.children = new Int32Array(records.length * 2);
+    this.starts = new Uint32Array(records.length);
+    this.counts = new Uint32Array(records.length);
+    records.forEach((record, i) => {
+      this.nodeBounds.set(record.bounds, i * stride);
+      this.children.set([record.left, record.right], i * 2);
+      this.starts[i] = record.start;
+      this.counts[i] = record.count;
+    });
+    this.order = Uint32Array.from(ids);
+  }
+  /** Closed-box overlap, including boundary contact. Sorted by original row index. */
+  search(minimum, maximum) {
+    this.validateBounds(minimum, maximum);
+    const result = [];
+    const overlaps = (bounds, index) => {
+      const start = index * this.dimension * 2;
+      for (let i = 0; i < this.dimension; i++) {
+        if (bounds[start + i] > maximum[i] || bounds[start + i + this.dimension] < minimum[i])
+          return false;
+      }
+      return true;
+    };
+    const stack = this.size ? [0] : [];
+    while (stack.length) {
+      const node = stack.pop();
+      if (!overlaps(this.nodeBounds, node))
+        continue;
+      if (this.counts[node]) {
+        for (let i = this.starts[node]; i < this.starts[node] + this.counts[node]; i++) {
+          if (overlaps(this.bounds, this.order[i]))
+            result.push(this.order[i]);
+        }
+      } else
+        stack.push(this.children[node * 2], this.children[node * 2 + 1]);
+    }
+    return result.sort((a, b) => a - b);
+  }
+  /** Branch-and-bound nearest box, optionally refined against actual geometry. */
+  nearest(point, options = {}) {
+    validateQueryPoint(point, this.dimension);
+    let best = options.maxDistance ?? Infinity;
+    validateQueryDistance(best);
+    let result = null;
+    const distance = (bounds, index) => {
+      const start = index * this.dimension * 2;
+      let x = 0, y = 0, z = 0;
+      x = Math.max(bounds[start] - point[0], 0, point[0] - bounds[start + this.dimension]);
+      y = Math.max(bounds[start + 1] - point[1], 0, point[1] - bounds[start + this.dimension + 1]);
+      if (this.dimension === 3)
+        z = Math.max(bounds[start + 2] - point[2], 0, point[2] - bounds[start + 5]);
+      return Math.hypot(x, y, z);
+    };
+    const stack = this.size ? [0] : [];
+    while (stack.length) {
+      const node = stack.pop();
+      if (distance(this.nodeBounds, node) > best)
+        continue;
+      if (this.counts[node]) {
+        for (let i = this.starts[node]; i < this.starts[node] + this.counts[node]; i++) {
+          const index = this.order[i];
+          const lower = distance(this.bounds, index);
+          if (lower > best || options.filter && !options.filter(index))
+            continue;
+          const exact = options.distanceToItem ? options.distanceToItem(index) : lower;
+          if (exact === null)
+            continue;
+          validateQueryDistance(exact);
+          if (exact < lower)
+            throw new RangeError("Refinement distance cannot be below box distance");
+          if (Number.isFinite(exact) && exact <= best && (!result || exact < best || index < result.index)) {
+            best = exact;
+            result = { index, distance: exact };
+          }
+        }
+      } else {
+        const a = this.children[node * 2], b = this.children[node * 2 + 1];
+        if (distance(this.nodeBounds, a) < distance(this.nodeBounds, b))
+          stack.push(b, a);
+        else
+          stack.push(a, b);
+      }
+    }
+    return result;
+  }
+  /**
+   * Nearest accepted box/geometry hit without materializing and sorting all ray candidates.
+   * Rejected refinements do not clip the ray. Equal distances select the lowest original row.
+   */
+  intersectRay(origin, direction, options = {}) {
+    validateQueryPoint(origin, this.dimension);
+    const unit = normalizeQueryDirection(direction, this.dimension);
+    let best = options.maxDistance ?? Infinity;
+    validateQueryDistance(best);
+    let result = null;
+    const getEntry = (bounds, index) => {
+      const offset = index * this.dimension * 2;
+      return intersectRayBounds(origin, unit, bounds.subarray(offset, offset + this.dimension), bounds.subarray(offset + this.dimension, offset + this.dimension * 2), best + getRayDistanceTolerance(best, best));
+    };
+    const rootDistance = this.size ? getEntry(this.nodeBounds, 0) : null;
+    const stack = rootDistance === null ? [] : [{ index: 0, distance: rootDistance }];
+    while (stack.length) {
+      const candidate = stack.pop();
+      if (!candidate || candidate.distance > best + getRayDistanceTolerance(candidate.distance, best))
+        continue;
+      const node = candidate.index;
+      if (this.counts[node]) {
+        for (let offset = this.starts[node]; offset < this.starts[node] + this.counts[node]; offset++) {
+          const index = this.order[offset];
+          const lower = getEntry(this.bounds, index);
+          if (lower === null || options.filter && !options.filter(index))
+            continue;
+          const exact = options.intersectItem ? options.intersectItem(index, best) : lower;
+          if (exact === null)
+            continue;
+          validateQueryDistance(exact);
+          if (exact < lower && (!Number.isFinite(lower) || lower - exact > getRayDistanceTolerance(lower, exact)))
+            throw new RangeError("Refinement distance cannot be below box entry");
+          if (Number.isFinite(exact) && exact <= best && (!result || exact < best || index < result.index)) {
+            best = exact;
+            result = { index, distance: exact };
+          }
+        }
+      } else {
+        const first = this.children[node * 2], second = this.children[node * 2 + 1];
+        const firstDistance = getEntry(this.nodeBounds, first), secondDistance = getEntry(this.nodeBounds, second);
+        if (firstDistance !== null && secondDistance !== null) {
+          if (firstDistance <= secondDistance)
+            stack.push({ index: second, distance: secondDistance }, { index: first, distance: firstDistance });
+          else
+            stack.push({ index: first, distance: firstDistance }, { index: second, distance: secondDistance });
+        } else if (firstDistance !== null)
+          stack.push({ index: first, distance: firstDistance });
+        else if (secondDistance !== null)
+          stack.push({ index: second, distance: secondDistance });
+      }
+    }
+    return result;
+  }
+  /** Broad-phase ray candidates, sorted by entry distance then original row index. */
+  searchRay(origin, direction, maxDistance = Infinity) {
+    validateQueryPoint(origin, this.dimension);
+    const unit = normalizeQueryDirection(direction, this.dimension);
+    validateQueryDistance(maxDistance);
+    const entry = (bounds, index) => {
+      const start = index * this.dimension * 2;
+      return intersectRayBounds(origin, unit, bounds.subarray(start, start + this.dimension), bounds.subarray(start + this.dimension, start + this.dimension * 2), maxDistance);
+    };
+    const result = [];
+    const stack = this.size ? [0] : [];
+    while (stack.length) {
+      const node = stack.pop();
+      if (entry(this.nodeBounds, node) === null)
+        continue;
+      if (this.counts[node]) {
+        for (let i = this.starts[node]; i < this.starts[node] + this.counts[node]; i++) {
+          const index = this.order[i], distance = entry(this.bounds, index);
+          if (distance !== null)
+            result.push({ index, distance });
+        }
+      } else
+        stack.push(this.children[node * 2], this.children[node * 2 + 1]);
+    }
+    return result.sort((a, b) => a.distance - b.distance || a.index - b.index);
+  }
+  validateBounds(minimum, maximum) {
+    validateQueryPoint(minimum, this.dimension);
+    validateQueryPoint(maximum, this.dimension);
+    for (let i = 0; i < this.dimension; i++) {
+      if (minimum[i] > maximum[i])
+        throw new RangeError("Bounds must be ordered");
+    }
+  }
+};
+function getRayDistanceTolerance(first, second) {
+  return 8 * Math.max(Number.MIN_VALUE, Number.EPSILON * Math.max(Math.abs(first), Math.abs(second)));
+}
+var PointIndex = class extends BoxIndex {
+  constructor(options) {
+    const { positions, dimension, leafSize } = options;
+    if (dimension !== 2 && dimension !== 3 || positions.length % dimension) {
+      throw new RangeError("Invalid point layout");
+    }
+    const bounds = new Float64Array(positions.length * 2);
+    for (let i = 0; i < positions.length / dimension; i++)
+      for (let axis = 0; axis < dimension; axis++) {
+        bounds[i * dimension * 2 + axis] = bounds[i * dimension * 2 + axis + dimension] = positions[i * dimension + axis];
+      }
+    super({ bounds, dimension, leafSize });
+  }
+};
+
+// dist/spatial-index/triangle-bvh.js
+var TriangleBVH = class {
+  constructor(options) {
+    if (options.positions.length % 3)
+      throw new RangeError("Positions must be packed xyz");
+    this.positions = Float64Array.from(options.positions);
+    for (const value of this.positions) {
+      if (!Number.isFinite(value))
+        throw new RangeError("Positions must be finite");
+    }
+    const source = options.indices ?? Array.from({ length: this.positions.length / 3 }, (_, i) => i);
+    if (source.length % 3)
+      throw new RangeError("Indices must form triangles");
+    this.indices = new Uint32Array(source.length);
+    for (let i = 0; i < source.length; i++) {
+      if (!Number.isSafeInteger(source[i]) || source[i] < 0 || source[i] >= this.positions.length / 3 || source[i] > 4294967295) {
+        throw new RangeError("Triangle index is out of bounds");
+      }
+      this.indices[i] = source[i];
+    }
+    this.size = this.indices.length / 3;
+    const bounds = new Float64Array(this.size * 6);
+    for (let i = 0; i < this.size; i++) {
+      const [a, b, c] = this.triangle(i);
+      for (let axis = 0; axis < 3; axis++) {
+        bounds[i * 6 + axis] = Math.min(a[axis], b[axis], c[axis]);
+        bounds[i * 6 + axis + 3] = Math.max(a[axis], b[axis], c[axis]);
+      }
+    }
+    this.boxes = new BoxIndex({ bounds, dimension: 3, leafSize: options.leafSize });
+  }
+  /** Bounds candidates only; does not imply exact triangle/box overlap. */
+  search(minimum, maximum) {
+    return this.boxes.search(minimum, maximum);
+  }
+  /** Nearest accepted exact hit; application rejection never clips away later candidates. */
+  intersectRay(origin, direction, options = {}) {
+    validateQueryPoint(origin, 3);
+    const unit = normalizeQueryDirection(direction, 3);
+    let result = null;
+    this.boxes.intersectRay(origin, direction, {
+      maxDistance: options.maxDistance,
+      filter: options.filter,
+      intersectItem: (index, maximum) => {
+        const [a, b, c] = this.triangle(index);
+        const hit = intersectRayTriangle(origin, unit, a, b, c, {
+          backfaceCulling: options.backfaceCulling,
+          maxT: maximum
+        });
+        if (hit && (!result || hit.t < result.distance || hit.t === result.distance && index < result.index)) {
+          const candidateHit = {
+            index,
+            distance: hit.t,
+            point: [
+              origin[0] + hit.t * unit[0],
+              origin[1] + hit.t * unit[1],
+              origin[2] + hit.t * unit[2]
+            ],
+            barycentric: hit.barycentric
+          };
+          if (!options.acceptHit || options.acceptHit(candidateHit)) {
+            result = candidateHit;
+            return hit.t;
+          }
+        }
+        return null;
+      }
+    });
+    return result;
+  }
+  nearest(point, options = {}) {
+    const result = this.boxes.nearest(point, {
+      ...options,
+      distanceToItem: (index) => {
+        const closest = getClosestPointOnTriangle(point, ...this.triangle(index));
+        return Math.hypot(point[0] - closest[0], point[1] - closest[1], point[2] - closest[2]);
+      }
+    });
+    return result ? { ...result, point: getClosestPointOnTriangle(point, ...this.triangle(result.index)) } : null;
+  }
+  triangle(index) {
+    const vertex = (i) => {
+      const start = this.indices[index * 3 + i] * 3;
+      return this.positions.subarray(start, start + 3);
+    };
+    return [vertex(0), vertex(1), vertex(2)];
+  }
+};
+//# sourceMappingURL=index.cjs.map

package/dist/spatial-index/index.cjs.map

@@ -0,0 +1,6 @@
+{
+  "version": 3,
+  "sources": ["../../src/spatial-index/index.ts", "../../src/culling/queries.ts", "../../src/spatial-index/box-index.ts", "../../src/spatial-index/triangle-bvh.ts"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;AAAA;;;;;;;;;ACQM,SAAU,mBAAmB,OAAmB,WAAiB;AACrE,MAAI,MAAM,WAAW;AAAW,UAAM,IAAI,WAAW,sCAAsC;AAC3F,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,CAAC,OAAO,SAAS,MAAM,CAAC,CAAC;AAAG,YAAM,IAAI,WAAW,4BAA4B;EACnF;AACF;AAEM,SAAU,sBAAsB,UAAgB;AACpD,MAAI,OAAO,MAAM,QAAQ,KAAK,WAAW;AAAG,UAAM,IAAI,WAAW,8BAA8B;AACjG;AAGM,SAAU,wBAAwB,WAAuB,WAAiB;AAC9E,qBAAmB,WAAW,SAAS;AACvC,QAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,KAAK,WAAW,KAAK,GAAG,CAAC;AACzD,MAAI,UAAU;AAAG,UAAM,IAAI,WAAW,+BAA+B;AACrE,QAAM,SAAS,MAAM,KAAK,WAAW,OAAK,IAAI,KAAK;AACnD,QAAM,SAAS,KAAK,MAAM,GAAG,MAAM;AACnC,SAAO,OAAO,IAAI,OAAK,IAAI,MAAM;AACnC;AAGM,SAAU,mBACd,QACA,WACA,SACA,SACA,OAAO,UAAQ;AAEf,QAAM,YAAY,OAAO;AACzB,MAAI,cAAc,KAAK,cAAc;AAAG,UAAM,IAAI,WAAW,yBAAyB;AACtF,qBAAmB,QAAQ,SAAS;AACpC,qBAAmB,WAAW,SAAS;AACvC,qBAAmB,SAAS,SAAS;AACrC,qBAAmB,SAAS,SAAS;AACrC,wBAAsB,IAAI;AAC1B,MAAI,OAAO,GACT,MAAM,MACN,UAAU;AACZ,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,QAAQ,CAAC,IAAI,QAAQ,CAAC;AAAG,YAAM,IAAI,WAAW,wBAAwB;AAC1E,gBAAA,UAAY,UAAU,CAAC,MAAM;EAC/B;AACA,MAAI,CAAC;AAAS,UAAM,IAAI,WAAW,+BAA+B;AAClE,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,UAAU,CAAC,MAAM,GAAG;AACtB,UAAI,OAAO,CAAC,IAAI,QAAQ,CAAC,KAAK,OAAO,CAAC,IAAI,QAAQ,CAAC;AAAG,eAAO;AAC7D;IACF;AACA,QAAI,KAAK,QAAQ,CAAC,IAAI,OAAO,CAAC,KAAK,UAAU,CAAC;AAC9C,QAAI,KAAK,QAAQ,CAAC,IAAI,OAAO,CAAC,KAAK,UAAU,CAAC;AAC9C,QAAI,IAAI;AAAG,OAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AACzB,WAAO,KAAK,IAAI,MAAM,CAAC;AACvB,UAAM,KAAK,IAAI,KAAK,CAAC;AACrB,QAAI,OAAO;AAAK,aAAO;EACzB;AACA,SAAO,OAAO,SAAS,IAAI,IAAI,OAAO;AACxC;AAGM,SAAU,qBACd,QACA,WACA,GACA,GACA,GACA,UAAsD,CAAA,GAAE;AAExD,aAAW,SAAS,CAAC,QAAQ,WAAW,GAAG,GAAG,CAAC;AAAG,uBAAmB,OAAO,CAAC;AAC7E,MAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,GAAG;AAClE,UAAM,IAAI,WAAW,+BAA+B;EACtD;AACA,QAAM,OAAO,QAAQ,QAAQ;AAC7B,wBAAsB,IAAI;AAC1B,QAAM,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjD,QAAM,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjD,QAAM,IAAI,MAAM,WAAW,EAAE;AAC7B,QAAM,cAAc,IAAI,IAAI,CAAC;AAC7B,MAAI,gBAAgB,KAAM,QAAQ,mBAAmB,cAAc;AAAI,WAAO;AAC9E,QAAM,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;AACpE,QAAM,IAAI,IAAI,QAAQ,CAAC,IAAI;AAC3B,MAAI,IAAI,KAAK,IAAI;AAAG,WAAO;AAC3B,QAAM,IAAI,MAAM,QAAQ,EAAE;AAC1B,QAAM,IAAI,IAAI,WAAW,CAAC,IAAI;AAC9B,MAAI,IAAI,KAAK,IAAI,IAAI;AAAG,WAAO;AAC/B,QAAM,IAAI,IAAI,IAAI,CAAC,IAAI;AACvB,MAAI,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI;AAAM,WAAO;AACrD,SAAO,EAAC,GAAG,KAAK,IAAI,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC,EAAC;AAC3D;AAGM,SAAU,0BACd,OACA,GACA,GACA,GAAa;AAEb,aAAW,SAAS,CAAC,OAAO,GAAG,GAAG,CAAC;AAAG,uBAAmB,OAAO,CAAC;AACjE,QAAM,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjD,QAAM,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACjD,QAAM,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;AAC7D,QAAM,KAAK,IAAI,IAAI,EAAE,GACnB,KAAK,IAAI,IAAI,EAAE,GACf,KAAK,IAAI,IAAI,EAAE;AACjB,QAAM,cAAc,KAAK,KAAK,KAAK;AACnC,MAAI,cAAc,KAAK,OAAO,SAAS,WAAW,GAAG;AACnD,UAAM,KAAK,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE,KAAK;AAClD,UAAM,KAAK,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE,KAAK;AAClD,QAAI,KAAK,KAAK,KAAK,KAAK,IAAI,KAAK,GAAG;AAClC,aAAO;QACL,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC;QAC3B,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC;QAC3B,EAAE,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC;;IAE/B;EACF;AACA,MAAI,OAAiC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AACtD,MAAI,WAAW;AACf,aAAW,CAAC,OAAO,GAAG,KAAK;IACzB,CAAC,GAAG,CAAC;IACL,CAAC,GAAG,CAAC;IACL,CAAC,GAAG,CAAC;KACJ;AACD,UAAM,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC;AACrE,UAAM,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC;AAC7E,UAAM,UAAU,IAAI,MAAM,IAAI;AAC9B,UAAM,IAAI,UAAU,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,IAAI,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI;AAChF,UAAM,YAAsC;MAC1C,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC;MACrB,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC;MACrB,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC;;AAEvB,UAAM,IAAI,KAAK,MAAM,MAAM,CAAC,IAAI,UAAU,CAAC,GAAG,MAAM,CAAC,IAAI,UAAU,CAAC,GAAG,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC;AAC9F,QAAI,IAAI,UAAU;AAChB,iBAAW;AACX,aAAO;IACT;EACF;AACA,SAAO;AACT;AAEA,SAAS,IAAI,GAAe,GAAa;AACvC,SAAO,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AAC/C;AACA,SAAS,MAAM,GAAe,GAAa;AACzC,SAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AACzF;;;AC/GM,IAAO,WAAP,MAAe;EAUnB,YAAY,SAAwB;AAClC,UAAM,EAAC,WAAW,QAAQ,WAAW,EAAC,IAAI;AAC1C,QAAI,cAAc,KAAK,cAAc;AAAG,YAAM,IAAI,WAAW,gCAAgC;AAC7F,QAAI,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW;AAChD,YAAM,IAAI,WAAW,2BAA2B;AAClD,QAAI,OAAO,UAAU,YAAY;AAAI,YAAM,IAAI,WAAW,0BAA0B;AACpF,SAAK,YAAY;AACjB,SAAK,SAAS,aAAa,KAAK,MAAM;AACtC,SAAK,OAAO,OAAO,UAAU,YAAY;AACzC,QAAI,KAAK,OAAO;AAAY,YAAM,IAAI,WAAW,+BAA+B;AAChF,UAAM,SAAS,YAAY;AAC3B,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM;AAC7B,WAAK,eACH,KAAK,OAAO,SAAS,IAAI,QAAQ,IAAI,SAAS,SAAS,GACvD,KAAK,OAAO,SAAS,IAAI,SAAS,YAAY,IAAI,KAAK,MAAM,CAAC;AAElE,UAAM,UACJ,CAAA;AACF,UAAM,MAAM,MAAM,KAAK,EAAC,QAAQ,KAAK,KAAI,GAAG,CAAC,GAAG,MAAM,CAAC;AACvD,UAAM,QAAQ,CAAC,OAAe,QAAuB;AACnD,YAAM,OAAO,QAAQ;AACrB,YAAM,QAAQ;QACZ,GAAG,IAAI,MAAM,SAAS,EAAE,KAAK,QAAQ;QACrC,GAAG,IAAI,MAAM,SAAS,EAAE,KAAK,SAAS;;AAExC,eAAS,IAAI,OAAO,IAAI,KAAK;AAC3B,iBAAS,OAAO,GAAG,OAAO,WAAW,QAAQ;AAC3C,gBAAM,IAAI,IAAI,KAAK,IAAI,MAAM,IAAI,GAAG,KAAK,OAAO,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC;AACvE,gBAAM,OAAO,SAAS,IAAI,KAAK,IAC7B,MAAM,OAAO,SAAS,GACtB,KAAK,OAAO,IAAI,CAAC,IAAI,SAAS,OAAO,SAAS,CAAC;QAEnD;AACF,YAAM,SAAS,EAAC,QAAQ,OAAO,MAAM,IAAI,OAAO,IAAI,OAAO,OAAO,MAAM,MAAK;AAC7E,cAAQ,KAAK,MAAM;AACnB,UAAI,MAAM,QAAQ,UAAU;AAC1B,YAAI,OAAO;AACX,iBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,cAAI,MAAM,IAAI,SAAS,IAAI,MAAM,CAAC,IAAI,MAAM,OAAO,SAAS,IAAI,MAAM,IAAI;AAAG,mBAAO;QACtF;AACA,cAAM,SAAS,CAAC,MACd,KAAK,OAAO,IAAI,SAAS,IAAI,IAAI,IAAI,KAAK,OAAO,IAAI,SAAS,OAAO,SAAS,IAAI;AACpF,cAAM,SAAS,IAAI,MAAM,OAAO,GAAG,EAAE,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,IAAI,OAAO,CAAC,KAAK,IAAI,CAAC;AAClF,iBAAS,IAAI,GAAG,IAAI,OAAO,QAAQ;AAAK,cAAI,QAAQ,CAAC,IAAI,OAAO,CAAC;AACjE,cAAM,SAAS,KAAK,OAAO,QAAQ,OAAO,CAAC;AAC3C,eAAO,OAAO,MAAM,OAAO,MAAM;AACjC,eAAO,QAAQ,MAAM,QAAQ,GAAG;AAChC,eAAO,QAAQ;MACjB;AACA,aAAO;IACT;AACA,QAAI,KAAK;AAAM,YAAM,GAAG,KAAK,IAAI;AACjC,SAAK,aAAa,IAAI,aAAa,QAAQ,SAAS,MAAM;AAC1D,SAAK,WAAW,IAAI,WAAW,QAAQ,SAAS,CAAC;AACjD,SAAK,SAAS,IAAI,YAAY,QAAQ,MAAM;AAC5C,SAAK,SAAS,IAAI,YAAY,QAAQ,MAAM;AAC5C,YAAQ,QAAQ,CAAC,QAAQ,MAAK;AAC5B,WAAK,WAAW,IAAI,OAAO,QAAQ,IAAI,MAAM;AAC7C,WAAK,SAAS,IAAI,CAAC,OAAO,MAAM,OAAO,KAAK,GAAG,IAAI,CAAC;AACpD,WAAK,OAAO,CAAC,IAAI,OAAO;AACxB,WAAK,OAAO,CAAC,IAAI,OAAO;IAC1B,CAAC;AACD,SAAK,QAAQ,YAAY,KAAK,GAAG;EACnC;;EAGA,OAAO,SAAqB,SAAmB;AAC7C,SAAK,eAAe,SAAS,OAAO;AACpC,UAAM,SAAmB,CAAA;AACzB,UAAM,WAAW,CAAC,QAAsB,UAA0B;AAChE,YAAM,QAAQ,QAAQ,KAAK,YAAY;AACvC,eAAS,IAAI,GAAG,IAAI,KAAK,WAAW,KAAK;AACvC,YAAI,OAAO,QAAQ,CAAC,IAAI,QAAQ,CAAC,KAAK,OAAO,QAAQ,IAAI,KAAK,SAAS,IAAI,QAAQ,CAAC;AAClF,iBAAO;MACX;AACA,aAAO;IACT;AACA,UAAM,QAAQ,KAAK,OAAO,CAAC,CAAC,IAAI,CAAA;AAChC,WAAO,MAAM,QAAQ;AACnB,YAAM,OAAO,MAAM,IAAG;AACtB,UAAI,CAAC,SAAS,KAAK,YAAY,IAAI;AAAG;AACtC,UAAI,KAAK,OAAO,IAAI,GAAG;AACrB,iBAAS,IAAI,KAAK,OAAO,IAAI,GAAG,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,OAAO,IAAI,GAAG,KAAK;AAC9E,cAAI,SAAS,KAAK,QAAQ,KAAK,MAAM,CAAC,CAAC;AAAG,mBAAO,KAAK,KAAK,MAAM,CAAC,CAAC;QACrE;MACF;AAAO,cAAM,KAAK,KAAK,SAAS,OAAO,CAAC,GAAG,KAAK,SAAS,OAAO,IAAI,CAAC,CAAC;IACxE;AACA,WAAO,OAAO,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;EACpC;;EAGA,QAAQ,OAAmB,UAA+B,CAAA,GAAE;AAC1D,uBAAmB,OAAO,KAAK,SAAS;AACxC,QAAI,OAAO,QAAQ,eAAe;AAClC,0BAAsB,IAAI;AAC1B,QAAI,SAAoC;AACxC,UAAM,WAAW,CAAC,QAAsB,UAAyB;AAC/D,YAAM,QAAQ,QAAQ,KAAK,YAAY;AACvC,UAAI,IAAI,GACN,IAAI,GACJ,IAAI;AACN,UAAI,KAAK,IAAI,OAAO,KAAK,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,OAAO,QAAQ,KAAK,SAAS,CAAC;AACnF,UAAI,KAAK,IAAI,OAAO,QAAQ,CAAC,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,OAAO,QAAQ,KAAK,YAAY,CAAC,CAAC;AAC3F,UAAI,KAAK,cAAc;AACrB,YAAI,KAAK,IAAI,OAAO,QAAQ,CAAC,IAAI,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,IAAI,OAAO,QAAQ,CAAC,CAAC;AAC5E,aAAO,KAAK,MAAM,GAAG,GAAG,CAAC;IAC3B;AACA,UAAM,QAAQ,KAAK,OAAO,CAAC,CAAC,IAAI,CAAA;AAChC,WAAO,MAAM,QAAQ;AACnB,YAAM,OAAO,MAAM,IAAG;AACtB,UAAI,SAAS,KAAK,YAAY,IAAI,IAAI;AAAM;AAC5C,UAAI,KAAK,OAAO,IAAI,GAAG;AACrB,iBAAS,IAAI,KAAK,OAAO,IAAI,GAAG,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,OAAO,IAAI,GAAG,KAAK;AAC9E,gBAAM,QAAQ,KAAK,MAAM,CAAC;AAC1B,gBAAM,QAAQ,SAAS,KAAK,QAAQ,KAAK;AACzC,cAAI,QAAQ,QAAS,QAAQ,UAAU,CAAC,QAAQ,OAAO,KAAK;AAAI;AAChE,gBAAM,QAAQ,QAAQ,iBAAiB,QAAQ,eAAe,KAAK,IAAI;AACvE,cAAI,UAAU;AAAM;AACpB,gCAAsB,KAAK;AAC3B,cAAI,QAAQ;AACV,kBAAM,IAAI,WAAW,kDAAkD;AACzE,cACE,OAAO,SAAS,KAAK,KACrB,SAAS,SACR,CAAC,UAAU,QAAQ,QAAQ,QAAQ,OAAO,QAC3C;AACA,mBAAO;AACP,qBAAS,EAAC,OAAO,UAAU,MAAK;UAClC;QACF;MACF,OAAO;AACL,cAAM,IAAI,KAAK,SAAS,OAAO,CAAC,GAC9B,IAAI,KAAK,SAAS,OAAO,IAAI,CAAC;AAChC,YAAI,SAAS,KAAK,YAAY,CAAC,IAAI,SAAS,KAAK,YAAY,CAAC;AAAG,gBAAM,KAAK,GAAG,CAAC;;AAC3E,gBAAM,KAAK,GAAG,CAAC;MACtB;IACF;AACA,WAAO;EACT;;;;;EAMA,aACE,QACA,WACA,UAA2B,CAAA,GAAE;AAE7B,uBAAmB,QAAQ,KAAK,SAAS;AACzC,UAAM,OAAO,wBAAwB,WAAW,KAAK,SAAS;AAC9D,QAAI,OAAO,QAAQ,eAAe;AAClC,0BAAsB,IAAI;AAC1B,QAAI,SAAoC;AACxC,UAAM,WAAW,CAAC,QAAsB,UAAgC;AACtE,YAAM,SAAS,QAAQ,KAAK,YAAY;AACxC,aAAO,mBACL,QACA,MACA,OAAO,SAAS,QAAQ,SAAS,KAAK,SAAS,GAC/C,OAAO,SAAS,SAAS,KAAK,WAAW,SAAS,KAAK,YAAY,CAAC,GACpE,OAAO,wBAAwB,MAAM,IAAI,CAAC;IAE9C;AACA,UAAM,eAAe,KAAK,OAAO,SAAS,KAAK,YAAY,CAAC,IAAI;AAChE,UAAM,QAAQ,iBAAiB,OAAO,CAAA,IAAK,CAAC,EAAC,OAAO,GAAG,UAAU,aAAY,CAAC;AAC9E,WAAO,MAAM,QAAQ;AACnB,YAAM,YAAY,MAAM,IAAG;AAC3B,UACE,CAAC,aACD,UAAU,WAAW,OAAO,wBAAwB,UAAU,UAAU,IAAI;AAE5E;AACF,YAAM,OAAO,UAAU;AACvB,UAAI,KAAK,OAAO,IAAI,GAAG;AACrB,iBACM,SAAS,KAAK,OAAO,IAAI,GAC7B,SAAS,KAAK,OAAO,IAAI,IAAI,KAAK,OAAO,IAAI,GAC7C,UACA;AACA,gBAAM,QAAQ,KAAK,MAAM,MAAM;AAC/B,gBAAM,QAAQ,SAAS,KAAK,QAAQ,KAAK;AACzC,cAAI,UAAU,QAAS,QAAQ,UAAU,CAAC,QAAQ,OAAO,KAAK;AAAI;AAClE,gBAAM,QAAQ,QAAQ,gBAAgB,QAAQ,cAAc,OAAO,IAAI,IAAI;AAC3E,cAAI,UAAU;AAAM;AACpB,gCAAsB,KAAK;AAC3B,cACE,QAAQ,UACP,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,QAAQ,wBAAwB,OAAO,KAAK;AAEhF,kBAAM,IAAI,WAAW,+CAA+C;AACtE,cACE,OAAO,SAAS,KAAK,KACrB,SAAS,SACR,CAAC,UAAU,QAAQ,QAAQ,QAAQ,OAAO,QAC3C;AACA,mBAAO;AACP,qBAAS,EAAC,OAAO,UAAU,MAAK;UAClC;QACF;MACF,OAAO;AACL,cAAM,QAAQ,KAAK,SAAS,OAAO,CAAC,GAClC,SAAS,KAAK,SAAS,OAAO,IAAI,CAAC;AACrC,cAAM,gBAAgB,SAAS,KAAK,YAAY,KAAK,GACnD,iBAAiB,SAAS,KAAK,YAAY,MAAM;AACnD,YAAI,kBAAkB,QAAQ,mBAAmB,MAAM;AACrD,cAAI,iBAAiB;AACnB,kBAAM,KACJ,EAAC,OAAO,QAAQ,UAAU,eAAc,GACxC,EAAC,OAAO,OAAO,UAAU,cAAa,CAAC;;AAGzC,kBAAM,KACJ,EAAC,OAAO,OAAO,UAAU,cAAa,GACtC,EAAC,OAAO,QAAQ,UAAU,eAAc,CAAC;QAE/C,WAAW,kBAAkB;AAAM,gBAAM,KAAK,EAAC,OAAO,OAAO,UAAU,cAAa,CAAC;iBAC5E,mBAAmB;AAAM,gBAAM,KAAK,EAAC,OAAO,QAAQ,UAAU,eAAc,CAAC;MACxF;IACF;AACA,WAAO;EACT;;EAGA,UACE,QACA,WACA,cAAc,UAAQ;AAEtB,uBAAmB,QAAQ,KAAK,SAAS;AACzC,UAAM,OAAO,wBAAwB,WAAW,KAAK,SAAS;AAC9D,0BAAsB,WAAW;AACjC,UAAM,QAAQ,CAAC,QAAsB,UAAgC;AACnE,YAAM,QAAQ,QAAQ,KAAK,YAAY;AACvC,aAAO,mBACL,QACA,MACA,OAAO,SAAS,OAAO,QAAQ,KAAK,SAAS,GAC7C,OAAO,SAAS,QAAQ,KAAK,WAAW,QAAQ,KAAK,YAAY,CAAC,GAClE,WAAW;IAEf;AACA,UAAM,SAA+B,CAAA;AACrC,UAAM,QAAQ,KAAK,OAAO,CAAC,CAAC,IAAI,CAAA;AAChC,WAAO,MAAM,QAAQ;AACnB,YAAM,OAAO,MAAM,IAAG;AACtB,UAAI,MAAM,KAAK,YAAY,IAAI,MAAM;AAAM;AAC3C,UAAI,KAAK,OAAO,IAAI,GAAG;AACrB,iBAAS,IAAI,KAAK,OAAO,IAAI,GAAG,IAAI,KAAK,OAAO,IAAI,IAAI,KAAK,OAAO,IAAI,GAAG,KAAK;AAC9E,gBAAM,QAAQ,KAAK,MAAM,CAAC,GACxB,WAAW,MAAM,KAAK,QAAQ,KAAK;AACrC,cAAI,aAAa;AAAM,mBAAO,KAAK,EAAC,OAAO,SAAQ,CAAC;QACtD;MACF;AAAO,cAAM,KAAK,KAAK,SAAS,OAAO,CAAC,GAAG,KAAK,SAAS,OAAO,IAAI,CAAC,CAAC;IACxE;AACA,WAAO,OAAO,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,KAAK;EAC3E;EAEQ,eAAe,SAAqB,SAAmB;AAC7D,uBAAmB,SAAS,KAAK,SAAS;AAC1C,uBAAmB,SAAS,KAAK,SAAS;AAC1C,aAAS,IAAI,GAAG,IAAI,KAAK,WAAW,KAAK;AACvC,UAAI,QAAQ,CAAC,IAAI,QAAQ,CAAC;AAAG,cAAM,IAAI,WAAW,wBAAwB;IAC5E;EACF;;AAIF,SAAS,wBAAwB,OAAe,QAAc;AAC5D,SACE,IAAI,KAAK,IAAI,OAAO,WAAW,OAAO,UAAU,KAAK,IAAI,KAAK,IAAI,KAAK,GAAG,KAAK,IAAI,MAAM,CAAC,CAAC;AAE/F;AAGM,IAAO,aAAP,cAA0B,SAAQ;EACtC,YAAY,SAA4E;AACtF,UAAM,EAAC,WAAW,WAAW,SAAQ,IAAI;AACzC,QAAK,cAAc,KAAK,cAAc,KAAM,UAAU,SAAS,WAAW;AACxE,YAAM,IAAI,WAAW,sBAAsB;IAC7C;AACA,UAAM,SAAS,IAAI,aAAa,UAAU,SAAS,CAAC;AACpD,aAAS,IAAI,GAAG,IAAI,UAAU,SAAS,WAAW;AAChD,eAAS,OAAO,GAAG,OAAO,WAAW,QAAQ;AAC3C,eAAO,IAAI,YAAY,IAAI,IAAI,IAAI,OAAO,IAAI,YAAY,IAAI,OAAO,SAAS,IAC5E,UAAU,IAAI,YAAY,IAAI;MAClC;AACF,UAAM,EAAC,QAAQ,WAAW,SAAQ,CAAC;EACrC;;;;ACnSI,IAAO,cAAP,MAAkB;EAMtB,YAAY,SAA2B;AACrC,QAAI,QAAQ,UAAU,SAAS;AAAG,YAAM,IAAI,WAAW,8BAA8B;AACrF,SAAK,YAAY,aAAa,KAAK,QAAQ,SAAS;AACpD,eAAW,SAAS,KAAK,WAAW;AAClC,UAAI,CAAC,OAAO,SAAS,KAAK;AAAG,cAAM,IAAI,WAAW,0BAA0B;IAC9E;AACA,UAAM,SAAS,QAAQ,WAAW,MAAM,KAAK,EAAC,QAAQ,KAAK,UAAU,SAAS,EAAC,GAAG,CAAC,GAAG,MAAM,CAAC;AAC7F,QAAI,OAAO,SAAS;AAAG,YAAM,IAAI,WAAW,6BAA6B;AACzE,SAAK,UAAU,IAAI,YAAY,OAAO,MAAM;AAC5C,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UACE,CAAC,OAAO,cAAc,OAAO,CAAC,CAAC,KAC/B,OAAO,CAAC,IAAI,KACZ,OAAO,CAAC,KAAK,KAAK,UAAU,SAAS,KACrC,OAAO,CAAC,IAAI,YACZ;AACA,cAAM,IAAI,WAAW,iCAAiC;MACxD;AACA,WAAK,QAAQ,CAAC,IAAI,OAAO,CAAC;IAC5B;AACA,SAAK,OAAO,KAAK,QAAQ,SAAS;AAClC,UAAM,SAAS,IAAI,aAAa,KAAK,OAAO,CAAC;AAC7C,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,YAAM,CAAC,GAAG,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC;AACjC,eAAS,OAAO,GAAG,OAAO,GAAG,QAAQ;AACnC,eAAO,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,IAAI,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC;AACzD,eAAO,IAAI,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC;MAC/D;IACF;AACA,SAAK,QAAQ,IAAI,SAAS,EAAC,QAAQ,WAAW,GAAG,UAAU,QAAQ,SAAQ,CAAC;EAC9E;;EAGA,OAAO,SAAqB,SAAmB;AAC7C,WAAO,KAAK,MAAM,OAAO,SAAS,OAAO;EAC3C;;EAGA,aACE,QACA,WACA,UAA8B,CAAA,GAAE;AAEhC,uBAAmB,QAAQ,CAAC;AAC5B,UAAM,OAAO,wBAAwB,WAAW,CAAC;AACjD,QAAI,SAAmC;AACvC,SAAK,MAAM,aAAa,QAAQ,WAAW;MACzC,aAAa,QAAQ;MACrB,QAAQ,QAAQ;MAChB,eAAe,CAAC,OAAO,YAAW;AAChC,cAAM,CAAC,GAAG,GAAG,CAAC,IAAI,KAAK,SAAS,KAAK;AACrC,cAAM,MAAM,qBAAqB,QAAQ,MAAM,GAAG,GAAG,GAAG;UACtD,iBAAiB,QAAQ;UACzB,MAAM;SACP;AACD,YACE,QACC,CAAC,UACA,IAAI,IAAI,OAAO,YACd,IAAI,MAAM,OAAO,YAAY,QAAQ,OAAO,QAC/C;AACA,gBAAM,eAAkC;YACtC;YACA,UAAU,IAAI;YACd,OAAO;cACL,OAAO,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC;cAC1B,OAAO,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC;cAC1B,OAAO,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC;;YAE5B,aAAa,IAAI;;AAEnB,cAAI,CAAC,QAAQ,aAAa,QAAQ,UAAU,YAAY,GAAG;AACzD,qBAAS;AACT,mBAAO,IAAI;UACb;QACF;AACA,eAAO;MACT;KACD;AACD,WAAO;EACT;EAEA,QACE,OACA,UAAuE,CAAA,GAAE;AAEzE,UAAM,SAAS,KAAK,MAAM,QAAQ,OAAO;MACvC,GAAG;MACH,gBAAgB,WAAQ;AACtB,cAAM,UAAU,0BAA0B,OAAO,GAAG,KAAK,SAAS,KAAK,CAAC;AACxE,eAAO,KAAK,MAAM,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC;MACvF;KACD;AACD,WAAO,SACH,EAAC,GAAG,QAAQ,OAAO,0BAA0B,OAAO,GAAG,KAAK,SAAS,OAAO,KAAK,CAAC,EAAC,IACnF;EACN;EAEQ,SAAS,OAAa;AAC5B,UAAM,SAAS,CAAC,MAA2B;AACzC,YAAM,QAAQ,KAAK,QAAQ,QAAQ,IAAI,CAAC,IAAI;AAC5C,aAAO,KAAK,UAAU,SAAS,OAAO,QAAQ,CAAC;IACjD;AACA,WAAO,CAAC,OAAO,CAAC,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;EACzC;;",
+  "names": []
+}

package/dist/spatial-index/index.d.ts

@@ -0,0 +1,5 @@
+export { BoxIndex, PointIndex } from "./box-index.js";
+export type { BoxIndexOptions, NearestIndexOptions, NearestIndexResult, RayIndexOptions } from "./box-index.js";
+export { TriangleBVH } from "./triangle-bvh.js";
+export type { TriangleBVHOptions, TriangleQueryResult, TriangleRayResult, TriangleRayOptions } from "./triangle-bvh.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/spatial-index/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/spatial-index/index.ts"],"names":[],"mappings":"AAIA,OAAO,EAAC,QAAQ,EAAE,UAAU,EAAC,uBAAoB;AACjD,YAAY,EACV,eAAe,EACf,mBAAmB,EACnB,kBAAkB,EAClB,eAAe,EAChB,uBAAoB;AACrB,OAAO,EAAC,WAAW,EAAC,0BAAuB;AAC3C,YAAY,EACV,kBAAkB,EAClB,mBAAmB,EACnB,iBAAiB,EACjB,kBAAkB,EACnB,0BAAuB"}

package/dist/spatial-index/index.js

@@ -0,0 +1,6 @@
+// math.gl
+// SPDX-License-Identifier: MIT
+// SPDX-FileCopyrightText: Copyright (c) vis.gl contributors
+export { BoxIndex, PointIndex } from "./box-index.js";
+export { TriangleBVH } from "./triangle-bvh.js";
+//# sourceMappingURL=index.js.map

package/dist/spatial-index/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/spatial-index/index.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,+BAA+B;AAC/B,4DAA4D;AAE5D,OAAO,EAAC,QAAQ,EAAE,UAAU,EAAC,uBAAoB;AAOjD,OAAO,EAAC,WAAW,EAAC,0BAAuB"}

package/dist/spatial-index/triangle-bvh.d.ts

@@ -0,0 +1,53 @@
+import { type QueryPoint } from "../culling/queries.js";
+export type TriangleBVHOptions = {
+    /** Packed xyz vertices. Copied at construction. */
+    positions: ArrayLike<number>;
+    /** Triangle-list vertex indices. Omit for non-indexed triangles. */
+    indices?: ArrayLike<number>;
+    leafSize?: number;
+};
+export type TriangleQueryResult = {
+    index: number;
+    distance: number;
+    point: [number, number, number];
+};
+export type TriangleRayResult = TriangleQueryResult & {
+    barycentric: [number, number, number];
+};
+/** Optional application constraints for the nearest accepted triangle intersection. */
+export type TriangleRayOptions = {
+    /** Inclusive Euclidean distance limit in input-coordinate units; defaults to Infinity. */
+    maxDistance?: number;
+    /** Ignore triangles facing away from the ray; defaults to false. */
+    backfaceCulling?: boolean;
+    /** Exclude an original triangle index before running its exact intersection kernel. */
+    filter?: (index: number) => boolean;
+    /**
+     * Accept or reject an exact hit using its point and original-order barycentric weights.
+     * Rejected hits do not shorten the search: a valid surface behind a hole can still win.
+     * Called only for candidates that could improve the current accepted result, not all hits.
+     * Treat the detached candidate as immutable; traversal order is unspecified.
+     */
+    acceptHit?: (hit: Readonly<Omit<TriangleRayResult, 'point' | 'barycentric'>> & {
+        readonly point: readonly [number, number, number];
+        readonly barycentric: readonly [number, number, number];
+    }) => boolean;
+};
+/** Static triangle-list BVH. index is the original triangle number, not a vertex index. */
+export declare class TriangleBVH {
+    readonly size: number;
+    private readonly positions;
+    private readonly indices;
+    private readonly boxes;
+    constructor(options: TriangleBVHOptions);
+    /** Bounds candidates only; does not imply exact triangle/box overlap. */
+    search(minimum: QueryPoint, maximum: QueryPoint): number[];
+    /** Nearest accepted exact hit; application rejection never clips away later candidates. */
+    intersectRay(origin: QueryPoint, direction: QueryPoint, options?: TriangleRayOptions): TriangleRayResult | null;
+    nearest(point: QueryPoint, options?: {
+        maxDistance?: number;
+        filter?: (index: number) => boolean;
+    }): TriangleQueryResult | null;
+    private triangle;
+}
+//# sourceMappingURL=triangle-bvh.d.ts.map

package/dist/spatial-index/triangle-bvh.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"triangle-bvh.d.ts","sourceRoot":"","sources":["../../src/spatial-index/triangle-bvh.ts"],"names":[],"mappings":"AAIA,OAAO,EAKL,KAAK,UAAU,EAChB,8BAA2B;AAG5B,MAAM,MAAM,kBAAkB,GAAG;IAC/B,mDAAmD;IACnD,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC7B,oEAAoE;IACpE,OAAO,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC;AACF,MAAM,MAAM,mBAAmB,GAAG;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;CACjC,CAAC;AACF,MAAM,MAAM,iBAAiB,GAAG,mBAAmB,GAAG;IAAC,WAAW,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;CAAC,CAAC;AAE9F,uFAAuF;AACvF,MAAM,MAAM,kBAAkB,GAAG;IAC/B,0FAA0F;IAC1F,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,oEAAoE;IACpE,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,uFAAuF;IACvF,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IACpC;;;;;OAKG;IACH,SAAS,CAAC,EAAE,CACV,GAAG,EAAE,QAAQ,CAAC,IAAI,CAAC,iBAAiB,EAAE,OAAO,GAAG,aAAa,CAAC,CAAC,GAAG;QAChE,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAClD,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;KACzD,KACE,OAAO,CAAC;CACd,CAAC;AAEF,2FAA2F;AAC3F,qBAAa,WAAW;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAe;IACzC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAc;IACtC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;gBAErB,OAAO,EAAE,kBAAkB;IAgCvC,yEAAyE;IACzE,MAAM,CAAC,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,GAAG,MAAM,EAAE;IAI1D,2FAA2F;IAC3F,YAAY,CACV,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,UAAU,EACrB,OAAO,GAAE,kBAAuB,GAC/B,iBAAiB,GAAG,IAAI;IAwC3B,OAAO,CACL,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE;QAAC,WAAW,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAA;KAAM,GACxE,mBAAmB,GAAG,IAAI;IAa7B,OAAO,CAAC,QAAQ;CAOjB"}