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.

EnumValueMap

EnumValueMap allows mapping of enum value keys to arbitrary values.

HashMap

HashMap allows mapping of hashable objects to arbitrary values.

IntMap

IntMap allows mapping of Int keys to arbitrary values.

ObjectMap

ObjectMap allows mapping of object keys to arbitrary values.

StringMap

StringMap allows mapping of String keys to arbitrary values.

TreeNode

A tree node of haxe.ds.BalancedTree.

Vector

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