package haxe.ds

..
ArraySort

ArraySort provides a stable implementation of merge sort through its sort method. It should be used instead of Array.sort in cases where the order of equal elements has to be retained on all targets.

BalancedTree

BalancedTree allows key-value mapping with arbitrary keys, as long as they can be ordered. By default, Reflect.compare is used in the compare method, which can be overridden in subclasses.

Either

Either represents values which are either of type L (Left) or type R (Right).

EnumValueMap

EnumValueMap allows mapping of enum value keys to arbitrary values.

GenericCell

A cell of haxe.ds.GenericStack.

GenericStack

A stack of elements.

HashMap

HashMap allows mapping of hashable objects to arbitrary values.

IntMap

IntMap allows mapping of Int keys to arbitrary values.

ListSort

ListSort provides a stable implementation of merge sort through its sort method. It has a O(N.log(N)) complexity and does not require additional memory allocation.

ObjectMap

ObjectMap allows mapping of object keys to arbitrary values.

Option

An Option is a wrapper type which can either have a value (Some) or not a value (None).

StringMap

StringMap allows mapping of String keys to arbitrary values.

TreeNode

A tree node of haxe.ds.BalancedTree.

UnsafeStringMap

This is similar to StringMap excepts that it does not sanitize the keys. As a result, it will be faster to access the map for reading, but it might fail with some reserved keys such as constructor or prototype.

Vector

A Vector is a storage of fixed size. It can be faster than Array on some targets, and is never slower.

WeakMap

WeakMap allows mapping of object keys to arbitrary values.