| /dports/finance/quantlib/QuantLib-1.20/ql/experimental/barrieroption/ |
| H A D | analyticdoublebarrierengine.cpp | 178 Real U2n = std::pow(barrierHi(), 2 * n); in callKO() local
179 Real d1 = std::log( underlying()* U2n / (strike() * L2n) ) / stdDeviation() + bsigma; in callKO()
180 Real d2 = std::log( underlying()* U2n / (barrierHi() * L2n) ) / stdDeviation() + bsigma; in callKO()
181 …Real d3 = std::log( std::pow(barrierLo(), 2 * n + 2) / (strike() * underlying() * U2n) ) / stdDevi… in callKO()
182 …Real d4 = std::log( std::pow(barrierLo(), 2 * n + 2) / (barrierHi() * underlying() * U2n) ) / stdD… in callKO()
213 Real U2n = std::pow(barrierHi(), 2 * n); in putKO() local
214 …Real y1 = std::log( underlying()* U2n / (std::pow(barrierLo(), 2 * n + 1)) ) / stdDeviation() + bs… in putKO()
215 Real y2 = std::log( underlying()* U2n / (strike() * L2n) ) / stdDeviation() + bsigma; in putKO()
216 …Real y3 = std::log( std::pow(barrierLo(), 2 * n + 2) / (barrierLo() * underlying() * U2n) ) / stdD… in putKO()
217 …Real y4 = std::log( std::pow(barrierLo(), 2 * n + 2) / (strike() * underlying() * U2n) ) / stdDevi… in putKO()
|
| /dports/archivers/lbzip2/lbzip2-2.5/src/ |
| H A D | divbwt.c | 252 const sauchar_t *U1, *U2, *U1n, *U2n; in ss_compare() local
257 U2n = T + *(p2 + 1) + 2; in ss_compare()
258 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
263 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
264 (U2 < U2n ? -1 : 0); in ss_compare()
272 const sauchar_t *U1, *U2, *U1n, *U2n; in ss_compare_last() local
277 U2n = T + *(p2 + 1) + 2; in ss_compare_last()
278 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare_last()
283 else if(U2 == U2n) { return 1; } in ss_compare_last()
291 (U2 < U2n ? *U1 - *U2 : 1) : 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
181 U2n = T + p2_hi + 2; in ss_compare_internal()
182 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare_internal()
187 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare_internal()
188 (U2 < U2n ? -1 : 0); 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
28 U2n = T + *(p2 + 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
200 U2n = T + *(p2 + 1) + 2; in ss_compare()
201 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
206 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
207 (U2 < U2n ? -1 : 0); in ss_compare()
|
| /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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
225 U2n = T + *(p2 + 1) + 2; in ss_compare()
226 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
231 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
232 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); 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
239 U2n = T + *(p2 + 1) + 2; in ss_compare()
240 (U1 < U1n) && (U2 < U2n) && (*U1 == *U2); in ss_compare()
245 (U2 < U2n ? *U1 - *U2 : 1) : in ss_compare()
246 (U2 < U2n ? -1 : 0); in ss_compare()
|