SweepQueue

SweepQueue is a data structure designed to manage and process events in a sweep line algorithm.

It maintains a priority queue to handle events based on their keys, and a set to track currently active elements.

Parameters

T

The type of the values stored in the events processed by this queue.

Constructors

Link copied to clipboard
constructor()

Types

Link copied to clipboard
object Companion
Link copied to clipboard
class Event<T>

Functions

Link copied to clipboard
fun active(): Set<T>
Link copied to clipboard
fun add(value: T, a: Double, b: Double)
Link copied to clipboard
operator fun next(): SweepQueue.Event<T>
Link copied to clipboard
fun peek(): Double
Link copied to clipboard
fun take(): T?