first occurrence is kept
| 1238 | if(nosort) tempslots.sort(tempslotunsort); |
| 1239 | loopv(presort) for(int n = i + 1; n < presort.length(); n++) if(presort[i] == presort[n]) presort.remove(n); // first occurrence is kept |
| 1240 | loopvk(presort) |
| 1241 | { |
| 1242 | loopv(tempslots) |
| 1243 | { |
| 1244 | bool yep = false; |
| 1245 | loopvj(tempslots[i].oldslot) if(tempslots[i].oldslot[j] == presort[k]) yep = true; |
| 1246 | if(yep && i > k) |
| 1247 | { |
| 1248 | temptexslot t = tempslots.remove(i); |
| 1249 | tempslots.insert(k, t); |
| 1250 | break; |
| 1251 | } |
| 1252 | } |
| 1253 | } |
| 1254 | |
| 1255 | // create translation table |
| 1256 | uchar newslot[256]; |
no outgoing calls
no test coverage detected