TreeSet

class TreeSet<V : Comparable<V>> : RedBlackTree<V, Unit> , MutableSortedSet<V>

A MutableSortedSet implementation backed by a Red/Black Tree, with each map entry being represented as a node. Search, insertion, and removal all run in O(log n) time thanks to the properties of the tree.

Removing map entries while iterating is not allowed, and using MutableIterator.remove will throw an exception.

Constructors

TreeSet

constructor()

Properties

size

open override val size: Int

Functions

add

open override fun add(element: V): Boolean

addAll

open override fun addAll(elements: Collection<V>): Boolean

clear

open override fun clear()

contains

open operator override fun contains(element: V): Boolean

containsAll

open override fun containsAll(elements: Collection<V>): Boolean

isEmpty

open override fun isEmpty(): Boolean

iterator

open operator override fun iterator(): MutableIterator<V>

remove

open override fun remove(element: V): Boolean

removeAll

open override fun removeAll(elements: Collection<V>): Boolean

retainAll

open override fun retainAll(elements: Collection<V>): Boolean