Searched defs:factors (Results 1 - 12 of 12) sorted by relevance

/external/chromium_org/chrome/browser/
H A Dchrome_page_zoom_unittest.cc10 // Fetch a vector of preset zoom factors, including a custom value that we
13 std::vector<double> factors = local
16 // Expect at least 10 zoom factors.
17 EXPECT_GE(factors.size(), 10U);
20 EXPECT_DOUBLE_EQ(factors.front(), content::kMinimumZoomFactor);
21 EXPECT_DOUBLE_EQ(factors.back(), content::kMaximumZoomFactor);
32 for (i = factors.begin(); i != factors.end(); ++i) {
80 std::vector<double> factors = chrome_page_zoom::PresetZoomFactors(too_low); local
81 EXPECT_FALSE(content::ZoomValuesEqual(factors
[all...]
/external/chromium_org/third_party/opus/src/celt/
H A Dkiss_fft.h75 /* e.g. an fft of length 128 has 4 factors
86 opus_int16 factors[2*MAXFACTORS]; member in struct:kiss_fft_state
H A Dkiss_fft.c456 opus_int16 * factors,
460 const int p=*factors++; /* the radix */
461 const int m=*factors++; /* stage's fft length/p */
476 compute_bitrev_table( Fout , f, fstride*p, in_stride, factors,st);
501 p = n; /* no more factors, skip to end */
544 size_t memneeded = sizeof(struct kiss_fft_state); /* twiddle factors*/
574 if (!kf_factor(nfft,st->factors))
583 compute_bitrev_table(0, bitrev, 1,1, st->factors,st);
635 p = st->factors[2*L];
636 m = st->factors[
451 compute_bitrev_table( int Fout, opus_int16 *f, const size_t fstride, int in_stride, opus_int16 * factors, const kiss_fft_state *st ) argument
[all...]
/external/libopus/celt/
H A Dkiss_fft.h75 /* e.g. an fft of length 128 has 4 factors
86 opus_int16 factors[2*MAXFACTORS]; member in struct:kiss_fft_state
H A Dkiss_fft.c456 opus_int16 * factors,
460 const int p=*factors++; /* the radix */
461 const int m=*factors++; /* stage's fft length/p */
476 compute_bitrev_table( Fout , f, fstride*p, in_stride, factors,st);
501 p = n; /* no more factors, skip to end */
544 size_t memneeded = sizeof(struct kiss_fft_state); /* twiddle factors*/
574 if (!kf_factor(nfft,st->factors))
583 compute_bitrev_table(0, bitrev, 1,1, st->factors,st);
635 p = st->factors[2*L];
636 m = st->factors[
451 compute_bitrev_table( int Fout, opus_int16 *f, const size_t fstride, int in_stride, opus_int16 * factors, const kiss_fft_state *st ) argument
[all...]
/external/speex/libspeex/
H A D_kiss_fft_guts.h26 /* e.g. an fft of length 128 has 4 factors
34 int factors[2*MAXFACTORS]; member in struct:kiss_fft_state
H A Dkiss_fft.c327 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, ski
322 kf_shuffle( kiss_fft_cpx * Fout, const kiss_fft_cpx * f, const size_t fstride, int in_stride, int * factors, const kiss_fft_cfg st ) argument
355 kf_work( kiss_fft_cpx * Fout, const kiss_fft_cpx * f, const size_t fstride, int in_stride, int * factors, const kiss_fft_cfg st, int N, int s2, int m2 ) argument
[all...]
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DCubicParameterizationCode.cpp51 // result1 and result2 are the same. 102 factors:
156 const int factors = 8; variable
160 int n[factors]; // 0 or power of a (1, 2, or 3) for a through h
231 if (x < 'a' || x > 'a' + factors) {
261 match(str, len, c[xx_coeff], "x^2"); // 7 factors
262 match(str, len, c[xy_coeff], "x y"); // 8 factors
263 match(str, len, c[yy_coeff], "y^2"); // 7 factors
264 match(str, len, c[x_coeff], "x"); // 21 factors
265 match(str, len, c[y_coeff], "y"); // 21 factors
266 match(str, len, c[c_coeff], ""); // 34 factors
[all...]
/external/opencv/cxcore/src/
H A Dcxdxt.cpp177 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 ) argument
224 int n = factors[
[all...]
/external/skia/experimental/Intersection/
H A DCubicParameterizationCode.cpp51 // result1 and result2 are the same. 102 factors:
156 const int factors = 8; variable
160 int n[factors]; // 0 or power of a (1, 2, or 3) for a through h
231 if (x < 'a' || x > 'a' + factors) {
261 match(str, len, c[xx_coeff], "x^2"); // 7 factors
262 match(str, len, c[xy_coeff], "x y"); // 8 factors
263 match(str, len, c[yy_coeff], "y^2"); // 7 factors
264 match(str, len, c[x_coeff], "x"); // 21 factors
265 match(str, len, c[y_coeff], "y"); // 21 factors
266 match(str, len, c[c_coeff], ""); // 34 factors
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Dunames.c782 writeFactorSuffix(const uint16_t *factors, uint16_t count, argument
791 /* write elements according to the factors */
795 * with the factors of this algorithm
801 factor=factors[i];
807 * guarantees here that code<=factors[0]
837 /* skip the rest of the strings for this factors[i] */
838 factor=(uint16_t)(factors[i]-indexes[i]-1);
914 const uint16_t *factors=(const uint16_t *)(range+1); local
916 const char *s=(const char *)(factors+count);
924 bufferPos+=writeFactorSuffix(factors, coun
1004 const uint16_t *factors=(const uint16_t *)(range+1); local
1133 const uint16_t *factors=(const uint16_t *)(range+1); local
1247 const uint16_t *factors=(const uint16_t *)(range+1); local
[all...]
/external/icu/icu4c/source/common/
H A Dunames.cpp773 writeFactorSuffix(const uint16_t *factors, uint16_t count, argument
782 /* write elements according to the factors */
786 * with the factors of this algorithm
792 factor=factors[i];
798 * guarantees here that code<=factors[0]
828 /* skip the rest of the strings for this factors[i] */
829 factor=(uint16_t)(factors[i]-indexes[i]-1);
905 const uint16_t *factors=(const uint16_t *)(range+1); local
907 const char *s=(const char *)(factors+count);
915 bufferPos+=writeFactorSuffix(factors, coun
995 const uint16_t *factors=(const uint16_t *)(range+1); local
1124 const uint16_t *factors=(const uint16_t *)(range+1); local
1238 const uint16_t *factors=(const uint16_t *)(range+1); local
[all...]

Completed in 979 milliseconds