/dports/archivers/lbzip2/lbzip2-2.5/src/ |
H A D | divbwt.c | 252 const sauchar_t *U1, *U2, *U1n, *U2n; in ss_compare() local 256 U1n = T + *(p1 + 1) + 2, in ss_compare() 258 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 262 return U1 < U1n ? in ss_compare() 272 const sauchar_t *U1, *U2, *U1n, *U2n; in ss_compare_last() local 276 U1n = T + size, in ss_compare_last() 278 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare_last() 282 if(U1 < U1n) { return (U2 < U2n) ? *U1 - *U2 : 1; } in ss_compare_last() 285 for(U1 = T + (U1 - T) % size, U1n = T + PA[0] + 2; in ss_compare_last() 286 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare_last() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/courgette/third_party/divsufsort/ |
H A D | sssort.cc | 176 const sauchar_t *U1, *U2, *U1n, *U2n; in ss_compare_internal() local 180 U1n = T + p1_hi + 2, in ss_compare_internal() 182 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare_internal() 186 return U1 < U1n ? in ss_compare_internal()
|
/dports/biology/mummer/mummer-4.0.0beta2-2-g277dac5/include/compactsufsort/ |
H A D | sssort_imp.hpp | 23 CHARPTR U1, U2, U1n, U2n; in compare() local 27 U1n = T + *(p1 + 1) + 2, in compare() 29 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in compare() 33 return U1 < U1n ? (U2 < U2n ? *U1 - *U2 : 1) : (U2 < U2n ? -1 : 0); in compare()
|
/dports/sysutils/wimlib/wimlib-1.13.0/src/ |
H A D | divsufsort.c | 195 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 199 U1n = T + *(p1 + 1) + 2, in ss_compare() 201 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 205 return U1 < U1n ? in ss_compare()
|
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/math/big/ |
H A D | arith_s390x.s | 217 U1n: // n >= 0 label 242 BGE U1n // if n >= 0 goto U1n
|
/dports/devel/sccache/sccache-0.2.15/cargo-crates/zstd-sys-1.4.19+zstd.1.4.8/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/emulators/ppsspp/ppsspp-1.12.3/ext/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/archivers/p5-Compress-Zstd/Compress-Zstd-0.20/ext/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/archivers/py-borgbackup/borgbackup-1.1.17/src/borg/algorithms/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/archivers/zstd/zstd-1.5.0/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/archivers/paq/paq-20140131_6/ |
H A D | divsufsort.c | 220 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 224 U1n = T + *(p1 + 1) + 2, in ss_compare() 226 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 230 return U1 < U1n ? in ss_compare()
|
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/rocksdb/third_party/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/archivers/c-blosc/c-blosc-1.21.0/internal-complibs/zstd-1.4.8/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/sysutils/vector/vector-0.10.0/cargo-crates/zstd-sys-1.4.15+zstd.1.4.4/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/archivers/c-blosc2/c-blosc2-2.0.4/internal-complibs/zstd-1.5.0/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/rocksdb/third_party/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/mail/rmilter/rmilter-1.10.0/contrib/zstd/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/mail/rspamd/rspamd-3.1/contrib/zstd/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/emulators/ppsspp-qt5/ppsspp-1.12.3/ext/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/sysutils/helmfile/vault-f6547fa8e820/vendor/github.com/DataDog/zstd/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/devel/mercurial/mercurial-6.0/contrib/python-zstandard/zstd/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/security/arti/arti-9d0ede26801cdb182daa85c3eb5f0058dc178eb6/cargo-crates/zstd-sys-1.5.0+zstd.1.4.9/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/rocksdb/third_party/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/textproc/ripgrep-all/ripgrep-all-0.9.6/cargo-crates/zstd-sys-1.4.15+zstd.1.4.4/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|
/dports/textproc/sonic/sonic-1.3.0/cargo-crates/librocksdb-sys-6.7.4/zstd/lib/dictBuilder/ |
H A D | divsufsort.c | 234 const unsigned char *U1, *U2, *U1n, *U2n; in ss_compare() local 238 U1n = T + *(p1 + 1) + 2, in ss_compare() 240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare() 244 return U1 < U1n ? in ss_compare()
|