/external/skia/src/views/unix/ |
H A D | keysym2ucs.c | 822 int mid; local 835 mid = (min + max) / 2; 836 if (keysymtab[mid].keysym < keysym) 837 min = mid + 1; 838 else if (keysymtab[mid].keysym > keysym) 839 max = mid - 1; 842 return keysymtab[mid].ucs;
|
/external/skia/tests/ |
H A D | PathOpsDLineTest.cpp | 46 SkDPoint mid = line.ptAtT(.5); local 47 REPORTER_ASSERT(reporter, approximately_equal((line[0].fX + line[1].fX) / 2, mid.fX)); 48 REPORTER_ASSERT(reporter, approximately_equal((line[0].fY + line[1].fY) / 2, mid.fY));
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/univariate/ |
H A D | BrentOptimizer.java | 73 * @param mid Point inside the interval {@code [lo, hi]}. 83 double lo, double mid, double hi, 102 double x = mid; 82 localMin(boolean isMinim, double lo, double mid, double hi, double eps, double t) argument
|
H A D | BracketFinder.java | 66 private double mid; field in class:BracketFinder 76 * Function value at {@link #mid}. 207 mid = xB; 264 return mid;
|
/external/compiler-rt/test/asan/TestCases/ |
H A D | contiguous_container.cc | 14 char *mid = beg + capacity; local 20 old_mid = mid; 21 mid = beg + size; 22 __sanitizer_annotate_contiguous_container(beg, end, old_mid, mid); 28 assert(__sanitizer_verify_contiguous_container(beg, mid, end)); 29 if (mid != beg) 30 assert(!__sanitizer_verify_contiguous_container(beg, mid - 1, end)); 31 if (mid != end) 32 assert(!__sanitizer_verify_contiguous_container(beg, mid + 1, end)); 36 __sanitizer_annotate_contiguous_container(beg, end, mid, en [all...] |
/external/lzma/CPP/7zip/Archive/Common/ |
H A D | MultiStream.cpp | 17 int left = 0, mid = _streamIndex, right = Streams.Size();
local 20 CSubStreamInfo &m = Streams[mid];
22 right = mid;
24 left = mid + 1;
27 _streamIndex = mid;
30 mid = (left + right) / 2;
32 _streamIndex = mid;
|
/external/lzma/CPP/7zip/Common/ |
H A D | FilePathAutoRename.cpp | 48 unsigned mid = (left + right) / 2;
local 49 if (MakeAutoName(name, extension, mid, path))
50 left = mid + 1;
52 right = mid;
|
/external/e2fsprogs/e2fsck/ |
H A D | dx_dirinfo.c | 83 int low, high, mid; local 95 mid = (low+high)/2; 96 if (mid == low || mid == high) 98 if (ino == ctx->dx_dir_info[mid].ino) 99 return &ctx->dx_dir_info[mid]; 100 if (ino < ctx->dx_dir_info[mid].ino) 101 high = mid; 103 low = mid;
|
/external/eigen/test/eigen2/ |
H A D | eigen2_array.cpp | 87 Scalar mid = (m1.cwise().abs().minCoeff() + m1.cwise().abs().maxCoeff())/Scalar(2); local 90 m3(i,j) = ei_abs(m1(i,j))<mid ? 0 : m1(i,j); 91 VERIFY_IS_APPROX( (m1.cwise().abs().cwise()<MatrixType::Constant(rows,cols,mid)) 94 VERIFY_IS_APPROX( (m1.cwise().abs().cwise()<MatrixType::Constant(rows,cols,mid)) 96 VERIFY_IS_APPROX( (m1.cwise().abs().cwise()>=MatrixType::Constant(rows,cols,mid)) 99 VERIFY_IS_APPROX( (m1.cwise().abs().cwise()<mid).select(0,m1), m3);
|
/external/freetype/src/psnames/ |
H A D | pstables.h | 4096 int mid = ( min + max ) >> 1; local 4097 const unsigned char* q = p + mid * 2; 4110 min = mid + 1; 4112 max = mid;
|
/external/pdfium/third_party/freetype/src/psnames/ |
H A D | pstables.h | 4096 int mid = ( min + max ) >> 1; local 4097 const unsigned char* q = p + mid * 2; 4110 min = mid + 1; 4112 max = mid;
|
/external/e2fsprogs/lib/blkid/ |
H A D | getsize.c | 182 const blkid_loff_t mid = (low + high) / 2; local 184 if (valid_offset(fd, mid)) 185 low = mid; 187 high = mid;
|
/external/libopus/celt/ |
H A D | rate.h | 67 int mid = (lo+hi+1)>>1; local 69 if ((int)cache[mid] >= bits) 70 hi = mid; 72 lo = mid;
|
/external/libvterm/src/ |
H A D | unicode.c | 134 int mid; local 139 mid = (min + max) / 2; 140 if (ucs > table[mid].last) 141 min = mid + 1; 142 else if (ucs < table[mid].first) 143 max = mid - 1;
|
/external/mockito/cglib-and-asm/src/org/mockito/cglib/util/ |
H A D | SorterTemplate.java | 93 int mid = lo + diff / 2; 94 mergeSort(lo, mid); 95 mergeSort(mid, hi); 96 merge(lo, mid, hi, mid - lo, hi - mid); 128 private void rotate(int lo, int mid, int hi) { argument 130 int hit = mid - 1; 134 lot = mid; hit = hi - 1; 148 int mid [all...] |
/external/skia/src/animator/ |
H A D | SkGetCondensedInfo.cpp | 26 int mid = (hi + lo) >> 1; local 27 if (strcmp(&strings[lengths[mid << 2]], target) < 0) 28 lo = mid + 1; 30 hi = mid; 42 int mid = (hi + lo) >> 1; local 43 if (gTypeIDs[mid] < match) 44 lo = mid + 1; 46 hi = mid;
|
/external/skia/src/core/ |
H A D | SkTSearch.cpp | 32 int mid = (hi + lo) >> 1; local 33 const char* elem = index_into_base(base, mid, elemSize); 37 lo = mid + 1; 39 hi = mid; 41 return mid;
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | badblocks.c | 164 int low, high, mid; local 180 mid = ((unsigned)low + (unsigned)high)/2; 181 if (mid == low || mid == high) 183 if (blk == bb->list[mid]) 184 return mid; 185 if (blk < bb->list[mid]) 186 high = mid; 188 low = mid;
|
/external/e2fsprogs/resize/ |
H A D | extent.c | 144 __s64 low, high, mid; local 157 mid = (low+high)/2; 160 mid = low; 178 mid = low + ((__u64) (range * (high-low))); 181 if ((old_loc >= extent->list[mid].old_loc) && 182 (old_loc < extent->list[mid].old_loc + extent->list[mid].size)) 183 return (extent->list[mid].new_loc + 184 (old_loc - extent->list[mid].old_loc)); 185 if (old_loc < extent->list[mid] [all...] |
/external/eigen/test/ |
H A D | array.cpp | 122 Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())/Scalar(2); local 125 m3(i,j) = abs(m1(i,j))<mid ? 0 : m1(i,j); 126 VERIFY_IS_APPROX( (m1.abs()<ArrayType::Constant(rows,cols,mid)) 129 VERIFY_IS_APPROX( (m1.abs()<ArrayType::Constant(rows,cols,mid)) 131 VERIFY_IS_APPROX( (m1.abs()>=ArrayType::Constant(rows,cols,mid)) 134 VERIFY_IS_APPROX( (m1.abs()<mid).select(0,m1), m3);
|
H A D | array_for_matrix.cpp | 109 Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())/Scalar(2); local 112 m3(i,j) = abs(m1(i,j))<mid ? 0 : m1(i,j); 113 VERIFY_IS_APPROX( (m1.array().abs()<MatrixType::Constant(rows,cols,mid).array()) 116 VERIFY_IS_APPROX( (m1.array().abs()<MatrixType::Constant(rows,cols,mid).array()) 118 VERIFY_IS_APPROX( (m1.array().abs()>=MatrixType::Constant(rows,cols,mid).array()) 121 VERIFY_IS_APPROX( (m1.array().abs()<mid).select(0,m1), m3);
|
/external/freetype/src/sfnt/ |
H A D | ttkern.c | 241 FT_UInt mid = ( min + max ) >> 1; local 242 FT_Byte* q = p + 6 * mid; 254 min = mid + 1; 256 max = mid;
|
/external/libcxxabi/src/Unwind/ |
H A D | EHHeaderParser.hpp | 111 size_t mid = low + (len / 2); local 112 tableEntry = hdrInfo.table + mid * tableEntrySize; 117 low = mid; 120 low = mid;
|
/external/libopus/celt/tests/ |
H A D | test_unit_mathops.c | 131 opus_int32 mid=bitexact_cos(i); local 133 opus_int32 q=bitexact_log2tan(mid,side); 136 if (q!=-1*bitexact_log2tan(side,mid))
|
/external/libopus/silk/ |
H A D | stereo_LR_to_MS.c | 38 opus_int16 x1[], /* I/O Left input signal, becomes mid signal */ 41 opus_int8 *mid_only_flag, /* O Flag: only mid signal coded */ 42 opus_int32 mid_side_rates_bps[], /* O Bitrates for mid and side signals */ 58 opus_int16 *mid = &x1[ -2 ]; local 62 /* Convert to basic mid/side signals */ 66 mid[ n ] = (opus_int16)silk_RSHIFT_ROUND( sum, 1 ); 71 silk_memcpy( mid, state->sMid, 2 * sizeof( opus_int16 ) ); 73 silk_memcpy( state->sMid, &mid[ frame_length ], 2 * sizeof( opus_int16 ) ); 76 /* LP and HP filter mid signal */ 80 sum = silk_RSHIFT_ROUND( silk_ADD_LSHIFT( mid[ [all...] |