Home
last modified time | relevance | path

Searched full:points (Results 1 – 25 of 7992) sorted by relevance

12345678910>>...320

/external/rust/crates/plotters/plotters-doc-data/
D3d-plot.svg6 <polygon opacity="0.1" fill="#000000" points="406,599 406,76 152,146 152,669 "/>
7 <polyline fill="none" opacity="0.2" stroke="#000000" stroke-width="1" points="406,599 406,76 152,14…
8 <polyline fill="none" opacity="0.2" stroke="#000000" stroke-width="1" points="406,512 152,582 "/>
9 <polyline fill="none" opacity="0.2" stroke="#000000" stroke-width="1" points="406,425 152,494 "/>
10 <polyline fill="none" opacity="0.2" stroke="#000000" stroke-width="1" points="406,338 152,407 "/>
11 <polyline fill="none" opacity="0.2" stroke="#000000" stroke-width="1" points="406,251 152,320 "/>
12 <polyline fill="none" opacity="0.2" stroke="#000000" stroke-width="1" points="406,163 152,233 "/>
13 <polyline fill="none" opacity="0.2" stroke="#000000" stroke-width="1" points="406,76 152,146 "/>
14 <polyline fill="none" opacity="0.2" stroke="#000000" stroke-width="1" points="406,599 406,76 "/>
15 <polyline fill="none" opacity="0.2" stroke="#000000" stroke-width="1" points="364,611 364,88 "/>
[all …]
/external/chromium-trace/catapult/third_party/polymer/components/iron-image/demo/
Dpolymer.svg8 <polygon fill="#303F9F" points="84.157,143 42.878,214.5 84.157,286 125.436,214.5 "/>
9 <polygon fill="#3F51B5" points="331.842,0 290.561,71.5 331.842,143 373.121,71.5 "/>
10 <polygon fill="#7986CB" points="373.121,71.5 249.278,286 331.842,286 414.4,143 "/>
11 <polygon fill="#FF4081" points="249.278,0 84.157,286 166.721,286 331.842,0 "/>
12 <polygon fill="#536DFE" points="84.157,0 1.596,143 42.878,214.5 166.721,0 "/>
13 <polygon fill="#FFFFFF" fill-opacity="0.2" points="249.278,0 290.561,71.5 331.842,0 "/>
14 <polygon fill="#FFFFFF" fill-opacity="0.1" points="208,71.5 249.278,0 290.561,71.5 "/>
15 <polygon fill="#FFFFFF" fill-opacity="0" points="208,71.5 249.278,143 290.561,71.5 "/>
16 <polygon fill-opacity="0.1" points="166.721,143 208,71.5 249.278,143 "/>
17 <polygon fill-opacity="0.2" points="166.721,143 208,214.5 249.278,143 "/>
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/
DGaussianParametersGuesser.java32 * points.
39 /** Observed points. */
46 * Constructs instance with the specified observed points.
48 * @param observations observed points upon which should base guess
61 * Guesses the parameters based on the observed points.
73 * Guesses the parameters based on the specified observed points.
75 * @param points observed points upon which should base guess
79 private double[] basicGuess(WeightedObservedPoint[] points) { in basicGuess() argument
80 Arrays.sort(points, createWeightedObservedPointComparator()); in basicGuess()
83 int minYIdx = findMinY(points); in basicGuess()
[all …]
/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/chromium-trace/catapult/third_party/polymer/components/paper-dialog/
Dhero.svg13 <polygon points="0,124 0,126 2,126 "/>
14 <polygon points="0,111.6 0,114.4 11.6,126 14.4,126 "/>
15 <polygon points="0,99.1 0,101.9 24.1,126 26.9,126 "/>
16 <polygon points="0,86.6 0,89.5 36.5,126 39.4,126 "/>
17 <polygon points="0,74.2 0,77 49,126 51.8,126 "/>
18 <polygon points="0,61.7 0,64.5 61.5,126 64.3,126 "/>
19 <polygon points="0,49.2 0,52.1 73.9,126 76.8,126 "/>
20 <polygon points="0,36.8 0,39.6 86.4,126 89.2,126 "/>
21 <polygon points="0,24.3 0,27.1 98.9,126 101.7,126 "/>
22 <polygon points="75.2,87 74,87 74,85.8 0,11.8 0,14.7 111.3,126 114.2,126 "/>
[all …]
/external/compiler-rt/test/asan/TestCases/
Dcoverage-tracing.cc7 … 2>&1 | FileCheck %s --check-prefix=CHECK --check-prefix=CHECK1; mv trace-points.*.sancov $A.points
8 … 2>&1 | FileCheck %s --check-prefix=CHECK --check-prefix=CHECK2; mv trace-points.*.sancov $A.points
9 … 2>&1 | FileCheck %s --check-prefix=CHECK --check-prefix=CHECK2; mv trace-points.*.sancov $A.points
10 … 2>&1 | FileCheck %s --check-prefix=CHECK --check-prefix=CHECK3; mv trace-points.*.sancov $A.points
11 … 2>&1 | FileCheck %s --check-prefix=CHECK --check-prefix=CHECK3; mv trace-points.*.sancov $A.points
12 … 2>&1 | FileCheck %s --check-prefix=CHECK --check-prefix=CHECK4; mv trace-points.*.sancov $A.points
13 … 2>&1 | FileCheck %s --check-prefix=CHECK --check-prefix=CHECK4; mv trace-points.*.sancov $A.points
14 …>&1 | FileCheck %s --check-prefix=CHECK --check-prefix=CHECK301; mv trace-points.*.sancov $A.points
15 // RUN: diff f.points fff.points
16 // RUN: diff bf.points fb.points
[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/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/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/fonttools/Lib/fontTools/pens/
DbasePen.py59 def curveTo(self, *points: Tuple[float, float]) -> None:
60 """Draw a cubic bezier with an arbitrary number of control points.
63 (control) points. If the number of control points is > 2, the
67 Let n be the number of control points (which is the number of
76 points" principle. See also decomposeQuadraticSegment().
80 def qCurveTo(self, *points: Tuple[float, float]) -> None:
84 points.
87 using 'implied points': between each two consequtive off-curve points,
92 This is to support contours that have NO on-curve points (a rarely
133 def curveTo(self, *points): argument
[all …]
DpointPen.py10 steps through all the points in a call from glyph.drawPoints().
69 as points, do use this base implementation as it properly takes
87 (segmentType, points)
94 The 'points' field in the 2-tuple is a list of point info
103 The 'points' list of "move" and "line" segments always contains
110 points = self.currentPath
112 if not points:
114 if len(points) == 1:
116 pt, segmentType, smooth, name, kwargs = points[0]
121 if points[0][1] == "move":
[all …]
Dcu2quPen.py36 UFO2-style anchors (aka "named points") when using ufoLib >= 2.0,
83 def qCurveTo(self, *points): argument
85 n = len(points)
87 self.lineTo(points[0])
90 self.pen.qCurveTo(*points)
91 self.current_pt = points[-1]
103 def curveTo(self, *points): argument
105 n = len(points)
108 self._curve_to_quadratic(*points)
110 for segment in decomposeSuperBezierSegment(points):
[all …]
/external/chromium-trace/catapult/third_party/polymer/components/paper-dialog-behavior/
Dhero.svg13 <polygon points="76.7,98 79.2,98 74,91.1 74,94.4 "/>
14 <polygon points="74,81.4 74,84.7 84.1,98 86.6,98 "/>
15 <polygon points="74,71.7 74,75 91.5,98 94,98 "/>
16 <polygon points="74,62 74,65.3 98.9,98 101.4,98 "/>
17 <polygon points="94.3,79 92,79 92,76 74,52.3 74,55.6 106.2,98 108.7,98 "/>
18 <polygon points="92,69.6 92,66.3 74,42.6 74,45.9 "/>
19 <polygon points="101.7,79 99.2,79 113.6,98 116.1,98 "/>
20 <polygon points="92,59.9 92,56.6 74,32.9 74,36.2 "/>
21 <polygon points="109.1,79 106.5,79 121,98 123.5,98 "/>
22 <polygon points="92,50.2 92,47 92.1,47 77.7,28 75.2,28 "/>
[all …]
/external/angle/src/tests/compiler_tests/
DGeometryShader_test.cpp97 const std::string kInputLayout = "layout (points) in;\n";
98 const std::string kOutputLayout = "layout (points, max_vertices = 1) out;\n";
102 {"points", 1},
178 layout(points) in; in TEST_F()
179 layout(points, max_vertices = 1) out; in TEST_F()
197 layout(points, max_vertices = 1) out; in TEST_F()
209 // primitives except 'points'.
210 // Skip testing "points" as it can be used as both input and output primitives.
235 {"points", "lines", "lines_adjacency", "triangles", "triangles_adjacency"}}; in TEST_F()
264 layout (points, triangles) in; in TEST_F()
[all …]
/external/ms-tpm-20-ref/Samples/Nucleo-TPM/L4A6RG/Drivers/CMSIS/Include/
Darm_math.h205 * float32_t *pData; // points to the data of the matrix.
210 * The structure specifies the size of the matrix and then points to
236 * specifies the number of columns, and <code>pData</code> points to the
1032 …q7_t *pState; /**< points to the state variable array. The array is of length numTaps+b…
1033 q7_t *pCoeffs; /**< points to the coefficient array. The array is of length numTaps.*/
1042 …q15_t *pState; /**< points to the state variable array. The array is of length numTaps+…
1043 … q15_t *pCoeffs; /**< points to the coefficient array. The array is of length numTaps.*/
1052 …q31_t *pState; /**< points to the state variable array. The array is of length numTaps+…
1053 … q31_t *pCoeffs; /**< points to the coefficient array. The array is of length numTaps. */
1062 …float32_t *pState; /**< points to the state variable array. The array is of length numTaps+bloc…
[all …]
/external/ms-tpm-20-ref/Samples/Nucleo-TPM/L476RG/Drivers/CMSIS/Include/
Darm_math.h205 * float32_t *pData; // points to the data of the matrix.
210 * The structure specifies the size of the matrix and then points to
236 * specifies the number of columns, and <code>pData</code> points to the
1032 …q7_t *pState; /**< points to the state variable array. The array is of length numTaps+b…
1033 q7_t *pCoeffs; /**< points to the coefficient array. The array is of length numTaps.*/
1042 …q15_t *pState; /**< points to the state variable array. The array is of length numTaps+…
1043 … q15_t *pCoeffs; /**< points to the coefficient array. The array is of length numTaps.*/
1052 …q31_t *pState; /**< points to the state variable array. The array is of length numTaps+…
1053 … q31_t *pCoeffs; /**< points to the coefficient array. The array is of length numTaps. */
1062 …float32_t *pState; /**< points to the state variable array. The array is of length numTaps+bloc…
[all …]
/external/skqp/platform_tools/android/apps/skar_java/src/main/java/com/google/skar/examples/helloskar/app/
DFingerPainting.java41 // Points obtained by touching the screen. The first point is always brought to (0,0).
42 // All subsequent points are translated by the same amount.
43 private ArrayList<PointF> points = new ArrayList<>(); field in FingerPainting
45 // Indices in points array that indicate the start of a new path. E.g: if 5 is added to
46 // jumpPoints, then index 5 of the points array is the start of a new path (use moveTo())
55 // Previous point added to the path. This points belongs to the path in local space.
58 // Previous point added to the path. This points belongs to the path in global space (i.e Pose)
123 if (points.size() <= 1) { in buildPath()
163 points.clear(); in reset()
173 points.add(p); in addPoint()
[all …]
/external/llvm-project/llvm/unittests/tools/llvm-exegesis/
DClusteringTest.cpp31 std::vector<InstructionBenchmark> Points(6); in TEST() local
33 // Cluster around (x=0, y=1, z=2): points {0, 3}. in TEST()
34 Points[0].Measurements = { in TEST()
36 Points[3].Measurements = { in TEST()
38 // Cluster around (x=1, y=1, z=2): points {1, 4}. in TEST()
39 Points[1].Measurements = { in TEST()
41 Points[4].Measurements = { in TEST()
43 // Cluster around (x=0, y=0, z=0): points {5}, marked as noise. in TEST()
44 Points[5].Measurements = { in TEST()
46 // Error cluster: points {2} in TEST()
[all …]
/external/lottie/lottie/src/main/java/com/airbnb/lottie/model/layer/
DSolidLayer.java22 private final float[] points = new float[8]; field in SolidLayer
49 points[0] = 0; in drawLayer()
50 points[1] = 0; in drawLayer()
51 points[2] = layerModel.getSolidWidth(); in drawLayer()
52 points[3] = 0; in drawLayer()
53 points[4] = layerModel.getSolidWidth(); in drawLayer()
54 points[5] = layerModel.getSolidHeight(); in drawLayer()
55 points[6] = 0; in drawLayer()
56 points[7] = layerModel.getSolidHeight(); in drawLayer()
60 parentMatrix.mapPoints(points); in drawLayer()
[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/mesa3d/src/mesa/main/
Deval.c144 /*** Copy and deallocate control points ***/
149 * Copy 1-parametric evaluator control points from user-specified
150 * memory space to a buffer of contiguous control points.
152 * \return pointer to buffer of contiguous control points or NULL if out
156 const GLfloat *points ) in _mesa_copy_map_points1f() argument
161 if (!points || !size) in _mesa_copy_map_points1f()
167 for (i = 0, p = buffer; i < uorder; i++, points += ustride) in _mesa_copy_map_points1f()
169 *p++ = points[k]; in _mesa_copy_map_points1f()
180 const GLdouble *points ) in _mesa_copy_map_points1d() argument
185 if (!points || !size) in _mesa_copy_map_points1d()
[all …]
/external/rust/crates/plotters/src/element/
Dcandlestick.rs15 points: [(X, Y); 4], field
54 points: [ in new()
68 &self.points in point_iter()
75 points: I, in draw()
79 let mut points: Vec<_> = points.take(4).collect(); in draw() localVariable
80 if points.len() == 4 { in draw()
82 if points[0].1 > points[3].1 { in draw()
83 points.swap(0, 3); in draw()
90 backend.draw_line(points[0], points[1], &self.style)?; in draw()
91 backend.draw_line(points[2], points[3], &self.style)?; in draw()
[all …]
/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/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 …]

12345678910>>...320