Helper accessor to the dataset points:

* convert from degree to radian */

how many rows/cols does the block at block-row / block-column r has?

dimension of the estimated state belonging to this node

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist. *

* Returns whether all the possible values between min and max were * already given. If get() is called when empty() is true, the behaviour * is

get features

* fill the CCS arrays of a matrix, arrays have to be allocated beforehand */

Frees the previously-built index. Automatically called within buildIndex(). */

* Compares the scores of two results * @return true iff a.Score > b.Score */

* Returns true iff a.Score >= b.Score * @param a * @param b * @return true iff a.Score >= b.Score */

* Returns true iff a.Score >= s * @param a * @param s * @return true iff a.Score >= s */

* Returns the branching factor of the tree (k) * @return k */

* Returns the depth levels of the tree (L) * @return L */

* Returns the di levels when using direct index * @return di levels */

* writes the estimater to an array of double * @returns true on success */

* writes the estimate to an array of double * @returns true on success */

* Returns the scoring method * @return scoring method */

* Returns the timestamp in seconds and microseconds * @param secs seconds * @param usecs microseconds */

* Returns the weighting method * @return weighting method */

* Compares the score of two results * @param a * @param b * @return true iff a.Score > b.Score */

returns the id

Make sure the auxiliary list \a vind has the same size than the current dataset, and re-generate if size has changed. */