API Reference stella v0.7.1

modules

Modules

Ackermann function is one of the simplest example of a total computable function that is not primitive recursive.

BST

Documentation for Binary search tree data structure.

Binary search is a search algorithm that finds the position of a target value within a sorted array.

Documentation for Bubble sort algorithm. All important informations about counting sort you can find on Wikipedia page.

Cartesian 2D and 3D plane

Documentation for Counting sort algorithm. All important informations about counting sort you can find at Wikipedia page.

Documentation for Easing.

The Fibonacci polynomials are a polynomial sequence which can be considered as a generalization of the Fibonacci numbers.

Documentation for Heap data structure

Documentation for Insertion sort algorithm. All important informations about counting sort you can find at Wikipedia page.

Documentation for Interval.

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 Quick sort algorithm. All important informations about counting sort you can find on Wikipedia page.

Documentation for Stack data structure

Documentation for Struct module.

Documentation for Time module.

Documentation for Vector 2D.

Documentation for Vector 3D.