OrderedSet

kermeta::standard
Class OrderedSet[G] inherited from Set[G],
OrderedCollection[G]

An OrderedSet is a Set that contained ordered distinct elements

@CompilerIgnore "true"
@ScalaCompilerName "k2.standard.OrderedSet"

Method Summary

Void addAt(Integer)

Overrides OrderedCollection.addAt(Integer, G)
Adds element in the OrderedSet at rank index if the ordered set does
not already contain the element, does nothing otherwise



OrderedSet[G] append()

Builds and returns a new OrderedSet from current one with element
inserted in tail if not already present, otherwise returns
a copy of the current OrderedSet



Boolean equals(Object)

See OrderedCollection.equals(Object)



OrderedSet[G] insertAt(Integer)

Builds and returns a new OrderedSet from current one with element
inserted at rank index if it not already present, otherwise returns
a copy of the current OrderedSet
Raises IndexOutOfBound exception if provided index is lower than 0 or
larger than the size of the OrderedSet



OrderedSet[G] prepend()

Builds and returns a new OrderedSet from current one with element
inserted in head if not already present, otherwise returns
a copy of the current OrderedSet



OrderedSet[G] subSet(IntegerInteger)

Builds and returns a new OrderedSet composed of elements of current ordered
set from rank min (included) to rank max (excluded).
The order is preserved.
Raises IndexOutOfBound exception if min is negative, max is larger than
the size of the ordered set or min is larger than max

Method Summary
`Void`	`addAt(Integer)` Overrides OrderedCollection.addAt(Integer, G) Adds element in the OrderedSet at rank index if the ordered set does not already contain the element, does nothing otherwise
`OrderedSet[G]`	`append()` Builds and returns a new OrderedSet from current one with element inserted in tail if not already present, otherwise returns a copy of the current OrderedSet
`Boolean`	`equals(Object)` See OrderedCollection.equals(Object)
`OrderedSet[G]`	`insertAt(Integer)` Builds and returns a new OrderedSet from current one with element inserted at rank index if it not already present, otherwise returns a copy of the current OrderedSet Raises IndexOutOfBound exception if provided index is lower than 0 or larger than the size of the OrderedSet
`OrderedSet[G]`	`prepend()` Builds and returns a new OrderedSet from current one with element inserted in head if not already present, otherwise returns a copy of the current OrderedSet
`OrderedSet[G]`	`subSet(IntegerInteger)` Builds and returns a new OrderedSet composed of elements of current ordered set from rank min (included) to rank max (excluded). The order is preserved. Raises IndexOutOfBound exception if min is negative, max is larger than the size of the ordered set or min is larger than max

Details of operations

addAt

Void addAt[(Integer)

Overrides OrderedCollection.addAt(Integer, G)
Adds element in the OrderedSet at rank index if the ordered set does
not already contain the element, does nothing otherwise

@traceability_text_reference "file:/mnt/extradisk/builds/workspace/org.kermeta.language.library_master/org/kermeta/language/org.kermeta.language.library.standard/src/main/kmt/kermeta/standard/collections.kmt;18481;18544"

append

OrderedSet[G] append[()

Builds and returns a new OrderedSet from current one with element
inserted in tail if not already present, otherwise returns
a copy of the current OrderedSet

equals

Boolean equals[(Object)

See OrderedCollection.equals(Object)

insertAt

OrderedSet[G] insertAt[(Integer)

Builds and returns a new OrderedSet from current one with element
inserted at rank index if it not already present, otherwise returns
a copy of the current OrderedSet
Raises IndexOutOfBound exception if provided index is lower than 0 or
larger than the size of the OrderedSet

prepend

OrderedSet[G] prepend[()

Builds and returns a new OrderedSet from current one with element
inserted in head if not already present, otherwise returns
a copy of the current OrderedSet

subSet

OrderedSet[G] subSet[(IntegerInteger)

Builds and returns a new OrderedSet composed of elements of current ordered
set from rank min (included) to rank max (excluded).
The order is preserved.
Raises IndexOutOfBound exception if min is negative, max is larger than
the size of the ordered set or min is larger than max