Class Index
comb.array
Utilities for Arrayscomb.characters
comb characterscomb.collections
Various collectionscomb.collections.AnderssonTree
Andersson Trees are a version of a balanced Binary tree, while similar to RedBlack Trees the balancing is not as strict.
comb.collections.AVLTree
An AVL tree is a self-balancing binary search tree.
comb.collections.BinaryTree
A Search tree that maintains the following properties
- The left subtree of a node contains only nodes with keys less than the node's key.
comb.collections.Collection
Base class for all collectionscomb.collections.HashTable
Implementation of a HashTable for javascript.
comb.collections.Iterable
Base class for all collectionscomb.collections.MaxHeap
Min Heap implementation, lowest value in heap is always at the root.
comb.collections.MinHeap
Min Heap implementation, lowest value in heap is always at the root.
comb.collections.Pool
Base class for a pool.comb.collections.PriorityQueue
PriorityQueue Implementation where the value with the highest priority moves to the front Priority starts at 0, and the greatest value being the lowest priority;comb.collections.Queue
FIFO Data structure
comb.collections.RedBlackTree
A RedBlack tree is a form of a self balancing binary tree.
comb.collections.Stack
LIFO Data structure