Home
last modified time | relevance | path

Searched refs:points (Results 1 – 25 of 1720) sorted by relevance

12345678910>>...69

/external/tensorflow/tensorflow/core/lib/monitoring/
Dcollection_registry_test.cc132 ASSERT_EQ(2, lps.points.size()); in TEST()
133 ASSERT_EQ(2, lps.points[0]->labels.size()); in TEST()
134 EXPECT_EQ("MyLabel0", lps.points[0]->labels[0].name); in TEST()
135 EXPECT_EQ("Label00", lps.points[0]->labels[0].value); in TEST()
136 EXPECT_EQ("MyLabel1", lps.points[0]->labels[1].name); in TEST()
137 EXPECT_EQ("Label10", lps.points[0]->labels[1].value); in TEST()
138 EXPECT_EQ(ValueType::kInt64, lps.points[0]->value_type); in TEST()
139 EXPECT_EQ(42, lps.points[0]->int64_value); in TEST()
140 EXPECT_LT(0, lps.points[0]->start_timestamp_millis); in TEST()
141 EXPECT_LT(0, lps.points[0]->end_timestamp_millis); in TEST()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/
DGaussianParametersGuesser.java79 private double[] basicGuess(WeightedObservedPoint[] points) { in basicGuess() argument
80 Arrays.sort(points, createWeightedObservedPointComparator()); in basicGuess()
83 int minYIdx = findMinY(points); in basicGuess()
84 params[0] = points[minYIdx].getY(); in basicGuess()
86 int maxYIdx = findMaxY(points); in basicGuess()
87 params[1] = points[maxYIdx].getY(); in basicGuess()
88 params[2] = points[maxYIdx].getX(); in basicGuess()
93 double fwhmX1 = interpolateXAtY(points, maxYIdx, -1, halfY); in basicGuess()
94 double fwhmX2 = interpolateXAtY(points, maxYIdx, +1, halfY); in basicGuess()
97 fwhmApprox = points[points.length - 1].getX() - points[0].getX(); in basicGuess()
[all …]
/external/fonttools/Lib/fontTools/pens/
DbasePen.py59 def curveTo(self, *points): argument
80 def qCurveTo(self, *points): argument
129 def curveTo(self, *points): argument
132 def qCurveTo(self, *points): argument
257 def curveTo(self, *points): argument
258 n = len(points) - 1 # 'n' is the number of control points
265 self._curveToOne(*points)
266 self.__currentPoint = points[-1]
276 for pt1, pt2, pt3 in decomposeSuperBezierSegment(points):
280 self.qCurveTo(*points)
[all …]
DpointPen.py98 points = self.currentPath
100 if not points:
102 if len(points) == 1:
104 pt, segmentType, smooth, name, kwargs = points[0]
109 if points[0][1] == "move":
112 pt, segmentType, smooth, name, kwargs = points[0]
114 points.pop(0)
120 for i in range(len(points)):
121 segmentType = points[i][1]
129 points.append((None, "qcurve", None, None, None))
[all …]
DtransformPen.py34 def curveTo(self, *points): argument
35 self._outPen.curveTo(*self._transformPoints(points))
37 def qCurveTo(self, *points): argument
38 if points[-1] is None:
39 points = self._transformPoints(points[:-1]) + [None]
41 points = self._transformPoints(points)
42 self._outPen.qCurveTo(*points)
44 def _transformPoints(self, points): argument
46 return [transformPoint(pt) for pt in points]
/external/mesa3d/src/glx/
Deval.c41 const GLfloat * points, GLubyte * pc) in __glFillMap1f() argument
45 __GLX_PUT_FLOAT_ARRAY(0, points, order * k); in __glFillMap1f()
51 __GLX_PUT_FLOAT_ARRAY(0, points, k); in __glFillMap1f()
52 points += stride; in __glFillMap1f()
60 const GLdouble * points, GLubyte * pc) in __glFillMap1d() argument
64 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k); in __glFillMap1d()
69 __GLX_PUT_DOUBLE_ARRAY(0, points, k); in __glFillMap1d()
70 points += stride; in __glFillMap1d()
79 const GLfloat * points, GLfloat * data) in __glFillMap2f() argument
85 __GLX_MEM_COPY(data, points, majorOrder * majorStride * in __glFillMap2f()
[all …]
/external/skqp/bench/
DHairlinePathBench.cpp26 static const int points[] = { variable
90 int size = SK_ARRAY_COUNT(points); in makePath()
101 path->moveTo(SkIntToScalar(points[base1] + xTrans), in makePath()
102 SkIntToScalar(points[base1+1] + yTrans)); in makePath()
103 path->lineTo(SkIntToScalar(points[base2] + xTrans), in makePath()
104 SkIntToScalar(points[base2+1] + yTrans)); in makePath()
105 path->lineTo(SkIntToScalar(points[base3] + xTrans), in makePath()
106 SkIntToScalar(points[base3+1] + yTrans)); in makePath()
122 int size = SK_ARRAY_COUNT(points); in makePath()
133 path->moveTo(SkIntToScalar(points[base1] + xTrans), in makePath()
[all …]
/external/skia/bench/
DHairlinePathBench.cpp26 static const int points[] = { variable
90 int size = SK_ARRAY_COUNT(points); in makePath()
101 path->moveTo(SkIntToScalar(points[base1] + xTrans), in makePath()
102 SkIntToScalar(points[base1+1] + yTrans)); in makePath()
103 path->lineTo(SkIntToScalar(points[base2] + xTrans), in makePath()
104 SkIntToScalar(points[base2+1] + yTrans)); in makePath()
105 path->lineTo(SkIntToScalar(points[base3] + xTrans), in makePath()
106 SkIntToScalar(points[base3+1] + yTrans)); in makePath()
122 int size = SK_ARRAY_COUNT(points); in makePath()
133 path->moveTo(SkIntToScalar(points[base1] + xTrans), in makePath()
[all …]
/external/skqp/platform_tools/android/apps/skar_java/src/main/java/com/google/skar/examples/helloskar/app/
DFingerPainting.java43 private ArrayList<PointF> points = new ArrayList<>(); field in FingerPainting
123 if (points.size() <= 1) { in buildPath()
163 points.clear(); in reset()
173 points.add(p); in addPoint()
175 jumpPoints.add(points.size() - 1); in addPoint()
176 indexColors.put(points.size() - 1, color); in addPoint()
191 buildRoughFromTo(start, points.size()); in buildRough()
203 buildSmoothFromTo(start, points.size()); in buildSmooth()
211 p.moveTo(points.get(start).x, points.get(start).y); in buildRoughFromTo()
214 p.lineTo(points.get(i).x, points.get(i).y); in buildRoughFromTo()
[all …]
/external/skia/platform_tools/android/apps/skar_java/src/main/java/com/google/skar/examples/helloskar/app/
DFingerPainting.java43 private ArrayList<PointF> points = new ArrayList<>(); field in FingerPainting
123 if (points.size() <= 1) { in buildPath()
163 points.clear(); in reset()
173 points.add(p); in addPoint()
175 jumpPoints.add(points.size() - 1); in addPoint()
176 indexColors.put(points.size() - 1, color); in addPoint()
191 buildRoughFromTo(start, points.size()); in buildRough()
203 buildSmoothFromTo(start, points.size()); in buildSmooth()
211 p.moveTo(points.get(start).x, points.get(start).y); in buildRoughFromTo()
214 p.lineTo(points.get(i).x, points.get(i).y); in buildRoughFromTo()
[all …]
/external/autotest/client/site_tests/firmware_TouchMTB/geometry/
Dtwo_farthest_clusters.py18 def get_two_farthest_points(points): argument
24 if len(points) <= 1:
25 return points
28 for p1 in points:
29 for p2 in points:
38 def get_two_farthest_clusters(points): argument
49 if len(points) <= 1:
50 return (points, [])
52 fp1, fp2 = get_two_farthest_points(points)
58 for p in points:
[all …]
/external/skqp/src/utils/
DSkParsePath.cpp80 SkPoint points[3]; in FromSVGString() local
112 data = find_points(data, points, 1, relative, &c); in FromSVGString()
113 path.moveTo(points[0]); in FromSVGString()
116 c = points[0]; in FromSVGString()
119 data = find_points(data, points, 1, relative, &c); in FromSVGString()
120 path.lineTo(points[0]); in FromSVGString()
121 c = points[0]; in FromSVGString()
136 data = find_points(data, points, 3, relative, &c); in FromSVGString()
139 data = find_points(data, &points[1], 2, relative, &c); in FromSVGString()
140 points[0] = c; in FromSVGString()
[all …]
/external/skia/src/utils/
DSkParsePath.cpp80 SkPoint points[3]; in FromSVGString() local
112 data = find_points(data, points, 1, relative, &c); in FromSVGString()
113 path.moveTo(points[0]); in FromSVGString()
116 c = points[0]; in FromSVGString()
119 data = find_points(data, points, 1, relative, &c); in FromSVGString()
120 path.lineTo(points[0]); in FromSVGString()
121 c = points[0]; in FromSVGString()
136 data = find_points(data, points, 3, relative, &c); in FromSVGString()
139 data = find_points(data, &points[1], 2, relative, &c); in FromSVGString()
140 points[0] = c; in FromSVGString()
[all …]
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/data/unicode/
DconfusablesWholeScript.txt26 # Total code points: 7
38 # Total code points: 7
52 # Total code points: 9
64 # Total code points: 7
76 # Total code points: 7
88 # Total code points: 7
100 # Total code points: 7
116 # Total code points: 11
128 # Total code points: 7
140 # Total code points: 7
[all …]
/external/icu/android_icu4j/src/main/tests/android/icu/dev/data/unicode/
DconfusablesWholeScript.txt26 # Total code points: 7
38 # Total code points: 7
52 # Total code points: 9
64 # Total code points: 7
76 # Total code points: 7
88 # Total code points: 7
100 # Total code points: 7
116 # Total code points: 11
128 # Total code points: 7
140 # Total code points: 7
[all …]
/external/icu/icu4c/source/data/unidata/
DconfusablesWholeScript.txt26 # Total code points: 7
38 # Total code points: 7
52 # Total code points: 9
64 # Total code points: 7
76 # Total code points: 7
88 # Total code points: 7
100 # Total code points: 7
116 # Total code points: 11
128 # Total code points: 7
140 # Total code points: 7
[all …]
/external/skia/docs/examples/
DPoint_subtract_operator.cpp9 SkPoint points[] = { { 3, 1 }, { 4, 2 }, { 5, 1 }, { 7, 3 }, in draw() local
15 canvas->drawPoints(SkCanvas::kPolygon_PointMode, SK_ARRAY_COUNT(points), points, paint); in draw()
16 points[1] += points[0] - points[2]; in draw()
17 points[2] -= points[3] - points[5]; in draw()
19 canvas->drawPoints(SkCanvas::kPolygon_PointMode, SK_ARRAY_COUNT(points), points, paint); in draw()
DIPoint_subtract_operator.cpp15 SkIPoint points[] = { { 3, 1 }, { 4, 2 }, { 5, 1 }, { 7, 3 } }; in draw() local
20 draw_lines(points, SK_ARRAY_COUNT(points), paint); in draw()
21 points[1] += points[0] - points[3]; in draw()
22 points[2] -= points[1] - points[0]; in draw()
24 draw_lines(points, SK_ARRAY_COUNT(points), paint); in draw()
DPath_IsCubicDegenerate.cpp7 SkPoint points[] = {{1, 0}, {0, 0}, {0, 0}, {0, 0}}; in draw() local
11 prior = points[0].fX; in draw()
13 if (SkPath::IsCubicDegenerate(points[0], points[1], points[2], points[3], false)) { in draw()
15 points[0].fX += step; in draw()
18 points[0].fX -= step; in draw()
20 } while (prior != points[0].fX); in draw()
DPath_getPoints.cpp7 auto debugster = [](const char* prefix, const SkPath& path, SkPoint* points, int max) -> void { in draw() argument
8 int count = path.getPoints(points, max); in draw()
10 for (int i = 0; i < std::min(count, max) && points; ++i) { in draw()
11 SkDebugf("(%1.8g,%1.8g) ", points[i].fX, points[i].fY); in draw()
18 SkPoint points[3]; in draw() local
20 debugster("zero max", path, points, 0); in draw()
21 debugster("too small", path, points, 2); in draw()
22 debugster("just right", path, points, path.countPoints()); in draw()
DPath_IsLineDegenerate.cpp7 SkPoint points[] = { {100, 100}, {100.000001f, 100.000001f}, {100.0001f, 100.0001f} }; in draw() local
8 for (size_t i = 0; i < SK_ARRAY_COUNT(points) - 1; ++i) { in draw()
11 points[i].fX, points[i].fY, points[i + 1].fX, points[i + 1].fY, in draw()
12 SkPath::IsLineDegenerate(points[i], points[i + 1], exact) in draw()
/external/skqp/tests/
DPathCoverageTest.cpp39 static inline int estimate_distance(const SkPoint points[]) { in estimate_distance() argument
40 return cheap_distance(points[1].fX * 2 - points[2].fX - points[0].fX, in estimate_distance()
41 points[1].fY * 2 - points[2].fY - points[0].fY); in estimate_distance()
44 static inline SkScalar compute_distance(const SkPoint points[]) { in compute_distance() argument
45 return SkPointPriv::DistanceToLineSegmentBetween(points[1], points[0], points[2]); in compute_distance()
69 static uint32_t quadraticPointCount_EE(const SkPoint points[]) { in quadraticPointCount_EE() argument
70 int distance = estimate_distance(points); in quadraticPointCount_EE()
74 static uint32_t quadraticPointCount_EC(const SkPoint points[], SkScalar tol) { in quadraticPointCount_EC() argument
75 int distance = estimate_distance(points); in quadraticPointCount_EC()
79 static uint32_t quadraticPointCount_CE(const SkPoint points[]) { in quadraticPointCount_CE() argument
[all …]
/external/skia/tests/
DPathCoverageTest.cpp39 static inline int estimate_distance(const SkPoint points[]) { in estimate_distance() argument
40 return cheap_distance(points[1].fX * 2 - points[2].fX - points[0].fX, in estimate_distance()
41 points[1].fY * 2 - points[2].fY - points[0].fY); in estimate_distance()
44 static inline SkScalar compute_distance(const SkPoint points[]) { in compute_distance() argument
45 return SkPointPriv::DistanceToLineSegmentBetween(points[1], points[0], points[2]); in compute_distance()
69 static uint32_t quadraticPointCount_EE(const SkPoint points[]) { in quadraticPointCount_EE() argument
70 int distance = estimate_distance(points); in quadraticPointCount_EE()
74 static uint32_t quadraticPointCount_EC(const SkPoint points[], SkScalar tol) { in quadraticPointCount_EC() argument
75 int distance = estimate_distance(points); in quadraticPointCount_EC()
79 static uint32_t quadraticPointCount_CE(const SkPoint points[]) { in quadraticPointCount_CE() argument
[all …]
/external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/paths/
DCatmullRom.java10 public float compute(float t, float[] points, int pointsCnt) { in compute() argument
18 return catmullRomSpline(points[0], points[0], points[1], points[2], t); in compute()
22 …return catmullRomSpline(points[pointsCnt-3], points[pointsCnt-2], points[pointsCnt-1], points[poin… in compute()
25 …return catmullRomSpline(points[segment-1], points[segment], points[segment+1], points[segment+2], … in compute()
/external/ImageMagick/PerlMagick/demo/
Dpiddle.pl16 $image->Draw(primitive=>'line',points=>"$i,0 $i,300",stroke=>"#ccf");
17 $image->Draw(primitive=>'line',points=>"0,$i 300,$i",stroke=>"#ccf");
23 strokewidth=>4,points=>'30,30 100,100 10,10');
27 $image->Draw(primitive=>'bezier',points=>'20,20, 100,50, 50,100, 160,160',
32 $image->Draw(primitive=>'line',points=>"10,200 20,190",stroke=>red);
37 points=>"170,70 200,70");
39 points=>'M170,70 v-30 a30,30 0 0,0 -30,30 z');
41 points=>"170,70 200,70");
46 points=>"160,120 130,190 210,145 110,145 190,190 160,120",stroke=>red,
51 $image->Draw(primitive=>'line',points=>'200,260 200,200',stroke=>yellow,
[all …]

12345678910>>...69