A log linear implementation of CkMeans. It uses a divide-and-conquer algorithm to compute a row in the dynamic programming matrix in O(n lg n) time. The Simple Statistic's implementation was used to validate this implementation.
There is a better one (not implemented) using the SMAWK optimisation.
The limit function produces class breaks like the other implementations and binned puts all data values into their bins.
Create up to bins number of results using the given scale.
TBD
TBD
TBD
TBD
TBD
TBD
Return the values in Scale into the given number of bins. For example, 1 [3,3,3,4] -> 3 bins -> [[1], [3,3,3], [4]]