/external/ImageMagick/MagickCore/ |
H A D | widget.c | 246 points[6]; 256 points[0].x=x1; 257 points[0].y=y1; 258 points[1].x=x1; 259 points[1].y=y2; 260 points[2].x=x2; 261 points[2].y=y2; 262 points[3].x=x2+bevel_width; 263 points[3].y=y2-bevel_width; 264 points[ 238 points[6]; local 659 points[4]; local 782 points[4]; local 892 points[4]; local [all...] |
/external/flac/include/FLAC/ |
H A D | format.h | 603 * - The seek points must be sorted by ascending sample number. 614 FLAC__StreamMetadata_SeekPoint *points; member in struct:__anon7233 683 /**< The number of track index points. */ 686 /**< NULL if num_indices == 0, else pointer to array of index points. */ 967 /** Sort a seek table's seek points according to the format specification. 969 * seek points with identical \a sample_number values. Duplicate seek 970 * points are converted into placeholder points and sorted to the end of 977 * The number of duplicate seek points converted into placeholders.
|
/external/freetype/src/autofit/ |
H A D | aflatin.c | 307 /* Find all blue zones. Flat segments give the reference points, */ 415 FT_Vector* points; local 417 FT_Pos best_y_extremum; /* same as points.y */ 485 points = outline.points; 507 /* attachment points that are way outside of the glyph's */ 517 if ( best_point < 0 || points[pp].y > best_y ) 520 best_y = points[pp].y; 524 descender = FT_MIN( descender, points[pp].y + y_offset ); 531 if ( best_point < 0 || points[p [all...] |
H A D | aflatin2.c | 209 /* bottom-most points (depending on `AF_IS_TOP_BLUE') */ 231 FT_Vector* points; local 245 points = glyph->outline.points; 266 /* In some fonts, they correspond to mark attachment points */ 274 if ( best_point < 0 || points[pp].y > best_y ) 277 best_y = points[pp].y; 283 if ( best_point < 0 || points[pp].y < best_y ) 286 best_y = points[pp].y; 301 /* lies, then inspect its previous and next points */ [all...] |
/external/freetype/src/base/ |
H A D | ftstroke.c | 316 FT_Vector* points; member in struct:FT_StrokeBorderRec_ 344 if ( FT_RENEW_ARRAY( border->points, old_max, cur_max ) || 374 border->points[start] = border->points[count]; 378 /* reverse the points */ 380 FT_Vector* vec1 = border->points + start + 1; 381 FT_Vector* vec2 = border->points + count - 1; 435 border->points[border->num_points - 1] = *to; 441 FT_IS_SMALL( border->points[border->num_points - 1].x - to->x ) && 442 FT_IS_SMALL( border->points[borde [all...] |
/external/freetype/src/truetype/ |
H A D | ttgxvar.c | 110 /* Read a set of points to which the following deltas will apply. */ 119 /* point_cnt :: The number of points read. A zero value means that */ 120 /* all points in the glyph will be affected, without */ 124 /* An array of FT_UShort containing the affected points or the */ 132 FT_UShort *points = NULL; local 158 FT_TRACE1(( "ft_var_readpackedpoints: number of points too large\n" )); 165 if ( FT_NEW_ARRAY( points, n + 1 ) ) 179 points[i++] = first; 185 points[i++] = first; 193 points[ 3062 FT_UShort* points; local 3576 FT_UShort* points; local [all...] |
/external/icu/icu4c/source/common/ |
H A D | ubidiimp.h | 213 /** BiDi control code points */ 240 int32_t capacity; /* number of points allocated */ 241 int32_t size; /* number of points used */ 242 int32_t confirmed; /* number of points confirmed */ 244 Point *points; /* pointer to array of points */ member in struct:InsertPoints
|
/external/opencv/cv/include/ |
H A D | cv.h | 362 Returns the number of retrieved points. */ 449 The reader is used to iteratively get coordinates of all the chain points. 486 Calculates optical flow between two images for certain set of points (i.e. 650 /* Calculates Voronoi tesselation (i.e. coordinates of Voronoi points) */ 654 /* Removes all Voronoi points from the tesselation */ 723 /* Finds high-curvature points of the contour */ 739 CVAPI(CvRect) cvBoundingRect( CvArr* points, int update CV_DEFAULT(0) ); 745 /* Finds minimum area rotated rectangle bounding a set of points */ 746 CVAPI(CvBox2D) cvMinAreaRect2( const CvArr* points, 749 /* Finds minimum enclosing circle for a set of points */ 798 CVAPI(CvBox2D) cvFitEllipse2( const CvArr* points ); variable [all...] |
H A D | cvcompat.h | 382 CV_INLINE void cvConvexHull( CvPoint* points, int num_points, argument 386 CvMat points1 = cvMat( 1, num_points, CV_32SC2, points ); 398 #define cvConvexHullApprox( points, num_points, bound_rect, bandwidth, \ 400 cvConvexHull( points, num_points, bound_rect, orientation, hull, hullsize ) 407 CV_INLINE void cvMinAreaRect( CvPoint* points, int n, argument 414 CvMat mat = cvMat( 1, n, CV_32SC2, points ); 432 CV_INLINE void cvFitLine3D( CvPoint3D32f* points, int count, int dist, argument 435 CvMat mat = cvMat( 1, count, CV_32FC3, points ); 441 /* Fits a line into set of 2d points in a robust way (M-estimator technique) */ 442 CV_INLINE void cvFitLine2D( CvPoint2D32f* points, in argument 452 cvFitEllipse( const CvPoint2D32f* points, int count, CvBox2D* box ) argument [all...] |
/external/opencv/cv/src/ |
H A D | cvfundam.cpp | 138 CV_ERROR( CV_StsOutOfRange, "the number of model points should be positive" ); 404 // to a line connecting some previously selected points 844 // form a linear system Ax=0: for each selected pair of points m1 & m2, 1029 cvComputeCorrespondEpilines( const CvMat* points, int pointImageID, argument 1044 if( !CV_IS_MAT(points) ) 1045 CV_ERROR( !points ? CV_StsNullPtr : CV_StsBadArg, "points parameter is not a valid matrix" ); 1047 depth = CV_MAT_DEPTH(points->type); 1048 cn = CV_MAT_CN(points->type); 1052 if( points [all...] |
/external/opencv/cvaux/src/ |
H A D | cvtrifocal.cpp | 65 void icvFindBaseTransform(CvMat* points,CvMat* resultT); 119 void icvNormalizePoints( CvMat* points, CvMat* normPoints,CvMat* cameraMatr ) argument 121 /* Normalize image points using camera matrix */ 127 if( points == 0 || normPoints == 0 || cameraMatr == 0 ) 132 if( !CV_IS_MAT(points) || !CV_IS_MAT(normPoints) || !CV_IS_MAT(cameraMatr) ) 138 numPoints = points->cols; 141 CV_ERROR( CV_StsUnmatchedSizes, "Number of points must be the same and more than 0" ); 144 if( normPoints->rows != 2 || normPoints->rows != points->rows ) 164 cvmSet(normPoints, 0, i, (cvmGet(points,0,i) - cx) / fx ); 165 cvmSet(normPoints, 1, i, (cvmGet(points, 228 CvMat* points[3]; local 587 icvCompute3ProjectMatricesNPointsStatus( CvMat** points, CvMat** projMatrs, CvMat** statuses, double threshold, double p, CvMat* resStatus, CvMat* points4D) argument 812 CvMat* points[3]; local 1335 icvFindBaseTransform(CvMat* points,CvMat* resultT) argument [all...] |
/external/skia/src/gpu/ |
H A D | SkGpuDevice.cpp | 347 // points and lines. 554 void SkGpuDevice::drawStrokedLine(const SkPoint points[2], argument 568 SkVector v = points[1] - points[0]; 584 SkPoint mid = points[0] + points[1]; 611 SkPoint points[2]; local 614 this->ctm().preservesRightAngles() && origSrcPath.isLine(points)) { 620 this->drawStrokedLine(points, paint);
|
H A D | GrTessellator.cpp | 53 * line-sweep algorithm, but due to floating point inaccuracy, the intersection points are 56 * points. This occurs in two ways: 290 // A line equation in implicit form. fA * x + fB * y + fC = 0, for all points (x, y) on the line. 1989 // Miter inner points 2007 // Miter outer points 2378 SkPoint* points = new SkPoint[count]; local 2379 SkPoint* pointsEnd = points; 2394 SkASSERT(pointsEnd - points == actualCount); 2395 delete[] points;
|
/external/skia/src/pathops/ |
H A D | SkOpSegment.cpp | 15 - find small collections of points that can be collapsed to a single point 1305 // adjacent spans may have points close by 1313 // verify that no combination of points are close 1327 // check only unique points 1563 int points = SkPathOpsVerbToPoints(fVerb); local 1564 edge->fCubic[points].set(endPtT.fPt);
|
H A D | SkPathOpsTypes.h | 568 inline SkPath::Verb SkPathOpsPointsToVerb(int points) { argument 569 int verb = (1 << points) >> 1; 571 switch (points) { 583 int points = (int) verb - (((int) verb + 1) >> 2); local 586 case SkPath::kLine_Verb: SkASSERT(1 == points); break; 587 case SkPath::kQuad_Verb: SkASSERT(2 == points); break; 588 case SkPath::kConic_Verb: SkASSERT(2 == points); break; 589 case SkPath::kCubic_Verb: SkASSERT(3 == points); break; 593 return points;
|
/external/skqp/src/gpu/ |
H A D | SkGpuDevice.cpp | 343 // points and lines. 558 void SkGpuDevice::drawStrokedLine(const SkPoint points[2], argument 572 SkVector v = points[1] - points[0]; 588 SkPoint mid = points[0] + points[1]; 615 SkPoint points[2]; local 618 this->ctm().preservesRightAngles() && origSrcPath.isLine(points)) { 624 this->drawStrokedLine(points, paint);
|
/external/skqp/src/pathops/ |
H A D | SkOpSegment.cpp | 15 - find small collections of points that can be collapsed to a single point 1305 // adjacent spans may have points close by 1313 // verify that no combination of points are close 1327 // check only unique points 1563 int points = SkPathOpsVerbToPoints(fVerb); local 1564 edge->fCubic[points].set(endPtT.fPt);
|
H A D | SkPathOpsTypes.h | 568 inline SkPath::Verb SkPathOpsPointsToVerb(int points) { argument 569 int verb = (1 << points) >> 1; 571 switch (points) { 583 int points = (int) verb - (((int) verb + 1) >> 2); local 586 case SkPath::kLine_Verb: SkASSERT(1 == points); break; 587 case SkPath::kQuad_Verb: SkASSERT(2 == points); break; 588 case SkPath::kConic_Verb: SkASSERT(2 == points); break; 589 case SkPath::kCubic_Verb: SkASSERT(3 == points); break; 593 return points;
|
/external/ImageMagick/coders/ |
H A D | dds.c | 994 const DDSVector4 *points, const ssize_t *map, const DDSVector3 principle, 1054 ConstructOrdering(count,points,principle,pointsWeights,&xSumwSum,order,0); 1206 if (ConstructOrdering(count,points,axis,pointsWeights,&xSumwSum,order, 1226 const DDSVector4* points, const ssize_t *map, const DDSVector3 principle, 1266 VectorCopy43(points[0],start); 1267 VectorCopy43(points[0],end); 1269 min = max = Dot(points[0],principle); 1272 val = Dot(points[i],principle); 1275 VectorCopy43(points[i],start); 1280 VectorCopy43(points[ 991 CompressClusterFit(const size_t count, const DDSVector4 *points, const ssize_t *map, const DDSVector3 principle, const DDSVector4 metric, DDSVector3 *start, DDSVector3* end, unsigned char *indices) argument 1223 CompressRangeFit(const size_t count, const DDSVector4* points, const ssize_t *map, const DDSVector3 principle, const DDSVector4 metric, DDSVector3 *start, DDSVector3 *end, unsigned char *indices) argument 1431 ComputeWeightedCovariance(const size_t count, const DDSVector4 *points, float *covariance) argument 1487 ConstructOrdering(const size_t count, const DDSVector4 *points, const DDSVector3 axis, DDSVector4 *pointsWeights, DDSVector4 *xSumwSum, unsigned char *order, size_t iteration) argument 2521 WriteCompressed(Image *image, const size_t count, DDSVector4 *points, const ssize_t *map, const MagickBooleanType clusterFit) argument 2801 points[16]; local 3022 WriteSingleColorFit(Image *image, const DDSVector4 *points, const ssize_t *map) argument [all...] |
/external/freetype/src/raster/ |
H A D | ftraster.c | 1717 /* there are simply no `on' points in the contour! */ 1738 FT_Vector* points; local 1746 points = ras.outline.points; 1747 limit = points + last; 1749 v_start.x = SCALED( points[first].x ); 1750 v_start.y = SCALED( points[first].y ); 1751 v_last.x = SCALED( points[last].x ); 1752 v_last.y = SCALED( points[last].y ); 1762 point = points [all...] |
/external/opencv/cvaux/include/ |
H A D | cvaux.h | 137 CvEHMMState* state; /* if level == 0 points to real states array, 138 if not - points to embedded hmms */ 231 /* Creates hand mask image given several points on the hand */ 236 CVAPI(void) cvFindHandRegion (CvPoint3D32f* points, int count, 243 CVAPI(void) cvFindHandRegionA( CvPoint3D32f* points, int count, 260 // returns squared distance between two 2D points with floating-point coordinates. 1044 /* Finds ending points of scanlines on left and right images of stereo-pair */ 1455 pointCount & points are used in case of 1459 int pointCount = 0, CvPoint2D32f* points = 0 ); 1461 /* Retrieves etalon parameters/or and points */ 1551 CvPoint2D32f* points[MAX_CAMERAS]; member in class:CvCalibFilter [all...] |
/external/dng_sdk/source/ |
H A D | dng_image_writer.cpp | 2558 // 16-bits here, but should be small number of points so... 2565 real32 *points = fToneCurveBuffer.Buffer_real32 (); local 2568 fToneCurveTag.SetData (points); 2576 points [i * 2 ] = (real32) profile.ToneCurve ().fCoord [i].h; 2577 points [i * 2 + 1] = (real32) profile.ToneCurve ().fCoord [i].v;
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
H A D | Bidi.java | 524 Point[] points = new Point[0]; field in class:Bidi.InsertPoints 2462 stackLast points to its current entry. */ 3076 int len = insertPoints.points.length; 3078 insertPoints.points = new Point[FIRSTALLOC]; 3082 Point[] savePoints = insertPoints.points; 3083 insertPoints.points = new Point[len * 2]; 3084 System.arraycopy(savePoints, 0, insertPoints.points, 0, len); 3088 insertPoints.points[insertPoints.size] = point; 3165 if ((insertPoints.points.length == 0) || 3185 /* mark insert points a [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | Bidi.java | 523 Point[] points = new Point[0]; field in class:Bidi.InsertPoints 2496 stackLast points to its current entry. */ 3110 int len = insertPoints.points.length; 3112 insertPoints.points = new Point[FIRSTALLOC]; 3116 Point[] savePoints = insertPoints.points; 3117 insertPoints.points = new Point[len * 2]; 3118 System.arraycopy(savePoints, 0, insertPoints.points, 0, len); 3122 insertPoints.points[insertPoints.size] = point; 3199 if ((insertPoints.points.length == 0) || 3219 /* mark insert points a [all...] |
/external/pdfium/core/fxge/win32/ |
H A D | fx_win32_gdipext.cpp | 1121 static bool IsSmallTriangle(Gdiplus::PointF* points, argument 1130 CFX_PointF p1(points[pair1].X, points[pair1].Y); 1131 CFX_PointF p2(points[pair2].X, points[pair2].Y); 1171 Gdiplus::PointF* points = FX_Alloc(Gdiplus::PointF, pPoints.size()); local 1179 points[i].X = pPoints[i].m_Point.x; 1180 points[i].Y = pPoints[i].m_Point.y; 1187 points[i].X = 50000 * 1.0f; 1189 points[ [all...] |