Node property representing the many side of a node relation. Provides set functionality. The iterator supports remove.

Constructors

Link copied to clipboard
constructor()

Types

Link copied to clipboard
inner class NodeSetIterator(val parentIterator: MutableIterator<T>) : MutableIterator<T>

Iterator which supports remove and delegates all other functionality to parent iterator

Properties

Link copied to clipboard
open override val isEmpty: Boolean
Link copied to clipboard
open override val size: Int

Functions

Link copied to clipboard
open override fun add(element: T): Boolean
Link copied to clipboard
open fun addAll(c: Collection<out T?>): Boolean
Link copied to clipboard
open fun clear()
Link copied to clipboard
open operator override fun contains(element: T): Boolean
Link copied to clipboard
Link copied to clipboard
open fun isEmpty(): Boolean
Link copied to clipboard
fun <T> Collection<T>.iterateGraph(action: (T) -> Collection<T>)

Helper function to iterate over a graph The Collection on which it is called is treated as the set of starting nodes action is called for each node in the graph exactly once, and returns a set of nodes to iterate over. This returned set of nodes may contain duplicates, or nodes which have already been iterated over.

Link copied to clipboard
open operator override fun iterator(): MutableIterator<T>
Link copied to clipboard
open override fun remove(element: T): Boolean
Link copied to clipboard
open fun removeAll(c: Collection<T?>): Boolean
Link copied to clipboard
open fun retainAll(c: Collection<T?>): Boolean
Link copied to clipboard
open fun toArray(): Array<out Any?>?
open fun <T : Any?> toArray(a: Array<out T?>?): Array<out T?>?