Home
last modified time | relevance | path

Searched refs:n_limit (Results 1 – 25 of 27) sorted by relevance

12

/dports/math/cppad/CppAD-20210000.8/example/abs_normal/
H A Dqp_box.hpp236 size_t n_limit = 0; in qp_box() local
240 ++n_limit; in qp_box()
242 ++n_limit; in qp_box()
246 Vector C_int((m + n_limit) * n ), c_int(m + n_limit); in qp_box()
271 Vector yout(m + n_limit), sout(m + n_limit); in qp_box()
H A Dlp_box.hpp154 size_t n_limit = 0; in lp_box() local
157 n_limit += 1; in lp_box()
161 Vector A_simplex((m + 2 * n_limit) * (2 * n) ), b_simplex(m + 2 * n_limit); in lp_box()
/dports/devel/concurrencykit/ck-0.6.0/include/
H A Dck_bitmap.h126 unsigned int n_limit; member
472 i->n_limit = CK_BITMAP_BLOCKS(bitmap->n_bits); in ck_bitmap_iterator_init()
473 if (i->n_limit > 0) { in ck_bitmap_iterator_init()
491 unsigned int n_limit = i->n_limit; in ck_bitmap_next() local
494 if (n_block >= n_limit) in ck_bitmap_next()
497 for (n_block++; n_block < n_limit; n_block++) { in ck_bitmap_next()
/dports/benchmarks/sysbench/sysbench-1.0.20/third_party/concurrency_kit/ck/include/
H A Dck_bitmap.h126 unsigned int n_limit; member
472 i->n_limit = CK_BITMAP_BLOCKS(bitmap->n_bits); in ck_bitmap_iterator_init()
473 if (i->n_limit > 0) { in ck_bitmap_iterator_init()
491 unsigned int n_limit = i->n_limit; in ck_bitmap_next() local
494 if (n_block >= n_limit) in ck_bitmap_next()
497 for (n_block++; n_block < n_limit; n_block++) { in ck_bitmap_next()
/dports/databases/dbh/libdbh2-5.0.22/src/
H A Ddbh_static.i310 if (ramas > dbh->head_info->n_limit){ in sdbh_readBranches()
365 if (ramas > dbh->head_info->n_limit){ in sdbh_updateBranch()
387 #define BRANCHOFF (dbh->head_info->n_limit-dbh->newbranches)
411 #define OFFSET (i+(dbh->head_info->n_limit-dbh->newbranches)) in sdbh_locate()
508 if(keys > dbh->head_info->n_limit) in sdbh_locateFind()
509 keys = dbh->head_info->n_limit; in sdbh_locateFind()
761 dbh->head_info->n_limit = key_length; in sdbh_create()
994 if(write (dbh->fd, the_key, dbh->head_info->n_limit) != dbh->head_info->n_limit) { in sdbh_write()
1033 keylength = dbh->head_info->n_limit; in sdbh_read()
1595 for(i = 0; i < dbh->head_info->n_limit; i++) in sdbh_newbarre()
[all …]
H A Ddbh.h281 unsigned char n_limit; member
402 (dbh->head_info->n_limit)
H A Ddbh_exported.i278 memcpy ((void *)dbh->key, (void *)key, dbh->head_info->n_limit); in dbh_set_key()
333 for(i = 0; i < dbh->head_info->n_limit; i++) in dbh_update()
415 for(i = 0; i < dbh->head_info->n_limit; i++) in dbh_update()
422 dbh->newbranches = dbh->head_info->n_limit; in dbh_update()
470 for(j = 0; j < dbh->head_info->n_limit; j++) in dbh_load()
555 for(i = 1; i <= dbh->head_info->n_limit; i++) in dbh_load_address()
/dports/audio/lsp-plugins-lv2/lsp-plugins-1.1.31/src/core/3d/
H A DObject3D.cpp87 ssize_t n_limit = pScene->vNormals.size(); in add_triangle() local
88 if ((vn1 >= n_limit) || (vn2 >= n_limit) || (vn3 >= n_limit)) in add_triangle()
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/share/extensions/inkex/deprecated-simple/
H A Dbezmisc.py38 def Simpson(func, a, b, n_limit, tolerance): argument
/dports/lang/spidermonkey78/firefox-78.9.0/browser/components/translation/cld2/internal/
H A Dscoreonescriptspan.cc427 int n_limit = minint(prior_size - 3, mapped_offset); in SummaryBufferToVector() local
428 n_limit = minint(n_limit, 12); in SummaryBufferToVector()
435 while ((n < n_limit) && (us[-n - 1] >= 0x41)) {++n;} in SummaryBufferToVector()
436 if (n >= n_limit) {n = 0;} // New boundary not found within range in SummaryBufferToVector()
439 if (n < n_limit) { in SummaryBufferToVector()
/dports/www/firefox/firefox-99.0/browser/components/translation/cld2/internal/
H A Dscoreonescriptspan.cc427 int n_limit = minint(prior_size - 3, mapped_offset); in SummaryBufferToVector() local
428 n_limit = minint(n_limit, 12); in SummaryBufferToVector()
435 while ((n < n_limit) && (us[-n - 1] >= 0x41)) {++n;} in SummaryBufferToVector()
436 if (n >= n_limit) {n = 0;} // New boundary not found within range in SummaryBufferToVector()
439 if (n < n_limit) { in SummaryBufferToVector()
/dports/www/firefox-esr/firefox-91.8.0/browser/components/translation/cld2/internal/
H A Dscoreonescriptspan.cc427 int n_limit = minint(prior_size - 3, mapped_offset); in SummaryBufferToVector() local
428 n_limit = minint(n_limit, 12); in SummaryBufferToVector()
435 while ((n < n_limit) && (us[-n - 1] >= 0x41)) {++n;} in SummaryBufferToVector()
436 if (n >= n_limit) {n = 0;} // New boundary not found within range in SummaryBufferToVector()
439 if (n < n_limit) { in SummaryBufferToVector()
/dports/mail/thunderbird/thunderbird-91.8.0/browser/components/translation/cld2/internal/
H A Dscoreonescriptspan.cc427 int n_limit = minint(prior_size - 3, mapped_offset); in SummaryBufferToVector() local
428 n_limit = minint(n_limit, 12); in SummaryBufferToVector()
435 while ((n < n_limit) && (us[-n - 1] >= 0x41)) {++n;} in SummaryBufferToVector()
436 if (n >= n_limit) {n = 0;} // New boundary not found within range in SummaryBufferToVector()
439 if (n < n_limit) { in SummaryBufferToVector()
/dports/lang/spidermonkey60/firefox-60.9.0/browser/components/translation/cld2/internal/
H A Dscoreonescriptspan.cc427 int n_limit = minint(prior_size - 3, mapped_offset); in SummaryBufferToVector() local
428 n_limit = minint(n_limit, 12); in SummaryBufferToVector()
435 while ((n < n_limit) && (us[-n - 1] >= 0x41)) {++n;} in SummaryBufferToVector()
436 if (n >= n_limit) {n = 0;} // New boundary not found within range in SummaryBufferToVector()
439 if (n < n_limit) { in SummaryBufferToVector()
/dports/devel/cld2/cld-20150505/internal/
H A Dscoreonescriptspan.cc428 int n_limit = minint(prior_size - 3, mapped_offset); in SummaryBufferToVector() local
429 n_limit = minint(n_limit, 12); in SummaryBufferToVector()
436 while ((n < n_limit) && (us[-n - 1] >= 0x41)) {++n;} in SummaryBufferToVector()
437 if (n >= n_limit) {n = 0;} // New boundary not found within range in SummaryBufferToVector()
441 if (n < n_limit) { in SummaryBufferToVector()
/dports/www/firefox-legacy/firefox-52.8.0esr/browser/components/translation/cld2/internal/
H A Dscoreonescriptspan.cc427 int n_limit = minint(prior_size - 3, mapped_offset); in SummaryBufferToVector() local
428 n_limit = minint(n_limit, 12); in SummaryBufferToVector()
435 while ((n < n_limit) && (us[-n - 1] >= 0x41)) {++n;} in SummaryBufferToVector()
436 if (n >= n_limit) {n = 0;} // New boundary not found within range in SummaryBufferToVector()
439 if (n < n_limit) { in SummaryBufferToVector()
/dports/cad/k40-whisperer/K40_Whisperer-0.58_src/
H A Dbezmisc.py206 def Simpson(f, a, b, n_limit, tolerance): argument
216 while n < n_limit and abs(est1 - est0) > tolerance:
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/erts/emulator/beam/
H A Dexternal.c3264 int n_limit = reds; in dec_term() local
3268 n_limit *= B2T_MEMCPY_FACTOR; in dec_term()
3269 ASSERT(n_limit >= reds); in dec_term()
3275 if (n > n_limit) { in dec_term()
3276 ctx->u.dc.remaining_n -= n_limit; in dec_term()
3277 n = n_limit; in dec_term()
3828 int n_limit = reds * B2T_MEMCPY_FACTOR; in dec_term() local
3829 if (n > n_limit) { in dec_term()
3833 n = n_limit; in dec_term()
3872 if (n > n_limit) { in dec_term()
[all …]
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/erts/emulator/beam/
H A Dexternal.c3042 int n_limit = reds; in dec_term() local
3046 n_limit *= B2T_MEMCPY_FACTOR; in dec_term()
3047 ASSERT(n_limit >= reds); in dec_term()
3053 if (n > n_limit) { in dec_term()
3054 ctx->u.dc.remaining_n -= n_limit; in dec_term()
3055 n = n_limit; in dec_term()
3575 int n_limit = reds * B2T_MEMCPY_FACTOR; in dec_term() local
3576 if (n > n_limit) { in dec_term()
3580 n = n_limit; in dec_term()
3619 if (n > n_limit) { in dec_term()
[all …]
/dports/graphics/inkscape/inkscape-1.1_2021-05-24_c4e8f9ed74/share/extensions/inkex/
H A Dbezier.py281 def simpson(a, b, n_limit, tolerance, balarg): argument
292 while n < n_limit and abs(est1 - est0) > tolerance:
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/erts/emulator/beam/
H A Dexternal.c3954 int n_limit = reds; in dec_term() local
3958 n_limit *= B2T_MEMCPY_FACTOR; in dec_term()
3959 ASSERT(n_limit >= reds); in dec_term()
3965 if (n > n_limit) { in dec_term()
3966 ctx->u.dc.remaining_n -= n_limit; in dec_term()
3967 n = n_limit; in dec_term()
4518 int n_limit = reds * B2T_MEMCPY_FACTOR; in dec_term() local
4519 if (n > n_limit) { in dec_term()
4523 n = n_limit; in dec_term()
4562 if (n > n_limit) { in dec_term()
[all …]
/dports/lang/erlang-runtime24/otp-OTP-24.1.7/erts/emulator/beam/
H A Dexternal.c4126 int n_limit = reds; in dec_term() local
4130 n_limit *= B2T_MEMCPY_FACTOR; in dec_term()
4131 ASSERT(n_limit >= reds); in dec_term()
4137 if (n > n_limit) { in dec_term()
4138 ctx->u.dc.remaining_n -= n_limit; in dec_term()
4139 n = n_limit; in dec_term()
4708 int n_limit = reds * B2T_MEMCPY_FACTOR; in dec_term() local
4709 if (n > n_limit) { in dec_term()
4713 n = n_limit; in dec_term()
4752 if (n > n_limit) { in dec_term()
[all …]
/dports/lang/erlang-wx/otp-OTP-24.1.7/erts/emulator/beam/
H A Dexternal.c4126 int n_limit = reds; in dec_term() local
4130 n_limit *= B2T_MEMCPY_FACTOR; in dec_term()
4131 ASSERT(n_limit >= reds); in dec_term()
4137 if (n > n_limit) { in dec_term()
4138 ctx->u.dc.remaining_n -= n_limit; in dec_term()
4139 n = n_limit; in dec_term()
4708 int n_limit = reds * B2T_MEMCPY_FACTOR; in dec_term() local
4709 if (n > n_limit) { in dec_term()
4713 n = n_limit; in dec_term()
4752 if (n > n_limit) { in dec_term()
[all …]
/dports/lang/erlang/otp-OTP-24.1.7/erts/emulator/beam/
H A Dexternal.c4126 int n_limit = reds; in dec_term() local
4130 n_limit *= B2T_MEMCPY_FACTOR; in dec_term()
4131 ASSERT(n_limit >= reds); in dec_term()
4137 if (n > n_limit) { in dec_term()
4138 ctx->u.dc.remaining_n -= n_limit; in dec_term()
4139 n = n_limit; in dec_term()
4708 int n_limit = reds * B2T_MEMCPY_FACTOR; in dec_term() local
4709 if (n > n_limit) { in dec_term()
4713 n = n_limit; in dec_term()
4752 if (n > n_limit) { in dec_term()
[all …]
/dports/lang/erlang-java/otp-OTP-24.1.7/erts/emulator/beam/
H A Dexternal.c4126 int n_limit = reds; in dec_term() local
4130 n_limit *= B2T_MEMCPY_FACTOR; in dec_term()
4131 ASSERT(n_limit >= reds); in dec_term()
4137 if (n > n_limit) { in dec_term()
4138 ctx->u.dc.remaining_n -= n_limit; in dec_term()
4139 n = n_limit; in dec_term()
4708 int n_limit = reds * B2T_MEMCPY_FACTOR; in dec_term() local
4709 if (n > n_limit) { in dec_term()
4713 n = n_limit; in dec_term()
4752 if (n > n_limit) { in dec_term()
[all …]

12