| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| product-weight.h | 185 inline ProductWeight<W1, W2> Divide(const ProductWeight<W1, W2> &w,
188 return ProductWeight<W1, W2>(Divide(w.Value1(), v.Value1(), typ),
189 Divide(w.Value2(), v.Value2(), typ));
|
| string-weight.h | 432 Divide(const StringWeight<L, S> &w1,
437 LOG(FATAL) << "StringWeight::Divide: only left division is defined "
457 Divide(const StringWeight<L, STRING_RIGHT> &w1,
462 LOG(FATAL) << "StringWeight::Divide: only right division is defined "
482 Divide(const StringWeight<L, STRING_RIGHT_RESTRICT> &w1,
487 LOG(FATAL) << "StringWeight::Divide: only right division is defined "
|
| /packages/apps/Gallery2/jni/filters/ |
| kmeans.h | 56 inline void divide(T dst[], N divisor, int dimension) { function
165 // divide to get centroid and set dst to result
167 divide<N, int>(tmp + x, popularities[x / stride], dimension);
|
| /external/eigen/unsupported/Eigen/src/SVD/ |
| BDCSVD.h | 4 // We used the "A Divide-And-Conquer Algorithm for the Bidiagonal SVD"
31 * \brief class Bidiagonal Divide and Conquer SVD
199 void divide (Index firstCol, Index lastCol, Index firstRowW,
284 //**** step 2 Divide
294 divide(0, this->m_diagSize - 1, 0, 0, 0);
352 // The divide algorithm is done "in place", we are always working on subsets of the same matrix. The divide methods takes as argument the
363 void BDCSVD<MatrixType>::divide (Index firstCol, Index lastCol, Index firstRowW, function in class:Eigen::BDCSVD
396 // We use the divide and conquer algorithm
399 // The divide must be done in that order in order to have good results. Divide change the data inside the submat (…)
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkPoint.cpp | 123 // divide by inf. and return (0,0) vector.
128 // we perform the divide with the double magmag, to stay exactly the
129 // same as setLength. It would be faster to perform the divide with
169 // divide by inf. and return (0,0) vector.
205 // divide by inf. and return (0,0) vector.
|
| /external/chromium_org/third_party/webrtc/common_audio/signal_processing/ |
| resample_by_2_mips.c | 135 // add two allpass outputs, divide by two and round
179 // add two allpass outputs, divide by two and round
208 // add two allpass outputs, divide by two and round
237 // add two allpass outputs, divide by two and round
266 // add two allpass outputs, divide by two and round
|
| /external/llvm/lib/Transforms/Utils/ |
| BypassSlowDivision.cpp | 14 // positive and less than 256 use an unsigned 8-bit divide.
96 // Basic Block is split before divide
101 // Add new basic block for slow divide operation
117 // Add new basic block for fast divide operation
222 // be profitably bypassed and carried out with a shorter, faster divide.
|
| /external/proguard/src/proguard/evaluation/value/ |
| LongValue.java | 112 public LongValue divide(LongValue other) method in class:LongValue
124 return other.divide(this);
269 public LongValue divide(SpecificLongValue other) method in class:LongValue
425 public LongValue divide(ParticularLongValue other) method in class:LongValue
427 return divide((SpecificLongValue)other);
|
| /external/guava/guava-tests/test/com/google/common/math/ |
| BigIntegerMathTest.java | 348 new BigDecimal(p).divide(new BigDecimal(q), 0, mode).toBigIntegerExact();
349 assertEquals(expected, BigIntegerMath.divide(p, q, mode));
361 assertEquals(p, BigIntegerMath.divide(p, q, UNNECESSARY).multiply(q));
373 assertEquals(ZERO, BigIntegerMath.divide(ZERO, q, mode));
382 BigIntegerMath.divide(p, ZERO, mode);
416 .divide(BigIntegerMath.factorial(k))
417 .divide(BigIntegerMath.factorial(n - k));
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/arm11_asm/ |
| h264bsd_interpolate_ver_half.s | 175 AND res, res, tmpb, LSR #5 ;// mask and divide by 32
219 AND res, res, tmpb, LSR #5 ;// mask and divide by 32
235 AND tmpa, tmpa, tmpb, LSL #3 ;// mask and divide by 32
263 AND res, res, tmpb, LSR #5 ;// mask and divide by 32
283 AND tmpa, tmpa, tmpb, LSL #3 ;// mask and divide by 32
311 AND res, res, tmpb, LSR #5 ;// mask and divide by 32
329 AND tmpa, tmp4, tmpb, LSL #3 ;// mask and divide by 32
|
| h264bsd_interpolate_ver_quarter.s | 176 AND res, res, tmpb, LSR #5 ;// mask and divide by 32
228 AND res, res, tmpb, LSR #5 ;// mask and divide by 32
245 AND tmpa, tmpa, tmpb, LSL #3 ;// mask and divide by 32
277 AND res, res, tmpb, LSR #5 ;// mask and divide by 32
295 AND tmpa, tmpa, tmpb, LSL #3 ;// mask and divide by 32
327 AND res, res, tmpb, LSR #5 ;// mask and divide by 32
344 AND tmpa, tmp4, tmpb, LSL #3 ;// mask and divide by 32
|
| /external/sonivox/arm-fm-22k/lib_src/ |
| eas_math.h | 84 /*lint -e(704) <avoid divide for performance>*/ \
125 #define MULT_AUDIO_COEF(audio,coef) /*lint -e704 <avoid divide for performance>*/ \
143 #define MULT_AUDIO_WET_DRY_COEF(audio,coef) /*lint -e(702) <avoid divide for performance>*/ \
180 #define MULT_EG1_EG1(gain,damping) /*lint -e(704) <avoid divide for performance>*/ \
199 #define MULT_EG1_EG1_X2(gain,damping) /*lint -e(702) <avoid divide for performance>*/ \
225 #define GET_DENTS_INT_PART(x) /*lint -e(704) <avoid divide for performance>*/ \
256 The divide by 20 helps convert dB to linear gain, and we might
283 #define MULT_DENTS_COEF(dents,coef) /*lint -e704 <avoid divide for performance>*/ \
303 #define MULT_AUDIO_DRIVE(audio,drive) /*lint -e(702) <avoid divide for performance>*/ \
311 #define MULT_AUDIO_AUDIO(audio1,audio2) /*lint -e(702) <avoid divide for performance>*/
[all...] |
| /external/sonivox/arm-hybrid-22k/lib_src/ |
| eas_math.h | 84 /*lint -e(704) <avoid divide for performance>*/ \
125 #define MULT_AUDIO_COEF(audio,coef) /*lint -e704 <avoid divide for performance>*/ \
143 #define MULT_AUDIO_WET_DRY_COEF(audio,coef) /*lint -e(702) <avoid divide for performance>*/ \
180 #define MULT_EG1_EG1(gain,damping) /*lint -e(704) <avoid divide for performance>*/ \
199 #define MULT_EG1_EG1_X2(gain,damping) /*lint -e(702) <avoid divide for performance>*/ \
225 #define GET_DENTS_INT_PART(x) /*lint -e(704) <avoid divide for performance>*/ \
256 The divide by 20 helps convert dB to linear gain, and we might
283 #define MULT_DENTS_COEF(dents,coef) /*lint -e704 <avoid divide for performance>*/ \
303 #define MULT_AUDIO_DRIVE(audio,drive) /*lint -e(702) <avoid divide for performance>*/ \
311 #define MULT_AUDIO_AUDIO(audio1,audio2) /*lint -e(702) <avoid divide for performance>*/
[all...] |
| /external/sonivox/arm-wt-22k/lib_src/ |
| eas_math.h | 84 /*lint -e(704) <avoid divide for performance>*/ \
125 #define MULT_AUDIO_COEF(audio,coef) /*lint -e704 <avoid divide for performance>*/ \
143 #define MULT_AUDIO_WET_DRY_COEF(audio,coef) /*lint -e(702) <avoid divide for performance>*/ \
180 #define MULT_EG1_EG1(gain,damping) /*lint -e(704) <avoid divide for performance>*/ \
199 #define MULT_EG1_EG1_X2(gain,damping) /*lint -e(702) <avoid divide for performance>*/ \
225 #define GET_DENTS_INT_PART(x) /*lint -e(704) <avoid divide for performance>*/ \
256 The divide by 20 helps convert dB to linear gain, and we might
283 #define MULT_DENTS_COEF(dents,coef) /*lint -e704 <avoid divide for performance>*/ \
303 #define MULT_AUDIO_DRIVE(audio,drive) /*lint -e(702) <avoid divide for performance>*/ \
311 #define MULT_AUDIO_AUDIO(audio1,audio2) /*lint -e(702) <avoid divide for performance>*/
[all...] |
| /frameworks/av/media/libeffects/testlibs/ |
| EffectsMath.h | 75 /*lint -e(704) <avoid divide for performance>*/ \
116 #define MULT_AUDIO_COEF(audio,coef) /*lint -e704 <avoid divide for performance>*/ \
134 #define MULT_AUDIO_WET_DRY_COEF(audio,coef) /*lint -e(702) <avoid divide for performance>*/ \
171 #define MULT_EG1_EG1(gain,damping) /*lint -e(704) <avoid divide for performance>*/ \
190 #define MULT_EG1_EG1_X2(gain,damping) /*lint -e(702) <avoid divide for performance>*/ \
216 #define GET_DENTS_INT_PART(x) /*lint -e(704) <avoid divide for performance>*/ \
247 The divide by 20 helps convert dB to linear gain, and we might
274 #define MULT_DENTS_COEF(dents,coef) /*lint -e704 <avoid divide for performance>*/ \
295 #define MULT_AUDIO_DRIVE(audio,drive) /*lint -e(702) <avoid divide for performance>*/ \
303 #define MULT_AUDIO_AUDIO(audio1,audio2) /*lint -e(702) <avoid divide for performance>*/
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| math_testcases.txt | 22 -- divide-by-zero : raised when a finite input gives a
174 lgam0000 lgamma 0.0 -> inf divide-by-zero
175 lgam0001 lgamma -0.0 -> inf divide-by-zero
181 lgam0010 lgamma -1 -> inf divide-by-zero
182 lgam0011 lgamma -2 -> inf divide-by-zero
183 lgam0012 lgamma -1e16 -> inf divide-by-zero
184 lgam0013 lgamma -1e300 -> inf divide-by-zero
185 lgam0014 lgamma -1.79e308 -> inf divide-by-zero
279 gam0000 gamma 0.0 -> inf divide-by-zero
280 gam0001 gamma -0.0 -> -inf divide-by-zer
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| math_testcases.txt | 22 -- divide-by-zero : raised when a finite input gives a
174 lgam0000 lgamma 0.0 -> inf divide-by-zero
175 lgam0001 lgamma -0.0 -> inf divide-by-zero
181 lgam0010 lgamma -1 -> inf divide-by-zero
182 lgam0011 lgamma -2 -> inf divide-by-zero
183 lgam0012 lgamma -1e16 -> inf divide-by-zero
184 lgam0013 lgamma -1e300 -> inf divide-by-zero
185 lgam0014 lgamma -1.79e308 -> inf divide-by-zero
279 gam0000 gamma 0.0 -> inf divide-by-zero
280 gam0001 gamma -0.0 -> -inf divide-by-zer
[all...] |
| /external/guava/guava/src/com/google/common/math/ |
| BigIntegerMath.java | 244 BigInteger sqrt1 = sqrt0.add(x.divide(sqrt0)).shiftRight(1);
250 sqrt1 = sqrt0.add(x.divide(sqrt0)).shiftRight(1);
266 public static BigInteger divide(BigInteger p, BigInteger q, RoundingMode mode){ method in class:BigIntegerMath
269 return pDec.divide(qDec, 0, mode).toBigIntegerExact();
293 int approxSize = IntMath.divide(n * IntMath.log2(n, CEILING), Long.SIZE, CEILING);
381 result = result.divide(BigInteger.valueOf(i + 1));
|
| /external/netperf/ |
| netcpu_kstat10.c | 313 /* multiply by 100 and divide by total and you get whole
314 percentages. multiply by 1000 and divide by total and you get
315 tenths of percentages. multiply by 10000 and divide by total and
504 /* multiply by 100 and divide by total and you get whole
505 percentages. multiply by 1000 and divide by total and you get
506 tenths of percentages. multiply by 10000 and divide by total
|
| /external/openfst/src/include/fst/ |
| string-weight.h | 452 Divide(const StringWeight<L, S> &w1,
457 FSTERROR() << "StringWeight::Divide: only left division is defined "
482 Divide(const StringWeight<L, STRING_RIGHT> &w1,
487 FSTERROR() << "StringWeight::Divide: only right division is defined "
512 Divide(const StringWeight<L, STRING_RIGHT_RESTRICT> &w1,
517 FSTERROR() << "StringWeight::Divide: only right division is defined "
|
| /external/chromium_org/third_party/opus/src/celt/ |
| fixed_generic.h | 91 /** Divide by two */
128 /** Divide a 32-bit value by a 16-bit value. Result fits in 16 bits */
131 /** Divide a 32-bit value by a 32-bit value. Result fits in 32 bits */
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| CubicToQuadratics.cpp | 34 if Tdiv < 0.5 divide the cubic at Tdiv. First segment [0..Tdiv] can be approximated with by a
37 0.5<=Tdiv<1 - simply divide the cubic in two. The two halves can be approximated by the mid-point
142 // and do a more precise job when calling chop at and sub divide by computing the fractional ts.
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrPathUtils.h | 25 /// Since we divide by tol if we're computing exact worst-case bounds,
31 /// Since we divide by tol if we're computing exact worst-case bounds,
42 /// Since we divide by tol if we're computing exact worst-case bounds,
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkDCubicToQuads.cpp | 33 if Tdiv < 0.5 divide the cubic at Tdiv. First segment [0..Tdiv] can be approximated with by a
36 0.5<=Tdiv<1 - simply divide the cubic in two. The two halves can be approximated by the mid-point
116 // and do a more precise job when calling chop at and sub divide by computing the fractional ts.
|
| /external/cmockery/cmockery_0_1_2/src/example/ |
| calculator.c | 92 static int divide(int a, int b);
99 {"/", divide},
114 static int divide(int a, int b) { function
|
