/external/chromium_org/third_party/icu/source/i18n/ |
H A D | csdetect.cpp | 73 charsetMatchComparator(const void * /*context*/, const void *left, const void *right) argument 78 const CharsetMatch **csm_r = (const CharsetMatch **) right;
|
H A D | japancal.cpp | 308 JapaneseCalendar& JapaneseCalendar::operator= ( const JapaneseCalendar& right) argument 310 GregorianCalendar::operator=(right);
|
H A D | rbt_rule.cpp | 53 * @param anchorEnd TRUE if the rule is anchored on the right to the 264 * right. The characters of r1 must equal (or be a superset 294 int32_t right = len - left; local 302 if (left == left2 && right == right2 && 312 (right < right2 || 313 (right == right2 && keyLength <= r2.keyLength)) &&
|
H A D | ucol_wgt.cpp | 81 // "If the value of the right operand is negative 136 compareRanges(const void * /*context*/, const void *left, const void *right) { argument 140 r=((const WeightRange *)right)->start;
|
H A D | uspoof_conf.cpp | 108 static int8_t U_CALLCONV SPUStringCompare(UHashTok left, UHashTok right) { argument 112 static_cast<SPUString *>(right.pointer));
|
/external/chromium_org/third_party/icu/source/io/ |
H A D | ufmt_cmn.c | 72 UChar *left, *right, temp; local 89 right = buffer + length; 90 while(left < --right) { 92 *left++ = *right; 93 *right = temp;
|
/external/chromium_org/third_party/icu/source/test/cintltst/ |
H A D | nfsprep.c | 153 int left, middle, right,rc; local 156 right= sortedArrLen-1; 158 while(left <= right){ 159 middle = (left+right)/2; 165 right = middle -1;
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | block.cc | 169 uint32_t right = num_restarts_ - 1; local 170 while (left < right) { 171 uint32_t mid = (left + right + 1) / 2; 189 right = mid - 1; 229 const char* limit = data_ + restarts_; // Restarts come right after data
|
/external/chromium_org/third_party/libvpx/source/libvpx/test/ |
H A D | vpx_scale_test.cc | 84 uint8_t *right = buf + crop_width; local 91 vpx_memset(right, right[-1], right_extend); 93 right += stride; 102 // The first row was already extended to the left and right. Copy it up.
|
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
H A D | matrix.c | 53 * \param right right clipping plane coordinate. 66 _mesa_Frustum( GLdouble left, GLdouble right, argument 76 left == right || 84 (GLfloat) left, (GLfloat) right, 95 * \param right right clipping plane coordinate. 108 _mesa_Ortho( GLdouble left, GLdouble right, argument 117 left, right, bottom, top, nearval, farval); 119 if (left == right || [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | LineCubicIntersection.cpp | 125 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument 126 addHorizontalEndPoints(left, right, axisIntercept); 133 double lineT = (pt.x - left) / (right - left); 183 void addHorizontalEndPoints(double left, double right, double y) argument 192 if (cubic[cIndex].x == right) { 259 int horizontalIntersect(const Cubic& cubic, double left, double right, double y, argument 268 if (x < left || x > right) { 276 int horizontalIntersect(const Cubic& cubic, double left, double right, double y, argument 279 return c.horizontalIntersect(y, left, right, flipped);
|
H A D | LineIntersection.cpp | 150 // left * dy <= xIntercept * dy <= right * dy 151 // thus: left * dy <= (line[1].x - line[0].x) * (y - line[0].y) <= right * dy 154 int horizontalLineIntersect(const _Line& line, double left, double right, argument 162 if (xIntercept > right || xIntercept < left) { 168 int horizontalIntersect(const _Line& line, double left, double right, argument 177 if (xIntercept > right || xIntercept < left) { 180 intersections.fT[1][0] = (xIntercept - left) / (right - left); 191 double overlapR = SkTMin(right, lineR); 199 intersections.fT[1][0] = (overlapL - left) / (right - left); 202 intersections.fT[1][1] = (overlapR - left) / (right [all...] |
H A D | LineQuadraticIntersection.cpp | 111 A = line[1].x - line[0].x (adjacent side of the right triangle) 112 O = line[1].y - line[0].y (opposite side of the right triangle) 156 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument 157 addHorizontalEndPoints(left, right, axisIntercept); 164 double lineT = (pt.x - left) / (right - left); 218 void addHorizontalEndPoints(double left, double right, double y) argument 227 if (quad[qIndex].x == right) { 332 int horizontalIntersect(const Quadratic& quad, double left, double right, argument 341 if (x < left || x > right) { 349 int horizontalIntersect(const Quadratic& quad, double left, double right, doubl argument [all...] |
H A D | LineQuadraticIntersection_Test.cpp | 45 double right = line[1].x; local 46 flipped = left > right; 48 SkTSwap<double>(left, right); 50 result = horizontalIntersect(quad, left, right, line[0].y, flipped, intersections);
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkRect.h | 61 int right() const { return fRight; } function in struct:SkIRect 70 * (i.e. left <= right) so the result may be negative. 82 * method is defined to return (right + left) >> 1. 85 * (right + left) / 2 when the sum is negative. 125 void set(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument 128 fRight = right; 132 void setLTRB(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument 133 this->set(left, top, right, bottom); 153 * be max 32bit and right will be min 32bit). 174 /** Offset set the rectangle by adding dx to its left and right, 233 contains(int32_t left, int32_t top, int32_t right, int32_t bottom) const argument 253 containsNoEmptyCheck(int32_t left, int32_t top, int32_t right, int32_t bottom) const argument [all...] |
H A D | SkRegion.h | 118 * If left < right and top < bottom, set this region to that rectangle and 121 bool setRect(int32_t left, int32_t top, int32_t right, int32_t bottom); 195 bool quickContains(int32_t left, int32_t top, int32_t right, argument 199 return left < right && top < bottom && 201 /* fBounds.contains(left, top, right, bottom); */ 203 fBounds.fRight >= right && fBounds.fBottom >= bottom; 266 bool op(int left, int top, int right, int bottom, Op op) { argument 268 rect.set(left, top, right, bottom); 351 * Y scanline, clipped to the specified left and right X values. 355 Spanerator(const SkRegion&, int y, int left, int right); [all...] |
/external/chromium_org/third_party/skia/samplecode/ |
H A D | SampleHairline.cpp | 78 int right = bm.width() - margin + i; local 79 if (!check_zeros(bm.getAddr32(right, 0), bm.height(),
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkBlitter.cpp | 148 // check for empty right mask, so we don't read off the end (or go slower than we need to) 284 int right = left + width; local 289 if (right > fClipRect.fRight) { 290 right = fClipRect.fRight; 293 width = right - left; 414 int left, right; 416 while (span.next(&left, &right)) { 417 SkASSERT(left < right); 418 fBlitter->blitH(left, y, right - left); 426 int left, right; [all...] |
H A D | SkRasterClip.h | 55 bool quickContains(int left, int top, int right, int bottom) const { argument 56 return quickContains(SkIRect::MakeLTRB(left, top, right, bottom)); 82 // these 2 are caches based on querying the right obj based on fIsBW
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadLineIntersection.cpp | 119 A = line[1].fX - line[0].fX (adjacent side of the right triangle) 120 O = line[1].fY - line[0].fY (opposite side of the right triangle) 170 int horizontalIntersect(double axisIntercept, double left, double right, bool flipped) { argument 171 addExactHorizontalEndPoints(left, right, axisIntercept); 173 addNearHorizontalEndPoints(left, right, axisIntercept); 180 double lineT = (pt.fX - left) / (right - left); 250 void addExactHorizontalEndPoints(double left, double right, double y) { argument 252 double lineT = SkDLine::ExactPointH(fQuad[qIndex], left, right, y); 261 void addNearHorizontalEndPoints(double left, double right, double y) { argument 267 double lineT = SkDLine::NearPointH(fQuad[qIndex], left, right, 354 horizontal(const SkDQuad& quad, double left, double right, double y, bool flipped) argument [all...] |
H A D | SkIntersectionHelper.h | 101 SkScalar right() const { function in class:SkIntersectionHelper
|
H A D | SkPathOpsLine.cpp | 35 // <0 for P2 right of the line 126 double SkDLine::ExactPointH(const SkDPoint& xy, double left, double right, double y) { argument 131 if (xy.fX == right) { 138 double SkDLine::NearPointH(const SkDPoint& xy, double left, double right, double y) { argument 142 if (!AlmostBetweenUlps(left, xy.fX, right)) { 145 double t = (xy.fX - left) / (right - left); 148 double realPtX = (1 - t) * left + t * right; 152 double tiniest = SkTMin(SkTMin(y, left), right); 153 double largest = SkTMax(SkTMax(y, left), right);
|
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkCanvasStateUtils.cpp | 45 int32_t left, top, right, bottom; member in struct:ClipRect 285 state.clipRects[i].right,
|
/external/chromium_org/third_party/skia/src/views/ |
H A D | SkTextBox.cpp | 147 void SkTextBox::setBox(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument 149 fBox.set(left, top, right, bottom);
|
/external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
H A D | vp8_partition_aggregator.cc | 101 // Root node is a "right" child by definition. 108 // This is a "right" child. 117 PartitionTreeNode* right = children_[kRightChild]; local 118 if ((left == NULL) && (right == NULL)) { 123 return right->GetOptimalNode(max_size, penalty); 124 } else if (right == NULL) { 130 if (left->Cost(penalty) <= right->Cost(penalty)) { 132 second = right; 134 first = right;
|