@mkerkstra/jsts-cjs/org/locationtech/jts/algorithm/locate/IndexedPointInAreaLocator.js

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

import hasInterface from '../../../../../hasInterface.js'
import IllegalArgumentException from '../../../../../java/lang/IllegalArgumentException.js'
import ItemVisitor from '../../index/ItemVisitor.js'
import PointOnGeometryLocator from './PointOnGeometryLocator.js'
import LinearRing from '../../geom/LinearRing.js'
import SortedPackedIntervalRTree from '../../index/intervalrtree/SortedPackedIntervalRTree.js'
import LineSegment from '../../geom/LineSegment.js'
import LinearComponentExtracter from '../../geom/util/LinearComponentExtracter.js'
import ArrayListVisitor from '../../index/ArrayListVisitor.js'
import RayCrossingCounter from '../RayCrossingCounter.js'
import Polygonal from '../../geom/Polygonal.js'
import ArrayList from '../../../../../java/util/ArrayList.js'
export default class IndexedPointInAreaLocator {
  constructor() {
    IndexedPointInAreaLocator.constructor_.apply(this, arguments)
  }
  static constructor_() {
    this._geom = null
    this._index = null
    const g = arguments[0]
    if (!(hasInterface(g, Polygonal) || g instanceof LinearRing)) throw new IllegalArgumentException('Argument must be Polygonal or LinearRing')
    this._geom = g
  }
  locate(p) {
    if (this._index === null) {
      this._index = new IntervalIndexedGeometry(this._geom)
      this._geom = null
    }
    const rcc = new RayCrossingCounter(p)
    const visitor = new SegmentVisitor(rcc)
    this._index.query(p.y, p.y, visitor)
    return rcc.getLocation()
  }
  get interfaces_() {
    return [PointOnGeometryLocator]
  }
}
class SegmentVisitor {
  constructor() {
    SegmentVisitor.constructor_.apply(this, arguments)
  }
  static constructor_() {
    this._counter = null
    const counter = arguments[0]
    this._counter = counter
  }
  visitItem(item) {
    const seg = item
    this._counter.countSegment(seg.getCoordinate(0), seg.getCoordinate(1))
  }
  get interfaces_() {
    return [ItemVisitor]
  }
}
class IntervalIndexedGeometry {
  constructor() {
    IntervalIndexedGeometry.constructor_.apply(this, arguments)
  }
  static constructor_() {
    this._isEmpty = false
    this._index = new SortedPackedIntervalRTree()
    const geom = arguments[0]
    if (geom.isEmpty()) this._isEmpty = true; else this.init(geom)
  }
  init(geom) {
    const lines = LinearComponentExtracter.getLines(geom)
    for (let i = lines.iterator(); i.hasNext(); ) {
      const line = i.next()
      const pts = line.getCoordinates()
      this.addLine(pts)
    }
  }
  addLine(pts) {
    for (let i = 1; i < pts.length; i++) {
      const seg = new LineSegment(pts[i - 1], pts[i])
      const min = Math.min(seg.p0.y, seg.p1.y)
      const max = Math.max(seg.p0.y, seg.p1.y)
      this._index.insert(min, max, seg)
    }
  }
  query() {
    if (arguments.length === 2) {
      const min = arguments[0], max = arguments[1]
      if (this._isEmpty) return new ArrayList()
      const visitor = new ArrayListVisitor()
      this._index.query(min, max, visitor)
      return visitor.getItems()
    } else if (arguments.length === 3) {
      const min = arguments[0], max = arguments[1], visitor = arguments[2]
      if (this._isEmpty) return null
      this._index.query(min, max, visitor)
    }
  }
}
IndexedPointInAreaLocator.SegmentVisitor = SegmentVisitor
IndexedPointInAreaLocator.IntervalIndexedGeometry = IntervalIndexedGeometry