# package haxe.ds

.. | |
---|---|

ArraySort | ArraySort provides a stable implementation of merge sort through its |

BalancedTree | BalancedTree allows key-value mapping with arbitrary keys, as long as they
can be ordered. By default, |

Either | Either represents values which are either of type |

EnumValueMap | EnumValueMap allows mapping of enum value keys to arbitrary values. |

GenericCell | A cell of |

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 |

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 |

UnsafeStringMap | This is similar to |

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. |