Home
last modified time | relevance | path

Searched refs:lena (Results 1 – 25 of 1287) sorted by relevance

12345678910>>...52

/dports/net/ns3/ns-allinone-3.35/ns-3.35/src/lte/examples/
H A Dwscript6 obj.source = 'lena-cqi-threshold.cc'
9 obj.source = 'lena-dual-stripe.cc'
12 obj.source = 'lena-fading.cc'
21 obj.source = 'lena-ipv6-ue-rh.cc'
24 obj.source = 'lena-ipv6-ue-ue.cc'
30 obj.source = 'lena-profiling.cc'
33 obj.source = 'lena-rem.cc'
39 obj.source = 'lena-rlc-traces.cc'
42 obj.source = 'lena-simple.cc'
45 obj.source = 'lena-simple-epc.cc'
[all …]
/dports/converters/p5-LaTeXML/LaTeXML-0.8.6/t/graphics/
H A Dcalc.tex30 \newlength{\lena}
33 \setlength{\lena}{0pt}
37 \setlength{\lena}{200pt}
38 Length 200pt = \the\lena.
40 \setlength{\lena}{2pt+4em}
41 Length 2pt+4em = \the\lena.
43 \setlength{\lena}{2em*\real{4.5}}
44 Length 2em*4.5 = \the\lena.
70 \settowidth{\lena}{Some text}
84 \setlength{\lena}{\widthof{\foo}}
[all …]
/dports/math/reduce/Reduce-svn5758-src/csl/embedded/
H A Darith09.c247 if (a[lena] == 0) lena--; in huge_gcd()
314 a0 = a[lena]; a1 = a[lena-1]; in huge_gcd()
315 b0 = b[lena]; b1 = b[lena-1]; in huge_gcd()
333 a0 = a[lena]; a1 = a[lena-1]; in huge_gcd()
335 if (lena > 1) a2 = a[lena-2]; in huge_gcd()
422 while (lena > 0 && a[lena]==0) lena--; in huge_gcd()
515 while (lena > 0 && a[lena] == 0) lena--; in huge_gcd()
522 return lena; in huge_gcd()
648 { lena = (lena + 1) & 0xfffffffeU; in gcd()
1030 if ((lena & 1) != 0) bignum_digits(a)[++lena] = 0; in shrink_bignum()
[all …]
H A Darith03.c471 lena--; in quotbn()
472 while (bignum_digits(a)[lena] == 0) lena--; in quotbn()
473 if ((bignum_digits(a)[lena] & 0x40000000) != 0) lena++; in quotbn()
483 lena--; in quotbn()
729 if (bignum_digits(a)[lena] == 0) lena--; in quotbb()
838 while (lena > 0 && bignum_digits(a)[lena] == 0) lena--; in quotbb()
839 if ((bignum_digits(a)[lena] & 0x40000000) != 0) lena++; in quotbb()
982 lena--; in quotbb()
1004 lena = lena - lenb; in quotbb()
1005 while (bignum_digits(a)[lena] == 0) lena--; in quotbb()
[all …]
/dports/math/reduce/Reduce-svn5758-src/csl/cslbase/
H A Darith09.cpp216 if (a[lena] == 0) lena--; in huge_gcd()
275 a0 = a[lena]; a1 = a[lena-1]; in huge_gcd()
276 b0 = b[lena]; b1 = b[lena-1]; in huge_gcd()
290 a0 = a[lena]; a1 = a[lena-1]; in huge_gcd()
292 if (lena > 1) a2 = a[lena-2]; in huge_gcd()
374 while (lena != 0 && a[lena]==0) lena--; in huge_gcd()
469 while (lena != 0 && a[lena] == 0) lena--; in huge_gcd()
477 return lena; in huge_gcd()
605 { lena = (lena + 1) & ~(size_t)1; in gcd()
946 if ((lena & 1) != 0) bignum_digits(a)[++lena] = 0; in shrink_bignum()
[all …]
H A Darith03.cpp323 lena--;
324 while (bignum_digits(a)[lena] == 0) lena--;
325 if ((bignum_digits(a)[lena] & 0x40000000) != 0) lena++;
608 { if (bignum_digits(a)[lena] == 0) lena--;
627 lena--;
671 { lena = copy_negated(big_dividend, a, lena);
674 else lena = copy_unsigned(big_dividend, a, lena);
787 while (lena != 0 && bignum_digits(a)[lena] == 0) lena--;
930 bignum_digits(a)[lena+1] = timesbn(a, lena, scale);
946 { lena = unscale(a, lena+1, scale);
[all …]
H A Darithlib.hpp6990 if (lena >= lenb) n = lena; in op()
7058 if (lena >= lenb) n = lena; in op()
7129 if (lena >= lenb) n = lena; in op()
7199 if (lena >= lenb) n = lena; in op()
7480 if (lena >= lenb) n = lena+1; in op()
7641 if (lena >= lenb) n = lena+1; in op()
7691 if (lena >= lenb) n = lena+1; in op()
10242 if (lena > lenb) a[lena-1] = a[lena-1] - hi - borrow; in reduce_for_gcd()
10268 if (lena > lenb+1) a[lena-1] = a[lena-1] - hi - borrow; in shifted_reduce_for_gcd()
10366 std::uint64_t a0=a[lena-1], a1=a[lena-2], a2=(lena>2 ? a[lena-3] : 0); in gcd_reduction()
[all …]
/dports/graphics/mahotas/mahotas-1.4.11/docs/source/
H A Dcolor.rst13 For example, the classic lena image is a ``(512,512,3)`` array::
16 lena = mh.demos.load('lena')
17 print(lena.shape)
25 lena = mh.demos.load('lena')
26 lenag = mh.colors.rgb2grey(lena)
32 lena = mh.demos.load('lena')
33 lenag = mh.colors.rgb2grey(lena)
39 lenas = mh.colors.rgb2sepia(lena)
45 lena = mh.demos.load('lena')
47 lenas = mh.colors.rgb2sepia(lena)
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/qadic/
H A Dsqrt.c42 const slong d = j[lena - 1]; in _find_nonresidue()
109 const slong d = j[lena - 1]; in _artin_schreier_preimage()
223 const slong d = j[lena - 1]; in _fmpz_mod_poly_sqrtmod_p()
377 _find_nonresidue(g, a, j, lena, p); in _fmpz_mod_poly_sqrtmod_p()
459 const slong d = j[lena - 1]; in _fmpz_mod_poly_sqrtmod_2()
465 _qadic_pow(rop, op, len, z, a, j, lena, p); in _fmpz_mod_poly_sqrtmod_2()
480 const slong d = j[lena - 1]; in _qadic_sqrt_p()
550 for (k = 0; k < lena; k++) in _qadic_sqrt_p()
620 const slong d = j[lena - 1]; in _qadic_sqrt_2()
632 _qadic_inv(r, op, len, a, j, lena, p, 3); in _qadic_sqrt_2()
[all …]
H A Dfrobenius.c31 const slong d = j[lena - 1]; in _fmpz_mod_poly_compose_smod_rectangular()
61 _fmpz_poly_reduce(t, 2 * d - 1, a, j, lena); in _fmpz_mod_poly_compose_smod_rectangular()
85 const slong d = j[lena - 1]; in _fmpz_mod_poly_compose_smod_horner()
152 const slong d = j[lena - 1]; in _qadic_frobenius_a()
199 for (k = 0; k < lena; k++) in _qadic_frobenius_a()
201 for (k = 1; k < lena; k++) in _qadic_frobenius_a()
211 _qadic_pow(rop, op, 2, t, a, j, lena, pow + i); in _qadic_frobenius_a()
213 _qadic_inv(inv, t, d, a, j, lena, p, 1); in _qadic_frobenius_a()
263 const slong d = j[lena - 1]; in _qadic_frobenius()
276 _qadic_pow(rop, op, len, t, a, j, lena, p); in _qadic_frobenius()
[all …]
H A Dexp_balanced.c19 const fmpz *a, const slong *j, slong lena) in _qadic_exp_bsplit_series() argument
21 const slong d = j[lena - 1]; in _qadic_exp_bsplit_series()
36 _fmpz_poly_reduce(P, 2*len - 1, a, j, lena); in _qadic_exp_bsplit_series()
57 _qadic_exp_bsplit_series(P, Q, T, x, len, lo, m, a, j, lena); in _qadic_exp_bsplit_series()
62 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_exp_bsplit_series()
68 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_exp_bsplit_series()
82 const fmpz *a, const slong *j, slong lena, in _qadic_exp_bsplit() argument
85 const slong d = j[lena - 1]; in _qadic_exp_bsplit()
127 const slong d = j[lena - 1]; in _qadic_exp_balanced()
160 _qadic_exp_bsplit(r, r, w, d, a, j, lena, p, N); in _qadic_exp_balanced()
[all …]
H A Dlog_balanced.c30 const fmpz *a, const slong *j, slong lena) in _qadic_log_bsplit_series() argument
32 const slong d = j[lena - 1]; in _qadic_log_bsplit_series()
47 _fmpz_poly_reduce(P, 2*len - 1, a, j, lena); in _qadic_log_bsplit_series()
73 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_log_bsplit_series()
80 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_log_bsplit_series()
105 const fmpz *a, const slong *j, slong lena, in _qadic_log_bsplit() argument
108 const slong d = j[lena - 1]; in _qadic_log_bsplit()
167 const slong d = j[lena - 1]; in _qadic_log_balanced()
200 _qadic_inv(u, r, d, a, j, lena, p, N); in _qadic_log_balanced()
205 _fmpz_poly_reduce(s, 2 * d - 1, a, j, lena); in _qadic_log_balanced()
[all …]
/dports/math/e-antic/flint2-ae7ec89/qadic/
H A Dsqrt.c42 const slong d = j[lena - 1]; in _find_nonresidue()
109 const slong d = j[lena - 1]; in _artin_schreier_preimage()
223 const slong d = j[lena - 1]; in _fmpz_mod_poly_sqrtmod_p()
377 _find_nonresidue(g, a, j, lena, p); in _fmpz_mod_poly_sqrtmod_p()
459 const slong d = j[lena - 1]; in _fmpz_mod_poly_sqrtmod_2()
465 _qadic_pow(rop, op, len, z, a, j, lena, p); in _fmpz_mod_poly_sqrtmod_2()
480 const slong d = j[lena - 1]; in _qadic_sqrt_p()
550 for (k = 0; k < lena; k++) in _qadic_sqrt_p()
620 const slong d = j[lena - 1]; in _qadic_sqrt_2()
632 _qadic_inv(r, op, len, a, j, lena, p, 3); in _qadic_sqrt_2()
[all …]
H A Dfrobenius.c31 const slong d = j[lena - 1]; in _fmpz_mod_poly_compose_smod_rectangular()
61 _fmpz_poly_reduce(t, 2 * d - 1, a, j, lena); in _fmpz_mod_poly_compose_smod_rectangular()
85 const slong d = j[lena - 1]; in _fmpz_mod_poly_compose_smod_horner()
152 const slong d = j[lena - 1]; in _qadic_frobenius_a()
199 for (k = 0; k < lena; k++) in _qadic_frobenius_a()
201 for (k = 1; k < lena; k++) in _qadic_frobenius_a()
211 _qadic_pow(rop, op, 2, t, a, j, lena, pow + i); in _qadic_frobenius_a()
213 _qadic_inv(inv, t, d, a, j, lena, p, 1); in _qadic_frobenius_a()
263 const slong d = j[lena - 1]; in _qadic_frobenius()
276 _qadic_pow(rop, op, len, t, a, j, lena, p); in _qadic_frobenius()
[all …]
H A Dexp_balanced.c19 const fmpz *a, const slong *j, slong lena) in _qadic_exp_bsplit_series() argument
21 const slong d = j[lena - 1]; in _qadic_exp_bsplit_series()
36 _fmpz_poly_reduce(P, 2*len - 1, a, j, lena); in _qadic_exp_bsplit_series()
57 _qadic_exp_bsplit_series(P, Q, T, x, len, lo, m, a, j, lena); in _qadic_exp_bsplit_series()
62 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_exp_bsplit_series()
68 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_exp_bsplit_series()
82 const fmpz *a, const slong *j, slong lena, in _qadic_exp_bsplit() argument
85 const slong d = j[lena - 1]; in _qadic_exp_bsplit()
127 const slong d = j[lena - 1]; in _qadic_exp_balanced()
160 _qadic_exp_bsplit(r, r, w, d, a, j, lena, p, N); in _qadic_exp_balanced()
[all …]
H A Dlog_balanced.c30 const fmpz *a, const slong *j, slong lena) in _qadic_log_bsplit_series() argument
32 const slong d = j[lena - 1]; in _qadic_log_bsplit_series()
47 _fmpz_poly_reduce(P, 2*len - 1, a, j, lena); in _qadic_log_bsplit_series()
73 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_log_bsplit_series()
80 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_log_bsplit_series()
105 const fmpz *a, const slong *j, slong lena, in _qadic_log_bsplit() argument
108 const slong d = j[lena - 1]; in _qadic_log_bsplit()
167 const slong d = j[lena - 1]; in _qadic_log_balanced()
200 _qadic_inv(u, r, d, a, j, lena, p, N); in _qadic_log_balanced()
205 _fmpz_poly_reduce(s, 2 * d - 1, a, j, lena); in _qadic_log_balanced()
[all …]
/dports/math/flint2/flint-2.8.4/qadic/
H A Dsqrt.c42 const slong d = j[lena - 1]; in _find_nonresidue()
109 const slong d = j[lena - 1]; in _artin_schreier_preimage()
223 const slong d = j[lena - 1]; in _fmpz_mod_poly_sqrtmod_p()
377 _find_nonresidue(g, a, j, lena, p); in _fmpz_mod_poly_sqrtmod_p()
459 const slong d = j[lena - 1]; in _fmpz_mod_poly_sqrtmod_2()
465 _qadic_pow(rop, op, len, z, a, j, lena, p); in _fmpz_mod_poly_sqrtmod_2()
480 const slong d = j[lena - 1]; in _qadic_sqrt_p()
550 for (k = 0; k < lena; k++) in _qadic_sqrt_p()
620 const slong d = j[lena - 1]; in _qadic_sqrt_2()
632 _qadic_inv(r, op, len, a, j, lena, p, 3); in _qadic_sqrt_2()
[all …]
H A Dfrobenius.c31 const slong d = j[lena - 1]; in _fmpz_mod_poly_compose_smod_rectangular()
61 _fmpz_poly_reduce(t, 2 * d - 1, a, j, lena); in _fmpz_mod_poly_compose_smod_rectangular()
85 const slong d = j[lena - 1]; in _fmpz_mod_poly_compose_smod_horner()
152 const slong d = j[lena - 1]; in _qadic_frobenius_a()
199 for (k = 0; k < lena; k++) in _qadic_frobenius_a()
201 for (k = 1; k < lena; k++) in _qadic_frobenius_a()
211 _qadic_pow(rop, op, 2, t, a, j, lena, pow + i); in _qadic_frobenius_a()
213 _qadic_inv(inv, t, d, a, j, lena, p, 1); in _qadic_frobenius_a()
263 const slong d = j[lena - 1]; in _qadic_frobenius()
276 _qadic_pow(rop, op, len, t, a, j, lena, p); in _qadic_frobenius()
[all …]
H A Dexp_balanced.c17 const fmpz *a, const slong *j, slong lena) in _qadic_exp_bsplit_series() argument
19 const slong d = j[lena - 1]; in _qadic_exp_bsplit_series()
34 _fmpz_poly_reduce(P, 2*len - 1, a, j, lena); in _qadic_exp_bsplit_series()
55 _qadic_exp_bsplit_series(P, Q, T, x, len, lo, m, a, j, lena); in _qadic_exp_bsplit_series()
60 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_exp_bsplit_series()
66 _fmpz_poly_reduce(W, 2*d - 1, a, j, lena); in _qadic_exp_bsplit_series()
80 const fmpz *a, const slong *j, slong lena, in _qadic_exp_bsplit() argument
83 const slong d = j[lena - 1]; in _qadic_exp_bsplit()
125 const slong d = j[lena - 1]; in _qadic_exp_balanced()
158 _qadic_exp_bsplit(r, r, w, d, a, j, lena, p, N); in _qadic_exp_balanced()
[all …]
/dports/net/ns3/ns-allinone-3.35/ns-3.35/src/lte/test/
H A Dlte-test-phy-error-model.cc208 enbDevs = lena->InstallEnbDevice (enbNodes); in DoRun()
209 stream += lena->AssignStreams (enbDevs, stream); in DoRun()
210 ueDevs = lena->InstallUeDevice (ueNodes); in DoRun()
211 stream += lena->AssignStreams (ueDevs, stream); in DoRun()
214 lena->Attach (ueDevs, enbDevs.Get (0)); in DoRun()
219 lena->ActivateDataRadioBearer (ueDevs, bearer); in DoRun()
244 lena->EnableRlcTraces (); in DoRun()
367 enbDevs = lena->InstallEnbDevice (enbNodes); in DoRun()
369 ueDevs = lena->InstallUeDevice (ueNodes); in DoRun()
373 lena->Attach (ueDevs, enbDevs.Get (0)); in DoRun()
[all …]
H A Dlte-test-harq.cc172 Ptr<LteHelper> lena = CreateObject<LteHelper> (); in DoRun() local
192 lena->SetPathlossModelAttribute ("ShadowSigmaOutdoor", DoubleValue (0.0)); in DoRun()
193 lena->SetPathlossModelAttribute ("ShadowSigmaIndoor", DoubleValue (0.0)); in DoRun()
199 lena->SetSchedulerType ("ns3::RrFfMacScheduler"); in DoRun()
202 enbDevs = lena->InstallEnbDevice (enbNodes); in DoRun()
203 ueDevs = lena->InstallUeDevice (ueNodes); in DoRun()
206 lena->Attach (ueDevs, enbDevs.Get (0)); in DoRun()
211 lena->ActivateDataRadioBearer (ueDevs, bearer); in DoRun()
238 lena->EnableRlcTraces (); in DoRun()
239 Ptr<RadioBearerStatsCalculator> rlcStats = lena->GetRlcStats (); in DoRun()
[all …]
/dports/chinese/gcin-gtk3/gcin-2.9.0/
H A Dtsa2d32.cpp94lena=*(pa++); if (lena < 0) lena = -lena; memcpy(&usecounta, pa, sizeof(usecount_t)); pa+= sizeof(… in qcmp()
96 pa += lena * phsz; in qcmp()
106 if (lena > lenb) in qcmp()
108 if (lena < lenb) in qcmp()
134 lena=*(pa++); if (lena < 0) lena = -lena; pa+= sizeof(usecount_t); in qcmp_eq()
136 pa += lena * phsz; in qcmp_eq()
146 if (lena > lenb) in qcmp_eq()
148 if (lena < lenb) in qcmp_eq()
172lena=*(pa++); if (lena < 0) lena = -lena; memcpy(&usecounta, pa, sizeof(usecount_t)); pa+= sizeof(… in qcmp_usecount()
182 if (lena > lenb) in qcmp_usecount()
[all …]
/dports/chinese/gcin/gcin-2.9.0/
H A Dtsa2d32.cpp94lena=*(pa++); if (lena < 0) lena = -lena; memcpy(&usecounta, pa, sizeof(usecount_t)); pa+= sizeof(… in qcmp()
96 pa += lena * phsz; in qcmp()
106 if (lena > lenb) in qcmp()
108 if (lena < lenb) in qcmp()
134 lena=*(pa++); if (lena < 0) lena = -lena; pa+= sizeof(usecount_t); in qcmp_eq()
136 pa += lena * phsz; in qcmp_eq()
146 if (lena > lenb) in qcmp_eq()
148 if (lena < lenb) in qcmp_eq()
172lena=*(pa++); if (lena < 0) lena = -lena; memcpy(&usecounta, pa, sizeof(usecount_t)); pa+= sizeof(… in qcmp_usecount()
182 if (lena > lenb) in qcmp_usecount()
[all …]
/dports/chinese/gcin-qt5/gcin-2.9.0/
H A Dtsa2d32.cpp94lena=*(pa++); if (lena < 0) lena = -lena; memcpy(&usecounta, pa, sizeof(usecount_t)); pa+= sizeof(… in qcmp()
96 pa += lena * phsz; in qcmp()
106 if (lena > lenb) in qcmp()
108 if (lena < lenb) in qcmp()
134 lena=*(pa++); if (lena < 0) lena = -lena; pa+= sizeof(usecount_t); in qcmp_eq()
136 pa += lena * phsz; in qcmp_eq()
146 if (lena > lenb) in qcmp_eq()
148 if (lena < lenb) in qcmp_eq()
172lena=*(pa++); if (lena < 0) lena = -lena; memcpy(&usecounta, pa, sizeof(usecount_t)); pa+= sizeof(… in qcmp_usecount()
182 if (lena > lenb) in qcmp_usecount()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/bipartite/
H A Dgenerators.py103 lena = len(aseq)
113 G = _add_nodes_with_bipartite_label(G, lena, lenb)
119 stubs = [[v] * aseq[v] for v in range(0, lena)]
122 stubs = [[v] * bseq[v - lena] for v in range(lena, lena + lenb)]
246 lena = len(aseq)
262 astubs = [[aseq[v], v] for v in range(0, lena)]
263 bstubs = [[bseq[v - lena], v] for v in range(lena, lena + lenb)]
586 def _add_nodes_with_bipartite_label(G, lena, lenb): argument
587 G.add_nodes_from(range(0, lena + lenb))
588 b = dict(zip(range(0, lena), [0] * lena))
[all …]

12345678910>>...52