27 int band, c, hole, move, p;
29 for (c = 0; c < C->nclasses; c++)
33 for (hole = 0; hole < C->nclasses; hole++)
34 if (C->count[hole] < minsize)
38 if (hole >= C->nclasses)
41 for (move = hole; move < C->nclasses; move++)
42 if (C->count[move] >= minsize) {
43 C->reclass[move] = hole;
44 C->count[hole] = C->count[move];
45 for (band = 0; band < C->nbands; band++)
46 C->sum[band][hole] = C->sum[band][move];
50 C->reclass[move] = -1;
52 for (p = 0; p < C->npoints; p++)
53 C->class[p] = C->reclass[C->class[p]];