/external/s2-geometry-library-java/src/com/google/common/geometry/ |
D | S1Interval.java | 42 private final double hi; field in S1Interval 48 public S1Interval(double lo, double hi) { in S1Interval() argument 49 this(lo, hi, false); in S1Interval() 59 this.hi = interval.hi; in S1Interval() 66 private S1Interval(double lo, double hi, boolean checked) { in S1Interval() argument 68 double newHi = hi; in S1Interval() 70 if (lo == -S2.M_PI && hi != S2.M_PI) { in S1Interval() 73 if (hi == -S2.M_PI && lo != S2.M_PI) { in S1Interval() 78 this.hi = newHi; in S1Interval() 121 public double hi() { in hi() method in S1Interval [all …]
|
D | R1Interval.java | 28 private final double hi; field in R1Interval 31 public R1Interval(double lo, double hi) { in R1Interval() argument 33 this.hi = hi; in R1Interval() 68 public double hi() { in hi() method in R1Interval 69 return hi; in hi() 76 return lo() > hi(); in isEmpty() 84 return 0.5 * (lo() + hi()); in getCenter() 92 return hi() - lo(); in getLength() 96 return p >= lo() && p <= hi(); in contains() 100 return p > lo() && p < hi(); in interiorContains() [all …]
|
/external/compiler-rt/lib/builtins/ppc/ |
D | divtc3.c | 13 (x).s.hi = crt_copysign(crt_isinf((x).s.hi) ? 1.0 : 0.0, (x).s.hi); \ 24 const double logbw = crt_logb(crt_fmax(crt_fabs(cDD.s.hi), crt_fabs(dDD.s.hi) )); in __divtc3() 30 cDD.s.hi = crt_scalbn(cDD.s.hi, -ilogbw); in __divtc3() 32 dDD.s.hi = crt_scalbn(dDD.s.hi, -ilogbw); in __divtc3() 43 real.s.hi = crt_scalbn(real.s.hi, -ilogbw); in __divtc3() 45 imag.s.hi = crt_scalbn(imag.s.hi, -ilogbw); in __divtc3() 48 if (crt_isnan(real.s.hi) && crt_isnan(imag.s.hi)) in __divtc3() 54 if ((rDD.s.hi == 0.0) && (!crt_isnan(aDD.s.hi) || in __divtc3() 55 !crt_isnan(bDD.s.hi))) in __divtc3() 57 real.s.hi = crt_copysign(CRT_INFINITY,cDD.s.hi) * aDD.s.hi; in __divtc3() [all …]
|
D | multc3.c | 9 (x).s.hi = crt_copysign(crt_isinf((x).s.hi) ? 1.0 : 0.0, (x).s.hi); \ 14 if (crt_isnan((x).s.hi)) { \ 15 (x).s.hi = crt_copysign(0.0, (x).s.hi); \ 31 if (crt_isnan(real.s.hi) && crt_isnan(imag.s.hi)) in __multc3() 40 if (crt_isinf(aDD.s.hi) || crt_isinf(bDD.s.hi)) in __multc3() 49 if (crt_isinf(cDD.s.hi) || crt_isinf(dDD.s.hi)) in __multc3() 65 if (crt_isinf(acDD.s.hi) || crt_isinf(bdDD.s.hi) || in __multc3() 66 crt_isinf(adDD.s.hi) || crt_isinf(bcDD.s.hi)) in __multc3() 78 real.s.hi = CRT_INFINITY * (aDD.s.hi*cDD.s.hi - bDD.s.hi*dDD.s.hi); in __multc3() 80 imag.s.hi = CRT_INFINITY * (aDD.s.hi*dDD.s.hi + bDD.s.hi*cDD.s.hi); in __multc3()
|
/external/llvm-project/compiler-rt/lib/builtins/ppc/ |
D | divtc3.c | 19 (x).s.hi = crt_copysign(crt_isinf((x).s.hi) ? 1.0 : 0.0, (x).s.hi); \ 30 __compiler_rt_logb(crt_fmax(crt_fabs(cDD.s.hi), crt_fabs(dDD.s.hi))); in __divtc3() 35 cDD.s.hi = crt_scalbn(cDD.s.hi, -ilogbw); in __divtc3() 37 dDD.s.hi = crt_scalbn(dDD.s.hi, -ilogbw); in __divtc3() 51 real.s.hi = crt_scalbn(real.s.hi, -ilogbw); in __divtc3() 53 imag.s.hi = crt_scalbn(imag.s.hi, -ilogbw); in __divtc3() 56 if (crt_isnan(real.s.hi) && crt_isnan(imag.s.hi)) { in __divtc3() 61 if ((rDD.s.hi == 0.0) && (!crt_isnan(aDD.s.hi) || !crt_isnan(bDD.s.hi))) { in __divtc3() 62 real.s.hi = crt_copysign(CRT_INFINITY, cDD.s.hi) * aDD.s.hi; in __divtc3() 64 imag.s.hi = crt_copysign(CRT_INFINITY, cDD.s.hi) * bDD.s.hi; in __divtc3() [all …]
|
D | multc3.c | 10 (x).s.hi = crt_copysign(crt_isinf((x).s.hi) ? 1.0 : 0.0, (x).s.hi); \ 16 if (crt_isnan((x).s.hi)) { \ 17 (x).s.hi = crt_copysign(0.0, (x).s.hi); \ 32 if (crt_isnan(real.s.hi) && crt_isnan(imag.s.hi)) { in __multc3() 40 if (crt_isinf(aDD.s.hi) || crt_isinf(bDD.s.hi)) { in __multc3() 48 if (crt_isinf(cDD.s.hi) || crt_isinf(dDD.s.hi)) { in __multc3() 62 if (crt_isinf(acDD.s.hi) || crt_isinf(bdDD.s.hi) || in __multc3() 63 crt_isinf(adDD.s.hi) || crt_isinf(bcDD.s.hi)) { in __multc3() 73 real.s.hi = CRT_INFINITY * (aDD.s.hi * cDD.s.hi - bDD.s.hi * dDD.s.hi); in __multc3() 75 imag.s.hi = CRT_INFINITY * (aDD.s.hi * dDD.s.hi + bDD.s.hi * cDD.s.hi); in __multc3()
|
/external/python/cpython3/Modules/_decimal/libmpdec/literature/ |
D | mulmod-64.txt | 21 (1) hi * 2**64 + lo = a * b 29 (3) R(hi, lo) = hi * z - hi + lo 35 a) Set (hi, lo) to the result of a * b. 37 b) Set (hi', lo') to the result of R(hi, lo). 39 c) Repeat step b) until 0 <= hi' * 2**64 + lo' < 2*p. 47 hi * 2**64 + lo == hi * z - hi + lo (mod p) 52 hi * 2**64 + lo = (2**64 - z + 1) * hi + z * hi - hi + lo 54 = p * hi + z * hi - hi + lo 56 == z * hi - hi + lo (mod p) 64 def R(hi, lo, z): [all …]
|
D | umodarith.lisp | 253 (defun dw-reduce (hi lo m base) 254 (let* ((r1 (mod hi m)) 260 (< hi base) (< lo base) 262 (natp hi) (natp lo)) 263 (equal (dw-reduce hi lo m base) 264 (mod (+ (* hi base) lo) m)))) 294 (< hi base) (< lo base) 296 (natp hi) (natp lo) 297 (equal r1 (mod hi m))) 301 ("Subgoal 1''" :cases ((< (+ lo (* base (mod hi m))) (* base m)))) [all …]
|
/external/protobuf/js/binary/ |
D | arith.js | 53 jspb.arith.UInt64 = function(lo, hi) { argument 63 this.hi = hi; 74 if (this.hi < other.hi || (this.hi == other.hi && this.lo < other.lo)) { 76 } else if (this.hi == other.hi && this.lo == other.lo) { 89 var hi = this.hi >>> 1; 90 var lo = (this.lo >>> 1) | ((this.hi & 1) << 31); 91 return new jspb.arith.UInt64(lo >>> 0, hi >>> 0); 101 var hi = (this.hi << 1) | (this.lo >>> 31); 102 return new jspb.arith.UInt64(lo >>> 0, hi >>> 0); 111 return !!(this.hi & 0x80000000); [all …]
|
/external/python/cpython2/Lib/ |
D | bisect.py | 3 def insort_right(a, x, lo=0, hi=None): argument 14 if hi is None: 15 hi = len(a) 16 while lo < hi: 17 mid = (lo+hi)//2 18 if x < a[mid]: hi = mid 24 def bisect_right(a, x, lo=0, hi=None): argument 37 if hi is None: 38 hi = len(a) 39 while lo < hi: [all …]
|
/external/XNNPACK/src/f32-dwconv/ |
D | up4x9-minmax-aarch64-neonfma-cortex-a55.S | 98 # Load vbias.hi 107 # Load vi0.hi 110 # Load vk0.hi 119 # Load vi1.hi 122 # Load vk1.hi 131 # Load vi2.hi 134 # Load vk2.hi 143 # Load vi3.hi 146 # Load vk3.hi 155 # Load vi4.hi [all …]
|
/external/llvm-project/libclc/generic/lib/integer/ |
D | upsample.cl | 4 _CLC_OVERLOAD _CLC_DEF BGENTYPE upsample(GENTYPE hi, UGENTYPE lo){ \ 5 return ((BGENTYPE)hi << GENSIZE) | lo; \ 7 _CLC_OVERLOAD _CLC_DEF BGENTYPE##2 upsample(GENTYPE##2 hi, UGENTYPE##2 lo){ \ 8 return (BGENTYPE##2){upsample(hi.s0, lo.s0), upsample(hi.s1, lo.s1)}; \ 10 _CLC_OVERLOAD _CLC_DEF BGENTYPE##3 upsample(GENTYPE##3 hi, UGENTYPE##3 lo){ \ 11 … return (BGENTYPE##3){upsample(hi.s0, lo.s0), upsample(hi.s1, lo.s1), upsample(hi.s2, lo.s2)}; \ 13 _CLC_OVERLOAD _CLC_DEF BGENTYPE##4 upsample(GENTYPE##4 hi, UGENTYPE##4 lo){ \ 14 return (BGENTYPE##4){upsample(hi.lo, lo.lo), upsample(hi.hi, lo.hi)}; \ 16 _CLC_OVERLOAD _CLC_DEF BGENTYPE##8 upsample(GENTYPE##8 hi, UGENTYPE##8 lo){ \ 17 return (BGENTYPE##8){upsample(hi.lo, lo.lo), upsample(hi.hi, lo.hi)}; \ [all …]
|
/external/pdfium/third_party/libopenjpeg20/ |
D | mct.c | 238 __m128i lo, hi; in opj_mct_encode_real() local 245 hi = _mm_shuffle_epi32(r, _MM_SHUFFLE(3, 3, 1, 1)); in opj_mct_encode_real() 247 hi = _mm_mul_epi32(hi, ry); in opj_mct_encode_real() 249 hi = _mm_add_epi64(hi, mulround); in opj_mct_encode_real() 251 hi = _mm_slli_epi64(hi, 32 - 13); in opj_mct_encode_real() 252 y = _mm_blend_epi16(lo, hi, 0xCC); in opj_mct_encode_real() 255 hi = _mm_shuffle_epi32(g, _MM_SHUFFLE(3, 3, 1, 1)); in opj_mct_encode_real() 257 hi = _mm_mul_epi32(hi, gy); in opj_mct_encode_real() 259 hi = _mm_add_epi64(hi, mulround); in opj_mct_encode_real() 261 hi = _mm_slli_epi64(hi, 32 - 13); in opj_mct_encode_real() [all …]
|
/external/python/cpython3/Lib/ |
D | bisect.py | 3 def insort_right(a, x, lo=0, hi=None): argument 12 lo = bisect_right(a, x, lo, hi) 15 def bisect_right(a, x, lo=0, hi=None): argument 28 if hi is None: 29 hi = len(a) 30 while lo < hi: 31 mid = (lo+hi)//2 33 if x < a[mid]: hi = mid 37 def insort_left(a, x, lo=0, hi=None): argument 46 lo = bisect_left(a, x, lo, hi) [all …]
|
/external/python/cpython2/Modules/ |
D | _bisectmodule.c | 9 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi) in internal_bisect_right() argument 18 if (hi == -1) { in internal_bisect_right() 19 hi = PySequence_Size(list); in internal_bisect_right() 20 if (hi < 0) in internal_bisect_right() 23 while (lo < hi) { in internal_bisect_right() 27 mid = ((size_t)lo + hi) / 2; in internal_bisect_right() 36 hi = mid; in internal_bisect_right() 48 Py_ssize_t hi = -1; in bisect_right() local 53 keywords, &list, &item, &lo, &hi)) in bisect_right() 55 index = internal_bisect_right(list, item, lo, hi); in bisect_right() [all …]
|
/external/python/cpython3/Modules/ |
D | _bisectmodule.c | 19 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi) in internal_bisect_right() argument 29 if (hi == -1) { in internal_bisect_right() 30 hi = PySequence_Size(list); in internal_bisect_right() 31 if (hi < 0) in internal_bisect_right() 34 while (lo < hi) { in internal_bisect_right() 38 mid = ((size_t)lo + hi) / 2; in internal_bisect_right() 47 hi = mid; in internal_bisect_right() 74 Py_ssize_t lo, Py_ssize_t hi) in _bisect_bisect_right_impl() argument 77 return internal_bisect_right(a, x, lo, hi); in _bisect_bisect_right_impl() 98 Py_ssize_t lo, Py_ssize_t hi) in _bisect_insort_right_impl() argument [all …]
|
/external/arm-neon-tests/ |
D | ref_dsp.c | 51 int32_t lo, hi; in exec_dsp() local 319 hi = 0x12345678; in exec_dsp() 321 fprintf(ref_file, "smlalbb(&%#x, &%#x, %#x, %#x) = ", lo, hi, svar1, svar2); in exec_dsp() 322 smlalbb(&lo, &hi, svar1, svar2); in exec_dsp() 323 fprintf(ref_file, "%#x%#x\n", hi, lo); in exec_dsp() 324 hi = 0x12345678; in exec_dsp() 326 fprintf(ref_file, "smlalbt(&%#x, &%#x, %#x, %#x) = ", lo, hi, svar1, svar2); in exec_dsp() 327 smlalbt(&lo, &hi, svar1, svar2); in exec_dsp() 328 fprintf(ref_file, "%#x%#x\n", hi, lo); in exec_dsp() 329 hi = 0x12345678; in exec_dsp() [all …]
|
/external/google-benchmark/src/ |
D | benchmark_register.h | 16 AddPowers(std::vector<T>* dst, T lo, T hi, int mult) { in AddPowers() argument 18 CHECK_GE(hi, lo); in AddPowers() 26 for (T i = 1; i <= hi; i *= mult) { in AddPowers() 39 void AddNegatedPowers(std::vector<T>* dst, T lo, T hi, int mult) { in AddNegatedPowers() argument 42 CHECK_GT(hi, std::numeric_limits<T>::min()); in AddNegatedPowers() 43 CHECK_GE(hi, lo); in AddNegatedPowers() 44 CHECK_LE(hi, 0); in AddNegatedPowers() 50 const auto hi_complement = static_cast<T>(-hi); in AddNegatedPowers() 59 void AddRange(std::vector<T>* dst, T lo, T hi, int mult) { in AddRange() argument 63 CHECK_GE(hi, lo); in AddRange() [all …]
|
/external/protobuf/js/compatibility_tests/v3.1.0/binary/ |
D | arith_test.js | 60 b.hi = a.hi - 1; 67 a.hi = 0; 70 a.hi = 0x80000000; 84 assertEquals(a.hi, 0); 88 assertEquals(orig.hi, 0); 90 assertEquals(a.hi, 0); 93 assertEquals(a.hi, 0); 98 assertEquals(a.hi, 0); 101 assertEquals(a.hi, 1); 104 assertEquals(a.hi, 2); [all …]
|
/external/protobuf/js/compatibility_tests/v3.0.0/binary/ |
D | arith_test.js | 60 b.hi = a.hi - 1; 67 a.hi = 0; 70 a.hi = 0x80000000; 84 assertEquals(a.hi, 0); 88 assertEquals(orig.hi, 0); 90 assertEquals(a.hi, 0); 93 assertEquals(a.hi, 0); 98 assertEquals(a.hi, 0); 101 assertEquals(a.hi, 1); 104 assertEquals(a.hi, 2); [all …]
|
/external/python/cpython3/Modules/_decimal/libmpdec/ |
D | umodarith.h | 103 dw_reduce(mpd_uint_t hi, mpd_uint_t lo, mpd_uint_t m) in dw_reduce() argument 107 _mpd_div_word(&w, &r1, hi, m); in dw_reduce() 119 dw_submod(mpd_uint_t a, mpd_uint_t hi, mpd_uint_t lo, mpd_uint_t m) in dw_submod() argument 123 r = dw_reduce(hi, lo, m); in dw_submod() 154 mpd_uint_t hi, lo, x, y; in x64_mulmod() local 157 _mpd_mul_words(&hi, &lo, a, b); in x64_mulmod() 162 x = y = hi; in x64_mulmod() 163 hi >>= 32; in x64_mulmod() 166 if (x > lo) hi--; in x64_mulmod() 170 if (lo < y) hi++; in x64_mulmod() [all …]
|
/external/FP16/test/ |
D | ieee-to-fp32x2-psimd.cc | 45 EXPECT_EQ(positive_infinity_f32, fp32.hi[0]) << in TEST() 48 "F32(F16) = 0x" << std::setw(8) << fp32.hi[0] << ", " << in TEST() 50 EXPECT_EQ(positive_infinity_f32, fp32.hi[1]) << in TEST() 53 "F32(F16) = 0x" << std::setw(8) << fp32.hi[1] << ", " << in TEST() 55 EXPECT_EQ(negative_infinity_f32, fp32.hi[2]) << in TEST() 58 "F32(F16) = 0x" << std::setw(8) << fp32.hi[2] << ", " << in TEST() 60 EXPECT_EQ(negative_infinity_f32, fp32.hi[3]) << in TEST() 63 "F32(F16) = 0x" << std::setw(8) << fp32.hi[3] << ", " << in TEST() 99 EXPECT_EQ(fp32.hi[0] & UINT32_C(0x80000000), 0) << in TEST() 102 "F32(F16) = 0x" << std::setw(8) << fp32.hi[0]; in TEST() [all …]
|
/external/vixl/test/aarch32/ |
D | test-assembler-cond-rdlow-operand-imm8-in-it-block-t32.cc | 107 {{hi, r3, 187}, true, hi, "hi r3 187", "hi_r3_187"}, 133 {{hi, r4, 176}, true, hi, "hi r4 176", "hi_r4_176"}, 136 {{hi, r0, 145}, true, hi, "hi r0 145", "hi_r0_145"}, 138 {{hi, r0, 124}, true, hi, "hi r0 124", "hi_r0_124"}, 147 {{hi, r3, 101}, true, hi, "hi r3 101", "hi_r3_101"}, 150 {{hi, r7, 32}, true, hi, "hi r7 32", "hi_r7_32"}, 210 {{hi, r5, 240}, true, hi, "hi r5 240", "hi_r5_240"}, 220 {{hi, r2, 102}, true, hi, "hi r2 102", "hi_r2_102"}, 234 {{hi, r7, 3}, true, hi, "hi r7 3", "hi_r7_3"}, 242 {{hi, r6, 204}, true, hi, "hi r6 204", "hi_r6_204"}, [all …]
|
/external/llvm-project/compiler-rt/test/builtins/Unit/ppc/ |
D | qadd_test.c | 111 a.hi = edgeCases[i].xhi; in testEdgeCases() 113 b.hi = edgeCases[i].yhi; in testEdgeCases() 115 r.hi = edgeCases[i].rhi; in testEdgeCases() 122 if (r.hi != r.hi) { in testEdgeCases() 123 if (c.hi == c.hi) in testEdgeCases() 131 else if (r.hi == 0.0) in testEdgeCases() 135 error = ((c.hi != r.hi) || (c.lo != r.lo)); in testEdgeCases() 138 …ror on edge case %a + %a: expected (%a, %a), got (%a, %a).\n", a.hi, b.hi, r.hi, r.lo, c.hi, c.lo); in testEdgeCases() 1820 a.hi = accuracyTests[i].xhi; in testAccuracy() 1822 b.hi = accuracyTests[i].yhi; in testAccuracy() [all …]
|
/external/compiler-rt/test/builtins/Unit/ppc/ |
D | qsub_test.c | 109 a.hi = edgeCases[i].xhi; in testEdgeCases() 111 b.hi = edgeCases[i].yhi; in testEdgeCases() 113 r.hi = edgeCases[i].rhi; in testEdgeCases() 122 if (r.hi != r.hi) { in testEdgeCases() 123 if (c.hi == c.hi) in testEdgeCases() 131 else if (r.hi == 0.0) in testEdgeCases() 135 error = ((c.hi != r.hi) || (c.lo != r.lo)); in testEdgeCases() 138 …ror on edge case %a - %a: expected (%a, %a), got (%a, %a).\n", a.hi, b.hi, r.hi, r.lo, c.hi, c.lo); in testEdgeCases() 1820 a.hi = accuracyTests[i].xhi; in testAccuracy() 1822 b.hi = -accuracyTests[i].yhi; in testAccuracy() [all …]
|