Home
last modified time | relevance | path

Searched refs:hi (Results 1 – 25 of 2290) sorted by relevance

12345678910>>...92

/external/s2-geometry-library-java/src/com/google/common/geometry/
DS1Interval.java42 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 …]
DR1Interval.java28 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/
Ddivtc3.c13 (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 …]
Dmultc3.c9 (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/python/cpython3/Modules/_decimal/libmpdec/literature/
Dmulmod-64.txt21 (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 …]
Dumodarith.lisp253 (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/cronet/third_party/protobuf/js/binary/
Darith.js53 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/musl/src/math/
Dsqrtl.c17 uint64_t hi; member
26 u.i2.hi = x.hi; in mkldbl()
28 u.i2.hi &= 0x0000ffffffffffff; in mkldbl()
29 u.i2.hi |= top << 48; in mkldbl()
46 r.hi = u.i2.hi; in asu128()
51 r.hi = u.i.m>>15; in asu128()
52 r.hi &= 0x0000ffffffffffff; in asu128()
53 r.hi |= (uint64_t)u.i.se << 48; in asu128()
78 r.hi = a.hi; in add64()
80 r.hi++; in add64()
[all …]
/external/python/cpython2/Lib/
Dbisect.py3 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/
Dup4x9-minmax-aarch64-neonfma-cortex-a55.S125 # Load vbias.hi
134 # Load vi0.hi
137 # Load vk0.hi
146 # Load vi1.hi
149 # Load vk1.hi
158 # Load vi2.hi
161 # Load vk2.hi
170 # Load vi3.hi
173 # Load vk3.hi
182 # Load vi4.hi
[all …]
/external/python/cpython3/Lib/
Dbisect.py4 def insort_right(a, x, lo=0, hi=None, *, key=None): argument
13 lo = bisect_right(a, x, lo, hi)
15 lo = bisect_right(a, key(x), lo, hi, key=key)
19 def bisect_right(a, x, lo=0, hi=None, *, key=None): argument
32 if hi is None:
33 hi = len(a)
37 while lo < hi:
38 mid = (lo + hi) // 2
40 hi = mid
44 while lo < hi:
[all …]
/external/zucchini/
Ddisassembler_dex.h136 offset_t hi);
139 offset_t hi);
142 offset_t hi);
144 offset_t hi);
147 offset_t hi);
149 offset_t hi);
151 offset_t hi);
153 offset_t hi);
155 offset_t hi);
157 offset_t hi);
[all …]
/external/zucchini/aosp/include/components/zucchini/
Ddisassembler_dex.h136 offset_t hi);
139 offset_t hi);
142 offset_t hi);
144 offset_t hi);
147 offset_t hi);
149 offset_t hi);
151 offset_t hi);
153 offset_t hi);
155 offset_t hi);
157 offset_t hi);
[all …]
/external/python/cpython2/Modules/
D_bisectmodule.c9 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/arm-neon-tests/
Dref_dsp.c51 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/python/cpython3/Modules/
D_bisectmodule.c19 internal_bisect_right(PyObject *list, PyObject *item, Py_ssize_t lo, Py_ssize_t hi, in internal_bisect_right() argument
30 if (hi == -1) { in internal_bisect_right()
31 hi = PySequence_Size(list); in internal_bisect_right()
32 if (hi < 0) in internal_bisect_right()
35 while (lo < hi) { in internal_bisect_right()
39 mid = ((size_t)lo + hi) / 2; in internal_bisect_right()
56 hi = mid; in internal_bisect_right()
85 Py_ssize_t lo, Py_ssize_t hi, PyObject *key) in _bisect_bisect_right_impl() argument
88 return internal_bisect_right(a, x, lo, hi, key); in _bisect_bisect_right_impl()
111 Py_ssize_t lo, Py_ssize_t hi, PyObject *key) in _bisect_insort_right_impl() argument
[all …]
/external/vixl/test/aarch32/
Dtest-assembler-cond-rdlow-operand-imm8-in-it-block-t32.cc107 {{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/FP16/test/
Dieee-to-fp32x2-psimd.cc45 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/python/cpython3/Modules/_decimal/libmpdec/
Dumodarith.h103 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 …]
Dbasearith.h98 _mpd_div_words_r(mpd_uint_t *q, mpd_uint_t *r, mpd_uint_t hi, mpd_uint_t lo) in _mpd_div_words_r() argument
109 _mpd_mul_words(&h, &l, mprime_rdx, hi-n1_neg); in _mpd_div_words_r()
112 t = h + hi; in _mpd_div_words_r()
124 h += hi; in _mpd_div_words_r()
142 _mpd_div_words_r(mpd_uint_t *q, mpd_uint_t *r, mpd_uint_t hi, mpd_uint_t lo) in _mpd_div_words_r() argument
144 _mpd_div_words(q, r, hi, lo, MPD_RADIX); in _mpd_div_words_r()
153 mpd_uint_t hi, lo; in _mpd_singlemul() local
155 _mpd_mul_words(&hi, &lo, u, v); in _mpd_singlemul()
156 _mpd_div_words_r(&w[1], &w[0], hi, lo); in _mpd_singlemul()
163 mpd_uint_t hi, lo; in _mpd_mul_2_le2() local
[all …]
/external/cronet/third_party/protobuf/js/compatibility_tests/v3.0.0/binary/
Darith_test.js60 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/cronet/third_party/protobuf/js/compatibility_tests/v3.1.0/binary/
Darith_test.js60 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/google-benchmark/src/
Dbenchmark_register.h16 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/compiler-rt/test/builtins/Unit/ppc/
Dqadd_test.c109 a.hi = edgeCases[i].xhi; in testEdgeCases()
111 b.hi = edgeCases[i].yhi; in testEdgeCases()
113 r.hi = edgeCases[i].rhi; in testEdgeCases()
120 if (r.hi != r.hi) { in testEdgeCases()
121 if (c.hi == c.hi) in testEdgeCases()
129 else if (r.hi == 0.0) in testEdgeCases()
133 error = ((c.hi != r.hi) || (c.lo != r.lo)); in testEdgeCases()
136 …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()
1818 a.hi = accuracyTests[i].xhi; in testAccuracy()
1820 b.hi = accuracyTests[i].yhi; in testAccuracy()
[all …]
Dqsub_test.c109 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 …]

12345678910>>...92