/dports/devel/hyperscan/boost_1_75_0/libs/safe_numerics/example/ |
H A D | motor2.c | 40 int16 denom; // 4.n+1 in ramp algo variable 66 denom = ((step_no - move) * 4) + 1; in isr_motor_step() 68 denom = ((move - step_no) * 4) - 1; in isr_motor_step() 70 denom += 4; in isr_motor_step() 80 denom += 4; in isr_motor_step() 85 if(denom > 0) in isr_motor_step() 86 c -= (c << 1) / denom; in isr_motor_step() 88 c += (c << 1) / -denom; in isr_motor_step() 104 denom = 5 - ((move - step_no) * 4); in isr_motor_step() 141 denom = 1; // 4.n+1, n=0 in motor_run()
|
/dports/math/R-cran-VGAM/VGAM/R/ |
H A D | family.loglin.R | 82 cbind("00" = 1/denom, 83 "01" = exp(u2) / denom, 84 "10" = exp(u1) / denom, 85 "11" = exp(u1+u2+u12) / denom) 110 u0 <- -log(denom) 140 du0.du12 <- -exp(u1 + u2 + u12) / denom 312 u0 <- -log(denom) 357 c(w) * cbind(-A1/denom + y[, 1], 358 -A2/denom + y[, 2], 359 -A3/denom + y[, 3], [all …]
|
/dports/games/uqm/uqm-0.8.0/src/uqm/ |
H A D | flash.c | 59 int numer, int denom); 61 int numer, int denom); 346 int denom) { in Flash_setMergeFactors() argument 355 context->denom = denom; in Flash_setMergeFactors() 572 *resDenom = denom * context->denom; in Flash_blendFraction() 761 cachePos = ((context->cacheSize - 1) * numer + (denom / 2)) / denom; in Flash_drawCachedFrame() 770 int denom; in Flash_drawCurrentFrame() local 775 denom = 1; in Flash_drawCurrentFrame() 780 denom = 1; in Flash_drawCurrentFrame() 793 if (numer > denom) in Flash_drawCurrentFrame() [all …]
|
/dports/math/latte-integrale/latte-version_1_7_6/code/latte/ |
H A D | rational.h | 107 rationalVector(const vec_ZZ & numer, const ZZ & denom); 125 denominator[i] = denom; 132 void getEntry(const int i, ZZ &numer, ZZ &denom) const in getEntry() argument 137 denom = denominator[i]; in getEntry() 146 void set_denominator(int i, const ZZ &denom) in set_denominator() argument 148 denominator[i] = denom; in set_denominator() 177 RationalNTL(const ZZ &num, const ZZ& denom); 178 RationalNTL(const ZZ &num, const int denom); 179 RationalNTL(const int num, const ZZ& denom); 180 RationalNTL(const int num, const int denom); [all …]
|
/dports/multimedia/librespot/librespot-0.1.3/cargo-crates/nalgebra-0.18.1/src/linalg/ |
H A D | givens.rs | 47 let denom = (mod0 * mod0 + s.modulus_squared()).sqrt(); in try_new() localVariable 49 if denom > eps { in try_new() 50 let norm = sign0.scale(denom); in try_new() 51 let c = mod0 / denom; in try_new() 66 let denom = (mod0 * mod0 + v[1].modulus_squared()).sqrt(); in cancel_y() localVariable 67 let c = mod0 / denom; in cancel_y() 68 let s = -v[1] / sign0.scale(denom); in cancel_y() 69 let r = sign0.scale(denom); in cancel_y() 84 let c = mod1 / denom; in cancel_x() 85 let s = (v[0].conjugate() * sign1).unscale(denom); in cancel_x() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/native_client/tests/math/ |
H A D | float_remainder.c | 37 #define CHECK_NAN(err, numer, denom) \ argument 39 double res = fmod(numer, denom); \ 43 __LINE__, numer, denom, res); \ 48 #define CHECK_NANF(err, numer, denom) \ argument 50 float res = fmodf(numer, denom); \ 54 __LINE__, numer, denom, res); \ 62 #define CHECK_EQ(expect, numer, denom) \ argument 64 double res = fmod(numer, denom); \ 74 numer, denom, res, expect); \ 80 #define CHECK_EQF(expect, numer, denom) \ argument [all …]
|
/dports/finance/quantlib/QuantLib-1.20/ql/math/integrals/ |
H A D | gaussianorthogonalpolynomial.cpp | 108 Real denom = (2.0*i+alpha_+beta_)*(2.0*i+alpha_+beta_+2); in alpha() local 110 if (close_enough(denom,0.0)) { in alpha() 117 denom= 2*(2.0*i+alpha_+beta_+1); in alpha() 119 QL_ASSERT(!close_enough(denom,0.0), "can't compute a_k for jacobi integration\n"); in alpha() 123 return num / denom; in alpha() 128 Real denom = (2.0*i+alpha_+beta_)*(2.0*i+alpha_+beta_) in beta() local 131 if (close_enough(denom,0.0)) { in beta() 137 denom= 2.0*(2.0*i+alpha_+beta_); in beta() 138 denom*=denom-1; in beta() 139 QL_ASSERT(!close_enough(denom,0.0), "can't compute b_k for jacobi integration\n"); in beta() [all …]
|
/dports/audio/spotifyd/spotifyd-0.3.0/cargo-crates/nalgebra-0.18.1/src/linalg/ |
H A D | givens.rs | 47 let denom = (mod0 * mod0 + s.modulus_squared()).sqrt(); 49 if denom > eps { 50 let norm = sign0.scale(denom); 51 let c = mod0 / denom; 66 let denom = (mod0 * mod0 + v[1].modulus_squared()).sqrt(); 67 let c = mod0 / denom; 68 let s = -v[1] / sign0.scale(denom); 69 let r = sign0.scale(denom); 84 let c = mod1 / denom; 85 let s = (v[0].conjugate() * sign1).unscale(denom); [all …]
|
/dports/math/barvinok/barvinok-0.41.5/ |
H A D | dpoly.cc | 80 value_multiply(denom->p[i], denom->p[i-1], denom->p[0]); in div() 91 return denom; in div() 97 Vector *denom = div(d); in div() local 110 Vector_Free(denom); in div() 116 Vector *denom = div(d); in div() local 128 Vector_Free(denom); in div() 151 denom = 1; in dpoly_r() 159 denom = 1; in dpoly_r() 174 denom = 1; in dpoly_r() 206 denom = num->denom; in dpoly_r() [all …]
|
/dports/math/eclib/eclib-20210318/libsrc/eclib/ |
H A D | msubspace.h | 34 :pivots(iota(n)),basis(midmat(n)) {denom=1;} in pivots() 36 :denom(d),pivots(p),basis(b) {} in msubspace() 38 :denom(s.denom),pivots(s.pivots),basis(s.basis) {} in msubspace() 43 {pivots=s.pivots; basis=s.basis; denom=s.denom;} 50 friend bigint denom(const msubspace& s); // the denominator 62 bigint denom; 85 inline bigint denom(const msubspace& s) {return s.denom;} // the denominator in denom() function
|
/dports/lang/sdcc/sdcc-4.0.0/support/regression/fwk/lib/ |
H A D | testfwk.c | 34 __div(int num, int denom) in __div() argument 37 while (num >= denom) in __div() 40 num -= denom; in __div() 46 __mod (int num, int denom) in __mod() argument 48 while (num >= denom) in __mod() 50 num -= denom; in __mod() 55 #define __div(num, denom) ((num) / (denom)) argument 56 #define __mod(num, denom) ((num) % (denom)) argument
|
/dports/devel/hyperscan/boost_1_75_0/boost/math/special_functions/detail/ |
H A D | bessel_jy_asym.hpp | 51 T denom = 4 * x; in asymptotic_bessel_phase_mx() local 52 T denom_mult = denom * denom; in asymptotic_bessel_phase_mx() 56 denom *= denom_mult; in asymptotic_bessel_phase_mx() 58 denom *= denom_mult; in asymptotic_bessel_phase_mx() 60 denom *= denom_mult; in asymptotic_bessel_phase_mx() 199 T denom = ex; 201 s -= num / denom; 204 denom *= ex * 2; 205 s += num / denom; 208 denom *= ex * 3; [all …]
|
/dports/devel/R-cran-BH/BH/inst/include/boost/math/special_functions/detail/ |
H A D | bessel_jy_asym.hpp | 51 T denom = 4 * x; in asymptotic_bessel_phase_mx() local 52 T denom_mult = denom * denom; in asymptotic_bessel_phase_mx() 56 denom *= denom_mult; in asymptotic_bessel_phase_mx() 58 denom *= denom_mult; in asymptotic_bessel_phase_mx() 60 denom *= denom_mult; in asymptotic_bessel_phase_mx() 199 T denom = ex; 201 s -= num / denom; 204 denom *= ex * 2; 205 s += num / denom; 208 denom *= ex * 3; [all …]
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/math/special_functions/detail/ |
H A D | bessel_jy_asym.hpp | 51 T denom = 4 * x; in asymptotic_bessel_phase_mx() local 52 T denom_mult = denom * denom; in asymptotic_bessel_phase_mx() 56 denom *= denom_mult; in asymptotic_bessel_phase_mx() 58 denom *= denom_mult; in asymptotic_bessel_phase_mx() 60 denom *= denom_mult; in asymptotic_bessel_phase_mx() 199 T denom = ex; 201 s -= num / denom; 204 denom *= ex * 2; 205 s += num / denom; 208 denom *= ex * 3; [all …]
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/math/special_functions/detail/ |
H A D | bessel_jy_asym.hpp | 51 T denom = 4 * x; in asymptotic_bessel_phase_mx() local 52 T denom_mult = denom * denom; in asymptotic_bessel_phase_mx() 56 denom *= denom_mult; in asymptotic_bessel_phase_mx() 58 denom *= denom_mult; in asymptotic_bessel_phase_mx() 60 denom *= denom_mult; in asymptotic_bessel_phase_mx() 199 T denom = ex; 201 s -= num / denom; 204 denom *= ex * 2; 205 s += num / denom; 208 denom *= ex * 3; [all …]
|
/dports/finance/alkimia/alkimia-8.1.0/src/ |
H A D | alkvalue.cpp | 138 if (denom != 0) { in AlkValue() 271 mpz_class denom = _denom; in convertDenominator() local 287 if (sgn(denom) < 0) { in convertDenominator() 290 denom = -denom; in convertDenominator() 296 out_denom = denom; in convertDenominator() 305 out_denom = denom; in convertDenominator() 393 while (denom > 1) { in denominatorToPrecision() 395 denom /= 10; in denominatorToPrecision() 402 mpz_class denom = 1; in precisionToDenominator() local 404 denom *= 10; in precisionToDenominator() [all …]
|
/dports/science/jmol/jmol-14.32.7/src/org/jmol/symmetry/ |
H A D | SymmetryOperation.java | 409 denom = 12; in setFromMatrix() 484 int denom = 0; in getMatrixFromString() local 508 denom = 0; in getMatrixFromString() 543 denom = 0; in getMatrixFromString() 559 denom = 0; in getMatrixFromString() 625 denom = (int) Math.abs(denom/f); in toDivisor() 642 n += denom; in xyzFraction12() 645 n -= denom; in xyzFraction12() 647 n += denom; in xyzFraction12() 838 if (denom == 1) in getXYZFromMatrix() [all …]
|
/dports/audio/afsp/AFsp-v8r2/audio/CompAudio/ |
H A D | CASNR.c | 45 double denom; in CASNR() local 63 denom = Stats->Sx2 - 2.0 * Stats->Sxy + Stats->Sy2; in CASNR() 64 if (denom > 0.0) in CASNR() 65 *SNR = Stats->Sx2 / denom; in CASNR() 95 denom = Stats->Sx2 * Stats->Sy2 - Stats->Sxy * Stats->Sxy; in CASNR() 96 if (denom > 0.0) in CASNR() 97 *SNRG = (Stats->Sx2 * Stats->Sy2) / denom; in CASNR()
|
/dports/lang/v/v-0.1.29/vlib/time/ |
H A D | time_darwin.c.v | 14 denom u32 23 denom u32 = 1 34 return InternalTimeBase{numer:tb.numer, denom:tb.denom} 39 if time_base.denom == 0 { 42 return (tm - start_time) * time_base.numer / time_base.denom 50 if time_base.denom == 0 { 53 return (tm - start_time) * time_base.numer / time_base.denom
|
/dports/graphics/lightzone/LightZone-4.1.8-3-g36e87773/lightcrafts/jnisrc/fast_jai/ |
H A D | bilateralFilter.cpp | 148 float denom = 0; local 162 denom = 1.0; 459 denom += f; 463 denom = select_eq(denom, v_zero, v_one, denom); 487 float denom = 0; local 501 denom += f; 506 denom = 1.0; 564 denom += f; 568 denom = select_eq(denom, v_zero, v_one, denom); 605 float denom = 0; local [all …]
|
H A D | bilateralFilterRGB.cpp | 132 float denom = 0; in separable_bf_mono_tile() local 145 denom += f; in separable_bf_mono_tile() 149 if (denom == 0) in separable_bf_mono_tile() 150 denom = 1.0; in separable_bf_mono_tile() 192 denom += f; in separable_bf_mono_tile() 196 denom = select_eq(denom, v_zero, v_one, denom); in separable_bf_mono_tile() 226 denom += f; in separable_bf_mono_tile() 230 if (denom == 0) in separable_bf_mono_tile() 231 denom = 1.0; in separable_bf_mono_tile() 614 denom = select_eq(denom, v_zero, v_one, denom); in separable_bf_chroma_tile() [all …]
|
/dports/graphics/xfractint/xfractint-20.04p16/common/ |
H A D | 3d.c | 251 double denom; in perspective() local 252 denom = view[2] - v[2]; in perspective() 254 if(denom >= 0.0) in perspective() 261 v[0] = (v[0]*view[2] - view[0]*v[2])/denom; in perspective() 262 v[1] = (v[1]*view[2] - view[1]*v[2])/denom; in perspective() 305 long denom; in longvmultpersp() local 307 denom = lview[2] - tmp[2]; in longvmultpersp() 346 long denom; in longpersp() local 348 denom = lview[2] - lv[2]; in longpersp() 359 tmpview[0] = divide(lview[0],denom,bitshift); in longpersp() [all …]
|
/dports/multimedia/gstreamermm/gstreamermm-1.10.0/gstreamer/src/ |
H A D | value.ccg | 69 : num(0), denom(1) 72 Fraction::Fraction(int num, int denom) 73 : num(num), denom(denom) 77 : num(src.num), denom(src.denom) 81 : num(0), denom(1) 86 denom = gst_value_get_fraction_denominator(value.gobj()); 91 : num(0), denom(1) 96 denom = gst_value_get_fraction_denominator(&value); 103 denom = src.denom; 189 gst_value_set_fraction(&gobject_, data.num, data.denom); [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/internal/ |
H A D | Exact_complex.h | 59 NT denom = _a*_a + _b*_b; in reciprocal() local 60 if(denom == NT(0)) in reciprocal() 63 return Self(_a/denom, -_b/denom); in reciprocal() 74 NT denom = (_a - xc)*(_a - xc) + (_b - yc)*(_b - yc); in invert_in_circle() local 75 return Self(xc + r2*(_a-xc)/denom, yc + r2*(_b-yc)/denom); in invert_in_circle() 97 NT denom = other._a*other._a + other._b*other._b; variable 98 CGAL_assertion(denom != 0); 101 return Self(rp/denom, ip/denom);
|
/dports/math/casadi/casadi-3.5.5/casadi/solvers/ |
H A D | linsol_tridiag.cpp | 97 double denom = A[a_colind[i] + 1] - A[a_colind[i] + 0] * m->ctr[i - 1]; in solve() local 98 m->ctr[i] = A[a_colind[i] + 2] / denom; in solve() 106 double denom = A[a_colind[1] + 1] - A[a_colind[1 - 1] + 1] * m->c[1 - 1]; in solve() local 107 m->c[1] = A[a_colind[1 + 1] + 0] / denom; in solve() 110 double denom = A[a_colind[i] + 1] - A[a_colind[i - 1] + 2] * m->c[i - 1]; in solve() local 111 m->c[i] = A[a_colind[i + 1] + 0] / denom; in solve() 123 double denom = A[a_colind[i] + 1] - A[a_colind[i] + 0] * m->ctr[i - 1]; in solve() local 124 m->d[i] = (x[i] - A[a_colind[i] + 0] * m->d[i - 1]) / denom; in solve() 134 double denom = A[a_colind[1] + 1] - A[a_colind[1 - 1] + 1] * m->c[1 - 1]; in solve() local 135 m->d[1] = (x[1] - A[a_colind[1 - 1] + 1] * m->d[1 - 1]) / denom; in solve() [all …]
|