Searched refs:lo (Results 1 - 25 of 631) sorted by relevance

1234567891011>>

/external/python/cpython2/Lib/
H A Dbisect.py3 def insort_right(a, x, lo=0, hi=None):
8 Optional args lo (default 0) and hi (default len(a)) bound the
12 if lo < 0:
13 raise ValueError('lo must be non-negative')
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):
31 Optional args lo (defaul
[all...]
/external/regex-re2/util/
H A Drandom.cc15 uint32 lo = A * (int32)(seed_ & 0xFFFF); local
17 lo += (hi & 0x7FFF) << 16;
18 if (lo > M) {
19 lo &= M;
20 ++lo;
22 lo += hi >> 15;
23 if (lo > M) {
24 lo &= M;
25 ++lo;
27 return (seed_ = (int32) lo);
[all...]
/external/llvm/test/MC/Mips/
H A Drelocation-n64.s27 addiu $2, $3, %lo(%neg(%gp_rel(foo))) // RELOC: R_MIPS_GPREL16/R_MIPS_SUB/R_MIPS_LO16 foo
28 // ENCBE: addiu $2, $3, %lo(%neg(%gp_rel(foo))) # encoding: [0x24,0x62,A,A]
29 // ENCLE: addiu $2, $3, %lo(%neg(%gp_rel(foo))) # encoding: [A,A,0x62,0x24]
30 // FIXUP: # fixup A - offset: 0, value: %lo(%neg(%gp_rel(foo))), kind: fixup_Mips_GPOFF_LO
32 addiu $2, $3, %lo(%neg(%gp_rel(bar))) // RELOC: R_MIPS_GPREL16/R_MIPS_SUB/R_MIPS_LO16 .data
33 // ENCBE: addiu $2, $3, %lo(%neg(%gp_rel(bar))) # encoding: [0x24,0x62,A,A]
34 // ENCLE: addiu $2, $3, %lo(%neg(%gp_rel(bar))) # encoding: [A,A,0x62,0x24]
35 // FIXUP: # fixup A - offset: 0, value: %lo(%neg(%gp_rel(bar))), kind: fixup_Mips_GPOFF_LO
H A Drelocation-xfail.s16 addiu $2, $2, %lo(baz)
19 addiu $2, $2, %lo(baz)
/external/compiler-rt/test/builtins/Unit/ppc/
H A DDD.h10 double lo; member in struct:__anon3544::__anon3545
H A Dfloatditf_test.c17 expected.lo = tests[i].lo;
20 if ((computed.hi != expected.hi) || (computed.lo != expected.lo))
23 printf("\tExpected %La = ( %a , %a )\n", expected.ld, expected.hi, expected.lo);
24 printf("\tComputed %La = ( %a , %a )\n", computed.ld, computed.hi, computed.lo);
H A Dfloatunditf_test.c17 expected.lo = tests[i].lo;
20 if ((computed.hi != expected.hi) || (computed.lo != expected.lo))
23 printf("\tExpected %La = ( %a , %a )\n", expected.ld, expected.hi, expected.lo);
24 printf("\tComputed %La = ( %a , %a )\n", computed.ld, computed.hi, computed.lo);
/external/protobuf/js/binary/
H A Darith.js49 * @param {number} lo The low 32 bits.
53 jspb.arith.UInt64 = function(lo, hi) {
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 >>>
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/exception/
H A DOutOfRangeException.java33 private final Number lo; field in class:OutOfRangeException
41 * @param lo Lower bound.
45 Number lo,
47 super(LocalizedFormats.OUT_OF_RANGE_SIMPLE, wrong, lo, hi);
48 this.lo = lo;
55 return lo;
44 OutOfRangeException(Number wrong, Number lo, Number hi) argument
/external/libcxx/test/std/containers/sequences/vector.bool/
H A Dmove.pass.cpp24 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5));
28 lo.push_back(i);
31 assert(l2 == lo);
33 assert(l2.get_allocator() == lo.get_allocator());
37 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5));
41 lo.push_back(i);
44 assert(l2 == lo);
46 assert(l2.get_allocator() == lo.get_allocator());
51 std::vector<bool, min_allocator<bool> > lo(min_allocator<bool>{});
55 lo
[all...]
H A Dassign_move.pass.cpp24 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5));
28 lo.push_back(i);
32 assert(l2 == lo);
34 assert(l2.get_allocator() == lo.get_allocator());
38 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5));
42 lo.push_back(i);
46 assert(l2 == lo);
52 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5));
56 lo.push_back(i);
60 assert(l2 == lo);
[all...]
H A Dmove_alloc.pass.cpp24 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5));
28 lo.push_back(i);
31 assert(l2 == lo);
37 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5));
41 lo.push_back(i);
44 assert(l2 == lo);
50 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5));
54 lo.push_back(i);
57 assert(l2 == lo);
64 std::vector<bool, min_allocator<bool> > lo(min_allocato
[all...]
/external/ltp/testcases/kernel/syscalls/fork/
H A Dfork05.c149 int lo; local
168 asm volatile ("movl %%fs:0, %0":"=r" (lo));
169 tst_resm(TINFO, "a = %d", lo);
171 asm volatile ("pushl %%fs; popl %0":"=q" (lo));
172 tst_resm(TINFO, "%%fs = %#06hx", lo);
179 asm volatile ("pushl %%fs; popl %0":"=q" (lo));
180 tst_resm(TINFO, "%%fs = %#06hx", lo);
182 asm volatile ("movl %%fs:0, %0":"=r" (lo));
183 tst_resm(TINFO, "a = %d", lo);
185 if (lo !
[all...]
/external/fio/oslib/
H A Dgetopt_long.c75 const struct option *lo; local
86 for (lo = longopts; lo->name; lo++) {
87 opt_end = option_matches(carg+2, lo->name, 0);
100 for (lo = longopts; lo->name; lo++) {
103 ret = option_matches(carg+2, lo->name, 1);
108 lo_match = lo;
[all...]
/external/libcxx/test/std/containers/sequences/list/list.cons/
H A Dmove.pass.cpp26 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
30 lo.push_back(i);
33 assert(l2 == lo);
35 assert(l2.get_allocator() == lo.get_allocator());
39 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5));
43 lo.push_back(i);
46 assert(l2 == lo);
48 assert(l2.get_allocator() == lo.get_allocator());
52 std::list<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{});
56 lo
[all...]
H A Dassign_move.pass.cpp25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
29 lo.push_back(i);
33 assert(l2 == lo);
35 assert(l2.get_allocator() == lo.get_allocator());
39 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
43 lo.push_back(i);
47 assert(l2 == lo);
53 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5));
57 lo.push_back(i);
61 assert(l2 == lo);
[all...]
/external/syslinux/com32/lib/
H A Dgetopt_long.c69 const struct option *lo; local
80 for (lo = longopts; lo->name; lo++) {
81 if ((opt_end = option_matches(carg+2, lo->name)))
88 *longindex = lo-longopts;
91 if (lo->has_arg)
95 } else if (lo->has_arg == 1) {
101 if (lo->flag) {
102 *lo
[all...]
/external/syslinux/libinstaller/getopt/
H A Dgetopt_long.c69 const struct option *lo; local
80 for (lo = longopts; lo->name; lo++) {
81 if ((opt_end = option_matches(carg+2, lo->name)))
88 *longindex = lo-longopts;
91 if (lo->has_arg)
95 } else if (lo->has_arg == 1) {
101 if (lo->flag) {
102 *lo
[all...]
/external/compiler-rt/lib/builtins/arm/
H A Dsync_fetch_and_umin_4.S17 #define umin_4(rD, rN, rM) MINMAX_4(rD, rN, rM, lo)
/external/libcxx/test/std/containers/sequences/vector/vector.cons/
H A Dassign_move.pass.cpp26 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
30 lo.push_back(i);
33 assert(is_contiguous_container_asan_correct(lo));
36 assert(l2 == lo);
38 assert(l2.get_allocator() == lo.get_allocator());
43 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
45 assert(is_contiguous_container_asan_correct(lo));
49 lo.push_back(i);
52 assert(is_contiguous_container_asan_correct(lo));
55 assert(l2 == lo);
[all...]
H A Dmove_alloc.pass.cpp26 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
28 assert(is_contiguous_container_asan_correct(lo));
32 lo.push_back(i);
35 assert(is_contiguous_container_asan_correct(lo));
37 assert(l2 == lo);
44 std::vector<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
46 assert(is_contiguous_container_asan_correct(lo));
50 lo.push_back(i);
53 assert(is_contiguous_container_asan_correct(lo));
55 assert(l2 == lo);
[all...]
/external/dhcpcd-6.8.2/compat/
H A Dstrtoi.h34 int base, intmax_t lo, intmax_t hi, int *rstatus);
36 int base, uintmax_t lo, uintmax_t hi, int *rstatus);
/external/regex-re2/re2/
H A Dunicode_groups.h27 uint16 lo; member in struct:re2::URange16
33 uint32 lo; member in struct:re2::URange32
/external/fonttools/Lib/fontTools/misc/
H A DfixedTools.py33 lo = fmt % (value - eps)
36 length = min(len(lo), len(hi))
38 if lo[i] != hi[i]:
40 out.append(lo[i])
43 out.append(max(lo[outlen], hi[outlen]))
/external/fonttools/Tools/fontTools/misc/
H A DfixedTools.py33 lo = fmt % (value - eps)
36 length = min(len(lo), len(hi))
38 if lo[i] != hi[i]:
40 out.append(lo[i])
43 out.append(max(lo[outlen], hi[outlen]))

Completed in 1974 milliseconds

1234567891011>>