ArraySort provides a stable implementation of merge sort through its
BalancedTree allows key-value mapping with arbitrary keys, as long as they
can be ordered. By default,
Either represents values which are either of type
EnumValueMap allows mapping of enum value keys to arbitrary values.
A cell of
A stack of elements.
HashMap allows mapping of hashable objects to arbitrary values.
IntMap allows mapping of Int keys to arbitrary values.
A linked-list of elements. The list is composed of element container objects that are chained together. It is optimized so that adding or removing an element does not imply copying the whole list content every time.
ListSort provides a stable implementation of merge sort through its
Map allows key to value mapping for arbitrary value types, and many key types.
ObjectMap allows mapping of object keys to arbitrary values.
An Option is a wrapper type which can either have a value (Some) or not a value (None).
StringMap allows mapping of String keys to arbitrary values.
A tree node of
This is similar to
A Vector is a storage of fixed size. It can be faster than Array on some targets, and is never slower.
WeakMap allows mapping of object keys to arbitrary values.