| /dports/math/e-antic/flint2-ae7ec89/fmpz_poly/ |
| H A D | gcd_modular.c | 37 _fmpz_vec_content(ac, poly1, len1); in _fmpz_poly_gcd_modular()
53 A = _fmpz_vec_init(len1); in _fmpz_poly_gcd_modular()
61 lead_A = A + len1 - 1; in _fmpz_poly_gcd_modular()
72 for (i = 0; i < len1; i++) in _fmpz_poly_gcd_modular()
94 for (i = 0; i < len1; i++) in _fmpz_poly_gcd_modular()
127 Q = _fmpz_vec_init(len1); in _fmpz_poly_gcd_modular()
130 a = _nmod_vec_init(len1); in _fmpz_poly_gcd_modular()
142 n0 = len1 - 1; in _fmpz_poly_gcd_modular()
289 _fmpz_vec_clear(A, len1); in _fmpz_poly_gcd_modular()
291 _fmpz_vec_clear(Q, len1); in _fmpz_poly_gcd_modular()
[all …]
|
| H A D | resultant_modular_div.c | 22 const fmpz * poly1, slong len1, in _fmpz_poly_resultant_modular_div() argument
44 fmpz_pow_ui(res, poly2, len1 - 1); in _fmpz_poly_resultant_modular_div()
54 _fmpz_vec_content(ac, poly1, len1); in _fmpz_poly_resultant_modular_div()
58 A = _fmpz_vec_init(len1); in _fmpz_poly_resultant_modular_div()
95 fmpz_pow_ui(lb, bc, len1 - 1); in _fmpz_poly_resultant_modular_div()
104 lead_A = A + len1 - 1; in _fmpz_poly_resultant_modular_div()
113 a = _nmod_vec_init(len1); in _fmpz_poly_resultant_modular_div()
183 _fmpz_vec_clear(A, len1); in _fmpz_poly_resultant_modular_div()
194 slong len1 = poly1->length; in fmpz_poly_resultant_modular_div() local
199 else if (len1 >= len2) in fmpz_poly_resultant_modular_div()
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_poly/ |
| H A D | gcd_modular.c | 37 _fmpz_vec_content(ac, poly1, len1); in _fmpz_poly_gcd_modular()
53 A = _fmpz_vec_init(len1); in _fmpz_poly_gcd_modular()
61 lead_A = A + len1 - 1; in _fmpz_poly_gcd_modular()
72 for (i = 0; i < len1; i++) in _fmpz_poly_gcd_modular()
94 for (i = 0; i < len1; i++) in _fmpz_poly_gcd_modular()
127 Q = _fmpz_vec_init(len1); in _fmpz_poly_gcd_modular()
130 a = _nmod_vec_init(len1); in _fmpz_poly_gcd_modular()
142 n0 = len1 - 1; in _fmpz_poly_gcd_modular()
289 _fmpz_vec_clear(A, len1); in _fmpz_poly_gcd_modular()
291 _fmpz_vec_clear(Q, len1); in _fmpz_poly_gcd_modular()
[all …]
|
| H A D | resultant_modular_div.c | 22 const fmpz * poly1, slong len1, in _fmpz_poly_resultant_modular_div() argument
44 fmpz_pow_ui(res, poly2, len1 - 1); in _fmpz_poly_resultant_modular_div()
54 _fmpz_vec_content(ac, poly1, len1); in _fmpz_poly_resultant_modular_div()
58 A = _fmpz_vec_init(len1); in _fmpz_poly_resultant_modular_div()
95 fmpz_pow_ui(lb, bc, len1 - 1); in _fmpz_poly_resultant_modular_div()
104 lead_A = A + len1 - 1; in _fmpz_poly_resultant_modular_div()
113 a = _nmod_vec_init(len1); in _fmpz_poly_resultant_modular_div()
183 _fmpz_vec_clear(A, len1); in _fmpz_poly_resultant_modular_div()
194 slong len1 = poly1->length; in fmpz_poly_resultant_modular_div() local
199 else if (len1 >= len2) in fmpz_poly_resultant_modular_div()
[all …]
|
| /dports/math/flint2/flint-2.8.4/fmpz_poly/ |
| H A D | gcd_modular.c | 37 _fmpz_vec_content(ac, poly1, len1); in _fmpz_poly_gcd_modular()
53 A = _fmpz_vec_init(len1); in _fmpz_poly_gcd_modular()
61 lead_A = A + len1 - 1; in _fmpz_poly_gcd_modular()
72 for (i = 0; i < len1; i++) in _fmpz_poly_gcd_modular()
94 for (i = 0; i < len1; i++) in _fmpz_poly_gcd_modular()
127 Q = _fmpz_vec_init(len1); in _fmpz_poly_gcd_modular()
130 a = _nmod_vec_init(len1); in _fmpz_poly_gcd_modular()
142 n0 = len1 - 1; in _fmpz_poly_gcd_modular()
289 _fmpz_vec_clear(A, len1); in _fmpz_poly_gcd_modular()
291 _fmpz_vec_clear(Q, len1); in _fmpz_poly_gcd_modular()
[all …]
|
| H A D | resultant_modular_div.c | 22 const fmpz * poly1, slong len1, in _fmpz_poly_resultant_modular_div() argument
44 fmpz_pow_ui(res, poly2, len1 - 1); in _fmpz_poly_resultant_modular_div()
54 _fmpz_vec_content(ac, poly1, len1); in _fmpz_poly_resultant_modular_div()
58 A = _fmpz_vec_init(len1); in _fmpz_poly_resultant_modular_div()
95 fmpz_pow_ui(lb, bc, len1 - 1); in _fmpz_poly_resultant_modular_div()
104 lead_A = A + len1 - 1; in _fmpz_poly_resultant_modular_div()
113 a = _nmod_vec_init(len1); in _fmpz_poly_resultant_modular_div()
183 _fmpz_vec_clear(A, len1); in _fmpz_poly_resultant_modular_div()
194 slong len1 = poly1->length; in fmpz_poly_resultant_modular_div() local
199 else if (len1 >= len2) in fmpz_poly_resultant_modular_div()
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/nmod_poly/ |
| H A D | compose_series_divconquer.c | 32 if (len1 == 1) in _nmod_poly_compose_series_divconquer()
42 if (len1 == 2) in _nmod_poly_compose_series_divconquer()
55 for (k = 1; (2 << k) < len1; k++) ; in _nmod_poly_compose_series_divconquer()
68 for (i = 0; i < (len1 + 1) / 2; i++) in _nmod_poly_compose_series_divconquer()
74 for (i = 0; i < (len1 - 1) / 2; i++) in _nmod_poly_compose_series_divconquer()
79 hlen[(len1 - 1) / 2] = 0; in _nmod_poly_compose_series_divconquer()
85 for (i = 0, j = 0; i < len1 / 2; i++, j += 2) in _nmod_poly_compose_series_divconquer()
99 if ((len1 & WORD(1))) in _nmod_poly_compose_series_divconquer()
165 const slong len1 = poly1->length; in nmod_poly_compose_series_divconquer() local
169 if (len1 == 0 || N == 0) in nmod_poly_compose_series_divconquer()
[all …]
|
| /dports/math/e-antic/flint2-ae7ec89/nmod_poly/ |
| H A D | compose_series_divconquer.c | 32 if (len1 == 1) in _nmod_poly_compose_series_divconquer()
42 if (len1 == 2) in _nmod_poly_compose_series_divconquer()
55 for (k = 1; (2 << k) < len1; k++) ; in _nmod_poly_compose_series_divconquer()
68 for (i = 0; i < (len1 + 1) / 2; i++) in _nmod_poly_compose_series_divconquer()
74 for (i = 0; i < (len1 - 1) / 2; i++) in _nmod_poly_compose_series_divconquer()
79 hlen[(len1 - 1) / 2] = 0; in _nmod_poly_compose_series_divconquer()
85 for (i = 0, j = 0; i < len1 / 2; i++, j += 2) in _nmod_poly_compose_series_divconquer()
99 if ((len1 & WORD(1))) in _nmod_poly_compose_series_divconquer()
165 const slong len1 = poly1->length; in nmod_poly_compose_series_divconquer() local
169 if (len1 == 0 || N == 0) in nmod_poly_compose_series_divconquer()
[all …]
|
| /dports/math/flint2/flint-2.8.4/nmod_poly/ |
| H A D | compose_series_divconquer.c | 32 if (len1 == 1) in _nmod_poly_compose_series_divconquer()
42 if (len1 == 2) in _nmod_poly_compose_series_divconquer()
55 for (k = 1; (2 << k) < len1; k++) ; in _nmod_poly_compose_series_divconquer()
68 for (i = 0; i < (len1 + 1) / 2; i++) in _nmod_poly_compose_series_divconquer()
74 for (i = 0; i < (len1 - 1) / 2; i++) in _nmod_poly_compose_series_divconquer()
79 hlen[(len1 - 1) / 2] = 0; in _nmod_poly_compose_series_divconquer()
85 for (i = 0, j = 0; i < len1 / 2; i++, j += 2) in _nmod_poly_compose_series_divconquer()
99 if ((len1 & WORD(1))) in _nmod_poly_compose_series_divconquer()
165 const slong len1 = poly1->length; in nmod_poly_compose_series_divconquer() local
169 if (len1 == 0 || N == 0) in nmod_poly_compose_series_divconquer()
[all …]
|
| H A D | mullow_classical.c | 29 len1 = FLINT_MIN(len1, n); in _nmod_poly_mullow_classical()
44 squaring = (poly1 == poly2 && len1 == len2); in _nmod_poly_mullow_classical()
56 for (i = 0; i < len1; i++) in _nmod_poly_mullow_classical()
65 for (j = i + 1; j < FLINT_MIN(len1, n - i); j++) in _nmod_poly_mullow_classical()
71 for (i = 0; i < len1; i++) in _nmod_poly_mullow_classical()
88 if (n == len1 + len2 - 1) in _nmod_poly_mullow_classical()
89 res[len1 + len2 - 2] = nmod_mul(poly1[len1 - 1], poly2[len2 - 1], mod); in _nmod_poly_mullow_classical()
102 n1 = FLINT_MAX(0, i - len1 + 1); in _nmod_poly_mullow_classical()
103 n2 = FLINT_MIN(len1 - 1, (i + 1) / 2 - 1); in _nmod_poly_mullow_classical()
108 if (i % 2 == 0 && i / 2 < len1) in _nmod_poly_mullow_classical()
[all …]
|
| /dports/biology/molden/molden5.8/ |
| H A D | searchd.f | 9 len1 = len(name1)
11 call tocap(caps1,len1)
35 caps1 = name1(1:len1)
37 call tocap(caps1,len1)
65 caps1 = name1(1:len1)
68 call tocap(caps1,len1)
98 len1 = len(name1)
101 call tocap(caps1,len1)
130 len1 = len(name1)
134 call tocap(caps1,len1)
[all …]
|
| H A D | search.f | 8 len1 = len(name)
9 call tocap(caps,len1)
13 if (index(line,name).eq.0.and.index(line,caps(1:len1)).eq.0)
33 len1 = len(name)
34 call tocap(caps,len1)
75 len1 = len(line)
78 do i=1,len1
88 name = name(nsp:len1)
102 len1 = len(name)
103 call tocap(caps,len1)
[all …]
|
| /dports/audio/aqualung/aqualung-1.0/src/ |
| H A D | metadata_id3v2.c | 235 int len1; in meta_parse_id3v2_txxx() local
241 val2 = meta_id3v2_to_utf8(buf[10], buf+12+len1, len-len1-2); in meta_parse_id3v2_txxx()
288 int len1; in meta_parse_id3v2_wxxx() local
332 int len1; in meta_parse_id3v2_comm() local
340 len1 = len-4; in meta_parse_id3v2_comm()
366 int len1; in meta_parse_id3v2_apic() local
371 len1 = len-1; in meta_parse_id3v2_apic()
377 len2 = meta_id3v2_strlen(buf+13+len1, len-3-len1, enc); in meta_parse_id3v2_apic()
412 int len1; in meta_parse_id3v2_rva2() local
417 len1 = len; in meta_parse_id3v2_rva2()
[all …]
|
| /dports/mail/qpopper/qpopper4.1.0/popper/ |
| H A D | genpath.c | 110 int len1 = 0; /* used with strlcpy/strlcat */ in genpath() local
133 len1 = strlcpy ( pszDrop, pw->pw_dir, iDropLen ); in genpath()
135 len1 = strlcpy ( pszDrop, p->pCfg_spool_dir, iDropLen ); in genpath()
148 len1 = strlcpy ( pszDrop, p->pCfg_spool_dir, iDropLen ); in genpath()
168 DEBUG_LOG2 ( p, "...built: (%d) '%.100s'", len1 + len2, pszDrop ); in genpath()
177 len1 + len2 + len3, pszDrop ); in genpath()
183 if ( len1 > iDropLen || len2 > iDropLen || len3 > iDropLen ) { in genpath()
190 MAX ( len1, len2 ), in genpath()
203 len1 = strlcat ( pszDrop, pszUser, iDropLen ); in genpath()
213 len1 = strlcat ( pszDrop, ".", iDropLen ); in genpath()
[all …]
|
| /dports/biology/ugene/ugene-40.1/src/libs_3rdparty/samtools/src/samtools/ |
| H A D | kaln.c | 225 if (len1 > len2) { in ka_global_core()
232 if (b1 > len1) b1 = len1; in ka_global_core()
237 end = (b1 + b2 <= len1)? (b1 + b2 + 1) : (len1 + 1); in ka_global_core()
259 end = (j + b1 <= len1 + 1)? (j + b1 - 1) : len1; in ka_global_core()
278 end = (j + b1 <= len1 + 1)? (j + b1 - 1) : len1; in ka_global_core()
345 s = last + len1; in ka_global_core()
409 i = len1 > len2? len1 : len2; in ka_global_score()
418 x = j + bw; end = len1 < x? len1 : x; // band end in ka_global_score()
430 x = j + bw; end = len1 < x? len1 : x; // band end in ka_global_score()
465 ret = curr[len1].M >= curr[len1].I? curr[len1].M : curr[len1].I; in ka_global_score()
[all …]
|
| /dports/biology/stringtie/stringtie-2.1.1/samtools-0.1.18/ |
| H A D | kaln.c | 225 if (len1 > len2) { in ka_global_core()
232 if (b1 > len1) b1 = len1; in ka_global_core()
237 end = (b1 + b2 <= len1)? (b1 + b2 + 1) : (len1 + 1); in ka_global_core()
259 end = (j + b1 <= len1 + 1)? (j + b1 - 1) : len1; in ka_global_core()
278 end = (j + b1 <= len1 + 1)? (j + b1 - 1) : len1; in ka_global_core()
345 s = last + len1; in ka_global_core()
409 i = len1 > len2? len1 : len2; in ka_global_score()
418 x = j + bw; end = len1 < x? len1 : x; // band end in ka_global_score()
430 x = j + bw; end = len1 < x? len1 : x; // band end in ka_global_score()
465 ret = curr[len1].M >= curr[len1].I? curr[len1].M : curr[len1].I; in ka_global_score()
[all …]
|
| /dports/biology/seqan1/seqan-1.3.1/lib/samtools/ |
| H A D | kaln.c | 225 if (len1 > len2) { in ka_global_core()
232 if (b1 > len1) b1 = len1; in ka_global_core()
237 end = (b1 + b2 <= len1)? (b1 + b2 + 1) : (len1 + 1); in ka_global_core()
259 end = (j + b1 <= len1 + 1)? (j + b1 - 1) : len1; in ka_global_core()
278 end = (j + b1 <= len1 + 1)? (j + b1 - 1) : len1; in ka_global_core()
345 s = last + len1; in ka_global_core()
409 i = len1 > len2? len1 : len2; in ka_global_score()
418 x = j + bw; end = len1 < x? len1 : x; // band end in ka_global_score()
430 x = j + bw; end = len1 < x? len1 : x; // band end in ka_global_score()
465 ret = curr[len1].M >= curr[len1].I? curr[len1].M : curr[len1].I; in ka_global_score()
[all …]
|
| /dports/math/cln/cln-1.3.6/src/float/lfloat/elem/ |
| H A D | cl_LF_mul.cc | 30 var uintC len1 = TheLfloat(x1)->len; in operator *() local
32 var uintC len = (len1 < len2 ? len1 : len2); // min. L�ge n von x1 und x2 in operator *()
35 { if (len < len1) return shorten(x1,len); else return x1; } in operator *()
60 var const uintD* x1_LSDptr = arrayLSDptr(TheLfloat(x1)->data,len1); in operator *()
63 if (len1 > len2) in operator *()
64 { x1_LSDptr = x1_LSDptr lspop (len1-(len2+1)); len1 = len2+1; } in operator *()
65 else if (len1 < len2) in operator *()
66 { x2_LSDptr = x2_LSDptr lspop (len2-(len1+1)); len2 = len1+1; } in operator *()
70 UDS_UDS_mul_UDS(len1,x1_LSDptr, in operator *()
91 && !test_loop_msp(midptr mspop 1,len1+len2-len-1) in operator *()
|
| /dports/dns/unbound/unbound-1.14.0/util/data/ |
| H A D | dname.c | 238 len1 = *d1++; in dname_pkt_compare()
249 len1 = *d1++; in dname_pkt_compare()
269 log_assert(len1 == len2 && len1 != 0); in dname_pkt_compare()
280 len1 = *d1++; in dname_pkt_compare()
496 d1 += len1; in dname_lab_cmp()
515 len1 = *d1++; in dname_lab_cmp()
523 d1 += len1; in dname_lab_cmp()
549 len1--; in dname_lab_cmp()
788 uint8_t min = (len1<len2)?len1:len2; in memcanoncmp()
816 d1 += len1; in dname_canon_lab_cmp()
[all …]
|
| /dports/converters/mimelib/mimelib-1.1.2/mimelib/ |
| H A D | string.cpp | 55 if (len1 < len2) { in dw_strcasecmp()
58 else if (len1 > len2) { in dw_strcasecmp()
78 if (len1 < len2) { in dw_strcmp()
81 else if (len1 > len2) { in dw_strcmp()
937 if (len1 < len2) in compare()
1704 len1 = DW_MIN(len1, n); in DwStrncasecmp()
1717 len1 = DW_MIN(len1, n); in DwStrncasecmp()
1730 len1 = DW_MIN(len1, n); in DwStrncasecmp()
1774 len1 = DW_MIN(len1, n); in DwStrncmp()
1787 len1 = DW_MIN(len1, n); in DwStrncmp()
[all …]
|
| /dports/mail/lurker/lurker-2.3/mimelib/ |
| H A D | dwstring.cpp | 55 if (len1 < len2) { in dw_strcasecmp()
58 else if (len1 > len2) { in dw_strcasecmp()
78 if (len1 < len2) { in dw_strcmp()
81 else if (len1 > len2) { in dw_strcmp()
932 if (len1 < len2) in compare()
1699 len1 = DW_MIN(len1, n); in DwStrncasecmp()
1712 len1 = DW_MIN(len1, n); in DwStrncasecmp()
1725 len1 = DW_MIN(len1, n); in DwStrncasecmp()
1769 len1 = DW_MIN(len1, n); in DwStrncmp()
1782 len1 = DW_MIN(len1, n); in DwStrncmp()
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fq_nmod_poly/ |
| H A D | mul.c | 16 const fq_nmod_struct * op1, slong len1, in _fq_nmod_poly_mul() argument
20 if (len1 <= 1 || len2 <= 1 || in _fq_nmod_poly_mul()
21 (fq_nmod_ctx_degree(ctx) == 2 && FLINT_MAX(len1, len2) <= 2) || in _fq_nmod_poly_mul()
23 fq_nmod_ctx_degree(ctx)* FLINT_MAX(len1, len2) <= 8) in _fq_nmod_poly_mul()
24 _fq_nmod_poly_mul_classical(rop, op1, len1, op2, len2, ctx); in _fq_nmod_poly_mul()
26 _fq_nmod_poly_mul_univariate(rop, op1, len1, op2, len2, ctx); in _fq_nmod_poly_mul()
32 slong len1 = fq_nmod_poly_length(op1, ctx); in fq_nmod_poly_mul() local
35 if (len1 <= 1 || len2 <= 1 || in fq_nmod_poly_mul()
36 (fq_nmod_ctx_degree(ctx) == 2 && FLINT_MAX(len1, len2) <= 2) || in fq_nmod_poly_mul()
38 fq_nmod_ctx_degree(ctx)* FLINT_MAX(len1, len2) <= 8) in fq_nmod_poly_mul()
|
| /dports/math/e-antic/flint2-ae7ec89/fq_nmod_poly/ |
| H A D | mul.c | 16 const fq_nmod_struct * op1, slong len1, in _fq_nmod_poly_mul() argument
20 if (len1 <= 1 || len2 <= 1 || in _fq_nmod_poly_mul()
21 (fq_nmod_ctx_degree(ctx) == 2 && FLINT_MAX(len1, len2) <= 2) || in _fq_nmod_poly_mul()
23 fq_nmod_ctx_degree(ctx)* FLINT_MAX(len1, len2) <= 8) in _fq_nmod_poly_mul()
24 _fq_nmod_poly_mul_classical(rop, op1, len1, op2, len2, ctx); in _fq_nmod_poly_mul()
26 _fq_nmod_poly_mul_univariate(rop, op1, len1, op2, len2, ctx); in _fq_nmod_poly_mul()
32 slong len1 = fq_nmod_poly_length(op1, ctx); in fq_nmod_poly_mul() local
35 if (len1 <= 1 || len2 <= 1 || in fq_nmod_poly_mul()
36 (fq_nmod_ctx_degree(ctx) == 2 && FLINT_MAX(len1, len2) <= 2) || in fq_nmod_poly_mul()
38 fq_nmod_ctx_degree(ctx)* FLINT_MAX(len1, len2) <= 8) in fq_nmod_poly_mul()
|
| /dports/math/flint2/flint-2.8.4/fq_nmod_poly/ |
| H A D | mul.c | 16 const fq_nmod_struct * op1, slong len1, in _fq_nmod_poly_mul() argument
20 if (len1 <= 1 || len2 <= 1 || in _fq_nmod_poly_mul()
21 (fq_nmod_ctx_degree(ctx) == 2 && FLINT_MAX(len1, len2) <= 2) || in _fq_nmod_poly_mul()
23 fq_nmod_ctx_degree(ctx)* FLINT_MAX(len1, len2) <= 8) in _fq_nmod_poly_mul()
24 _fq_nmod_poly_mul_classical(rop, op1, len1, op2, len2, ctx); in _fq_nmod_poly_mul()
26 _fq_nmod_poly_mul_univariate(rop, op1, len1, op2, len2, ctx); in _fq_nmod_poly_mul()
32 slong len1 = fq_nmod_poly_length(op1, ctx); in fq_nmod_poly_mul() local
35 if (len1 <= 1 || len2 <= 1 || in fq_nmod_poly_mul()
36 (fq_nmod_ctx_degree(ctx) == 2 && FLINT_MAX(len1, len2) <= 2) || in fq_nmod_poly_mul()
38 fq_nmod_ctx_degree(ctx)* FLINT_MAX(len1, len2) <= 8) in fq_nmod_poly_mul()
|
| /dports/biology/sim4/sim4.2003-09-21/ |
| H A D | sim4.init.c | 144 len1 = SEQ_LEN(sf1); in main()
146 if (!is_DNA(seq1, len1)) in main()
148 seq_toupper(seq1, len1, argv[1]); in main()
169 if (rs.CDS_to>len1) in main()
187 if (cds_to>len1) in main()
193 get_polyAT(seq1,len1,&pT,&pA,BOTH_AT); in main()
499 len1+1-head->offset2, in print_align_blk()
506 head->offset1+head->len1-1, in print_align_blk()
539 head->len2, head->len1, S, in print_align_lat()
545 head->len2, head->len1, S, in print_align_lat()
[all …]
|