Really need to be able to reset the shape! Otherwise, if the points ever go to zero, we've lost it, and can't resize.

Extremely simplistic hash function which probably ought to be replaced with wxStringHash::stringHash().

Extremely simplistic hash function which probably ought to be replaced with wxStringHash::stringHash().

Extremely simplistic hash function which probably ought to be replaced with wxStringHash::stringHash().

Extremely simplistic hash function which probably ought to be replaced with wxStringHash::stringHash().

assign one rect to another

Assign each object to the nearest cluster, return the cost.

Used by betai: Evaluates continued fraction for incomplete beta function by modified Lentz's method (x5.2).

Returns the incomplete beta function Ix(a; b)

Required initialization method

Assume input b and v is sorted. If not, can sort with std::sort(v.begin(), v.end()) We assume that b and v are sorted in ascending order and are v

h Current object to swap with any medoid. mnum Medoid number to swap with h. Scratch assignment to fill. return Cost change

Compute non-edge forces using Barnes-Hut algorithm

Subroutine */

Subroutine */

Subroutine */

-- For Error messaging, call the "a" routines at the bottom of ./loessc.c : */ Subroutine */

Subroutine */