size is constant

Returns number of points in dataset */

swap (note: linear complexity in N, constant for given instantiation)

* same as other method, just that x/y are composed of two parts, the first 4 elements are in x4/y4, the last 6 in x6/y6. */

* Computes the inde memory usage * Returns: memory used by the index */

Returns the length of each point in the dataset */

* Find the worst result (furtherest neighbor) without copying or sorting * Pre-conditions: size() > 0 */

Standard destructor */

* Destructor. Frees all the memory allocated in this pool. */