Constructs and returns a new QR decomposition object; computed by Householder reflections;
The decomposed matrices can be retrieved via instance methods of the returned decomposition object.
1-dimensional non-rebinnable bin holding double elements with scalable quantile operations defined upon;
Using little main memory, quickly computes approximate quantiles over very large data sequences with and even without a-priori knowledge of the number of elements to be filled;
Conceptually a strongly lossily compressed multiset (or bag);
Guarantees to respect the worst case approximation error specified upon instance construction.
Sorts the matrix rows into ascending order, according to the natural ordering of the values computed by applying the given aggregation function to each row;
Particularly efficient when comparing expensive aggregates, because aggregates need not be recomputed time and again, as is the case for comparator based sorts.
Sorts the matrix rows into ascending order, according to the natural ordering of the matrix values in the virtual column aggregates;
Particularly efficient when comparing expensive aggregates, because aggregates need not be recomputed time and again, as is the case for comparator based sorts.