/external/python/cpython2/Lib/test/ |
test_math.py | 371 def fact(n): function in function:MathTests.testFactorial 380 self.assertEqual(math.factorial(cast(x)), fact(x), (x, fact(x), math.factorial(x))) [all...] |
test_scope.py | 170 def fact(n): function in function:ScopeTests.testRecursion.f 174 return n * fact(n - 1) 176 return fact(x)
|
test_itertools.py | 51 def fact(n): function 126 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of combs 188 return fact(n+r-1) // fact(r) // fact(n-1) 274 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(n-r)) # right number of perms 311 self.assertEqual(len(cwr), (fact(n+r-1) // fact(r) // fact(n-1)) if n else (not r) [all...] |
/external/svox/pico/lib/ |
picodata.c | 704 picoos_int32 fact, rest; local 708 fact = (targetdur << (PICODATA_PRECISION - frame_duration_exp)) / inputdur; 711 rest += fact * inout[i]; 730 picoos_int32 fact, rest, out, weighted_sum; local 744 fact = ((targetdur - inputdur) << (PICODATA_PRECISION-frame_duration_exp))/ weighted_sum; 746 fact = -((inputdur - targetdur) << (PICODATA_PRECISION-frame_duration_exp))/ weighted_sum; 749 /* input[i] * fact * weight[i] is the additive modification in PICODATA_PRECISION */ 751 rest += fact * inout[i] * weight[i]; 788 PICODBG_TRACE(("######## transforming duration fact=%i, limits = [%i,%i] (input frames: %i)",facttarget,mintarget,maxtarget, inputdur)); [all...] |
picosig2.c | 4014 picoos_single fact; \/*normalization factor*\/ local [all...] |
/libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/ |
KeyFactory2Test.java | 111 KeyFactory fact = KeyFactory.getInstance(keyfactAlgs[i], providerName); local 122 KeySpec privateKeySpec = fact.getKeySpec(keys.getPrivate(), 124 PrivateKey privateKey = fact.generatePrivate(privateKeySpec); 128 privateKey = fact.generatePrivate(new PKCS8EncodedKeySpec(keys.getPrivate().getEncoded())); 139 KeyFactory fact = KeyFactory.getInstance(keyfactAlgs[i], local 151 KeySpec publicKeySpec = fact.getKeySpec(keys.getPublic(), 153 PublicKey publicKey = fact.generatePublic(publicKeySpec); 157 + fact.getProvider().getName() + ")", 167 KeyFactory fact = KeyFactory.getInstance(keyfactAlgs[i], local 170 fact.getAlgorithm().equals(keyfactAlgs[i])) 230 KeyFactory fact = KeyFactory.getInstance(keyfactAlgs[i], local 277 KeyFactory fact = KeyFactory.getInstance(keyfactAlgs[i]); local 287 KeyFactory fact = KeyFactory.getInstance(keyfactAlgs[i], local [all...] |
/prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
test_math.py | 371 def fact(n): function in function:MathTests.testFactorial 380 self.assertEqual(math.factorial(cast(x)), fact(x), (x, fact(x), math.factorial(x))) [all...] |
test_scope.py | 170 def fact(n): function in function:ScopeTests.testRecursion.f 174 return n * fact(n - 1) 176 return fact(x)
|
test_itertools.py | 51 def fact(n): function 126 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of combs 183 return fact(n+r-1) // fact(r) // fact(n-1) 264 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(n-r)) # right number of perms 296 self.assertEqual(len(cwr), (fact(n+r-1) // fact(r) // fact(n-1)) if n else (not r) [all...] |
/prebuilts/gdb/linux-x86/lib/python2.7/test/ |
test_math.py | 371 def fact(n): function in function:MathTests.testFactorial 380 self.assertEqual(math.factorial(cast(x)), fact(x), (x, fact(x), math.factorial(x))) [all...] |
test_scope.py | 170 def fact(n): function in function:ScopeTests.testRecursion.f 174 return n * fact(n - 1) 176 return fact(x)
|
test_itertools.py | 51 def fact(n): function 126 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of combs 183 return fact(n+r-1) // fact(r) // fact(n-1) 264 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(n-r)) # right number of perms 296 self.assertEqual(len(cwr), (fact(n+r-1) // fact(r) // fact(n-1)) if n else (not r) [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_math.py | 371 def fact(n): function in function:MathTests.testFactorial 380 self.assertEqual(math.factorial(cast(x)), fact(x), (x, fact(x), math.factorial(x))) [all...] |
test_scope.py | 170 def fact(n): function in function:ScopeTests.testRecursion.f 174 return n * fact(n - 1) 176 return fact(x)
|
test_itertools.py | 51 def fact(n): function 126 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of combs 183 return fact(n+r-1) // fact(r) // fact(n-1) 264 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(n-r)) # right number of perms 296 self.assertEqual(len(cwr), (fact(n+r-1) // fact(r) // fact(n-1)) if n else (not r) [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_math.py | 371 def fact(n): function in function:MathTests.testFactorial 380 self.assertEqual(math.factorial(cast(x)), fact(x), (x, fact(x), math.factorial(x))) [all...] |
test_scope.py | 170 def fact(n): function in function:ScopeTests.testRecursion.f 174 return n * fact(n - 1) 176 return fact(x)
|
test_itertools.py | 51 def fact(n): function 126 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of combs 183 return fact(n+r-1) // fact(r) // fact(n-1) 264 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(n-r)) # right number of perms 296 self.assertEqual(len(cwr), (fact(n+r-1) // fact(r) // fact(n-1)) if n else (not r) [all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
test_itertools.py | 51 def fact(n):
function 126 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(r) // fact(n-r)) # right number of combs
182 return fact(n+r-1) // fact(r) // fact(n-1)
261 self.assertEqual(len(result), 0 if r>n else fact(n) // fact(n-r)) # right number of perms
292 self.assertEqual(len(cwr), (fact(n+r-1) // fact(r) // fact(n-1)) if n else (not r)) [all...] |
/external/autotest/client/deps/iwcap/src/ |
iwcap.c | 330 int fact = (1<<(13+factor))-1; local 331 if (fact > ampdu_fact) 332 ampdu_fact = fact;
|
/external/eigen/unsupported/test/ |
NonLinearOptimization.cpp | 823 double fact = 1./(1.+b[4]*x+b[5]*xx+b[6]*xxx); local 824 fjac(i,0) = 1.*fact; 825 fjac(i,1) = x*fact; 826 fjac(i,2) = xx*fact; 827 fjac(i,3) = xxx*fact; 828 fact = - (b[0]+b[1]*x+b[2]*xx+b[3]*xxx) * fact * fact; 829 fjac(i,4) = x*fact; 830 fjac(i,5) = xx*fact; 1579 double fact = 1.\/(1.+b[4]*x+b[5]*xx+b[6]*xxx); local [all...] |
/external/libvpx/libvpx/vp9/encoder/ |
vp9_rd.c | 662 int *const fact = &factor_buf[bs][mode]; local 664 *fact -= (*fact >> 4); 666 *fact = VPXMIN(*fact + RD_THRESH_INC, rd_thresh * RD_THRESH_MAX_FACT);
|
/external/speex/libspeex/ |
nb_celp.c | 689 float fact = ((float)sub+1.0f)/st->nbSubframes; local 691 curr_curve[i] = (1.0f-fact)*st->old_curve[i] + fact*st->curve[i]; 1025 spx_word16_t fact; local 1235 spx_word16_t fact; local [all...] |
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
transform_neon.c | 34 int32_t fact = 16921 << 5; local 35 int32x4_t factq = vdupq_n_s32(fact); 365 int32x4_t fact = vdupq_n_s32(factQ19); local 439 outre1_0 = vqdmulhq_s32(outre1_0, fact); 440 outre2_0 = vqdmulhq_s32(outre2_0, fact); 441 outre1_1 = vqdmulhq_s32(outre1_1, fact); 442 outre2_1 = vqdmulhq_s32(outre2_1, fact);
|
/external/ImageMagick/MagickCore/ |
morphology.c | 99 static inline size_t fact(size_t n) 106 #define fact(n) ((size_t)tgamma((double)n+1)) macro 108 #define fact(n) ((size_t)lgamma((double)n+1)) 97 static inline size_t fact(size_t n) function 104 #define fact macro [all...] |