Home
last modified time | relevance | path

Searched refs:mhalf (Results 1 – 3 of 3) sorted by relevance

/external/python/cpython3/Modules/_decimal/libmpdec/
Ddifradix2.c83 mpd_size_t m, mhalf; in fnt_dif2() local
93 mhalf = n / 2; in fnt_dif2()
94 for (j = 0; j < mhalf; j += 2) { in fnt_dif2()
100 v0 = a[j+mhalf]; in fnt_dif2()
103 v1 = a[j+1+mhalf]; in fnt_dif2()
113 a[j+mhalf] = v0; in fnt_dif2()
114 a[j+1+mhalf] = v1; in fnt_dif2()
121 mhalf = m / 2; in fnt_dif2()
127 v0 = a[r+mhalf]; in fnt_dif2()
130 v1 = a[m+r+mhalf]; in fnt_dif2()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/distribution/
DFDistributionImpl.java91 final double mhalf = denominatorDegreesOfFreedom / 2; in density() local
96 return FastMath.exp(nhalf*logn + nhalf*logx - logx + mhalf*logm - nhalf*lognxm - in density()
97 mhalf*lognxm - Beta.logBeta(nhalf, mhalf)); in density()
/external/python/cpython3/Modules/
D_heapqmodule.c295 Py_ssize_t i, j, m, mhalf, leftmost; in cache_friendly_heapify() local
299 mhalf = m >> 1; /* parent of first childless node */ in cache_friendly_heapify()
301 for (i = leftmost - 1 ; i >= mhalf ; i--) { in cache_friendly_heapify()