| /external/v8/src/ |
| H A D | bignum-dtoa.cc | 44 static void FixupMultiply10(int estimated_power, bool is_even,
52 bool is_even,
72 bool is_even = (significand & 1) == 0; local
106 FixupMultiply10(estimated_power, is_even, decimal_point,
115 is_even, buffer, length);
140 // upper and lower boundaries. d must be strictly between them if !is_even.
149 bool is_even,
172 if (is_even) {
177 if (is_even) {
605 static void FixupMultiply10(int estimated_power, bool is_even, argument
147 GenerateShortestDigits(Bignum* numerator, Bignum* denominator, Bignum* delta_minus, Bignum* delta_plus, bool is_even, Vector<char> buffer, int* length) argument
[all...] |
| /external/libcxx/fuzzing/ |
| H A D | fuzzing.cpp | 88 struct is_even struct in namespace:fuzzing
98 struct is_even<stable_test> struct in namespace:fuzzing
200 auto iter = std::partition(working.begin(), working.end(), is_even<uint8_t>());
202 if (!std::all_of (working.begin(), iter, is_even<uint8_t>())) return 1;
203 if (!std::none_of(iter, working.end(), is_even<uint8_t>())) return 2;
215 is_even<uint8_t>());
221 if (!std::all_of (v1.begin(), v1.end(), is_even<uint8_t>())) return 2;
222 if (!std::none_of(v2.begin(), v2.end(), is_even<uint8_t>())) return 3;
241 auto iter = std::stable_partition(working.begin(), working.end(), is_even<stable_test>());
243 if (!std::all_of (working.begin(), iter, is_even<stable_tes
[all...] |
| /external/tensorflow/tensorflow/python/ops/ |
| H A D | spectral_grad.py | 78 is_even = math_ops.cast(1 - (fft_length[-1] % 2), dtypes.complex64)
111 extra_terms = y0 + is_even * ym * _YMMask(input_shape[-1])
134 extra_terms += is_even * ym_term
|
| /external/skia/src/core/ |
| H A D | SkGpuBlurUtils.cpp | 40 static inline int is_even(int x) { return !(x & 1); } function
45 SkASSERT(is_even(rect->fLeft) && is_even(rect->fRight));
50 SkASSERT(is_even(rect->fTop) && is_even(rect->fBottom));
|
| /external/skia/src/utils/ |
| H A D | SkDashPath.cpp | 13 static inline int is_even(int x) { function
374 if (src.isRect(nullptr) && src.isLastContourClosed() && is_even(initialDashIndex)) {
383 if (is_even(index) == (endPhase > 0)) {
446 if (is_even(index) && !skipFirstSegment) {
477 if (meas.isClosed() && is_even(initialDashIndex) &&
|
| /external/skqp/src/core/ |
| H A D | SkGpuBlurUtils.cpp | 40 static inline int is_even(int x) { return !(x & 1); } function
45 SkASSERT(is_even(rect->fLeft) && is_even(rect->fRight));
50 SkASSERT(is_even(rect->fTop) && is_even(rect->fBottom));
|
| /external/skqp/src/utils/ |
| H A D | SkDashPath.cpp | 13 static inline int is_even(int x) { function
374 if (src.isRect(nullptr) && src.isLastContourClosed() && is_even(initialDashIndex)) {
383 if (is_even(index) == (endPhase > 0)) {
446 if (is_even(index) && !skipFirstSegment) {
477 if (meas.isClosed() && is_even(initialDashIndex) &&
|
| /external/tensorflow/tensorflow/contrib/data/python/kernel_tests/ |
| H A D | bucketing_test.py | 372 is_even = all(x % 2 == 0 for x in result)
374 self.assertTrue(is_even or is_odd)
375 expected_batch_size = 5 if is_even else 10
|
| /external/tensorflow/tensorflow/contrib/timeseries/python/timeseries/ |
| H A D | math_utils.py | 204 is_even = math_ops.equal(residual_powers % 2,
208 new_accumulator = array_ops.where(is_even, accumulator,
|
| /external/python/cpython2/Modules/ |
| H A D | parsermodule.c | 978 #define is_even(n) (((n) & 1) == 0) macro
1040 if (is_even(nch))
1543 if (res && is_even(nch))
1981 && is_even(nch) && (nch >= 2));
2464 if (!is_even(nch - pos)) {
|
| /external/google-breakpad/src/testing/test/ |
| H A D | gmock-matchers_test.cc | 2399 const Matcher<int> is_even = PolymorphicIsEven(); local
2401 EXPECT_TRUE(ExplainMatchResult(is_even, 42, &listener1));
|
| /external/googletest/googlemock/test/ |
| H A D | gmock-matchers_test.cc | 2572 const Matcher<int> is_even = PolymorphicIsEven(); local
2574 EXPECT_TRUE(ExplainMatchResult(is_even, 42, &listener1));
|
| /external/v8/testing/gmock/test/ |
| H A D | gmock-matchers_test.cc | 2563 const Matcher<int> is_even = PolymorphicIsEven(); local
2565 EXPECT_TRUE(ExplainMatchResult(is_even, 42, &listener1));
|