Searched defs:top (Results 176 - 200 of 488) sorted by relevance

1234567891011>>

/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DZoneMeta.java288 UResourceBundle top = UResourceBundle.getBundleInstance(
290 ZONEIDS = top.getStringArray(kNAMES);
368 UResourceBundle top = UResourceBundle.getBundleInstance(ICUResourceBundle.ICU_BASE_NAME,
370 UResourceBundle zones = top.get(kZONES);
431 UResourceBundle top = UResourceBundle.getBundleInstance(
433 UResourceBundle regions = top.get(kREGIONS);
511 * Given an ID and the top-level resource of the zoneinfo resource,
514 * @param top the top level resource of the zoneinfo resource or null.
518 public static UResourceBundle openOlsonResource(UResourceBundle top, Strin argument
[all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DZoneMeta.java287 UResourceBundle top = UResourceBundle.getBundleInstance(
289 ZONEIDS = top.getStringArray(kNAMES);
367 UResourceBundle top = UResourceBundle.getBundleInstance(ICUResourceBundle.ICU_BASE_NAME,
369 UResourceBundle zones = top.get(kZONES);
430 UResourceBundle top = UResourceBundle.getBundleInstance(
432 UResourceBundle regions = top.get(kREGIONS);
510 * Given an ID and the top-level resource of the zoneinfo resource,
513 * @param top the top level resource of the zoneinfo resource or null.
517 public static UResourceBundle openOlsonResource(UResourceBundle top, Strin argument
[all...]
/external/libhevc/common/
H A Dihevc_chroma_intra_pred_filters.c106 * UWORD8 pointer to the top-left
109 * UWORD8 pointer to the top
149 WORD32 bot_left, left, top, tp_right, tp_left; local
174 top = (nbr_flags & 0x00f00);
182 pu1_dst[(4 * nt)] = *pu1_top_left; // U top-left sample
183 pu1_dst[(4 * nt) + 1] = *(pu1_top_left + 1); // V top-left sample
206 if(0 != top)
209 // U-V interleaved Top-top right samples
216 // U-V interleaved Top-top right samples
225 top
[all...]
H A Dihevc_intra_pred_filters.c100 * UWORD8 pointer to the top-left
103 * UWORD8 pointer to the top
167 // if(top)
218 WORD32 bot_left, left, top, tp_right, tp_left; local
247 top = (nbr_flags & 0x100) >> 8;
279 if(top)
305 a_nbr_flag[3] = top;
312 /* If Left, top-left are available*/
320 else /* If top, top
[all...]
/external/llvm/include/llvm/IR/
H A DLegacyPassManagers.h41 // PassManager and FunctionPassManager are two top-level pass manager that
48 // Two top level managers, PassManager and FunctionPassManager, derive from
49 // PMTopLevelManager. PMTopLevelManager manages information used by top level
71 // FunctionPassManagerImpl is a top level manager. It manages FPPassManagers
89 // PassManagerImpl is a top level pass manager responsible for managing
152 PMDataManager *top() const { return S.back(); } function in class:llvm::PMStack
166 /// top level pass managers.
218 // maintained by this top level pass manager
223 // Print passes managed by this top level manager.
248 /// Immutable passes are managed by top leve
[all...]
/external/nist-sip/java/gov/nist/javax/sip/header/
H A DSIPHeaderList.java109 * @param top
110 * is true if we want to add to the top of the list.
112 public void add(HDR sipheader, boolean top) { argument
113 if (top)
136 // add given items to the top end of the list.
/external/opencv/cv/src/
H A Dcvrotcalipers.cpp70 // left, bottom, right, top - indexes of extremal points
101 int left = 0, bottom = 0, right = 0, top = 0; local
129 top_y = pt0.y, top = i;
176 seq[2] = top;
H A Dcvutils.cpp113 int top, int left, int cn, const uchar* )
118 if( srcstep == dststep && dst + dststep*top + left*cn == src &&
132 return ifunc( src, srcstep, srcroi, dstroi, top, left );
147 return func( src, srcstep, srcroi, dst, dststep, dstroi, top, left );
172 if( i >= top && i < top + srcroi.height - 1 )
191 if( i >= top && i < top + srcroi.height - 1 )
203 int top, int left, int cn )
256 idst += top*dstste
111 icvCopyReplicateBorder_8u( const uchar* src, int srcstep, CvSize srcroi, uchar* dst, int dststep, CvSize dstroi, int top, int left, int cn, const uchar* ) argument
201 icvCopyReflect101Border_8u( const uchar* src, int srcstep, CvSize srcroi, uchar* dst, int dststep, CvSize dstroi, int top, int left, int cn ) argument
334 icvCopyConstBorder_8u( const uchar* src, int srcstep, CvSize srcroi, uchar* dst, int dststep, CvSize dstroi, int top, int left, int cn, const uchar* value ) argument
[all...]
/external/opencv3/modules/imgproc/src/
H A Drotcalipers.cpp70 // left, bottom, right, top - indexes of extremal points
101 int left = 0, bottom = 0, right = 0, top = 0; local
129 top_y = pt0.y, top = i;
174 seq[2] = top;
/external/opencv3/modules/ts/include/opencv2/ts/
H A Docl_test.hpp255 int top, bot, lef, rig; member in struct:cvtest::ocl::TestUtils::Border
271 Size wholeSize = Size(roiSize.width + border.lef + border.rig, roiSize.height + border.top + border.bot);
273 subMat = whole(Rect(border.lef, border.top, roiSize.width, roiSize.height));
/external/pdfium/third_party/agg23/
H A Dagg_rasterizer_scanline_aa.cpp342 cell_aa*** top; local
347 top = stack;
382 top[0] = base;
383 top[1] = j;
386 top[0] = i;
387 top[1] = limit;
390 top += 2;
402 if(top > stack) {
403 top -= 2;
404 base = top[
[all...]
/external/pdfium/third_party/freetype/src/cff/
H A Dcffobjs.c671 CFF_FontRecDict top = &cff->top_font.font_dict; local
684 /* if we have a top-level matrix, */
687 if ( top->has_font_matrix )
689 if ( top->units_per_em > 1 && sub->units_per_em > 1 )
690 scaling = (FT_Long)FT_MIN( top->units_per_em,
695 FT_Matrix_Multiply_Scaled( &top->font_matrix,
699 &top->font_matrix,
704 (FT_Long)top->units_per_em,
710 sub->font_matrix = top->font_matrix;
711 sub->font_offset = top
[all...]
/external/sfntly/cpp/src/sfntly/table/bitmap/
H A Dbitmap_size_table.cc157 int32_t top = subtable_list->size(); local
158 while (top != bottom) {
159 index = (top + bottom) / 2;
163 top = index;
434 int32_t top = subtable_list->size(); local
435 while (top != bottom) {
436 index = (top + bottom) / 2;
440 top = index;
/external/skia/fuzz/
H A Dfuzz.cpp228 SkDebugf("[terminated] Could not start top-down scanline decoder\n");
279 // SkWebpCodec, the only one that supports subsets, requires even top/left boundaries.
288 // Keep track of left and top (for drawing subsetBm into canvas). We could use
293 int top = 0; local
342 top += decodeInfo.height();
/external/skia/include/core/
H A DSkRect.h60 int top() const { return fTop; } function in struct:SkIRect
66 /** return the top edge of the rect */
76 * (i.e. top <= bottom) so the result may be negative.
93 * method is defined to return (bottom + top) >> 1
96 * (bottom + top) / 2 when the sum is negative.
127 void set(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument
129 fTop = top;
134 void setLTRB(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument
135 this->set(left, top, right, bottom);
184 and adding dy to its top an
242 contains(int32_t left, int32_t top, int32_t right, int32_t bottom) const argument
266 containsNoEmptyCheck(int32_t left, int32_t top, int32_t right, int32_t bottom) const argument
268 SkASSERT(fLeft < fRight && fTop < fBottom); SkASSERT(left < right && top < bottom); return fLeft <= left && fTop <= top && fRight >= right && fBottom >= bottom; } bool containsNoEmptyCheck(const SkIRect& r) const { return containsNoEmptyCheck(r.fLeft, r.fTop, r.fRight, r.fBottom); } bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& r) { return this->intersect(r.fLeft, r.fTop, r.fRight, r.fBottom); } bool SK_WARN_UNUSED_RESULT intersect(const SkIRect& a, const SkIRect& b) { if (!a.isEmpty() && !b.isEmpty() && a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom) { fLeft = SkMax32(a.fLeft, b.fLeft); fTop = SkMax32(a.fTop, b.fTop); fRight = SkMin32(a.fRight, b.fRight); fBottom = SkMin32(a.fBottom, b.fBottom); return true; } return false; } bool SK_WARN_UNUSED_RESULT intersectNoEmptyCheck(const SkIRect& a, const SkIRect& b) { SkASSERT(!a.isEmpty() && !b.isEmpty()); if (a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom) { fLeft = SkMax32(a.fLeft, b.fLeft); fTop = SkMax32(a.fTop, b.fTop); fRight = SkMin32(a.fRight, b.fRight); fBottom = SkMin32(a.fBottom, b.fBottom); return true; } return false; } bool SK_WARN_UNUSED_RESULT intersect(int32_t left, int32_t top, int32_t right, int32_t bottom) { if (left < right && top < bottom && !this->isEmpty() && fLeft < right && left < fRight && fTop < bottom && top < fBottom) { if (fLeft < left) fLeft = left; if (fTop < top) fTop = top; if (fRight > right) fRight = right; if (fBottom > bottom) fBottom = bottom; return true; } return false; } static bool Intersects(const SkIRect& a, const SkIRect& b) { return !a.isEmpty() && !b.isEmpty() && a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom; } static bool IntersectsNoEmptyCheck(const SkIRect& a, const SkIRect& b) { SkASSERT(!a.isEmpty()); SkASSERT(!b.isEmpty()); return a.fLeft < b.fRight && b.fLeft < a.fRight && a.fTop < b.fBottom && b.fTop < a.fBottom; } void join(int32_t left, int32_t top, int32_t right, int32_t bottom); void join(const SkIRect& r) { this->join(r.fLeft, r.fTop, r.fRight, r.fBottom); } void sort(); static const SkIRect& SK_WARN_UNUSED_RESULT EmptyIRect() { static const SkIRect gEmpty = { 0, 0, 0, 0 }; return gEmpty; } }; struct SK_API SkRect { SkScalar fLeft, fTop, fRight, fBottom; static SkRect SK_WARN_UNUSED_RESULT MakeEmpty() { SkRect r; r.setEmpty(); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeLargest() { SkRect r; r.setLargest(); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeWH(SkScalar w, SkScalar h) { SkRect r; r.set(0, 0, w, h); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeIWH(int w, int h) { SkRect r; r.set(0, 0, SkIntToScalar(w), SkIntToScalar(h)); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeSize(const SkSize& size) { SkRect r; r.set(0, 0, size.width(), size.height()); return r; } static SkRect SK_WARN_UNUSED_RESULT MakeLTRB(SkScalar l, SkScalar t, SkScalar r, SkScalar b) { SkRect rect; rect.set(l, t, r, b); return rect; } static SkRect SK_WARN_UNUSED_RESULT MakeXYWH(SkScalar x, SkScalar y, SkScalar w, SkScalar h) { SkRect r; r.set(x, y, x + w, y + h); return r; } SK_ATTR_DEPRECATED(�) static SkRect SK_WARN_UNUSED_RESULT MakeFromIRect(const SkIRect& irect) { SkRect r; r.set(SkIntToScalar(irect.fLeft), SkIntToScalar(irect.fTop), SkIntToScalar(irect.fRight), SkIntToScalar(irect.fBottom)); return r; } static SkRect SK_WARN_UNUSED_RESULT Make(const SkIRect& irect) { SkRect r; r.set(SkIntToScalar(irect.fLeft), SkIntToScalar(irect.fTop), SkIntToScalar(irect.fRight), SkIntToScalar(irect.fBottom)); return r; } bool isEmpty() const { return fLeft >= fRight || fTop >= fBottom; } bool isLargest() const { return SK_ScalarMin == fLeft && SK_ScalarMin == fTop && SK_ScalarMax == fRight && SK_ScalarMax == fBottom; } bool isFinite() const { float accum = 0; accum *= fLeft; accum *= fTop; accum *= fRight; accum *= fBottom; SkASSERT(0 == accum || SkScalarIsNaN(accum)); return !SkScalarIsNaN(accum); } SkScalar x() const { return fLeft; } SkScalar y() const { return fTop; } SkScalar left() const { return fLeft; } SkScalar top() const { return fTop; } SkScalar right() const { return fRight; } SkScalar bottom() const { return fBottom; } SkScalar width() const { return fRight - fLeft; } SkScalar height() const { return fBottom - fTop; } SkScalar centerX() const { return SkScalarHalf(fLeft + fRight); } SkScalar centerY() const { return SkScalarHalf(fTop + fBottom); } friend bool operator==(const SkRect& a, const SkRect& b) { return SkScalarsEqual((SkScalar*)&a, (SkScalar*)&b, 4); } friend bool operator!=(const SkRect& a, const SkRect& b) { return !SkScalarsEqual((SkScalar*)&a, (SkScalar*)&b, 4); } void toQuad(SkPoint quad[4]) const; void setEmpty() { memset(this, 0, sizeof(*this)); } void set(const SkIRect& src) { fLeft = SkIntToScalar(src.fLeft); fTop = SkIntToScalar(src.fTop); fRight = SkIntToScalar(src.fRight); fBottom = SkIntToScalar(src.fBottom); } void set(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { fLeft = left; fTop = top; fRight = right; fBottom = bottom; } void setLTRB(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) { this->set(left, top, right, bottom); } void iset(int left, int top, int right, int bottom) { fLeft = SkIntToScalar(left); fTop = SkIntToScalar(top); fRight = SkIntToScalar(right); fBottom = SkIntToScalar(bottom); } void isetWH(int width, int height) { fLeft = fTop = 0; fRight = SkIntToScalar(width); fBottom = SkIntToScalar(height); } void set(const SkPoint pts[], int count) { (void)this->setBoundsCheck(pts, count); } void setBounds(const SkPoint pts[], int count) { (void)this->setBoundsCheck(pts, count); } bool setBoundsCheck(const SkPoint pts[], int count); void set(const SkPoint& p0, const SkPoint& p1) { fLeft = SkMinScalar(p0.fX, p1.fX); fRight = SkMaxScalar(p0.fX, p1.fX); fTop = SkMinScalar(p0.fY, p1.fY); fBottom = SkMaxScalar(p0.fY, p1.fY); } void setXYWH(SkScalar x, SkScalar y, SkScalar width, SkScalar height) { fLeft = x; fTop = y; fRight = x + width; fBottom = y + height; } void setWH(SkScalar width, SkScalar height) { fLeft = 0; fTop = 0; fRight = width; fBottom = height; } void setLargest() { fLeft = fTop = SK_ScalarMin; fRight = fBottom = SK_ScalarMax; } void setLargestInverted() { fLeft = fTop = SK_ScalarMax; fRight = fBottom = SK_ScalarMin; } SkRect makeOffset(SkScalar dx, SkScalar dy) const { return MakeLTRB(fLeft + dx, fTop + dy, fRight + dx, fBottom + dy); } SkRect makeInset(SkScalar dx, SkScalar dy) const { return MakeLTRB(fLeft + dx, fTop + dy, fRight - dx, fBottom - dy); } SkRect makeOutset(SkScalar dx, SkScalar dy) const { return MakeLTRB(fLeft - dx, fTop - dy, fRight + dx, fBottom + dy); } void offset(SkScalar dx, SkScalar dy) { fLeft += dx; fTop += dy; fRight += dx; fBottom += dy; } void offset(const SkPoint& delta) { this->offset(delta.fX, delta.fY); } void offsetTo(SkScalar newX, SkScalar newY) { fRight += newX - fLeft; fBottom += newY - fTop; fLeft = newX; fTop = newY; } void inset(SkScalar dx, SkScalar dy) { fLeft += dx; fTop += dy; fRight -= dx; fBottom -= dy; } void outset(SkScalar dx, SkScalar dy) { this->inset(-dx, -dy); } bool SK_WARN_UNUSED_RESULT intersect(const SkRect& r); bool SK_WARN_UNUSED_RESULT intersect(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom); bool SK_WARN_UNUSED_RESULT intersect(const SkRect& a, const SkRect& b); private: static bool Intersects(SkScalar al, SkScalar at, SkScalar ar, SkScalar ab, SkScalar bl, SkScalar bt, SkScalar br, SkScalar bb) { SkScalar L = SkMaxScalar(al, bl); SkScalar R = SkMinScalar(ar, br); SkScalar T = SkMaxScalar(at, bt); SkScalar B = SkMinScalar(ab, bb); return L < R && T < B; } public: bool intersects(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) const { return Intersects(fLeft, fTop, fRight, fBottom, left, top, right, bottom); } bool intersects(const SkRect& r) const { return Intersects(fLeft, fTop, fRight, fBottom, r.fLeft, r.fTop, r.fRight, r.fBottom); } static bool Intersects(const SkRect& a, const SkRect& b) { return Intersects(a.fLeft, a.fTop, a.fRight, a.fBottom, b.fLeft, b.fTop, b.fRight, b.fBottom); } void join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom); void join(const SkRect& r) { this->join(r.fLeft, r.fTop, r.fRight, r.fBottom); } void joinNonEmptyArg(const SkRect& r) { SkASSERT(!r.isEmpty()); if (fLeft >= fRight || fTop >= fBottom) { *this = r; } else { this->joinPossiblyEmptyRect(r); } } void joinPossiblyEmptyRect(const SkRect& r) { fLeft = SkMinScalar(fLeft, r.left()); fTop = SkMinScalar(fTop, r.top()); fRight = SkMaxScalar(fRight, r.right()); fBottom = SkMaxScalar(fBottom, r.bottom()); } void growToInclude(SkScalar x, SkScalar y) { fLeft = SkMinScalar(x, fLeft); fRight = SkMaxScalar(x, fRight); fTop = SkMinScalar(y, fTop); fBottom = SkMaxScalar(y, fBottom); } void growToInclude(const SkPoint pts[], int count) { this->growToInclude(pts, sizeof(SkPoint), count); } void growToInclude(const SkPoint pts[], size_t stride, int count) { SkASSERT(count >= 0); SkASSERT(stride >= sizeof(SkPoint)); const SkPoint* end = (const SkPoint*)((intptr_t)pts + count * stride); for (; pts < end; pts = (const SkPoint*)((intptr_t)pts + stride)) { this->growToInclude(pts->fX, pts->fY); } } bool contains(const SkRect& r) const { return !r.isEmpty() && !this->isEmpty() && fLeft <= r.fLeft && fTop <= r.fTop && fRight >= r.fRight && fBottom >= r.fBottom; } bool contains(const SkIRect& r) const { return !r.isEmpty() && !this->isEmpty() && fLeft <= SkIntToScalar(r.fLeft) && fTop <= SkIntToScalar(r.fTop) && fRight >= SkIntToScalar(r.fRight) && fBottom >= SkIntToScalar(r.fBottom); } void round(SkIRect* dst) const { SkASSERT(dst); dst->set(SkScalarRoundToInt(fLeft), SkScalarRoundToInt(fTop), SkScalarRoundToInt(fRight), SkScalarRoundToInt(fBottom)); } void roundOut(SkIRect* dst) const { SkASSERT(dst); dst->set(SkScalarFloorToInt(fLeft), SkScalarFloorToInt(fTop), SkScalarCeilToInt(fRight), SkScalarCeilToInt(fBottom)); } void roundOut(SkRect* dst) const { dst->set(SkScalarFloorToScalar(fLeft), SkScalarFloorToScalar(fTop), SkScalarCeilToScalar(fRight), SkScalarCeilToScalar(fBottom)); } void roundIn(SkIRect* dst) const { SkASSERT(dst); dst->set(SkScalarCeilToInt(fLeft), SkScalarCeilToInt(fTop), SkScalarFloorToInt(fRight), SkScalarFloorToInt(fBottom)); } SkIRect round() const { SkIRect ir; this->round(&ir); return ir; } SkIRect roundOut() const { SkIRect ir; this->roundOut(&ir); return ir; } void sort() { if (fLeft > fRight) argument
[all...]
/external/skia/samplecode/
H A DSampleRegion.cpp120 static void make_rgn(SkRegion* rgn, int left, int top, int right, int bottom, argument
123 r.set(left, top, right, bottom);
/external/skia/src/core/
H A DSkPicturePlayback.cpp350 const SkScalar top = reader->readScalar(); local
352 if (!canvas->quickRejectY(top, bottom)) {
371 const SkScalar top = *xpos++; local
374 if (!canvas->quickRejectY(top, bottom)) {
392 /* int top = */ reader->readInt();
417 // ptr[2] == top
H A DSkRegion_path.cpp134 // allow for two "empty" rows for the top and bottom
135 // [ Y, 1, L, R, S] == 5 (*2 for top and bottom)
279 SkScalar top = SkIntToScalar(SK_MaxS16); local
288 if (top > pts[i].fY) {
289 top = pts[i].fY;
295 if (top > pts[0].fY) {
296 top = pts[0].fY;
306 SkASSERT(top <= bot);
307 *itop = SkScalarRoundToInt(top);
341 int top local
403 int top() const { function in struct:Edge
[all...]
/external/skia/src/effects/
H A DSkMatrixConvolutionImageFilter.cpp140 y = (y - bounds.top()) % bounds.height() + bounds.top();
144 if (y < bounds.top()) {
308 bounds.top() + fKernelOffset.fY,
311 SkIRect top = SkIRect::MakeLTRB(bounds.left(), bounds.top(), bounds.right(), interior.top()); local
314 SkIRect left = SkIRect::MakeLTRB(bounds.left(), interior.top(),
316 SkIRect right = SkIRect::MakeLTRB(interior.right(), interior.top(),
318 filterBorderPixels(src, result, top, bound
[all...]
/external/skia/src/gpu/
H A DGrGpu.cpp332 int left, int top, int width, int height,
344 &left, &top, &width, &height,
351 left, top, width, height,
357 int left, int top, int width, int height,
365 if (this->onWritePixels(surface, left, top, width, height, config, buffer, rowBytes)) {
373 int left, int top, int width, int height,
379 if (this->onTransferPixels(surface, left, top, width, height, config,
331 readPixels(GrSurface* surface, int left, int top, int width, int height, GrPixelConfig config, void* buffer, size_t rowBytes) argument
356 writePixels(GrSurface* surface, int left, int top, int width, int height, GrPixelConfig config, const void* buffer, size_t rowBytes) argument
372 transferPixels(GrSurface* surface, int left, int top, int width, int height, GrPixelConfig config, GrTransferBuffer* buffer, size_t offset, size_t rowBytes) argument
/external/skia/src/images/
H A DSkMovie_gif.cpp205 static void fillRect(SkBitmap* bm, GifWord left, GifWord top, GifWord width, GifWord height, argument
210 uint32_t* dst = bm->getAddr32(left, top);
217 if (top + copyHeight > bmHeight) {
218 copyHeight = bmHeight - top;
/external/skia/src/opts/
H A DSkNx_sse.h215 const uint16_t top = 0x8000; // Keep this separate from _mm_set1_epi16 or MSVC will whine. local
216 const __m128i top_8x = _mm_set1_epi16(top);
/external/skia/src/pathops/
H A DSkDConicLineIntersection.cpp144 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument
145 this->addExactVerticalEndPoints(top, bottom, axisIntercept);
147 this->addNearVerticalEndPoints(top, bottom, axisIntercept);
156 double lineT = (pt.fY - top) / (bottom - top);
224 void addExactVerticalEndPoints(double top, double bottom, double x) { argument
226 double lineT = SkDLine::ExactPointV(fConic[cIndex], top, bottom, x);
235 void addNearVerticalEndPoints(double top, double bottom, double x) { argument
241 double lineT = SkDLine::NearPointV(fConic[cIndex], top, bottom, x);
333 int SkIntersections::vertical(const SkDConic& conic, double top, doubl argument
[all...]
H A DSkDCubicLineIntersection.cpp245 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument
246 addExactVerticalEndPoints(top, bottom, axisIntercept);
248 addNearVerticalEndPoints(top, bottom, axisIntercept);
255 double lineT = (pt.fY - top) / (bottom - top);
322 void addExactVerticalEndPoints(double top, double bottom, double x) { argument
324 double lineT = SkDLine::ExactPointV(fCubic[cIndex], top, bottom, x);
333 void addNearVerticalEndPoints(double top, double bottom, double x) { argument
339 double lineT = SkDLine::NearPointV(fCubic[cIndex], top, bottom, x);
407 int SkIntersections::vertical(const SkDCubic& cubic, double top, doubl argument
[all...]
H A DSkDQuadLineIntersection.cpp253 int verticalIntersect(double axisIntercept, double top, double bottom, bool flipped) { argument
254 addExactVerticalEndPoints(top, bottom, axisIntercept);
256 addNearVerticalEndPoints(top, bottom, axisIntercept);
263 double lineT = (pt.fY - top) / (bottom - top);
329 void addExactVerticalEndPoints(double top, double bottom, double x) { argument
331 double lineT = SkDLine::ExactPointV(fQuad[qIndex], top, bottom, x);
340 void addNearVerticalEndPoints(double top, double bottom, double x) { argument
346 double lineT = SkDLine::NearPointV(fQuad[qIndex], top, bottom, x);
414 int SkIntersections::vertical(const SkDQuad& quad, double top, doubl argument
[all...]

Completed in 1570 milliseconds

1234567891011>>