(out, start, mid, end, lBuffer, rBuffer)
| 1395 | |
| 1396 | // for merge sort |
| 1397 | function merge(out, start, mid, end, lBuffer, rBuffer) { |
| 1398 | const sizeLeft = mid - start; |
| 1399 | const sizeRight = end - mid; |
| 1400 | let l, r, o; |
| 1401 | |
| 1402 | for (l = 0; l < sizeLeft; l++) |
| 1403 | lBuffer[l] = out[start + l]; |
| 1404 | for (r = 0; r < sizeRight; r++) |
| 1405 | rBuffer[r] = out[mid + r]; |
| 1406 | |
| 1407 | l = 0; |
| 1408 | r = 0; |
| 1409 | o = start; |
| 1410 | while (l < sizeLeft && r < sizeRight) { |
| 1411 | if (lBuffer[l] <= rBuffer[r]) { |
| 1412 | out[o++] = lBuffer[l++]; |
| 1413 | out[o++] = lBuffer[l++]; |
| 1414 | } else { |
| 1415 | out[o++] = rBuffer[r++]; |
| 1416 | out[o++] = rBuffer[r++]; |
| 1417 | } |
| 1418 | } |
| 1419 | while (l < sizeLeft) |
| 1420 | out[o++] = lBuffer[l++]; |
| 1421 | while (r < sizeRight) |
| 1422 | out[o++] = rBuffer[r++]; |
| 1423 | } |
| 1424 | |
| 1425 | function domainToASCII(domain) { |
| 1426 | if (arguments.length < 1) |
no outgoing calls
no test coverage detected
searching dependent graphs…