| /external/chromium_org/chrome/browser/ |
| chrome_page_zoom_unittest.cc | 10 // 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.front(), too_low))
[all...] |
| /external/chromium_org/third_party/opus/src/celt/ |
| kiss_fft.h | 75 /* e.g. an fft of length 128 has 4 factors
86 opus_int16 factors[2*MAXFACTORS]; member in struct:kiss_fft_state
|
| /external/libopus/celt/ |
| kiss_fft.h | 75 /* e.g. an fft of length 128 has 4 factors
86 opus_int16 factors[2*MAXFACTORS]; member in struct:kiss_fft_state
|
| /external/speex/libspeex/ |
| _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/chromium_org/third_party/skia/experimental/Intersection/ |
| CubicParameterizationCode.cpp | 51 // 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 : total 10
[all...] |
| /external/skia/experimental/Intersection/ |
| CubicParameterizationCode.cpp | 51 // 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 : total 10
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| unames.cpp | 773 writeFactorSuffix(const uint16_t *factors, uint16_t count,
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, count
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...] |
| /external/icu/icu4c/source/common/ |
| unames.cpp | 773 writeFactorSuffix(const uint16_t *factors, uint16_t count,
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, count
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...] |
