openrs2/org.openrs2.util.collect/DisjointSet

DisjointSet

interface DisjointSet<T> : Iterable<DisjointSet.Partition<T>>

A data structure containing a set of elements partitioned into a number of non-overlapping subsets. New elements belong to singleton subsets. The union function combines two subsets together into a single larger subset.

Inheritors

ForestDisjointSet

Types

Partition

interface Partition<T> : Iterable<T>

Properties

elements

abstract val elements: Int

partitions

abstract val partitions: Int

Functions

add

abstract fun add(x: T): DisjointSet.Partition<T>

forEach

open fun forEach(p0: Consumer<in DisjointSet.Partition<T>>)

get

abstract operator fun get(x: T): DisjointSet.Partition<T>?

iterator

abstract operator fun iterator(): Iterator<DisjointSet.Partition<T>>

spliterator

open fun spliterator(): Spliterator<DisjointSet.Partition<T>>

union

abstract fun union(x: DisjointSet.Partition<T>, y: DisjointSet.Partition<T>)