/external/skia/gm/ |
H A D | gamma.cpp | 139 SkPoint points[2] = { local 144 p.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 2, 152 SkPoint points[2] = { local 157 p.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 2, 165 SkPoint points[2] = { local 170 p.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 3, 178 SkPoint points[2] = { local 183 p.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 5,
|
H A D | dstreadshuffle.cpp | 57 SkPoint points[4]; local 58 kRect.toQuad(points); 59 fConvexPath.moveTo(points[0]); 60 fConvexPath.quadTo(points[1], points[2]); 61 fConvexPath.quadTo(points[3], points[0]); 68 SkPoint points[5] = {{50.f, 0.f}}; local 72 rot.mapPoints(points + i, points [all...] |
H A D | hardstop_gradients.cpp | 70 static void create_gradient_points(int cellRow, int cellCol, SkPoint points[2]) { argument 77 points[0] = SkPoint::Make(x0, y); 78 points[1] = SkPoint::Make(x1, y); 97 SkPoint points[2]; variable 144 create_gradient_points(cellRow, cellCol, points); 147 points,
|
H A D | skbug_257.cpp | 108 SkPoint points[8] = {{size / 2, 8 + translate}, local 119 canvas->drawPoints(SkCanvas::kLines_PointMode, 8, points, checker); 125 // reference points (without the huge translations).
|
/external/skqp/bench/ |
H A D | HardStopGradientBench_SpecialHardStops.cpp | 55 SkPoint points[2] = { variable 92 fPaint.setShader(SkGradientShader::MakeLinear(points,
|
H A D | HairlinePathBench.cpp | 26 static const int points[] = { variable 90 int size = SK_ARRAY_COUNT(points); 101 path->moveTo(SkIntToScalar(points[base1] + xTrans), 102 SkIntToScalar(points[base1+1] + yTrans)); 103 path->lineTo(SkIntToScalar(points[base2] + xTrans), 104 SkIntToScalar(points[base2+1] + yTrans)); 105 path->lineTo(SkIntToScalar(points[base3] + xTrans), 106 SkIntToScalar(points[base3+1] + yTrans)); 122 int size = SK_ARRAY_COUNT(points); 133 path->moveTo(SkIntToScalar(points[base [all...] |
H A D | PatchBench.cpp | 44 const SkPoint points[SkPatchUtils::kNumCtrlPts] = { local 45 //top points 47 //right points 49 //bottom points 51 //left points 54 memcpy(fCubics, points, SkPatchUtils::kNumCtrlPts * sizeof(SkPoint)); 168 const SkPoint points[SkPatchUtils::kNumCtrlPts] = { variable 169 //top points 171 //right points 173 //bottom points 194 const SkPoint points[SkPatchUtils::kNumCtrlPts] = { variable 220 const SkPoint points[SkPatchUtils::kNumCtrlPts] = { variable [all...] |
/external/skqp/gm/ |
H A D | gamma.cpp | 139 SkPoint points[2] = { local 144 p.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 2, 152 SkPoint points[2] = { local 157 p.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 2, 165 SkPoint points[2] = { local 170 p.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 3, 178 SkPoint points[2] = { local 183 p.setShader(SkGradientShader::MakeLinear(points, colors, nullptr, 5,
|
/external/tensorflow/tensorflow/core/lib/monitoring/ |
H A D | collected_metrics.h | 52 // Individual points will provide a value for the metric (e.g. the counter 98 // consecutive points that share a common start_timestamp, which is often 115 // but the time ranges of two points do not overlap. The delta form of the 135 // A set of points belonging to a metric. 141 std::vector<std::unique_ptr<Point>> points; member in struct:tensorflow::monitoring::PointSet
|
/external/webrtc/webrtc/modules/audio_coding/codecs/opus/ |
H A D | audio_encoder_opus_unittest.cc | 110 std::vector<double> points; local 112 points.push_back(a + i * step); 113 return points;
|
/external/eigen/test/ |
H A D | diagonalmatrices.cpp | 107 Matrix3Xd points = Matrix3Xd::Random(3, 3); local 109 Matrix2Xd tmp1 = points.topRows<2>(), res1, res2; 110 VERIFY_IS_APPROX( res1 = diag.asDiagonal() * points.topRows<2>(), res2 = diag.asDiagonal() * tmp1 ); 111 Matrix2d tmp2 = points.topLeftCorner<2,2>(); 112 VERIFY_IS_APPROX(( res1 = points.topLeftCorner<2,2>()*diag.asDiagonal()) , res2 = tmp2*diag.asDiagonal() );
|
/external/freetype/src/smooth/ |
H A D | ftsmooth.c | 167 FT_Vector* points = outline->points; local 168 FT_Vector* points_end = points + outline->n_points; 173 for ( vec = points; vec < points_end; vec++ ) 177 for ( vec = points; vec < points_end; vec++ ) 186 FT_Vector* points = outline->points; local 187 FT_Vector* points_end = points + outline->n_points; 192 for ( vec = points; vec < points_end; vec++ ) 196 for ( vec = points; ve [all...] |
/external/kernel-headers/original/uapi/linux/ |
H A D | net_dropmon.h | 37 struct net_dm_drop_point points[0]; member in struct:net_dm_alert_msg
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_unfilled.c | 30 * Convert triangles to points or lines as needed. 114 static void points(struct draw_stage *stage, function 204 points( stage, header );
|
/external/mesa3d/src/gallium/state_trackers/wgl/ |
H A D | stw_ext_pixelformat.c | 333 int points; member in struct:stw_pixelformat_score 360 * score points. 370 * the score is set to 0 points, effectively removing the pixelformat 374 scores[index].points = 0; 383 scores[index].points = 0; 385 scores[index].points -= (actual_value - expected_value) * ami->weight; 409 * points for a mismatch when the match does not have to be exact. 417 scores[i].points = 0x7fffffff; 452 if (scores[i - 1].points < scores[i].points) { [all...] |
/external/opencv/cv/src/ |
H A D | cvlinefit.cpp | 46 icvFitLine2D_wods( CvPoint2D32f * points, int _count, float *weights, float *line ) argument 60 x += points[i].x; 61 y += points[i].y; 62 x2 += points[i].x * points[i].x; 63 y2 += points[i].y * points[i].y; 64 xy += points[i].x * points[i].y; 72 x += weights[i] * points[ 102 icvFitLine3D_wods( CvPoint3D32f * points, int count, float *weights, float *line ) argument [all...] |
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowPath.java | 20 private List<Point> points = new ArrayList<Point>(); field in class:ShadowPath 29 points.add(p); 36 points.add(point); 52 * @return all the points that have been added to the {@code Path} 55 return points;
|
/external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/ |
H A D | ShadowPath.java | 19 private List<Point> points = new ArrayList<>(); field in class:ShadowPath 25 points = new ArrayList<>(Shadows.shadowOf(path).getPoints()); 33 points.add(p); 40 points.add(point); 50 points.clear(); 65 * @return all the points that have been added to the {@code Path} 68 return points;
|
/external/skia/bench/ |
H A D | HairlinePathBench.cpp | 26 static const int points[] = { variable 90 int size = SK_ARRAY_COUNT(points); 101 path->moveTo(SkIntToScalar(points[base1] + xTrans), 102 SkIntToScalar(points[base1+1] + yTrans)); 103 path->lineTo(SkIntToScalar(points[base2] + xTrans), 104 SkIntToScalar(points[base2+1] + yTrans)); 105 path->lineTo(SkIntToScalar(points[base3] + xTrans), 106 SkIntToScalar(points[base3+1] + yTrans)); 122 int size = SK_ARRAY_COUNT(points); 133 path->moveTo(SkIntToScalar(points[base [all...] |
H A D | PatchBench.cpp | 44 const SkPoint points[SkPatchUtils::kNumCtrlPts] = { local 45 //top points 47 //right points 49 //bottom points 51 //left points 54 memcpy(fCubics, points, SkPatchUtils::kNumCtrlPts * sizeof(SkPoint)); 168 const SkPoint points[SkPatchUtils::kNumCtrlPts] = { variable 169 //top points 171 //right points 173 //bottom points 194 const SkPoint points[SkPatchUtils::kNumCtrlPts] = { variable 220 const SkPoint points[SkPatchUtils::kNumCtrlPts] = { variable [all...] |
/external/skia/example/ |
H A D | SkiaSDLExample.cpp | 89 SkPoint points[kNumPoints] = {{0, SkIntToScalar(-50)} }; local 93 rot.mapPoints(points + i, points + i - 1, 1); 95 concavePath.moveTo(points[0]); 97 concavePath.lineTo(points[(2 * i) % kNumPoints]);
|
/external/skia/src/gpu/ccpr/ |
H A D | GrCCGeometry.h | 51 : fPoints(numSkPoints * 3) // Reserve for a 3x expansion in points and verbs. 54 const SkTArray<SkPoint, true>& points() const { SkASSERT(!fBuildingContour); return fPoints; } function in class:GrCCGeometry 79 // We pass through inflection points and loop intersections using a line and quadratic(s) 81 // segments are allowed to get to these points. For normal rendering you will want to use the 125 // TODO: These points could eventually be written directly to block-allocated GPU buffers.
|
/external/skia/src/shaders/gradients/ |
H A D | SkLinearGradient.cpp | 156 SkPoint points[] = {{d->fRandom->nextUScalar1(), d->fRandom->nextUScalar1()}, local 161 SkGradientShader::MakeLinear(points, params.fColors4f, params.fColorSpace, params.fStops, 163 SkGradientShader::MakeLinear(points, params.fColors, params.fStops,
|
/external/skia/tests/ |
H A D | PathCoverageTest.cpp | 26 // For determining the maximum possible number of points to use in 39 static inline int estimate_distance(const SkPoint points[]) { argument 40 return cheap_distance(points[1].fX * 2 - points[2].fX - points[0].fX, 41 points[1].fY * 2 - points[2].fY - points[0].fY); 44 static inline SkScalar compute_distance(const SkPoint points[]) { argument 45 return SkPointPriv::DistanceToLineSegmentBetween(points[ 69 quadraticPointCount_EE(const SkPoint points[]) argument 74 quadraticPointCount_EC(const SkPoint points[], SkScalar tol) argument 79 quadraticPointCount_CE(const SkPoint points[]) argument 84 quadraticPointCount_CC(const SkPoint points[], SkScalar tol) argument [all...] |
/external/skqp/example/ |
H A D | SkiaSDLExample.cpp | 89 SkPoint points[kNumPoints] = {{0, SkIntToScalar(-50)} }; local 93 rot.mapPoints(points + i, points + i - 1, 1); 95 concavePath.moveTo(points[0]); 97 concavePath.lineTo(points[(2 * i) % kNumPoints]);
|