Searched refs:U1n (Results 1 – 2 of 2) sorted by relevance
| /external/libdivsufsort/lib/ |
| D | sssort.c | 144 const sauchar_t *U1, *U2, *U1n, *U2n; in ss_compare() local
148 U1n = T + *(p1 + 1) + 2, in ss_compare()
150 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
154 return U1 < U1n ? in ss_compare()
|
| /external/archive-patcher/generator/src/main/java/com/google/archivepatcher/generator/bsdiff/ |
| D | DivSuffixSorter.java | 381 int U1, U2, U1n, U2n; // pointers to T in ssCompare() local
383 for (U1 = depth + pa, U2 = depth + readSuffixArray(p2), U1n = pb + 2, in ssCompare()
385 (U1 < U1n) && (U2 < U2n) && (readInput(U1) == readInput(U2)); in ssCompare()
388 return U1 < U1n ? (U2 < U2n ? readInput(U1) - readInput(U2) : 1) : (U2 < U2n ? -1 : 0); in ssCompare()
392 int U1, U2, U1n, U2n; // pointers to T in ssCompare() local
395 U1n = readSuffixArray(p1 + 1) + 2, U2n = readSuffixArray(p2 + 1) + 2; in ssCompare()
396 (U1 < U1n) && (U2 < U2n) && (readInput(U1) == readInput(U2)); in ssCompare()
399 return U1 < U1n ? (U2 < U2n ? readInput(U1) - readInput(U2) : 1) : (U2 < U2n ? -1 : 0); in ssCompare()
|