| /dports/cad/calculix/CalculiX/cgx_2.18/src/ |
| H A D | meshSurf.c | 61 extern Nodes *npre;
1154 npre[npre[nm_i[i]].nr].nx=ppre[i].px; in mesh_tr3u()
1155 npre[npre[nm_i[i]].nr].ny=ppre[i].py; in mesh_tr3u()
1156 npre[npre[nm_i[i]].nr].nz=ppre[i].pz; in mesh_tr3u()
1174 v_result(&npre[ebufn[i][0]].nx,&npre[ebufn[i][3]].nx, v0); in mesh_tr3u()
1175 v_result(&npre[ebufn[i][3]].nx,&npre[ebufn[i][5]].nx, v1); in mesh_tr3u()
1195 v_result(&npre[ebufn[i][3]].nx,&npre[ebufn[i][1]].nx, v0); in mesh_tr3u()
1295 v_result(&npre[ebuf[0]].nx,&npre[ebuf[1]].nx, v0); in mesh_tr3u()
1296 v_result(&npre[ebuf[1]].nx,&npre[ebuf[2]].nx, v1); in mesh_tr3u()
1466 npre[nodnr].nx,npre[nodnr].ny,npre[nodnr].nz ); in fillSurf2()
[all …]
|
| /dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/ulong_extras/ |
| H A D | is_probabprime.c | 30 double npre; in n_is_probabprime() local
74 npre = n_precompute_inverse(n); in n_is_probabprime()
79 isprime = n_is_strong_probabprime_precomp(n, npre, UWORD(9345883071009581737), d); in n_is_probabprime()
83 isprime = n_is_strong_probabprime_precomp(n, npre, UWORD(336781006125), d) in n_is_probabprime()
84 && n_is_strong_probabprime_precomp(n, npre, UWORD(9639812373923155), d); in n_is_probabprime()
89 isprime = n_is_strong_probabprime_precomp(n, npre, UWORD(4230279247111683200), d) in n_is_probabprime()
90 && n_is_strong_probabprime_precomp(n, npre, UWORD(14694767155120705706), d) in n_is_probabprime()
91 && n_is_strong_probabprime_precomp(n, npre, UWORD(16641139526367750375), d); in n_is_probabprime()
|
| H A D | is_probabprime_fibonacci.c | 18 fchain_precomp(mp_limb_t m, mp_limb_t n, double npre) in fchain_precomp() argument
32 xy = n_mulmod_precomp(old.x, old.y, n, npre); in fchain_precomp()
39 n_submod(n_mulmod_precomp(old.y, old.y, n, npre), UWORD(2), n); in fchain_precomp()
45 n_submod(n_mulmod_precomp(old.x, old.x, n, npre), UWORD(2), n); in fchain_precomp()
113 double npre = n_precompute_inverse(n); in n_is_probabprime_fibonacci() local
115 V = fchain_precomp(m, n, npre); in n_is_probabprime_fibonacci()
116 return (n_mulmod_precomp(n - UWORD(3), V.x, n, npre) == in n_is_probabprime_fibonacci()
117 n_mulmod_precomp(UWORD(2), V.y, n, npre)); in n_is_probabprime_fibonacci()
|
| H A D | powmod_precomp.c | 17 n_powmod_ui_precomp(mp_limb_t a, mp_limb_t exp, mp_limb_t n, double npre) in n_powmod_ui_precomp() argument
30 x = n_mulmod_precomp(x, y, n, npre); in n_powmod_ui_precomp()
33 y = n_mulmod_precomp(y, y, n, npre); in n_powmod_ui_precomp()
40 n_powmod_precomp(mp_limb_t a, mp_limb_signed_t exp, mp_limb_t n, double npre) in n_powmod_precomp() argument
48 return n_powmod_ui_precomp(a, exp, n, npre); in n_powmod_precomp()
|
| H A D | is_probabprime_lucas.c | 18 lchain_precomp(mp_limb_t m, mp_limb_t a, mp_limb_t n, double npre) in lchain_precomp() argument
32 xy = n_submod(n_mulmod_precomp(old.x, old.y, n, npre), a, n); in lchain_precomp()
36 yy = n_submod(n_mulmod_precomp(old.y, old.y, n, npre), UWORD(2), n); in lchain_precomp()
42 xx = n_submod(n_mulmod_precomp(old.x, old.x, n, npre), UWORD(2), n); in lchain_precomp()
154 double npre = n_precompute_inverse(n); in n_is_probabprime_lucas() local
155 V = lchain_precomp(n + 1, A, n, npre); in n_is_probabprime_lucas()
157 left = n_mulmod_precomp(A, V.x, n, npre); in n_is_probabprime_lucas()
158 right = n_mulmod_precomp(2, V.y, n, npre); in n_is_probabprime_lucas()
|
| H A D | is_strong_probabprime_precomp.c | 19 n_is_strong_probabprime_precomp(mp_limb_t n, double npre, mp_limb_t a, in n_is_strong_probabprime_precomp() argument
27 a = n_mod2_precomp(a, n, npre); in n_is_strong_probabprime_precomp()
31 y = n_powmod_ui_precomp(a, t, n, npre); in n_is_strong_probabprime_precomp()
39 y = n_mulmod_precomp(y, y, n, npre); in n_is_strong_probabprime_precomp()
|
| H A D | mod2_precomp.c | 17 n_mod2_precomp(mp_limb_t a, mp_limb_t n, double npre) in n_mod2_precomp() argument
33 quot = (mp_limb_t) ((double) a * npre); in n_mod2_precomp()
38 quot -= (mp_limb_t) ((double) (-rem) * npre); in n_mod2_precomp()
40 quot += (mp_limb_t) ((double) rem * npre); in n_mod2_precomp()
|
| H A D | divrem2_precomp.c | 17 n_divrem2_precomp(mp_limb_t * q, mp_limb_t a, mp_limb_t n, double npre) in n_divrem2_precomp() argument
40 quot = (ulong) ( a * npre); in n_divrem2_precomp()
45 quot -= (mp_limb_t) ((double) (-rem) * npre); in n_divrem2_precomp()
47 quot += (mp_limb_t) ((double) rem * npre); in n_divrem2_precomp()
|
| /dports/math/e-antic/flint2-ae7ec89/ulong_extras/ |
| H A D | is_probabprime.c | 30 double npre; in n_is_probabprime() local
74 npre = n_precompute_inverse(n); in n_is_probabprime()
79 isprime = n_is_strong_probabprime_precomp(n, npre, UWORD(9345883071009581737), d); in n_is_probabprime()
83 isprime = n_is_strong_probabprime_precomp(n, npre, UWORD(336781006125), d) in n_is_probabprime()
84 && n_is_strong_probabprime_precomp(n, npre, UWORD(9639812373923155), d); in n_is_probabprime()
89 isprime = n_is_strong_probabprime_precomp(n, npre, UWORD(4230279247111683200), d) in n_is_probabprime()
90 && n_is_strong_probabprime_precomp(n, npre, UWORD(14694767155120705706), d) in n_is_probabprime()
91 && n_is_strong_probabprime_precomp(n, npre, UWORD(16641139526367750375), d); in n_is_probabprime()
|
| H A D | is_probabprime_fibonacci.c | 18 fchain_precomp(mp_limb_t m, mp_limb_t n, double npre) in fchain_precomp() argument
32 xy = n_mulmod_precomp(old.x, old.y, n, npre); in fchain_precomp()
39 n_submod(n_mulmod_precomp(old.y, old.y, n, npre), UWORD(2), n); in fchain_precomp()
45 n_submod(n_mulmod_precomp(old.x, old.x, n, npre), UWORD(2), n); in fchain_precomp()
113 double npre = n_precompute_inverse(n); in n_is_probabprime_fibonacci() local
115 V = fchain_precomp(m, n, npre); in n_is_probabprime_fibonacci()
116 return (n_mulmod_precomp(n - UWORD(3), V.x, n, npre) == in n_is_probabprime_fibonacci()
117 n_mulmod_precomp(UWORD(2), V.y, n, npre)); in n_is_probabprime_fibonacci()
|
| H A D | powmod_precomp.c | 17 n_powmod_ui_precomp(mp_limb_t a, mp_limb_t exp, mp_limb_t n, double npre) in n_powmod_ui_precomp() argument
30 x = n_mulmod_precomp(x, y, n, npre); in n_powmod_ui_precomp()
33 y = n_mulmod_precomp(y, y, n, npre); in n_powmod_ui_precomp()
40 n_powmod_precomp(mp_limb_t a, mp_limb_signed_t exp, mp_limb_t n, double npre) in n_powmod_precomp() argument
48 return n_powmod_ui_precomp(a, exp, n, npre); in n_powmod_precomp()
|
| H A D | is_probabprime_lucas.c | 18 lchain_precomp(mp_limb_t m, mp_limb_t a, mp_limb_t n, double npre) in lchain_precomp() argument
32 xy = n_submod(n_mulmod_precomp(old.x, old.y, n, npre), a, n); in lchain_precomp()
36 yy = n_submod(n_mulmod_precomp(old.y, old.y, n, npre), UWORD(2), n); in lchain_precomp()
42 xx = n_submod(n_mulmod_precomp(old.x, old.x, n, npre), UWORD(2), n); in lchain_precomp()
154 double npre = n_precompute_inverse(n); in n_is_probabprime_lucas() local
155 V = lchain_precomp(n + 1, A, n, npre); in n_is_probabprime_lucas()
157 left = n_mulmod_precomp(A, V.x, n, npre); in n_is_probabprime_lucas()
158 right = n_mulmod_precomp(2, V.y, n, npre); in n_is_probabprime_lucas()
|
| H A D | is_strong_probabprime_precomp.c | 19 n_is_strong_probabprime_precomp(mp_limb_t n, double npre, mp_limb_t a, in n_is_strong_probabprime_precomp() argument
27 a = n_mod2_precomp(a, n, npre); in n_is_strong_probabprime_precomp()
31 y = n_powmod_ui_precomp(a, t, n, npre); in n_is_strong_probabprime_precomp()
39 y = n_mulmod_precomp(y, y, n, npre); in n_is_strong_probabprime_precomp()
|
| H A D | mod2_precomp.c | 17 n_mod2_precomp(mp_limb_t a, mp_limb_t n, double npre) in n_mod2_precomp() argument
33 quot = (mp_limb_t) ((double) a * npre); in n_mod2_precomp()
38 quot -= (mp_limb_t) ((double) (-rem) * npre); in n_mod2_precomp()
40 quot += (mp_limb_t) ((double) rem * npre); in n_mod2_precomp()
|
| H A D | divrem2_precomp.c | 17 n_divrem2_precomp(mp_limb_t * q, mp_limb_t a, mp_limb_t n, double npre) in n_divrem2_precomp() argument
40 quot = (ulong) ( a * npre); in n_divrem2_precomp()
45 quot -= (mp_limb_t) ((double) (-rem) * npre); in n_divrem2_precomp()
47 quot += (mp_limb_t) ((double) rem * npre); in n_divrem2_precomp()
|
| /dports/math/flint2/flint-2.8.4/ulong_extras/ |
| H A D | is_probabprime.c | 30 double npre; in n_is_probabprime() local
74 npre = n_precompute_inverse(n); in n_is_probabprime()
79 isprime = n_is_strong_probabprime_precomp(n, npre, UWORD(9345883071009581737), d); in n_is_probabprime()
83 isprime = n_is_strong_probabprime_precomp(n, npre, UWORD(336781006125), d) in n_is_probabprime()
84 && n_is_strong_probabprime_precomp(n, npre, UWORD(9639812373923155), d); in n_is_probabprime()
89 isprime = n_is_strong_probabprime_precomp(n, npre, UWORD(4230279247111683200), d) in n_is_probabprime()
90 && n_is_strong_probabprime_precomp(n, npre, UWORD(14694767155120705706), d) in n_is_probabprime()
91 && n_is_strong_probabprime_precomp(n, npre, UWORD(16641139526367750375), d); in n_is_probabprime()
|
| H A D | is_probabprime_fibonacci.c | 18 fchain_precomp(mp_limb_t m, mp_limb_t n, double npre) in fchain_precomp() argument
32 xy = n_mulmod_precomp(old.x, old.y, n, npre); in fchain_precomp()
39 n_submod(n_mulmod_precomp(old.y, old.y, n, npre), UWORD(2), n); in fchain_precomp()
45 n_submod(n_mulmod_precomp(old.x, old.x, n, npre), UWORD(2), n); in fchain_precomp()
113 double npre = n_precompute_inverse(n); in n_is_probabprime_fibonacci() local
115 V = fchain_precomp(m, n, npre); in n_is_probabprime_fibonacci()
116 return (n_mulmod_precomp(n - UWORD(3), V.x, n, npre) == in n_is_probabprime_fibonacci()
117 n_mulmod_precomp(UWORD(2), V.y, n, npre)); in n_is_probabprime_fibonacci()
|
| H A D | powmod_precomp.c | 17 n_powmod_ui_precomp(mp_limb_t a, mp_limb_t exp, mp_limb_t n, double npre) in n_powmod_ui_precomp() argument
30 x = n_mulmod_precomp(x, y, n, npre); in n_powmod_ui_precomp()
33 y = n_mulmod_precomp(y, y, n, npre); in n_powmod_ui_precomp()
40 n_powmod_precomp(mp_limb_t a, mp_limb_signed_t exp, mp_limb_t n, double npre) in n_powmod_precomp() argument
48 return n_powmod_ui_precomp(a, exp, n, npre); in n_powmod_precomp()
|
| H A D | is_probabprime_lucas.c | 18 lchain_precomp(mp_limb_t m, mp_limb_t a, mp_limb_t n, double npre) in lchain_precomp() argument
32 xy = n_submod(n_mulmod_precomp(old.x, old.y, n, npre), a, n); in lchain_precomp()
36 yy = n_submod(n_mulmod_precomp(old.y, old.y, n, npre), UWORD(2), n); in lchain_precomp()
42 xx = n_submod(n_mulmod_precomp(old.x, old.x, n, npre), UWORD(2), n); in lchain_precomp()
154 double npre = n_precompute_inverse(n); in n_is_probabprime_lucas() local
155 V = lchain_precomp(n + 1, A, n, npre); in n_is_probabprime_lucas()
157 left = n_mulmod_precomp(A, V.x, n, npre); in n_is_probabprime_lucas()
158 right = n_mulmod_precomp(2, V.y, n, npre); in n_is_probabprime_lucas()
|
| H A D | is_strong_probabprime_precomp.c | 19 n_is_strong_probabprime_precomp(mp_limb_t n, double npre, mp_limb_t a, in n_is_strong_probabprime_precomp() argument
27 a = n_mod2_precomp(a, n, npre); in n_is_strong_probabprime_precomp()
31 y = n_powmod_ui_precomp(a, t, n, npre); in n_is_strong_probabprime_precomp()
39 y = n_mulmod_precomp(y, y, n, npre); in n_is_strong_probabprime_precomp()
|
| H A D | mod2_precomp.c | 17 n_mod2_precomp(mp_limb_t a, mp_limb_t n, double npre) in n_mod2_precomp() argument
33 quot = (mp_limb_t) ((double) a * npre); in n_mod2_precomp()
38 quot -= (mp_limb_t) ((double) (-rem) * npre); in n_mod2_precomp()
40 quot += (mp_limb_t) ((double) rem * npre); in n_mod2_precomp()
|
| /dports/math/py-symcxx/symcxx-0.1.10/include/symcxx/ |
| H A D | isprime.hpp | 4 template<idx_t npre=512>
6 std::array<intgr_t, npre> known;
9 known[npre-1] = 0; in PrimeSieve()
12 while (idx < npre){ in PrimeSieve()
25 if (known[npre-1] != 0){ in is_prime()
26 for (idx_t idx=0; idx < npre; ++idx){ in is_prime()
|
| /dports/science/dynare/dynare-4.6.4/contrib/ms-sbvar/switch_dw/state_space/sbvar/ |
| H A D | VARio_matlab.c | 61 npre=nvars * nlags + nexg; in Combine_matlab_standard()
99 if (IV[j] != npre) in Combine_matlab_standard()
114 V[j]=IdentityMatrix((TMatrix)NULL,npre); in Combine_matlab_standard()
126 InitializeMatrix(S=CreateMatrix(npre,nvars),0.0); in Combine_matlab_standard()
156 if (!dw_ReadMatrix(f_in,Aplus_prior[j]=CreateMatrix(npre,npre))) ReadError_VARio_matlab(id); in Combine_matlab_standard()
303 for (i=p->npre-1; i >= 0; i--) in ReadConstantParameters()
361 npre=nvars * nlags + nexg; in CreateStateModel_VAR_matlab()
379 if (IV[j] != npre) in CreateStateModel_VAR_matlab()
381 printf("V[%d] not %d x %d\n",j,npre,npre); in CreateStateModel_VAR_matlab()
386 V[j]=IdentityMatrix((TMatrix)NULL,npre); in CreateStateModel_VAR_matlab()
[all …]
|
| /dports/lang/gawk/gawk-5.1.1/test/ |
| H A D | sortglos.awk | 3 npre=0;
8 pr=="y" { npre++; pre[npre]=$0; }
23 for ( i=1; i<=npre; i++ ) { print pre[i]; }
47 print "@c npre=" npre;
|
| /dports/math/mpir/mpir-3.0.0/mpz/ |
| H A D | likely_prime_p.c | 293 double npre = n_precompute_inverse(n); in n_powmod() local
295 return n_powmod_precomp(a, exp, n, npre); in n_powmod()
537 y = n_powmod_precomp(a, t, n, npre); in n_is_strong_pseudoprime_precomp()
544 y = n_mulmod_precomp(y, y, n, npre); in n_is_strong_pseudoprime_precomp()
586 xy = n_mulmod_precomp(old.x, old.y, n, npre); in fchain_precomp()
659 double npre = n_precompute_inverse(n); in n_is_pseudoprime_fibonacci() local
661 V = fchain_precomp(m, n, npre); in n_is_pseudoprime_fibonacci()
802 double npre = n_precompute_inverse(n); in n_is_pseudoprime_lucas() local
803 V = lchain_precomp(n + 1, A, n, npre); in n_is_pseudoprime_lucas()
805 left = n_mulmod_precomp(A, V.x, n, npre); in n_is_pseudoprime_lucas()
[all …]
|