Searched refs:mid (Results 1 - 25 of 235) sorted by relevance

12345678910

/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/xy/
H A DBezierLineAndPointRenderer.java36 PointF mid = new PointF();
37 mid.set((lastPoint.x + thisPoint.x) / 2, (lastPoint.y + thisPoint.y) / 2);
38 path.quadTo((lastPoint.x + mid.x) / 2, lastPoint.y, mid.x, mid.y);
39 //path.quadTo((mid.x + thisPoint.x) / 2, thisPoint.y, thisPoint.x, thisPoint.y);
40 path.quadTo((mid.x + thisPoint.x) / 2, lastPoint.y, thisPoint.x, thisPoint.y);
/external/compiler-rt/test/asan/TestCases/
H A Dcontiguous_container.cc14 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 DMultiStream.cpp17 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/Common/
H A DMyVector.h85 int mid = (left + right) / 2; local
86 const T& midValue = (*this)[mid];
88 return mid;
90 right = mid;
92 left = mid + 1;
102 int mid = (left + right) / 2; local
103 const T& midValue = (*this)[mid];
105 return mid;
107 right = mid;
109 left = mid
119 int mid = (left + right) / 2; local
226 int mid = (left + right) / 2; local
242 int mid = (left + right) / 2; local
[all...]
/external/mockito/cglib-and-asm/src/org/mockito/cglib/util/
H A DSorterTemplate.java93 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/e2fsprogs/e2fsck/
H A Ddx_dirinfo.c83 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/skia/src/animator/
H A DSkGetCondensedInfo.cpp26 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/freetype/src/psnames/
H A Dpstables.h4096 int mid = ( min + max ) >> 1; local
4097 const unsigned char* q = p + mid * 2;
4110 min = mid + 1;
4112 max = mid;
H A Dpsmodule.c401 PS_UniMap *min, *max, *mid, *result = NULL; local
414 mid = min + ( ( max - min ) >> 1 );
416 if ( mid->unicode == unicode )
418 result = mid;
422 base_glyph = BASE_GLYPH( mid->unicode );
425 result = mid; /* remember match but continue search for base glyph */
431 min = mid + 1;
433 max = mid - 1;
454 FT_UInt mid; local
461 mid
[all...]
/external/libopus/celt/
H A Drate.h67 int mid = (lo+hi+1)>>1; local
69 if ((int)cache[mid] >= bits)
70 hi = mid;
72 lo = mid;
/external/lzma/CPP/7zip/Common/
H A DFilePathAutoRename.cpp48 unsigned mid = (left + right) / 2; local
49 if (MakeAutoName(name, extension, mid, path))
50 left = mid + 1;
52 right = mid;
/external/pdfium/third_party/freetype/src/psnames/
H A Dpstables.h4096 int mid = ( min + max ) >> 1; local
4097 const unsigned char* q = p + mid * 2;
4110 min = mid + 1;
4112 max = mid;
H A Dpsmodule.c401 PS_UniMap *min, *max, *mid, *result = NULL; local
414 mid = min + ( ( max - min ) >> 1 );
416 if ( mid->unicode == unicode )
418 result = mid;
422 base_glyph = BASE_GLYPH( mid->unicode );
425 result = mid; /* remember match but continue search for base glyph */
431 min = mid + 1;
433 max = mid - 1;
454 FT_UInt mid; local
461 mid
[all...]
/external/skia/src/core/
H A DSkTSearch.cpp32 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/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_interface_internal.h54 int __sanitizer_verify_contiguous_container(const void *beg, const void *mid,
/external/libopus/silk/
H A Dstereo_LR_to_MS.c38 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...]
/external/e2fsprogs/resize/
H A Dextent.c144 __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/skia/tests/
H A DPathOpsDLineTest.cpp46 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/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/
H A Dscanresults.cpp88 bssid = (*it).mid(pos);
90 freq = (*it).mid(pos);
92 signal = (*it).mid(pos);
94 flags = (*it).mid(pos);
96 ssid = (*it).mid(pos);
/external/compiler-rt/include/sanitizer/
H A Dcommon_interface_defs.h69 // [beg, end); the memory [beg, mid) is used to store the current elements
70 // and the memory [mid, end) is reserved for future elements;
71 // beg <= mid <= end. For example, in "std::vector<> v"
74 // mid = beg + v.size() * sizeof(v[0]);
77 // container so that the tool can report errors when memory from [mid, end)
79 // Supply the old and the new values of mid (old_mid/new_mid).
80 // In the initial state mid == end and so should be the final
101 // - [beg, mid) is addressable,
102 // - [mid, end) is unaddressable.
104 // such complexity by touching only parts of the container around beg/mid/en
[all...]
/external/libcxx/test/support/
H A Dasan_testing.h17 ( const void *beg, const void *mid, const void *end );
/external/skia/include/core/
H A DSkTSearch.h52 int mid = (hi + lo) >> 1; local
53 const T* elem = (const T*)((const char*)base + mid * elemSize);
56 lo = mid + 1;
58 hi = mid;
/external/e2fsprogs/lib/ext2fs/
H A Dbadblocks.c164 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/eigen/unsupported/Eigen/src/BVH/
H A DKdBVH.h192 int mid = from + 2; local
193 std::nth_element(objCenters.begin() + from, objCenters.begin() + mid,
195 build(objCenters, from, mid, objBoxes, (dim + 1) % Dim);
197 boxes.push_back(boxes[idx1].merged(objBoxes[objCenters[mid].second]));
199 children.push_back(mid + (int)objects.size() - 1);
202 int mid = from + (to - from) / 2; local
203 nth_element(objCenters.begin() + from, objCenters.begin() + mid,
205 build(objCenters, from, mid, objBoxes, (dim + 1) % Dim);
207 build(objCenters, mid, to, objBoxes, (dim + 1) % Dim);
/external/protobuf/java/src/main/java/com/google/protobuf/nano/
H A DFieldArray.java245 int mid = (lo + hi) >>> 1;
246 int midVal = mFieldNumbers[mid];
249 lo = mid + 1;
251 hi = mid - 1;
253 return mid; // value found

Completed in 1580 milliseconds

12345678910