node-red-contrib-tak-registration
Version:
A Node-RED node to register to TAK and to help wrap files as datapackages to send to TAK
93 lines (89 loc) • 3.25 kB
JavaScript
import hasInterface from '../../../../../hasInterface'
import MonotoneChain from './MonotoneChain'
import SweepLineEvent from './SweepLineEvent'
import EdgeSetIntersector from './EdgeSetIntersector'
import Collections from '../../../../../java/util/Collections'
import SegmentIntersector from './SegmentIntersector'
import ArrayList from '../../../../../java/util/ArrayList'
import List from '../../../../../java/util/List'
export default class SimpleMCSweepLineIntersector extends EdgeSetIntersector {
constructor() {
super()
SimpleMCSweepLineIntersector.constructor_.apply(this, arguments)
}
static constructor_() {
this.events = new ArrayList()
this.nOverlaps = null
}
prepareEvents() {
Collections.sort(this.events)
for (let i = 0; i < this.events.size(); i++) {
const ev = this.events.get(i)
if (ev.isDelete())
ev.getInsertEvent().setDeleteEventIndex(i)
}
}
computeIntersections() {
if (arguments.length === 1) {
const si = arguments[0]
this.nOverlaps = 0
this.prepareEvents()
for (let i = 0; i < this.events.size(); i++) {
const ev = this.events.get(i)
if (ev.isInsert())
this.processOverlaps(i, ev.getDeleteEventIndex(), ev, si)
if (si.isDone())
break
}
} else if (arguments.length === 3) {
if (arguments[2] instanceof SegmentIntersector && (hasInterface(arguments[0], List) && hasInterface(arguments[1], List))) {
const edges0 = arguments[0], edges1 = arguments[1], si = arguments[2]
this.addEdges(edges0, edges0)
this.addEdges(edges1, edges1)
this.computeIntersections(si)
} else if (typeof arguments[2] === 'boolean' && (hasInterface(arguments[0], List) && arguments[1] instanceof SegmentIntersector)) {
const edges = arguments[0], si = arguments[1], testAllSegments = arguments[2]
if (testAllSegments) this.addEdges(edges, null); else this.addEdges(edges)
this.computeIntersections(si)
}
}
}
addEdge(edge, edgeSet) {
const mce = edge.getMonotoneChainEdge()
const startIndex = mce.getStartIndexes()
for (let i = 0; i < startIndex.length - 1; i++) {
const mc = new MonotoneChain(mce, i)
const insertEvent = new SweepLineEvent(edgeSet, mce.getMinX(i), mc)
this.events.add(insertEvent)
this.events.add(new SweepLineEvent(mce.getMaxX(i), insertEvent))
}
}
processOverlaps(start, end, ev0, si) {
const mc0 = ev0.getObject()
for (let i = start; i < end; i++) {
const ev1 = this.events.get(i)
if (ev1.isInsert()) {
const mc1 = ev1.getObject()
if (!ev0.isSameLabel(ev1)) {
mc0.computeIntersections(mc1, si)
this.nOverlaps++
}
}
}
}
addEdges() {
if (arguments.length === 1) {
const edges = arguments[0]
for (let i = edges.iterator(); i.hasNext(); ) {
const edge = i.next()
this.addEdge(edge, edge)
}
} else if (arguments.length === 2) {
const edges = arguments[0], edgeSet = arguments[1]
for (let i = edges.iterator(); i.hasNext(); ) {
const edge = i.next()
this.addEdge(edge, edgeSet)
}
}
}
}