ideal • library • elements • ordered

A finite set of elements with an explicit ordering. Unlike a list, it is guaranteed not to have duplicate elements. Attempting to insert a duplicate element will trigger an assertion failure.

interface ordered set[combivariant value element]

subtypes collection[element]

readonly subtypes readonly list[element], readonly set[element]

immutable subtypes immutable list[element], immutable set[element]

deeply immutable subtypes deeply immutable list[element], deeply immutable set[element]

void append(element the element)

void append all(readonly list[element] the list)

void prepend(element the element)

immutable ordered set[element] frozen copy() pure