stella v0.3.0 API Reference

Modules

Documentation for Ackermann.

Documentation for Cartesian.

Documentation for Easing.

Documentation for Heap data structure

Documentation for Isometric.

Documentation for Number.

Documentation for PriorityQueue data structure implemented on general balanced trees by Arne Andersson These have no storage overhead compared to unbalanced binary trees, and their performance is better than AVL trees.

Documentation for Queue data structure

Documentation for Quicksort algorithm

Documentation for Stack data structure

Documentation for Time.

Documentation for Vector 2D.

Documentation for Vector 3D.