jsts/org/locationtech/jts/index/quadtree/Root.js

A JavaScript library of spatial predicates and functions for processing geometry

import Coordinate from '../../geom/Coordinate.js'
import NodeBase from './NodeBase.js'
import Node from './Node.js'
import IntervalSize from './IntervalSize.js'
import Assert from '../../util/Assert.js'
export default class Root extends NodeBase {
  constructor() {
    super()
  }
  insertContained(tree, itemEnv, item) {
    Assert.isTrue(tree.getEnvelope().contains(itemEnv))
    const isZeroX = IntervalSize.isZeroWidth(itemEnv.getMinX(), itemEnv.getMaxX())
    const isZeroY = IntervalSize.isZeroWidth(itemEnv.getMinY(), itemEnv.getMaxY())
    let node = null
    if (isZeroX || isZeroY) node = tree.find(itemEnv); else node = tree.getNode(itemEnv)
    node.add(item)
  }
  isSearchMatch(searchEnv) {
    return true
  }
  insert(itemEnv, item) {
    const index = NodeBase.getSubnodeIndex(itemEnv, Root.origin.x, Root.origin.y)
    if (index === -1) {
      this.add(item)
      return null
    }
    const node = this._subnode[index]
    if (node === null || !node.getEnvelope().contains(itemEnv)) {
      const largerNode = Node.createExpanded(node, itemEnv)
      this._subnode[index] = largerNode
    }
    this.insertContained(this._subnode[index], itemEnv, item)
  }
}
Root.origin = new Coordinate(0.0, 0.0)