121     if(ISAd[SA[m / 2]] < ISAd[SA[m]]) { SWAP(SA[m], SA[m / 2]); }  in tr_heapsort()
125   if((size % 2) == 0) { SWAP(SA[0], SA[m]); tr_fixdown(ISAd, SA, 0, m); }  in tr_heapsort()
141   if(ISAd[*v1] > ISAd[*v2]) { SWAP(v1, v2); }  in tr_median3()
155   if(ISAd[*v2] > ISAd[*v3]) { SWAP(v2, v3); }  in tr_median5()
156   if(ISAd[*v4] > ISAd[*v5]) { SWAP(v4, v5); }  in tr_median5()
157   if(ISAd[*v2] > ISAd[*v4]) { SWAP(v2, v4); SWAP(v3, v5); }  in tr_median5()
158   if(ISAd[*v1] > ISAd[*v3]) { SWAP(v1, v3); }  in tr_median5()
159   if(ISAd[*v1] > ISAd[*v4]) { SWAP(v1, v4); SWAP(v3, v5); }  in tr_median5()
232       if(x == v) { SWAP(*b, *a); ++a; }  in tr_partition()
238       if(x == v) { SWAP(*c, *d); --d; }  in tr_partition()
242     SWAP(*b, *c);  in tr_partition()
244       if(x == v) { SWAP(*b, *a); ++a; }  in tr_partition()
247       if(x == v) { SWAP(*c, *d); --d; }  in tr_partition()
254     for(e = first, f = b - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); }  in tr_partition()
256     for(e = b, f = last - s; 0 < s; --s, ++e, ++f) { SWAP(*e, *f); }  in tr_partition()
446     SWAP(*first, *a);  in tr_introsort()