Searched defs:left (Results 176 - 200 of 978) sorted by relevance

1234567891011>>

/external/opencv3/modules/cudaobjdetect/src/cuda/
H A Dlbp.hpp62 int left; member in struct:cv::cuda::device::lbp::ClNode
/external/opencv3/modules/objdetect/include/opencv2/objdetect/
H A Dobjdetect_c.h88 int* left; member in struct:CvHaarClassifier
/external/opencv3/modules/objdetect/src/
H A DHaarStructs.h14 float left; member in struct:__anon15658
/external/opencv3/samples/gpu/
H A Ddriver_api_stereo_multi.cpp93 std::cout << "Usage: driver_api_stereo_multi_gpu --left <left_image> --right <right_image>\n";
126 Mat left, right; local
129 if (string(argv[i]) == "--left")
131 left = imread(argv[++i], cv::IMREAD_GRAYSCALE);
132 CV_Assert(!left.empty());
163 d_left[0].upload(left.rowRange(0, left.rows / 2));
170 d_left[1].upload(left.rowRange(left.rows / 2, left
[all...]
H A Dstereo_match.cpp21 string left; member in struct:Params
57 ss << "(" << p.method_str() << ") FPS: " << setiosflags(ios::left)
66 Mat left, right; member in struct:App
80 << "\t--left <left_view> --right <right_view> # must be rectified\n"
122 if (string(argv[i]) == "--left") p.left = argv[++i];
163 left_src = imread(p.left);
165 if (left_src.empty()) throw runtime_error("can't open file \"" + p.left + "\"");
167 cvtColor(left_src, left, COLOR_BGR2GRAY);
169 d_left.upload(left);
[all...]
/external/pdfium/third_party/freetype/include/freetype/
H A Dftcache.h770 /* If `anode' is NULL, the cache node is left unchanged, which means */
823 /* If `anode' is NULL, the cache node is left unchanged, which means */
865 /* left :: The horizontal distance from the pen position to the */
866 /* left bitmap border (a.k.a. `left side bearing', or */
891 FT_Char left; member in struct:FTC_SBitRec_
981 /* If `anode' is NULL, the cache node is left unchanged, which means */
1036 /* If `anode' is NULL, the cache node is left unchanged, which means */
H A Dftglyph.h142 /* left :: The left-side bearing, i.e., the horizontal distance */
143 /* from the current pen position to the left border of the */
163 FT_Int left; member in struct:FT_BitmapGlyphRec_
/external/pdfium/third_party/zlib_v128/
H A Dgzread.c79 left unchanged if there is no more input data available, will be set to COPY
488 unsigned left, n; local
514 left = (unsigned)len - 1;
515 if (left) do {
525 n = state->x.have > left ? left : state->x.have;
535 left -= n;
537 } while (left && eol == NULL);
H A Dinftrees.c46 int left; /* number of prefix codes available */ local
131 left = 1;
133 left <<= 1;
134 left -= count[len];
135 if (left < 0) return -1; /* over-subscribed */
137 if (left > 0 && (type == CODES || max != 1))
270 left = (int)(1 << curr);
272 left -= count[curr + drop];
273 if (left <= 0) break;
275 left <<
[all...]
/external/pdfium/xfa/src/fxbarcode/common/
H A DBC_CommonBitMatrix.cpp79 void CBC_CommonBitMatrix::SetRegion(int32_t left, argument
84 if (top < 0 || left < 0) {
92 int32_t right = left + width;
102 for (x = left; x < right; x++) {
/external/protobuf/src/google/protobuf/
H A Dunknown_field_set.cc175 int left = 0; // The number of fields left after deletion. local
181 if (i != left) {
182 (*fields_)[left] = (*fields_)[i];
184 ++left;
187 fields_->resize(left);
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowRect.java14 public void __constructor__(int left, int top, int right, int bottom) { argument
15 realRect.left = left;
22 realRect.left = otherRect.left;
30 set(rect.left, rect.top, rect.right, rect.bottom);
34 public void set(int left, int top, int right, int bottom) { argument
35 realRect.left = left;
43 return realRect.right - realRect.left;
104 intersect(int left, int top, int right, int bottom) argument
[all...]
/external/skia/src/core/
H A DSkColorSpace.cpp28 static SkFloat3x3 concat(const SkFloat3x3& left, const SkFloat3x3& rite) { argument
34 tmp += (double)left.fMat[row + i * 3] * rite.fMat[i + col * 3];
H A DSkRect.cpp11 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument
13 if (left >= right || top >= bottom) {
19 this->set(left, top, right, bottom);
21 if (left < fLeft) fLeft = left;
113 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { argument
114 CHECK_INTERSECT(left, top, right, bottom, fLeft, fTop, fRight, fBottom);
129 void SkRect::join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { argument
131 if (left >= right || top >= bottom) {
137 this->set(left, to
[all...]
H A DSkScan_AntiPath.cpp90 const int left = sectBounds.left(); local
93 fLeft = left;
94 fSuperLeft = SkLeftShift(left, SHIFT);
95 fWidth = right - left;
330 // There is always a left column, a middle, and a right column.
600 when left-shifted by shift?
H A DSkTSort.h121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { argument
122 for (T* next = left + 1; next <= right; ++next) {
125 while (left < hole && lessThan(insert, *(hole - 1))) {
136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument
139 T* newPivot = left;
140 while (left < right) {
141 if (lessThan(*left, pivotValue)) {
142 SkTSwap(*left, *newPivot);
145 left += 1;
154 * This implementation recurses on the left regio
163 SkTIntroSort(int depth, T* left, T* right, C lessThan) argument
191 SkTQSort(T* left, T* right, C lessThan) argument
201 SkTQSort(T* left, T* right) argument
206 SkTQSort(T** left, T** right) argument
[all...]
/external/skia/src/pathops/
H A DSkIntersectionHelper.h47 SkScalar left() const { function in class:SkIntersectionHelper
H A DSkPathOpsLine.cpp81 double SkDLine::ExactPointH(const SkDPoint& xy, double left, double right, double y) { argument
83 if (xy.fX == left) {
93 double SkDLine::NearPointH(const SkDPoint& xy, double left, double right, double y) { argument
97 if (!AlmostBetweenUlps(left, xy.fX, right)) {
100 double t = (xy.fX - left) / (right - left);
103 double realPtX = (1 - t) * left + t * right;
107 double tiniest = SkTMin(SkTMin(y, left), right);
108 double largest = SkTMax(SkTMax(y, left), right);
/external/skia/tests/
H A DPathOpsConicLineIntersectionTest.cpp44 double left = line[0].fX; local
46 flipped = left > right;
48 SkTSwap<double>(left, right);
50 result = intersections.horizontal(conic, left, right, line[0].fY, flipped);
H A DPathOpsCubicLineIntersectionTest.cpp111 double left = line[0].fX; local
113 flipped = left > right;
115 SkTSwap<double>(left, right);
117 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped);
H A DPathOpsQuadLineIntersectionTest.cpp44 double left = line[0].fX; local
46 flipped = left > right;
48 SkTSwap<double>(left, right);
50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
H A DPathOpsQuadLineIntersectionThreadedTest.cpp27 double left = line[0].fX; local
29 flipped = left > right;
31 SkTSwap<double>(left, right);
33 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
/external/sl4a/ScriptingLayerForAndroid/src/com/googlecode/android_scripting/
H A DActivityFlinger.java49 public ActivityTransition(Class<? extends Activity> left, Class<? extends Activity> right) { argument
50 mLeft = left;
69 Class<? extends Activity> left = null;
83 mActivityTransitions.put(current, new ActivityTransition(left, right));
84 left = current;
/external/sl4a/ScriptingLayerForAndroid/src/org/connectbot/util/
H A DSelectionArea.java26 * left and right to keep it in the correct orientation.
31 private int left; field in class:SelectionArea
42 top = left = bottom = right = 0;
111 setLeft(left - 1);
118 setLeft(left + 1);
130 private void setLeft(int left) { argument
131 this.left = right = checkBounds(left, maxColumns);
135 return Math.min(left, right);
143 return Math.max(left, righ
[all...]
/external/tremolo/Tremolo/
H A Ddsp.c118 static LOOKUP_T *_vorbis_window(int left){ argument
119 switch(left){

Completed in 587 milliseconds

1234567891011>>