Home
last modified time | relevance | path

Searched refs:lo (Results 1 – 25 of 2546) sorted by relevance

12345678910>>...102

/external/s2-geometry-library-java/src/com/google/common/geometry/
DS1Interval.java41 private final double lo; field in S1Interval
48 public S1Interval(double lo, double hi) { in S1Interval() argument
49 this(lo, hi, false); in S1Interval()
58 this.lo = interval.lo; in S1Interval()
66 private S1Interval(double lo, double hi, boolean checked) { in S1Interval() argument
67 double newLo = lo; 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()
77 this.lo = newLo; in S1Interval()
117 public double lo() { in lo() method in S1Interval
[all …]
DR1Interval.java27 private final double lo; field in R1Interval
31 public R1Interval(double lo, double hi) { in R1Interval() argument
32 this.lo = lo; in R1Interval()
64 public double lo() { in lo() method in R1Interval
65 return lo; in lo()
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/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.
41 d) If the result is less than p, return lo'. Otherwise return lo' - 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)
[all …]
/external/e2fsprogs/intl/
DMakefile.in145 bindtextdom.$lo \
146 dcgettext.$lo \
147 dgettext.$lo \
148 gettext.$lo \
149 finddomain.$lo \
150 loadmsgcat.$lo \
151 localealias.$lo \
152 textdomain.$lo \
153 l10nflist.$lo \
154 explodename.$lo \
[all …]
/external/protobuf/js/binary/
Darith.js53 jspb.arith.UInt64 = function(lo, hi) { argument
58 this.lo = lo;
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) {
90 var lo = (this.lo >>> 1) | ((this.hi & 1) << 31);
91 return new jspb.arith.UInt64(lo >>> 0, hi >>> 0);
100 var lo = this.lo << 1;
101 var hi = (this.hi << 1) | (this.lo >>> 31);
102 return new jspb.arith.UInt64(lo >>> 0, hi >>> 0);
120 return !!(this.lo & 1);
[all …]
/external/python/cpython2/Lib/
Dbisect.py3 def insort_right(a, x, lo=0, hi=None): argument
12 if lo < 0:
16 while lo < hi:
17 mid = (lo+hi)//2
19 else: lo = mid+1
20 a.insert(lo, x)
24 def bisect_right(a, x, lo=0, hi=None): argument
35 if lo < 0:
39 while lo < hi:
40 mid = (lo+hi)//2
[all …]
/external/XNNPACK/src/f32-dwconv/
Dup4x9-minmax-aarch64-neonfma-cortex-a55.S95 # Load vbias.lo
101 # Load vi0.lo
104 # Load vk0.lo
113 # Load vi1.lo
116 # Load vk1.lo
125 # Load vi2.lo
128 # Load vk2.lo
137 # Load vi3.lo
140 # Load vk3.lo
149 # Load vi4.lo
[all …]
/external/python/cpython3/Lib/
Dbisect.py3 def insort_right(a, x, lo=0, hi=None): argument
12 lo = bisect_right(a, x, lo, hi)
13 a.insert(lo, x)
15 def bisect_right(a, x, lo=0, hi=None): argument
26 if lo < 0:
30 while lo < hi:
31 mid = (lo+hi)//2
34 else: lo = mid+1
35 return lo
37 def insort_left(a, x, lo=0, hi=None): argument
[all …]
/external/llvm-project/libclc/generic/lib/integer/
Dupsample.cl4 _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/llvm-project/polly/lib/External/isl/
Disl_sort.c30 #define MID(lo, hi) (lo + ((hi - lo) >> 1)) argument
56 char *a1, *al, *am, *ah, *ls, *hs, *lo, *hi, *b; in msort() local
73 lo = al; in msort()
77 ls = lo; in msort()
80 if (lo > al || hi > am) { in msort()
82 lo += size; in msort()
85 while (lo < am && compare (lo, hi, arg) <= 0) in msort()
86 lo += size; in msort()
88 if (lo < am) { in msort()
91 a1 = lo; in msort()
[all …]
/external/python/cpython3/Modules/_decimal/libmpdec/
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
104 n1_neg = (lo & (1ULL<<63)) ? MPD_UINT_MAX : 0; in _mpd_div_words_r()
106 n_adj = lo + (n1_neg & MPD_RADIX); in _mpd_div_words_r()
122 l = l + lo; in _mpd_div_words_r()
123 if (l < lo) h++; 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()
[all …]
Dumodarith.h103 dw_reduce(mpd_uint_t hi, mpd_uint_t lo, mpd_uint_t m) in dw_reduce() argument
108 _mpd_div_words(&w, &r2, r1, lo, 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()
165 x = lo - x; in x64_mulmod()
166 if (x > lo) hi--; in x64_mulmod()
169 lo = y + x; in x64_mulmod()
170 if (lo < y) hi++; in x64_mulmod()
[all …]
/external/pdfium/third_party/libopenjpeg20/
Dmct.c238 __m128i lo, hi; in opj_mct_encode_real() local
244 lo = r; in opj_mct_encode_real()
246 lo = _mm_mul_epi32(lo, ry); in opj_mct_encode_real()
248 lo = _mm_add_epi64(lo, mulround); in opj_mct_encode_real()
250 lo = _mm_srli_epi64(lo, 13); in opj_mct_encode_real()
252 y = _mm_blend_epi16(lo, hi, 0xCC); in opj_mct_encode_real()
254 lo = g; in opj_mct_encode_real()
256 lo = _mm_mul_epi32(lo, gy); in opj_mct_encode_real()
258 lo = _mm_add_epi64(lo, mulround); in opj_mct_encode_real()
260 lo = _mm_srli_epi64(lo, 13); in opj_mct_encode_real()
[all …]
/external/llvm-project/llvm/test/MC/Mips/
Dexpr1.s10 # 32R2-EL: lw $4, %lo(foo)($4) # encoding: [A,A,0x84,0x8c]
11 # 32R2-EL: # fixup A - offset: 0, value: %lo(foo), kind: fixup_Mips_L…
13 # 32R2-EL: lui $1, %hi(foo+(%lo(8))) # encoding: [A,A,0x01,0x3c]
14 # 32R2-EL: # fixup A - offset: 0, value: %hi(foo+(%lo(8))), kind: …
16 # 32R2-EL: lw $4, %lo(foo+(%lo(8)))($1) # encoding: [A,A,0x24,0x8c]
17 # 32R2-EL: # fixup A - offset: 0, value: %lo(foo+(%lo(8))), kind: …
18 # 32R2-EL: lw $4, %lo(12+foo)($4) # encoding: [A,A,0x84,0x8c]
19 # 32R2-EL: # fixup A - offset: 0, value: %lo(12+foo), kind: fixup_Mip…
20 # 32R2-EL: lw $4, %lo(16+foo)($4) # encoding: [A,A,0x84,0x8c]
21 # 32R2-EL: # fixup A - offset: 0, value: %lo(16+foo), kind: fixup_Mip…
[all …]
/external/llvm-project/libcxx/test/std/containers/sequences/vector/vector.cons/
Dassign_move.pass.cpp27 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
31 lo.push_back(i); in main()
34 assert(is_contiguous_container_asan_correct(lo)); in main()
37 assert(l2 == lo); in main()
39 assert(l2.get_allocator() == lo.get_allocator()); in main()
44 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
46 assert(is_contiguous_container_asan_correct(lo)); in main()
50 lo.push_back(i); in main()
53 assert(is_contiguous_container_asan_correct(lo)); in main()
56 assert(l2 == lo); in main()
[all …]
Dmove_alloc.pass.cpp27 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
29 assert(is_contiguous_container_asan_correct(lo)); in main()
33 lo.push_back(i); in main()
36 assert(is_contiguous_container_asan_correct(lo)); in main()
38 assert(l2 == lo); in main()
45 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
47 assert(is_contiguous_container_asan_correct(lo)); in main()
51 lo.push_back(i); in main()
54 assert(is_contiguous_container_asan_correct(lo)); in main()
56 assert(l2 == lo); in main()
[all …]
/external/libcxx/test/std/containers/sequences/vector/vector.cons/
Dassign_move.pass.cpp27 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
31 lo.push_back(i); in main()
34 assert(is_contiguous_container_asan_correct(lo)); in main()
37 assert(l2 == lo); in main()
39 assert(l2.get_allocator() == lo.get_allocator()); in main()
44 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
46 assert(is_contiguous_container_asan_correct(lo)); in main()
50 lo.push_back(i); in main()
53 assert(is_contiguous_container_asan_correct(lo)); in main()
56 assert(l2 == lo); in main()
[all …]
Dmove_alloc.pass.cpp27 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
29 assert(is_contiguous_container_asan_correct(lo)); in main()
33 lo.push_back(i); in main()
36 assert(is_contiguous_container_asan_correct(lo)); in main()
38 assert(l2 == lo); in main()
45 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); in main() local
47 assert(is_contiguous_container_asan_correct(lo)); in main()
51 lo.push_back(i); in main()
54 assert(is_contiguous_container_asan_correct(lo)); in main()
56 assert(l2 == lo); in main()
[all …]
/external/protobuf/js/compatibility_tests/v3.1.0/binary/
Darith_test.js53 b.lo -= 1;
56 b.lo += 2;
59 b.lo = a.lo;
68 a.lo = 0;
73 a.lo = 0x00000001;
83 assertEquals(a.lo, 1);
87 assertEquals(orig.lo, 1); // original unmodified.
89 assertEquals(a.lo, 2);
92 assertEquals(a.lo, 4);
97 assertEquals(a.lo, 0x80000000);
[all …]
/external/protobuf/js/compatibility_tests/v3.0.0/binary/
Darith_test.js53 b.lo -= 1;
56 b.lo += 2;
59 b.lo = a.lo;
68 a.lo = 0;
73 a.lo = 0x00000001;
83 assertEquals(a.lo, 1);
87 assertEquals(orig.lo, 1); // original unmodified.
89 assertEquals(a.lo, 2);
92 assertEquals(a.lo, 4);
97 assertEquals(a.lo, 0x80000000);
[all …]
/external/arm-neon-tests/
Dref_dsp.c51 int32_t lo, hi; in exec_dsp() local
320 lo = 0x9ABCDEF0; 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()
325 lo = 0x9ABCDEF0; 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()
330 lo = 0x9ABCDEF0; in exec_dsp()
[all …]
/external/llvm/test/MC/Mips/
Dexpr1.s10 # 32R2-EL: lw $4, %lo(foo)($4) # encoding: [A,A,0x84,0x8c]
11 # 32R2-EL: # fixup A - offset: 0, value: %lo(foo), kind: fixup_Mips_L…
13 # 32R2-EL: lw $4, %lo(8+foo)($4) # encoding: [A,A,0x84,0x8c]
14 # 32R2-EL: # fixup A - offset: 0, value: %lo(8+foo), kind: fixup_Mips…
15 # 32R2-EL: lw $4, %lo(8+foo)($4) # encoding: [A,A,0x84,0x8c]
16 # 32R2-EL: # fixup A - offset: 0, value: %lo(8+foo), kind: fixup_Mips…
17 # 32R2-EL: lw $4, %lo(8+foo)($4) # encoding: [A,A,0x84,0x8c]
18 # 32R2-EL: # fixup A - offset: 0, value: %lo(8+foo), kind: fixup_Mips…
23 # 32R2-EL: lw $4, %lo(65542)($4) # encoding: [0x06,0x00,0x84,0x8c]
29 # MM-32R2-EL: lw $4, %lo(foo)($4) # encoding: [0x84'A',0xfc'A',0x00,0x00]
[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
14 if (lo < 0) { in internal_bisect_right()
23 while (lo < hi) { in internal_bisect_right()
27 mid = ((size_t)lo + hi) / 2; in internal_bisect_right()
38 lo = mid + 1; in internal_bisect_right()
40 return lo; in internal_bisect_right()
47 Py_ssize_t lo = 0; 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()
78 Py_ssize_t lo = 0; in insort_right() local
[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
25 if (lo < 0) { in internal_bisect_right()
34 while (lo < hi) { in internal_bisect_right()
38 mid = ((size_t)lo + hi) / 2; in internal_bisect_right()
49 lo = mid + 1; in internal_bisect_right()
51 return lo; 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
102 Py_ssize_t index = internal_bisect_right(a, x, lo, hi); in _bisect_insort_right_impl()
[all …]
/external/rust/crates/libz-sys/src/zlib-ng/arch/x86/
DMakefile.in22 x86.o x86.lo \
23 adler32_avx.o adler32.lo \
24 adler32_ssse3.o adler32_ssse3.lo \
25 chunkset_sse.o chunkset_sse.lo \
26 compare258_avx.o compare258_avx.lo \
27 compare258_sse.o compare258_sse.lo \
28 insert_string_sse.o insert_string_sse.lo \
29 crc_folding.o crc_folding.lo \
30 slide_avx.o slide_avx.lo \
31 slide_sse.o slide_sse.lo
[all …]

12345678910>>...102