/external/regex-re2/util/ |
random.cc | 15 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...] |
/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...] |
/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/mockito/cglib-and-asm/src/org/mockito/cglib/util/ |
SorterTemplate.java | 27 protected void quickSort(int lo, int hi) { 28 quickSortHelper(lo, hi); 29 insertionSort(lo, hi); 32 private void quickSortHelper(int lo, int hi) { 34 int diff = hi - lo; 38 int i = (hi + lo) / 2; 39 if (compare(lo, i) > 0) { 40 swap(lo, i); 42 if (compare(lo, hi) > 0) { 43 swap(lo, hi) [all...] |
/external/compiler-rt/test/builtins/Unit/ppc/ |
DD.h | 10 double lo; member in struct:__anon7268::__anon7269
|
floatditf_test.c | 17 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);
|
floatunditf_test.c | 17 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/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;
|
/external/libcxx/test/std/containers/sequences/vector.bool/ |
move.pass.cpp | 24 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.push_back(i) [all...] |
assign_move.pass.cpp | 24 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...] |
move_alloc.pass.cpp | 24 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_allocator<bool>{}) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
move.pass.cpp | 24 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.push_back(i) [all...] |
assign_move.pass.cpp | 24 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...] |
move_alloc.pass.cpp | 24 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_allocator<bool>{}) [all...] |
/frameworks/base/libs/androidfw/ |
AssetDir.cpp | 42 int lo, hi, cur; 44 lo = 0; 46 while (lo <= hi) { 49 cur = (hi + lo) / 2; 56 lo = cur + 1;
|
/frameworks/base/core/java/android/app/usage/ |
TimeSparseArray.java | 46 int lo = 0; local 50 while (lo <= hi) { 51 mid = lo + ((hi - lo) / 2); 55 lo = mid + 1; 65 } else if (time > key && lo < size) { 66 return lo;
|
/frameworks/support/v4/java/android/support/v4/util/ |
ContainerHelpers.java | 46 int lo = 0; local 49 while (lo <= hi) { 50 int mid = (lo + hi) >>> 1; 54 lo = mid + 1; 61 return ~lo; // value not present 65 int lo = 0; local 68 while (lo <= hi) { 69 final int mid = (lo + hi) >>> 1; 73 lo = mid + 1; 80 return ~lo; // value not presen [all...] |
/bionic/libm/upstream-freebsd/lib/msun/src/ |
s_cosl.c | 56 long double hi, lo; local 77 lo = y[1]; 81 hi = __kernel_cosl(hi, lo); 84 hi = - __kernel_sinl(hi, lo, 1); 87 hi = - __kernel_cosl(hi, lo); 90 hi = __kernel_sinl(hi, lo, 1);
|
s_sinl.c | 51 long double hi, lo; local 75 lo = y[1]; 79 hi = __kernel_sinl(hi, lo, 1); 82 hi = __kernel_cosl(hi, lo); 85 hi = - __kernel_sinl(hi, lo, 1); 88 hi = - __kernel_cosl(hi, lo);
|
/external/fio/lib/ |
getopt_long.c | 75 const struct option *lo; local 86 for (lo = longopts; lo->name; lo++) { 87 if ((opt_end = option_matches(carg+2, lo->name))) 94 *longindex = lo-longopts; 97 if (lo->has_arg) 101 } else if (lo->has_arg == 1) { 107 if (lo->flag) { 108 *lo->flag = lo->val [all...] |
/external/libcxx/test/std/containers/sequences/list/list.cons/ |
move.pass.cpp | 25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 29 lo.push_back(i); 32 assert(l2 == lo); 34 assert(l2.get_allocator() == lo.get_allocator()); 38 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 42 lo.push_back(i); 45 assert(l2 == lo); 47 assert(l2.get_allocator() == lo.get_allocator()); 52 std::list<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{}); 56 lo.push_back(i) [all...] |
/frameworks/av/media/libstagefright/codecs/amrwbenc/inc/ |
oper_32b.h | 24 void VO_L_Extract (Word32 L_32, Word16 *hi, Word16 *lo); 25 Word32 L_Comp (Word16 hi, Word16 lo); 27 Word32 Mpy_32_16 (Word16 hi, Word16 lo, Word16 n);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
move.pass.cpp | 25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5)); 29 lo.push_back(i); 32 assert(l2 == lo); 34 assert(l2.get_allocator() == lo.get_allocator()); 38 std::list<MoveOnly, other_allocator<MoveOnly> > lo(other_allocator<MoveOnly>(5)); 42 lo.push_back(i); 45 assert(l2 == lo); 47 assert(l2.get_allocator() == lo.get_allocator()); 52 std::list<MoveOnly, min_allocator<MoveOnly> > lo(min_allocator<MoveOnly>{}); 56 lo.push_back(i) [all...] |
/art/runtime/verifier/ |
dex_gc_map.cc | 35 int lo = 0; local 37 while (hi >= lo) { 38 int mid = (hi + lo) / 2; 41 lo = mid + 1;
|