| /frameworks/base/core/java/android/util/ |
| ContainerHelpers.java | 23 int lo = 0; local
26 while (lo <= hi) {
27 final int mid = (lo + hi) >>> 1;
31 lo = mid + 1;
38 return ~lo; // value not present
42 int lo = 0; local
45 while (lo <= hi) {
46 final int mid = (lo + hi) >>> 1;
50 lo = mid + 1;
57 return ~lo; // value not presen
[all...] |
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mips/ |
| elf-rel22.s | 2 lui $4,%lo(%neg(%lo(bar-foo)))
6 lui $4,%lo(%neg(%lo(bar-foo)))
8 lui $4,%lo(%neg(%gp_rel(late_const)))
|
| dot-1.s | 11 addiu $4,%lo(.L2 - .)
12 addiu $4,%lo(.L3 - .)
13 addiu $4,%lo(. - .L1)
14 addiu $4,%lo(. - foo)
|
| expr1.s | 4 lw $4,%lo(foo)($4)
6 lw $4,%lo (2 * 4) + foo($4)
7 lw $4,%lo((2 * 4) + foo)($4)
8 lw $4,(((%lo ((2 * 4) + foo))))($4)
|
| la-reloc.s | 3 la $4,%lo(foo)
5 la $4,%lo(0x12348765)
7 la $4,%lo(foo)($5)
9 la $4,%lo(0x12348765)($5)
11 la $4,%lo(foo+0x12348765)($5)
|
| dla-reloc.s | 3 dla $4,%lo(foo)
5 dla $4,%lo(0x12348765)
7 dla $4,%lo(foo)($5)
9 dla $4,%lo(0x12348765)($5)
11 dla $4,%lo(foo+0x12348765)($5)
14 dla $4,%lo(%neg(%gp_rel(bar)))($5)
|
| pr12915.s | 2 lw $27, %lo(kernelsp)($27)
|
| elf-rel20.s | 5 addiu $4,$4,%lo(foo + 2)
6 addiu $5,$5,%lo(foo + 0x80004)
7 addiu $6,$6,%lo(bar + 2)
8 addiu $7,$7,%lo(bar + 0x80004)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| bisect.py | 3 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 (default 0) and hi (default len(a)) bound the
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| bisect.py | 3 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 (default 0) and hi (default len(a)) bound the
[all...] |
| /external/python/cpython2/Lib/ |
| bisect.py | 3 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 (default 0) and hi (default len(a)) bound th
[all...] |
| /external/python/cpython3/Lib/ |
| bisect.py | 3 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 (default 0) and hi (default len(a)) bound th
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| bisect.py | 3 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 (default 0) and hi (default len(a)) bound th
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| bisect.py | 3 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 (default 0) and hi (default len(a)) bound th
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| bisect.py | 3 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 (default 0) and hi (default len(a)) bound th
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| bisect.py | 3 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 (default 0) and hi (default len(a)) bound th
[all...] |
| /external/llvm/test/MC/Mips/ |
| relocation-n64.s | 27 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
|
| relocation-xfail.s | 16 addiu $2, $2, %lo(baz)
19 addiu $2, $2, %lo(baz)
|
| /external/compiler-rt/test/builtins/Unit/ppc/ |
| DD.h | 10 double lo; member in struct:__anon17240::__anon17241
|
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-v850/ |
| split-lo16.s | 2 addi lo(lo16_nocarry),r1,r2
3 ld.bu lo(lo16_nocarry)[r1],r2
5 addi lo(lo16_nocarry + 0x18200),r1,r2
6 ld.bu lo(lo16_nocarry + 0x18200)[r1],r2
8 ld.bu lo(split_lo16_nocarry)[r1],r2
9 addi lo(split_lo16_nocarry),r1,r2
11 ld.bu lo(split_lo16_nocarry + 0x18200)[r1],r2
12 addi lo(split_lo16_nocarry + 0x18200),r1,r2
14 addi lo(lo16_carry),r1,r2
15 ld.bu lo(lo16_carry)[r1],r
[all...] |
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/v850/ |
| split-lo16.s | 2 addi lo(foo),r1,r2
3 ld.b lo(foo),r1,r2
4 ld.bu lo(foo),r1,r2
6 ld.bu lo(0x12345),r1,r2
7 ld.bu lo(0x123456),r1,r2
9 ld.w lo(0)[r0], r10
10 ld.w lo(0x12345678)[r0], r10
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/exception/ |
| OutOfRangeException.java | 33 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;
|
| /device/linaro/bootloader/edk2/StdLib/LibC/StdLib/ |
| Rand.c | 50 INT32 hi, lo, x;
local
56 lo = next % 127773;
57 x = 16807 * lo - 2836 * hi;
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| move.pass.cpp | 25 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5));
29 lo.push_back(i);
32 assert(l2 == lo);
34 assert(l2.get_allocator() == lo.get_allocator());
38 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5));
42 lo.push_back(i);
45 assert(l2 == lo);
47 assert(l2.get_allocator() == lo.get_allocator());
51 std::vector<bool, min_allocator<bool> > lo(min_allocator<bool>{});
55 lo.push_back(i)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/vector.bool/ |
| move.pass.cpp | 25 std::vector<bool, test_allocator<bool> > lo(test_allocator<bool>(5));
29 lo.push_back(i);
32 assert(l2 == lo);
34 assert(l2.get_allocator() == lo.get_allocator());
38 std::vector<bool, other_allocator<bool> > lo(other_allocator<bool>(5));
42 lo.push_back(i);
45 assert(l2 == lo);
47 assert(l2.get_allocator() == lo.get_allocator());
51 std::vector<bool, min_allocator<bool> > lo(min_allocator<bool>{});
55 lo.push_back(i)
[all...] |
