76 |
|
register PACKHEAD *csm; |
77 |
|
register int i; |
78 |
|
/* search for common members */ |
79 |
– |
qsort((char *)clist, nents, sizeof(PACKHEAD), beamidcmp); |
79 |
|
for (csm = clist+nents; csm-- > clist; ) |
80 |
|
csm->nc = -1; |
81 |
+ |
qsort((char *)clist, nents, sizeof(PACKHEAD), beamidcmp); |
82 |
|
for (i = 0; i < complen; i++) { |
83 |
|
csm = (PACKHEAD *)bsearch((char *)(complist+i), (char *)clist, |
84 |
|
nents, sizeof(PACKHEAD), beamidcmp); |
249 |
|
complist[k].nr = frac*complist[k].nr + 0.5; |
250 |
|
listpos = 0; lastin = -1; /* perform initial sort */ |
251 |
|
sortcomplist(); |
252 |
+ |
/* no view vicinity */ |
253 |
+ |
myeye.rng = 0; |
254 |
|
} |
255 |
|
|
256 |
|
|
306 |
|
} else if (i < complen-1) { |
307 |
|
list2 = (PACKHEAD *)realloc((char *)complist, |
308 |
|
(i+1)*sizeof(PACKHEAD)); |
309 |
< |
if (list2 != NULL) { |
309 |
> |
if (list2 != NULL) |
310 |
|
complist = list2; |
311 |
< |
complen = i+1; |
310 |
< |
} |
311 |
> |
complen = i+1; |
312 |
|
} |
313 |
|
listpos = 0; lastin = i; |
314 |
|
} |