216     if(Td[PA[SA[m / 2]]] < Td[PA[SA[m]]]) { SWAP(SA[m], SA[m / 2]); }  in ss_heapsort()
220   if((size % 2) == 0) { SWAP(SA[0], SA[m]); ss_fixdown(Td, PA, SA, 0, m); }  in ss_heapsort()
237   if(Td[PA[*v1]] > Td[PA[*v2]]) { SWAP(v1, v2); }  in ss_median3()
251   if(Td[PA[*v2]] > Td[PA[*v3]]) { SWAP(v2, v3); }  in ss_median5()
252   if(Td[PA[*v4]] > Td[PA[*v5]]) { SWAP(v4, v5); }  in ss_median5()
253   if(Td[PA[*v2]] > Td[PA[*v4]]) { SWAP(v2, v4); SWAP(v3, v5); }  in ss_median5()
254   if(Td[PA[*v1]] > Td[PA[*v3]]) { SWAP(v1, v3); }  in ss_median5()
255   if(Td[PA[*v1]] > Td[PA[*v4]]) { SWAP(v1, v4); SWAP(v3, v5); }  in ss_median5()
366     SWAP(*first, *a);  in ss_mintrosort()
372         if(x == v) { SWAP(*b, *a); ++a; }  in ss_mintrosort()
378         if(x == v) { SWAP(*c, *d); --d; }  in ss_mintrosort()
382       SWAP(*b, *c);  in ss_mintrosort()
384         if(x == v) { SWAP(*b, *a); ++a; }  in ss_mintrosort()
387         if(x == v) { SWAP(*c, *d); --d; }  in ss_mintrosort()
395       for(e = first, f = b - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); }  in ss_mintrosort()
397       for(e = b, f = last - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); }  in ss_mintrosort()