@mkerkstra/jsts-cjs/org/locationtech/jts/index/bintree/Root.js

A CommonJS fork of JSTS: A JavaScript library of spatial predicates and functions for processing geometry

import NodeBase from './NodeBase.js'
import Node from './Node.js'
import IntervalSize from '../quadtree/IntervalSize.js'
import Assert from '../../util/Assert.js'
export default class Root extends NodeBase {
  constructor() {
    super()
  }
  insertContained(tree, itemInterval, item) {
    Assert.isTrue(tree.getInterval().contains(itemInterval))
    const isZeroArea = IntervalSize.isZeroWidth(itemInterval.getMin(), itemInterval.getMax())
    let node = null
    if (isZeroArea) node = tree.find(itemInterval); else node = tree.getNode(itemInterval)
    node.add(item)
  }
  isSearchMatch(interval) {
    return true
  }
  insert(itemInterval, item) {
    const index = NodeBase.getSubnodeIndex(itemInterval, Root.origin)
    if (index === -1) {
      this.add(item)
      return null
    }
    const node = this._subnode[index]
    if (node === null || !node.getInterval().contains(itemInterval)) {
      const largerNode = Node.createExpanded(node, itemInterval)
      this._subnode[index] = largerNode
    }
    this.insertContained(this._subnode[index], itemInterval, item)
  }
}
Root.origin = 0.0