Lines Matching defs:sortList
36 int *sortList;
39 sortList= new int [numArc+2];
40 sortList[0]= 0;
43 forwardList= sortList;
54 int holdArc, *sortList;
64 sortList= new int [numArc+2];
66 sortList[ii]= forwardList[ii];
68 sortList[ii]= ii;
69 sortList--;
75 holdArc= sortList[hired];
79 if (jj < numArc && ARC_COMPARE (sortList[jj], sortList[jj+1]) <= 0 )
81 if (ARC_COMPARE (holdArc, sortList[jj]) < 0) {
82 sortList[ii]= sortList[jj];
89 sortList[ii]= holdArc;
96 holdArc= sortList[retd];
97 sortList[retd]= sortList[1];
99 sortList[1]= holdArc;
105 if (jj < retd && ARC_COMPARE (sortList[jj], sortList[jj+1]) <= 0)
107 if (ARC_COMPARE (holdArc, sortList[jj]) < 0) {
108 sortList[ii]= sortList[jj];
115 sortList[ii]= holdArc;
117 sortList++;
121 forwardList= sortList;
134 int holdArc, *sortList;
144 sortList= forwardList;
145 sortList--;
151 holdArc= sortList[hired];
155 if (jj < numArc && ARC_COMPARE (sortList[jj], sortList[jj+1]) <= 0 )
157 if (ARC_COMPARE (holdArc, sortList[jj]) < 0) {
158 sortList[ii]= sortList[jj];
165 sortList[ii]= holdArc;
172 holdArc= sortList[retd];
173 sortList[retd]= sortList[1];
175 sortList[1]= holdArc;
181 if (jj < retd && ARC_COMPARE (sortList[jj], sortList[jj+1]) <= 0)
183 if (ARC_COMPARE (holdArc, sortList[jj]) < 0) {
184 sortList[ii]= sortList[jj];
191 sortList[ii]= holdArc;
193 sortList++;
195 forwardList= sortList;
232 int holdArc, *sortList;
235 sortList= new int [numArc+2];
236 sortList[0]= 0;
239 backwardList= sortList;
244 sortList= new int [numArc+2];
246 sortList[ii]= ii;
247 sortList--;
253 holdArc= sortList[hired];
257 if (jj < numArc && ARC_COMPARE_REV (sortList[jj], sortList[jj+1]) <= 0 )
259 if (ARC_COMPARE_REV (holdArc, sortList[jj]) < 0) {
260 sortList[ii]= sortList[jj];
267 sortList[ii]= holdArc;
274 holdArc= sortList[retd];
275 sortList[retd]= sortList[1];
277 sortList[1]= holdArc;
283 if (jj < retd && ARC_COMPARE_REV (sortList[jj], sortList[jj+1]) <= 0)
285 if (ARC_COMPARE_REV (holdArc, sortList[jj]) < 0) {
286 sortList[ii]= sortList[jj];
293 sortList[ii]= holdArc;
295 sortList++;
299 backwardList= sortList;
450 int *sortList;
453 sortList= new int [numArc+2];
454 sortList[0]= 0;
457 forwardList= sortList;
468 int holdArc, *sortList;
478 sortList= new int [numArc+2];
480 sortList[ii]= forwardList[ii];
482 sortList[ii]= ii;
483 sortList--;
489 holdArc= sortList[hired];
493 if (jj < numArc && ARC_COMPARE_MIN (sortList[jj], sortList[jj+1]) <= 0 )
495 if (ARC_COMPARE_MIN (holdArc, sortList[jj]) < 0) {
496 sortList[ii]= sortList[jj];
503 sortList[ii]= holdArc;
510 holdArc= sortList[retd];
511 sortList[retd]= sortList[1];
513 sortList[1]= holdArc;
519 if (jj < retd && ARC_COMPARE_MIN (sortList[jj], sortList[jj+1]) <= 0)
521 if (ARC_COMPARE_MIN (holdArc, sortList[jj]) < 0) {
522 sortList[ii]= sortList[jj];
529 sortList[ii]= holdArc;
531 sortList++;
535 forwardList= sortList;
