142 |
|
qsort(div, ndivs, sizeof(AMBSAMP), ambcmp); /* sort divs */ |
143 |
|
/* super-sample */ |
144 |
|
for (i = ns; i > 0; i--) { |
145 |
< |
copystruct(&dnew, div); |
145 |
> |
dnew = *div; |
146 |
|
if (divsample(&dnew, &hemi, r) < 0) |
147 |
|
goto oopsy; |
148 |
|
/* reinsert */ |
149 |
|
dp = div; |
150 |
|
j = ndivs < i ? ndivs : i; |
151 |
|
while (--j > 0 && dnew.k < dp[1].k) { |
152 |
< |
copystruct(dp, dp+1); |
152 |
> |
*dp = *(dp+1); |
153 |
|
dp++; |
154 |
|
} |
155 |
< |
copystruct(dp, &dnew); |
155 |
> |
*dp = dnew; |
156 |
|
} |
157 |
|
if (pg != NULL || dg != NULL) /* restore order */ |
158 |
|
qsort(div, ndivs, sizeof(AMBSAMP), ambnorm); |