/external/opencv/cxcore/src/ |
cxdxt.cpp | 177 icvDFTFactorize( int n, int* factors ) 183 factors[0] = n; 190 factors[nf++] = f; 199 factors[nf++] = f; 211 factors[nf++] = n; 213 f = (factors[0] & 1) == 0; 215 CV_SWAP( factors[i], factors[nf-i-1+f], j ); 221 icvDFTInit( int n0, int nf, int* factors, int* itab, int elem_size, void* _wave, int inv_itab ) 224 int n = factors[0], m = 0 [all...] |
/external/speex/libspeex/ |
kiss_fft.c | 327 int * factors, 331 const int p=*factors++; /* the radix */ 332 const int m=*factors++; /* stage's fft length/p */ 347 kf_shuffle( Fout , f, fstride*p, in_stride, factors,st); 360 int * factors, 369 const int p=*factors++; /* the radix */ 370 const int m=*factors++; /* stage's fft length/p */ 385 kf_work( Fout , f, fstride*p, in_stride, factors,st, N*p, fstride*in_stride, m); 416 kf_work( Fout , f, fstride*p, in_stride, factors,st, N*p, fstride*in_stride, m); 450 p = n; /* no more factors, skip to end * [all...] |
_kiss_fft_guts.h | 26 /* e.g. an fft of length 128 has 4 factors 34 int factors[2*MAXFACTORS]; member in struct:kiss_fft_state
|
/external/icu4c/common/ |
unames.cpp | 796 writeFactorSuffix(const uint16_t *factors, uint16_t count, 805 /* write elements according to the factors */ 809 * with the factors of this algorithm 815 factor=factors[i]; 821 * guarantees here that code<=factors[0] 851 /* skip the rest of the strings for this factors[i] */ 852 factor=(uint16_t)(factors[i]-indexes[i]-1); 928 const uint16_t *factors=(const uint16_t *)(range+1); local 930 const char *s=(const char *)(factors+count); 938 bufferPos+=writeFactorSuffix(factors, count 1018 const uint16_t *factors=(const uint16_t *)(range+1); local 1147 const uint16_t *factors=(const uint16_t *)(range+1); local 1261 const uint16_t *factors=(const uint16_t *)(range+1); local [all...] |
/development/cmds/monkey/src/com/android/commands/monkey/ |
MonkeySourceRandom.java | 185 // if verbose, show factors 220 * See if any key exists for non-zero factors. 229 * set the factors 231 * @param factors percentages for each type of event 233 public void setFactors(float factors[]) { 235 if (factors.length < c) { 236 c = factors.length; 239 mFactors[i] = factors[i]; 452 //check factors
|
/external/jpeg/ |
mips_idct_le.S | 59 # $s0:3 - simd quantization factors 300 # $s0:3 - simd quantization factors
|
/external/v8/benchmarks/ |
deltablue.js | 829 * mapping and to change the scale and offset factors.
|
/external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
v8-deltablue.js | 823 * mapping and to change the scale and offset factors.
|
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
v8-deltablue.js | 823 * mapping and to change the scale and offset factors.
|
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
v8-deltablue.js | 823 * mapping and to change the scale and offset factors.
|
/dalvik/docs/ |
prettify.js | 398 // to move us to the next column, where columns occur at factors of [all...] |
/frameworks/base/docs/html/training/ |
training_toc.cs | 73 optimized user experience on multiple device form factors using a single APK." [all...] |
/external/ceres-solver/docs/ |
solving.tex | 349 The computational cost of using a preconditioner $M$ is the cost of computing $M$ and evaluating the product $M^{-1}y$ for arbitrary vectors $y$. Thus, there are two competing factors to consider: How much of $H$'s structure is captured by $M$ so that the condition number $\kappa(HM^{-1})$ is low, and the computational cost of constructing and using $M$. The ideal preconditioner would be one for which $\kappa(M^{-1}A) =1$. $M=A$ achieves this, but it is not a practical choice, as applying this preconditioner would require solving a linear system equivalent to the unpreconditioned problem. It is usually the case that the more information $M$ has about $H$, the more expensive it is use. For example, Incomplete Cholesky factorization based preconditioners have much better convergence behavior than the Jacobi preconditioner, but are also much more expensive. [all...] |
/external/grub/docs/ |
texinfo.tex | [all...] |
/external/v8/test/mjsunit/ |
unicode-test.js | [all...] |
/external/qemu-pc-bios/bochs/bios/ |
rombios.c | [all...] |
/external/bison/build-aux/ |
texinfo.tex | [all...] |
/ndk/sources/host-tools/sed-4.2.1/build-aux/ |
texinfo.tex | [all...] |
/build/tools/droiddoc/templates-sac/assets/js/ |
android_3p-bundle.js | 637 // to move us to the next column, where columns occur at factors of [all...] |
/build/tools/droiddoc/templates-sdk/assets/js/ |
android_3p-bundle.js | 637 // to move us to the next column, where columns occur at factors of [all...] |