@antv/l7-layers 2.9.37-alpha.2 → 2.9.37-alpha.3

package/es/utils/extrude_polyline.js

@@ -0,0 +1,613 @@
+import _slicedToArray from "@babel/runtime/helpers/slicedToArray";
+import _toConsumableArray from "@babel/runtime/helpers/toConsumableArray";
+import _classCallCheck from "@babel/runtime/helpers/classCallCheck";
+import _createClass from "@babel/runtime/helpers/createClass";
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { aProjectFlat } from '@antv/l7-utils';
+import { vec2 } from 'gl-matrix';
+var tmp = vec2.create(); // eslint-disable-next-line @typescript-eslint/no-unused-vars
+
+var capEnd = vec2.create();
+var lineA = vec2.create();
+var lineB = vec2.create();
+var tangent = vec2.create();
+export function computeMiter(lineTangent, miter, start, end, halfThick) {
+  vec2.add(lineTangent, start, end);
+  vec2.normalize(lineTangent, lineTangent);
+  miter = vec2.fromValues(-lineTangent[1], lineTangent[0]);
+  var tmpvec = vec2.fromValues(-start[1], start[0]);
+  return [halfThick / vec2.dot(miter, tmpvec), miter];
+}
+export function computeNormal(out, dir) {
+  return vec2.set(out, -dir[1], dir[0]);
+}
+export function direction(out, a, b) {
+  vec2.sub(out, a, b);
+  vec2.normalize(out, out);
+  return out;
+}
+
+function isPointEqual(a, b) {
+  return a[0] === b[0] && a[1] === b[1];
+}
+
+export function getArrayUnique(matrix) {
+  var map = new Map();
+
+  for (var i = 0; i < matrix.length; i++) {
+    var key = matrix[0].toString() + '-' + matrix[1].toString();
+
+    if (map.get(key)) {
+      matrix.splice(i, 1);
+      i++;
+    } else {
+      map.set(key, key);
+    }
+  }
+
+  return matrix;
+}
+
+var ExtrudePolyline = /*#__PURE__*/function () {
+  function ExtrudePolyline() {
+    var opts = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};
+
+    _classCallCheck(this, ExtrudePolyline);
+
+    _defineProperty(this, "lastFlip", -1);
+
+    _defineProperty(this, "miter", vec2.fromValues(0, 0));
+
+    _defineProperty(this, "started", false);
+
+    _defineProperty(this, "dash", false);
+
+    _defineProperty(this, "totalDistance", 0);
+
+    _defineProperty(this, "currentIndex", 0);
+
+    this.join = opts.join || 'miter';
+    this.cap = opts.cap || 'butt';
+    this.miterLimit = opts.miterLimit || 10;
+    this.thickness = opts.thickness || 1;
+    this.dash = opts.dash || false;
+    this.complex = {
+      positions: [],
+      indices: [],
+      normals: [],
+      startIndex: 0,
+      indexes: []
+    };
+  }
+
+  _createClass(ExtrudePolyline, [{
+    key: "simpleExtrude",
+    value: function simpleExtrude(points) {
+      var complex = this.complex;
+
+      if (points.length <= 1) {
+        return complex;
+      }
+
+      this.lastFlip = -1;
+      this.started = false;
+      this.normal = null;
+      this.totalDistance = 0;
+      var total = points.length;
+      var count = complex.startIndex;
+
+      for (var i = 1; i < total; i++) {
+        var last = points[i - 1];
+        var cur = points[i];
+        var next = i < points.length - 1 ? points[i + 1] : null;
+        var amt = this.simpleSegment(complex, count, last, cur, next);
+        count += amt;
+      }
+
+      if (this.dash) {
+        for (var _i = 0; _i < complex.positions.length / 6; _i++) {
+          complex.positions[_i * 6 + 5] = this.totalDistance;
+        }
+      }
+
+      complex.startIndex = complex.positions.length / 6;
+      return complex;
+    }
+  }, {
+    key: "simpleExtrude_gaode2",
+    value: function simpleExtrude_gaode2(points, originPoints) {
+      var complex = this.complex;
+
+      if (points.length <= 1) {
+        return complex;
+      }
+
+      this.lastFlip = -1;
+      this.started = false;
+      this.normal = null;
+      this.totalDistance = 0; // 去除数组里重复的点
+      // points = getArrayUnique(points);
+
+      var total = points.length;
+      var count = complex.startIndex;
+
+      for (var i = 1; i < total; i++) {
+        var _originPoints$, _originPoints$i$, _originPoints$2;
+
+        var last = points[i - 1];
+        last.push((_originPoints$ = originPoints[i - 1][2]) !== null && _originPoints$ !== void 0 ? _originPoints$ : 0); // @ts-ignore
+
+        var originLast = originPoints[i - 1];
+        var cur = points[i];
+        cur.push((_originPoints$i$ = originPoints[i][2]) !== null && _originPoints$i$ !== void 0 ? _originPoints$i$ : 0); // @ts-ignore
+
+        var originCur = originPoints[i];
+        var next = i < points.length - 1 ? [].concat(_toConsumableArray(points[i + 1]), [(_originPoints$2 = originPoints[i + 1][2]) !== null && _originPoints$2 !== void 0 ? _originPoints$2 : 0]) : null;
+        var originNext = i < originPoints.length - 1 ? originPoints[i + 1] : null;
+        var amt = this.simpleSegment(complex, count, // @ts-ignore
+        last, // @ts-ignore
+        cur, // @ts-ignore
+        next, // @ts-ignore
+        originLast, originCur, // @ts-ignore
+        originNext);
+        count += amt;
+      }
+
+      if (this.dash) {
+        for (var _i2 = 0; _i2 < complex.positions.length / 6; _i2++) {
+          complex.positions[_i2 * 6 + 5] = this.totalDistance;
+        }
+      }
+
+      complex.startIndex = complex.positions.length / 6;
+      return complex;
+    }
+  }, {
+    key: "extrude_gaode2",
+    value: function extrude_gaode2(points, originPoints) {
+      var complex = this.complex;
+
+      if (points.length <= 1) {
+        return complex;
+      }
+
+      this.lastFlip = -1;
+      this.started = false;
+      this.normal = null;
+      this.totalDistance = 0; // 去除数组里重复的点
+      // points = getArrayUnique(points);
+
+      var total = points.length;
+      var count = complex.startIndex;
+
+      for (var i = 1; i < total; i++) {
+        var _originPoints$3, _originPoints$i$2, _originPoints$4;
+
+        var last = points[i - 1];
+        last.push((_originPoints$3 = originPoints[i - 1][2]) !== null && _originPoints$3 !== void 0 ? _originPoints$3 : 0); // @ts-ignore
+
+        var originLast = originPoints[i - 1];
+        var cur = points[i];
+        cur.push((_originPoints$i$2 = originPoints[i][2]) !== null && _originPoints$i$2 !== void 0 ? _originPoints$i$2 : 0); // @ts-ignore
+
+        var originCur = originPoints[i];
+        var next = i < points.length - 1 ? [].concat(_toConsumableArray(points[i + 1]), [(_originPoints$4 = originPoints[i + 1][2]) !== null && _originPoints$4 !== void 0 ? _originPoints$4 : 0]) : null;
+        var originNext = i < originPoints.length - 1 ? originPoints[i + 1] : null;
+        var amt = this.segment_gaode2(complex, count, // @ts-ignore
+        last, // @ts-ignore
+        cur, // @ts-ignore
+        next, // @ts-ignore
+        originLast, originCur, // @ts-ignore
+        originNext);
+        count += amt;
+      }
+
+      if (this.dash) {
+        for (var _i3 = 0; _i3 < complex.positions.length / 6; _i3++) {
+          complex.positions[_i3 * 6 + 5] = this.totalDistance;
+        }
+      }
+
+      complex.startIndex = complex.positions.length / 6;
+      return complex;
+    }
+  }, {
+    key: "extrude",
+    value: function extrude(points) {
+      var complex = this.complex;
+
+      if (points.length <= 1) {
+        return complex;
+      }
+
+      this.lastFlip = -1;
+      this.started = false;
+      this.normal = null;
+      this.totalDistance = 0; // 去除数组里重复的点
+      // points = getArrayUnique(points);
+
+      var total = points.length;
+      var count = complex.startIndex;
+
+      for (var i = 1; i < total; i++) {
+        var last = points[i - 1];
+        var cur = points[i];
+        var next = i < points.length - 1 ? points[i + 1] : null;
+        var amt = this.segment(complex, count, last, cur, next);
+        count += amt;
+      }
+
+      if (this.dash) {
+        for (var _i4 = 0; _i4 < complex.positions.length / 6; _i4++) {
+          complex.positions[_i4 * 6 + 5] = this.totalDistance;
+        }
+      }
+
+      complex.startIndex = complex.positions.length / 6;
+      return complex;
+    }
+  }, {
+    key: "simpleSegment",
+    value: function simpleSegment(complex, index, last, cur, next) {
+      var count = 0;
+      var indices = complex.indices;
+      var positions = complex.positions;
+      var normals = complex.normals;
+      var flatCur = aProjectFlat([cur[0], cur[1]]);
+      var flatLast = aProjectFlat([last[0], last[1]]); // @ts-ignore
+
+      direction(lineA, flatCur, flatLast);
+      var segmentDistance = 0;
+
+      if (this.dash) {
+        // @ts-ignore
+        segmentDistance = this.lineSegmentDistance(flatCur, flatLast);
+        this.totalDistance += segmentDistance;
+      }
+
+      if (!this.normal) {
+        this.normal = vec2.create();
+        computeNormal(this.normal, lineA);
+      }
+
+      if (!this.started) {
+        this.started = true;
+        this.extrusions(positions, normals, last, this.normal, this.thickness, this.totalDistance - segmentDistance);
+      }
+
+      indices.push(index + 0, index + 1, index + 2);
+
+      if (!next) {
+        computeNormal(this.normal, lineA);
+        this.extrusions(positions, normals, cur, this.normal, this.thickness, this.totalDistance);
+        indices.push.apply(indices, _toConsumableArray(this.lastFlip === 1 ? [index, index + 2, index + 3] : [index + 2, index + 1, index + 3]));
+        count += 2;
+      } else {
+        var flatNext = aProjectFlat([next[0], next[1]]);
+
+        if (isPointEqual(flatCur, flatNext)) {
+          vec2.add(flatNext, flatCur, vec2.normalize(flatNext, vec2.subtract(flatNext, flatCur, flatLast)));
+        }
+
+        direction(lineB, flatNext, flatCur); // stores tangent & miter
+
+        var _computeMiter = computeMiter(tangent, vec2.create(), lineA, lineB, this.thickness),
+            _computeMiter2 = _slicedToArray(_computeMiter, 2),
+            miterLen = _computeMiter2[0],
+            miter = _computeMiter2[1]; // normal(tmp, lineA)
+        // get orientation
+
+
+        var flip = vec2.dot(tangent, this.normal) < 0 ? -1 : 1;
+        this.extrusions(positions, normals, cur, miter, miterLen, this.totalDistance);
+        indices.push.apply(indices, _toConsumableArray(this.lastFlip === 1 ? [index, index + 2, index + 3] : [index + 2, index + 1, index + 3]));
+        flip = -1; // the miter is now the normal for our next join
+
+        vec2.copy(this.normal, miter);
+        count += 2;
+        this.lastFlip = flip;
+      }
+
+      return count;
+    }
+  }, {
+    key: "segment_gaode2",
+    value: function segment_gaode2(complex, index, last, cur, next, originLast, originCur, // eslint-disable-next-line @typescript-eslint/no-unused-vars
+    originNext) {
+      var count = 0;
+      var indices = complex.indices;
+      var positions = complex.positions;
+      var normals = complex.normals;
+      var capSquare = this.cap === 'square';
+      var joinBevel = this.join === 'bevel';
+      var flatCur = aProjectFlat([originCur[0], originCur[1]]);
+      var flatLast = aProjectFlat([originLast[0], originLast[1]]); // @ts-ignore
+
+      direction(lineA, cur, last);
+      var segmentDistance = 0;
+
+      if (this.dash) {
+        // @ts-ignore
+        segmentDistance = this.lineSegmentDistance(flatCur, flatLast);
+        this.totalDistance += segmentDistance;
+      }
+
+      if (!this.normal) {
+        this.normal = vec2.create();
+        computeNormal(this.normal, lineA);
+      }
+
+      if (!this.started) {
+        this.started = true; // if the end cap is type square, we can just push the verts out a bit
+
+        if (capSquare) {
+          // vec2.scaleAndAdd(capEnd, last, lineA, -this.thickness);
+          var out1 = vec2.create();
+          var out2 = vec2.create();
+          vec2.add(out1, this.normal, lineA);
+          vec2.add(out2, this.normal, lineA);
+          normals.push(out2[0], out2[1], 0);
+          normals.push(out1[0], out1[1], 0);
+          positions.push(last[0], last[1], last[2] | 0, this.totalDistance - segmentDistance, -this.thickness, last[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          positions.push(last[0], last[1], last[2] | 0, this.totalDistance - segmentDistance, this.thickness, last[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          this.currentIndex++;
+        } else {
+          this.extrusions(positions, normals, last, this.normal, this.thickness, this.totalDistance - segmentDistance);
+        }
+      }
+
+      indices.push(index + 0, index + 1, index + 2);
+
+      if (!next) {
+        computeNormal(this.normal, lineA);
+
+        if (capSquare) {
+          var _out = vec2.create();
+
+          var _out2 = vec2.create();
+
+          vec2.sub(_out2, lineA, this.normal);
+          vec2.add(_out, lineA, this.normal);
+          normals.push(_out2[0], _out2[1], 0);
+          normals.push(_out[0], _out[1], 0);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, this.thickness, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, this.thickness, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          this.currentIndex++;
+        } else {
+          this.extrusions(positions, normals, cur, this.normal, this.thickness, this.totalDistance);
+        }
+
+        indices.push.apply(indices, _toConsumableArray(this.lastFlip === 1 ? [index, index + 2, index + 3] : [index + 2, index + 1, index + 3]));
+        count += 2;
+      } else {
+        // @ts-ignore
+        if (isPointEqual(cur, next)) {
+          vec2.add( // @ts-ignore
+          next, // @ts-ignore
+          cur, vec2.normalize( // @ts-ignore
+          next, // @ts-ignore
+          vec2.subtract(next, cur, last)));
+        } // @ts-ignore
+
+
+        direction(lineB, next, cur); // stores tangent & miter
+
+        var _computeMiter3 = computeMiter(tangent, vec2.create(), lineA, lineB, this.thickness),
+            _computeMiter4 = _slicedToArray(_computeMiter3, 2),
+            miterLen = _computeMiter4[0],
+            miter = _computeMiter4[1]; // normal(tmp, lineA)
+        // get orientation
+
+
+        var flip = vec2.dot(tangent, this.normal) < 0 ? -1 : 1;
+        var bevel = joinBevel;
+
+        if (!bevel && this.join === 'miter') {
+          var limit = miterLen;
+
+          if (limit > this.miterLimit) {
+            bevel = true;
+          }
+        }
+
+        if (bevel) {
+          normals.push(this.normal[0], this.normal[1], 0);
+          normals.push(miter[0], miter[1], 0);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, -this.thickness * flip, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, this.thickness * flip, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          this.currentIndex++;
+          indices.push.apply(indices, _toConsumableArray(this.lastFlip !== -flip ? [index, index + 2, index + 3] : [index + 2, index + 1, index + 3])); // now add the bevel triangle
+
+          indices.push(index + 2, index + 3, index + 4);
+          computeNormal(tmp, lineB);
+          vec2.copy(this.normal, tmp); // store normal for next round
+
+          normals.push(this.normal[0], this.normal[1], 0);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, -this.thickness * flip, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          this.currentIndex++;
+          count += 3;
+        } else {
+          this.extrusions(positions, normals, cur, miter, miterLen, this.totalDistance);
+          indices.push.apply(indices, _toConsumableArray(this.lastFlip === 1 ? [index, index + 2, index + 3] : [index + 2, index + 1, index + 3]));
+          flip = -1; // the miter is now the normal for our next join
+
+          vec2.copy(this.normal, miter);
+          count += 2;
+        }
+
+        this.lastFlip = flip;
+      }
+
+      return count;
+    }
+  }, {
+    key: "segment",
+    value: function segment(complex, index, last, cur, next) {
+      var count = 0;
+      var indices = complex.indices;
+      var positions = complex.positions;
+      var normals = complex.normals;
+      var capSquare = this.cap === 'square';
+      var joinBevel = this.join === 'bevel';
+      var flatCur = aProjectFlat([cur[0], cur[1]]);
+      var flatLast = aProjectFlat([last[0], last[1]]); // @ts-ignore
+
+      direction(lineA, flatCur, flatLast);
+      var segmentDistance = 0;
+
+      if (this.dash) {
+        // @ts-ignore
+        segmentDistance = this.lineSegmentDistance(flatCur, flatLast);
+        this.totalDistance += segmentDistance;
+      }
+
+      if (!this.normal) {
+        this.normal = vec2.create();
+        computeNormal(this.normal, lineA);
+      }
+
+      if (!this.started) {
+        this.started = true; // if the end cap is type square, we can just push the verts out a bit
+
+        if (capSquare) {
+          // vec2.scaleAndAdd(capEnd, last, lineA, -this.thickness);
+          var out1 = vec2.create();
+          var out2 = vec2.create();
+          vec2.add(out1, this.normal, lineA);
+          vec2.add(out2, this.normal, lineA);
+          normals.push(out2[0], out2[1], 0);
+          normals.push(out1[0], out1[1], 0);
+          positions.push(last[0], last[1], last[2] | 0, this.totalDistance - segmentDistance, -this.thickness, last[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          positions.push(last[0], last[1], last[2] | 0, this.totalDistance - segmentDistance, this.thickness, last[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          this.currentIndex++; // this.extrusions(positions, normals, last, out, this.thickness);
+          // last = capEnd;
+        } else {
+          this.extrusions(positions, normals, last, this.normal, this.thickness, this.totalDistance - segmentDistance);
+        }
+      }
+
+      indices.push(index + 0, index + 1, index + 2);
+
+      if (!next) {
+        computeNormal(this.normal, lineA);
+
+        if (capSquare) {
+          // vec2.scaleAndAdd(capEnd, cur, lineA, this.thickness);
+          // cur = capEnd;
+          var _out3 = vec2.create();
+
+          var _out4 = vec2.create();
+
+          vec2.sub(_out4, lineA, this.normal);
+          vec2.add(_out3, lineA, this.normal); // this.extrusions(positions, normals, cur, out, this.thickness);
+
+          normals.push(_out4[0], _out4[1], 0);
+          normals.push(_out3[0], _out3[1], 0);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, this.thickness, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, this.thickness, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          this.currentIndex++;
+        } else {
+          this.extrusions(positions, normals, cur, this.normal, this.thickness, this.totalDistance);
+        } // this.extrusions(positions, normals, cur, this.normal, this.thickness);
+
+
+        indices.push.apply(indices, _toConsumableArray(this.lastFlip === 1 ? [index, index + 2, index + 3] : [index + 2, index + 1, index + 3]));
+        count += 2;
+      } else {
+        var flatNext = aProjectFlat([next[0], next[1]]);
+
+        if (isPointEqual(flatCur, flatNext)) {
+          vec2.add(flatNext, flatCur, vec2.normalize(flatNext, vec2.subtract(flatNext, flatCur, flatLast)));
+        }
+
+        direction(lineB, flatNext, flatCur); // stores tangent & miter
+
+        var _computeMiter5 = computeMiter(tangent, vec2.create(), lineA, lineB, this.thickness),
+            _computeMiter6 = _slicedToArray(_computeMiter5, 2),
+            miterLen = _computeMiter6[0],
+            miter = _computeMiter6[1]; // normal(tmp, lineA)
+        // get orientation
+
+
+        var flip = vec2.dot(tangent, this.normal) < 0 ? -1 : 1;
+        var bevel = joinBevel;
+
+        if (!bevel && this.join === 'miter') {
+          var limit = miterLen;
+
+          if (limit > this.miterLimit) {
+            bevel = true;
+          }
+        }
+
+        if (bevel) {
+          normals.push(this.normal[0], this.normal[1], 0);
+          normals.push(miter[0], miter[1], 0);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, -this.thickness * flip, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, this.thickness * flip, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          this.currentIndex++;
+          indices.push.apply(indices, _toConsumableArray(this.lastFlip !== -flip ? [index, index + 2, index + 3] : [index + 2, index + 1, index + 3])); // now add the bevel triangle
+
+          indices.push(index + 2, index + 3, index + 4);
+          computeNormal(tmp, lineB);
+          vec2.copy(this.normal, tmp); // store normal for next round
+
+          normals.push(this.normal[0], this.normal[1], 0);
+          positions.push(cur[0], cur[1], cur[2] | 0, this.totalDistance, -this.thickness * flip, cur[2] | 0);
+          this.complex.indexes.push(this.currentIndex);
+          this.currentIndex++;
+          count += 3;
+        } else {
+          this.extrusions(positions, normals, cur, miter, miterLen, this.totalDistance);
+          indices.push.apply(indices, _toConsumableArray(this.lastFlip === 1 ? [index, index + 2, index + 3] : [index + 2, index + 1, index + 3]));
+          flip = -1; // the miter is now the normal for our next join
+
+          vec2.copy(this.normal, miter);
+          count += 2;
+        }
+
+        this.lastFlip = flip;
+      }
+
+      return count;
+    }
+  }, {
+    key: "extrusions",
+    value: function extrusions(positions, normals, point, // 顶点
+    normal, // 法向量
+    thickness, // 高度
+    distanceRadio) {
+      normals.push(normal[0], normal[1], 0);
+      normals.push(normal[0], normal[1], 0);
+      positions.push(point[0], point[1], point[2] | 0, distanceRadio, -thickness, point[2] | 0);
+      this.complex.indexes.push(this.currentIndex);
+      positions.push(point[0], point[1], point[2] | 0, distanceRadio, thickness, point[2] | 0);
+      this.complex.indexes.push(this.currentIndex);
+      this.currentIndex++;
+    }
+  }, {
+    key: "lineSegmentDistance",
+    value: function lineSegmentDistance(b1, a1) {
+      var dx = a1[0] - b1[0];
+      var dy = a1[1] - b1[1];
+      return Math.sqrt(dx * dx + dy * dy);
+    }
+  }]);
+
+  return ExtrudePolyline;
+}();
+
+export { ExtrudePolyline as default };

package/es/utils/grid-index.d.ts

@@ -0,0 +1,28 @@
+declare type CallBack = (...args: any[]) => any;
+/**
+ * 网格索引，相比 @mapbox/grid-index，在简单计算碰撞检测结果时效率更高
+ * @see https://zhuanlan.zhihu.com/p/74373214
+ */
+declare class GridIndex {
+    private boxCells;
+    private xCellCount;
+    private yCellCount;
+    private boxKeys;
+    private bboxes;
+    private width;
+    private height;
+    private xScale;
+    private yScale;
+    private boxUid;
+    constructor(width: number, height: number, cellSize: number);
+    insert(key: any, x1: number, y1: number, x2: number, y2: number): void;
+    query(x1: number, y1: number, x2: number, y2: number, predicate?: CallBack): boolean | any[];
+    hitTest(x1: number, y1: number, x2: number, y2: number, predicate?: CallBack): boolean | any[];
+    private insertBoxCell;
+    private queryHitTest;
+    private queryCell;
+    private forEachCell;
+    private convertToXCellCoord;
+    private convertToYCellCoord;
+}
+export default GridIndex;