| 242 |
|
double |
| 243 |
|
get_threshold(const TRITREE *tree) |
| 244 |
|
{ |
| 245 |
+ |
long samptotal = 0; |
| 246 |
|
long exphisto[256]; |
| 246 |
– |
long samptotal; |
| 247 |
|
int i; |
| 248 |
|
/* compute sample histogram */ |
| 249 |
< |
memset((void *)exphisto, 0, sizeof(exphisto)); |
| 249 |
> |
memset(exphisto, 0, sizeof(exphisto)); |
| 250 |
|
for (i = 0; i < NTRUNKBR; i++) |
| 251 |
|
get_ehisto(&tree->kid[i], exphisto); |
| 252 |
|
/* use 98th percentile */ |
| 355 |
|
if (remaining) |
| 356 |
|
return; |
| 357 |
|
/* consolidate empties */ |
| 358 |
< |
free((void *)node->kid); node->kid = NULL; |
| 358 |
> |
free(node->kid); node->kid = NULL; |
| 359 |
|
copycolr(node->val, blkclr); |
| 360 |
|
node->sd = node->gdv[0]; /* doesn't really matter */ |
| 361 |
|
} |
| 387 |
|
if (fdir2diff(thisp->sd,cent) <= maxr2) { |
| 388 |
|
LOSTLIGHT *mynext = thisp->next; |
| 389 |
|
addcolor(intens, thisp->intens); |
| 390 |
< |
free((void *)thisp); |
| 390 |
> |
free(thisp); |
| 391 |
|
lastp->next = mynext; |
| 392 |
|
} else |
| 393 |
|
lastp = thisp; |
| 457 |
|
thisethresh); |
| 458 |
|
if (normalize(vsum) == .0) |
| 459 |
|
break; |
| 460 |
< |
movedist = acos(DOT(vsum,curcent)); |
| 460 |
> |
movedist = Acos(DOT(vsum,curcent)); |
| 461 |
|
if (movedist > growstep) { |
| 462 |
|
VSUB(vsum, vsum, curcent); |
| 463 |
|
movedist = growstep/VLEN(vsum); |