/dports/math/gap/gap-4.11.0/extern/gmp/mpn/generic/ |
H A D | mul_fft.c | 707 MPN_ZERO (T + j, nprime + 1 - j); in mpn_mul_fft_decompose() 712 MPN_ZERO (A, nprime + 1); in mpn_mul_fft_decompose() 713 A += nprime + 1; in mpn_mul_fft_decompose() 749 Bp[0] = T + nprime + 1; in mpn_mul_fft_internal() 758 MPN_ZERO (T, nprime + 1); in mpn_mul_fft_internal() 770 cc += mpn_add_1 (n + nprime + 1, n + nprime + 1, in mpn_mul_fft_internal() 861 nprime = Nprime / GMP_NUMB_BITS; in mpn_mul_fft() 871 if ((nprime & (K2 - 1)) == 0) in mpn_mul_fft() 873 nprime = (nprime + K2 - 1) & -K2; in mpn_mul_fft() 874 Nprime = nprime * GMP_LIMB_BITS; in mpn_mul_fft() [all …]
|
/dports/math/mingw32-libgmp/gmp-6.0.0/mpn/generic/ |
H A D | mul_fft.c | 707 MPN_ZERO (T + j, nprime + 1 - j); in mpn_mul_fft_decompose() 712 MPN_ZERO (A, nprime + 1); in mpn_mul_fft_decompose() 713 A += nprime + 1; in mpn_mul_fft_decompose() 749 Bp[0] = T + nprime + 1; in mpn_mul_fft_internal() 758 MPN_ZERO (T, nprime + 1); in mpn_mul_fft_internal() 770 cc += mpn_add_1 (n + nprime + 1, n + nprime + 1, in mpn_mul_fft_internal() 861 nprime = Nprime / GMP_NUMB_BITS; in mpn_mul_fft() 871 if ((nprime & (K2 - 1)) == 0) in mpn_mul_fft() 873 nprime = (nprime + K2 - 1) & -K2; in mpn_mul_fft() 874 Nprime = nprime * GMP_LIMB_BITS; in mpn_mul_fft() [all …]
|
/dports/math/gmp/gmp-6.2.1/mpn/generic/ |
H A D | mul_fft.c | 738 MPN_ZERO (T + j, nprime + 1 - j); in mpn_mul_fft_decompose() 743 MPN_ZERO (A, nprime + 1); in mpn_mul_fft_decompose() 744 A += nprime + 1; in mpn_mul_fft_decompose() 780 Bp[0] = T + nprime + 1; in mpn_mul_fft_internal() 789 MPN_ZERO (T, nprime + 1); in mpn_mul_fft_internal() 801 cc += mpn_add_1 (n + nprime + 1, n + nprime + 1, in mpn_mul_fft_internal() 892 nprime = Nprime / GMP_NUMB_BITS; in mpn_mul_fft() 902 if ((nprime & (K2 - 1)) == 0) in mpn_mul_fft() 904 nprime = (nprime + K2 - 1) & -K2; in mpn_mul_fft() 905 Nprime = nprime * GMP_LIMB_BITS; in mpn_mul_fft() [all …]
|
/dports/math/kalker/gmp-mpfr-sys-21966f4bfb56c87d407eb14c72e92ef4e55856aa/gmp-6.2.1-c/mpn/generic/ |
H A D | mul_fft.c | 738 MPN_ZERO (T + j, nprime + 1 - j); in mpn_mul_fft_decompose() 743 MPN_ZERO (A, nprime + 1); in mpn_mul_fft_decompose() 744 A += nprime + 1; in mpn_mul_fft_decompose() 780 Bp[0] = T + nprime + 1; in mpn_mul_fft_internal() 789 MPN_ZERO (T, nprime + 1); in mpn_mul_fft_internal() 801 cc += mpn_add_1 (n + nprime + 1, n + nprime + 1, in mpn_mul_fft_internal() 892 nprime = Nprime / GMP_NUMB_BITS; in mpn_mul_fft() 902 if ((nprime & (K2 - 1)) == 0) in mpn_mul_fft() 904 nprime = (nprime + K2 - 1) & -K2; in mpn_mul_fft() 905 Nprime = nprime * GMP_LIMB_BITS; in mpn_mul_fft() [all …]
|
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/src/ |
H A D | atom_map.cpp | 324 int nprime = n+1; in next_prime() local 325 if (nprime % 2 == 0) nprime++; in next_prime() 328 while (nprime <= MAXSMALLINT) { in next_prime() 330 if (nprime % factor == 0) break; in next_prime() 331 if (factor == root) return nprime; in next_prime() 332 nprime += 2; in next_prime()
|
/dports/misc/py-eemeter/eemeter-3.1.0/eemeter/ |
H A D | derivatives.py | 36 nprime, argument 45 t_stat * rmse_base_residuals * (post_obs * base_obs / nprime) ** 0.5 63 nprime, argument 80 * ((base_obs / nprime) * (1.0 + (2.0 / nprime)) * (1.0 / post_obs)) ** 0.5 122 nprime = float(base_obs * (1 - autocorr_resid) / (1 + autocorr_resid)) 134 nprime, 145 nprime,
|
/dports/science/lammps/lammps-stable_29Sep2021/src/ |
H A D | atom_map.cpp | 374 int nprime = n+1; in next_prime() local 375 if (nprime % 2 == 0) nprime++; in next_prime() 378 while (nprime < MAXSMALLINT) { in next_prime() 380 if (nprime % factor == 0) break; in next_prime() 381 if (factor == root) return nprime; in next_prime() 382 nprime += 2; in next_prime()
|
/dports/misc/openmvg/openMVG-2.0/src/openMVG/multiview/ |
H A D | triangulation.cpp | 172 const Vec3 nprime = na.squaredNorm() >= nb.squaredNorm() ? na.normalized() : nb.normalized(); in TriangulateLInfinityAngular() local 174 const Vec3 mprime0 = Rx0 - (Rx0.dot(nprime)) * nprime; in TriangulateLInfinityAngular() 175 const Vec3 mprime1 = x1 - (x1.dot(nprime)) * nprime; in TriangulateLInfinityAngular()
|
/dports/science/lammps/lammps-stable_29Sep2021/src/DEPEND/ |
H A D | fastdep.c | 102 int nprime, factor, root; in next_prime() local 105 nprime = num + (num & 1) + 1; in next_prime() 107 while (nprime < 2 * num) { in next_prime() 109 root = isqrt(nprime) + 1; in next_prime() 111 if (nprime % factor == 0) break; in next_prime() 114 if (factor >= root) return nprime; in next_prime() 115 nprime += 2; in next_prime() 117 return nprime; in next_prime()
|
/dports/games/aquaria/Aquaria-OSE-v1.002-22-g84366ad/files/scripts/maps/ |
H A D | map_eric.lua | 33 local nprime = getNode("nprime") 94 cam_toNode(nprime)
|
/dports/audio/rosegarden/rosegarden-21.06.1/src/base/ |
H A D | NotationQuantizer.cpp | 304 Segment::iterator n(s->end()), nprime(s->end()); in quantizeAbsoluteTime() local 312 nprime = j; in quantizeAbsoluteTime() 319 if (n != s->end() && n != nprime) { in quantizeAbsoluteTime() 322 if (nprime != s->end()) { in quantizeAbsoluteTime() 323 cout << "found nprime at " << (*nprime)->getAbsoluteTime() in quantizeAbsoluteTime() 324 << ", duration " << (*nprime)->getDuration() << endl; in quantizeAbsoluteTime() 334 t, d, noteType, n, nprime, right); in quantizeAbsoluteTime() 390 const Segment::iterator &nprime, in scoreAbsoluteTimeForBase() argument 440 if (n != nprime) { in scoreAbsoluteTimeForBase() 444 if (nprime != s->end()) { in scoreAbsoluteTimeForBase() [all …]
|
/dports/security/gnupg1/gnupg-1.4.23/cipher/ |
H A D | primegen.c | 110 unsigned nprime; in generate_elg_prime() local 188 nprime = mpi_get_nbits(prime); in generate_elg_prime() 189 if( nprime < pbits ) { in generate_elg_prime() 201 if( nprime > pbits ) { in generate_elg_prime() 213 } while( !(nprime == pbits && check_prime( prime, val_2 )) ); in generate_elg_prime()
|
/dports/mail/mailagent/mailagent-9a14a15/agent/filter/ |
H A D | hash.c | 60 private uint32 nprime(); /* Find next prime number */ 78 hsize = nprime((5 * n) / 4); /* Table's size */ 359 private uint32 nprime(n) in nprime() function
|
/dports/math/mingw32-libgmp/gmp-6.0.0/tune/ |
H A D | tuneup.c | 778 mp_bitcnt_t N, Nprime, nprime, M; in fftfill() local 786 nprime = Nprime / GMP_NUMB_BITS; in fftfill() 787 if (nprime >= (sqr ? SQR_FFT_MODF_THRESHOLD : MUL_FFT_MODF_THRESHOLD)) in fftfill() 792 K2 = 1L << mpn_fft_best_k (nprime, sqr); in fftfill() 793 if ((nprime & (K2 - 1)) == 0) in fftfill() 795 nprime = (nprime + K2 - 1) & -K2; in fftfill() 796 Nprime = nprime * GMP_LIMB_BITS; in fftfill() 799 ASSERT_ALWAYS (nprime < pl); in fftfill()
|
/dports/math/gap/gap-4.11.0/extern/gmp/tune/ |
H A D | tuneup.c | 790 mp_bitcnt_t N, Nprime, nprime, M; in fftfill() local 798 nprime = Nprime / GMP_NUMB_BITS; in fftfill() 799 if (nprime >= (sqr ? SQR_FFT_MODF_THRESHOLD : MUL_FFT_MODF_THRESHOLD)) in fftfill() 804 K2 = 1L << mpn_fft_best_k (nprime, sqr); in fftfill() 805 if ((nprime & (K2 - 1)) == 0) in fftfill() 807 nprime = (nprime + K2 - 1) & -K2; in fftfill() 808 Nprime = nprime * GMP_LIMB_BITS; in fftfill() 811 ASSERT_ALWAYS (nprime < pl); in fftfill()
|
/dports/math/kalker/gmp-mpfr-sys-21966f4bfb56c87d407eb14c72e92ef4e55856aa/gmp-6.2.1-c/tune/ |
H A D | tuneup.c | 854 mp_bitcnt_t N, Nprime, nprime, M; in fftfill() local 862 nprime = Nprime / GMP_NUMB_BITS; in fftfill() 863 if (nprime >= (sqr ? SQR_FFT_MODF_THRESHOLD : MUL_FFT_MODF_THRESHOLD)) in fftfill() 868 K2 = 1L << mpn_fft_best_k (nprime, sqr); in fftfill() 869 if ((nprime & (K2 - 1)) == 0) in fftfill() 871 nprime = (nprime + K2 - 1) & -K2; in fftfill() 872 Nprime = nprime * GMP_LIMB_BITS; in fftfill() 875 ASSERT_ALWAYS (nprime < pl); in fftfill()
|
/dports/math/gmp/gmp-6.2.1/tune/ |
H A D | tuneup.c | 854 mp_bitcnt_t N, Nprime, nprime, M; in fftfill() local 862 nprime = Nprime / GMP_NUMB_BITS; in fftfill() 863 if (nprime >= (sqr ? SQR_FFT_MODF_THRESHOLD : MUL_FFT_MODF_THRESHOLD)) in fftfill() 868 K2 = 1L << mpn_fft_best_k (nprime, sqr); in fftfill() 869 if ((nprime & (K2 - 1)) == 0) in fftfill() 871 nprime = (nprime + K2 - 1) & -K2; in fftfill() 872 Nprime = nprime * GMP_LIMB_BITS; in fftfill() 875 ASSERT_ALWAYS (nprime < pl); in fftfill()
|
/dports/security/libgcrypt/libgcrypt-1.9.4/cipher/ |
H A D | primegen.c | 323 unsigned int nprime = 0; /* Bits of PRIME. */ in prime_generate_internal() local 537 nprime = mpi_get_nbits (prime); in prime_generate_internal() 539 if (nprime < pbits) in prime_generate_internal() 554 if (nprime > pbits) in prime_generate_internal() 569 while (! ((nprime == pbits) && check_prime (prime, val_2, 5, in prime_generate_internal()
|
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/libgcrypt/cipher/ |
H A D | primegen.c | 323 unsigned int nprime = 0; /* Bits of PRIME. */ in prime_generate_internal() local 537 nprime = mpi_get_nbits (prime); in prime_generate_internal() 539 if (nprime < pbits) in prime_generate_internal() 554 if (nprime > pbits) in prime_generate_internal() 569 while (! ((nprime == pbits) && check_prime (prime, val_2, 5, in prime_generate_internal()
|
/dports/science/dalton/dalton-66052b3af5ea7225e31178bf9a8b031913c72190/DALTON/abacus/ |
H A D | ecp.F | 1116 nprime=npi+nlo+la+1 1117 qold1=qcomp(nprime,lb)/dfac(la+la+3) 1133 nprime=nprime+2 1134 f1=(nprime+nprime-5) 1135 f2=((lb-nprime+4)*(lb+nprime-3))
|
/dports/math/gap/gap-4.11.0/hpcgap/lib/ |
H A D | fldabnum.gi | 951 nprime, # biggest divisor of `n' coprime to `m' 956 transversal, # roots in basis of `CF(n/nprime) / CF(m)', 978 nprime := Product( Filtered( factors, x -> m mod x <> 0 ) ); 981 zumb:= List( ZumbroichBase( nprime, 1 ), x -> x * ( n / nprime ) ); 982 transversal := List( ZumbroichBase( n / nprime, m ), x -> x * nprime ); 986 if nprime = NN then 1060 No := nprime; 1148 # `( pnt * rep ) mod nprime' ?
|
/dports/math/gap/gap-4.11.0/lib/ |
H A D | fldabnum.gi | 940 nprime, # biggest divisor of `n' coprime to `m' 945 transversal, # roots in basis of `CF(n/nprime) / CF(m)', 967 nprime := Product( Filtered( factors, x -> m mod x <> 0 ) ); 970 zumb:= List( ZumbroichBase( nprime, 1 ), x -> x * ( n / nprime ) ); 971 transversal := List( ZumbroichBase( n / nprime, m ), x -> x * nprime ); 975 if nprime = NN then 1049 No := nprime; 1137 # `( pnt * rep ) mod nprime' ?
|
/dports/math/gmp/gmp-6.2.1/tests/mpz/ |
H A D | t-jac.c | 750 ref_jacobi (mpz_srcptr a, mpz_srcptr b, unsigned nprime, in ref_jacobi() argument 756 for (i = 0, res = 1; i < nprime; i++) in ref_jacobi()
|
/dports/math/gap/gap-4.11.0/extern/gmp/tests/mpz/ |
H A D | t-jac.c | 754 ref_jacobi (mpz_srcptr a, mpz_srcptr b, unsigned nprime, in ref_jacobi() argument 760 for (i = 0, res = 1; i < nprime; i++) in ref_jacobi()
|
/dports/math/mingw32-libgmp/gmp-6.0.0/tests/mpz/ |
H A D | t-jac.c | 754 ref_jacobi (mpz_srcptr a, mpz_srcptr b, unsigned nprime, in ref_jacobi() argument 760 for (i = 0, res = 1; i < nprime; i++) in ref_jacobi()
|