Home
last modified time | relevance | path

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

12345678910>>...366

/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/angle/build/util/lib/proto/
Ddata_points_unittests.py16 points = DataPoints("a")
17 self.assertEqual(points.dump().name, "a")
18 self.assertEqual(len(points.dump().points.points), 0)
21 points = DataPoints("b")
22 points.record(101)
23 self.assertEqual(points.dump().name, "b")
24 self.assertEqual(len(points.dump().points.points), 1)
25 self.assertEqual(points.dump().points.points[0].value, 101)
28 points = DataPoints("c")
29 points.record(1)
[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/icu4j/main/core/src/test/resources/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/cronet/third_party/icu/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/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/zxing/core/src/main/java/com/google/zxing/datamatrix/detector/
DDetector.java52 ResultPoint[] points = detectSolid1(cornerPoints); in detect() local
53 points = detectSolid2(points); in detect()
54 points[3] = correctTopRight(points); in detect()
55 if (points[3] == null) { in detect()
58 points = shiftToModuleCenter(points); in detect()
60 ResultPoint topLeft = points[0]; in detect()
61 ResultPoint bottomLeft = points[1]; in detect()
62 ResultPoint bottomRight = points[2]; in detect()
63 ResultPoint topRight = points[3]; in detect()
135 ResultPoint[] points = {pointD, pointA, pointB, pointC}; in detectSolid1() local
[all …]
/external/fonttools/Lib/fontTools/pens/
DbasePen.py73 def curveTo(self, *points: Tuple[float, float]) -> None:
74 """Draw a cubic bezier with an arbitrary number of control points.
77 (control) points. If the number of control points is > 2, the
81 Let n be the number of control points (which is the number of
90 points" principle. See also decomposeQuadraticSegment().
94 def qCurveTo(self, *points: Tuple[float, float]) -> None:
98 points.
101 using 'implied points': between each two consequtive off-curve points,
106 This is to support contours that have NO on-curve points (a rarely
159 def curveTo(self, *points): argument
[all …]
DpointPen.py10 steps through all the points in a call from glyph.drawPoints().
86 as points, do use this base implementation as it properly takes
105 (segmentType, points)
112 The 'points' field in the 2-tuple is a list of point info
121 The 'points' list of "move" and "line" segments always contains
129 points = self.currentPath
131 if not points:
133 if len(points) == 1:
135 pt, segmentType, smooth, name, kwargs = points[0]
140 if points[0][1] == "move":
[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},
181 layout(points) in; in TEST_F()
182 layout(points, max_vertices = 1) out; in TEST_F()
200 layout(points, max_vertices = 1) out; in TEST_F()
212 // primitives except 'points'.
213 // Skip testing "points" as it can be used as both input and output primitives.
238 {"points", "lines", "lines_adjacency", "triangles", "triangles_adjacency"}}; in TEST_F()
267 layout (points, triangles) in; in TEST_F()
[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/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/apache-commons-math/src/main/java/org/apache/commons/math3/optimization/fitting/
DGaussianFitter.java34 * Fits points to a {@link
71 * Fits a Gaussian function to the observed points.
80 * observed points (in the same order as above).
116 * Fits a Gaussian function to the observed points.
119 * observed points (in the same order as above).
129 * based on the specified observed points.
140 * Constructs instance with the specified observed points.
142 * @param observations Observed points from which to guess the
231 * Guesses the parameters based on the specified observed points.
233 * @param points Observed points, sorted.
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math3/fitting/
DGaussianFitter.java33 * Fits points to a {@link org.apache.commons.math3.analysis.function.Gaussian.Parametric Gaussian}
72 * Fits a Gaussian function to the observed points.
81 * @return the parameters of the Gaussian function that best fits the observed points (in the
121 * Fits a Gaussian function to the observed points.
123 * @return the parameters of the Gaussian function that best fits the observed points (in the
134 * observed points.
147 * Constructs instance with the specified observed points.
149 * @param observations Observed points from which to guess the parameters of the Gaussian.
234 * Guesses the parameters based on the specified observed points.
236 * @param points Observed points, sorted.
[all …]
DGaussianCurveFitter.java38 * Fits points to a {@link org.apache.commons.math3.analysis.function.Gaussian.Parametric Gaussian}
180 // observed points. in getProblem()
194 * observed points.
207 * Constructs instance with the specified observed points.
209 * @param observations Observed points from which to guess the parameters of the Gaussian.
297 * Guesses the parameters based on the specified observed points.
299 * @param points Observed points, sorted.
302 private double[] basicGuess(WeightedObservedPoint[] points) { in basicGuess() argument
303 final int maxYIdx = findMaxY(points); in basicGuess()
304 final double n = points[maxYIdx].getY(); in basicGuess()
[all …]
/external/deqp/android/cts/main/vk-main-2021-03-01/
Drasterization.txt14 dEQP-VK.rasterization.conservative.overestimate.samples_1.points.normal.0_00
15 dEQP-VK.rasterization.conservative.overestimate.samples_1.points.normal.0_25
16 dEQP-VK.rasterization.conservative.overestimate.samples_1.points.normal.0_50
17 dEQP-VK.rasterization.conservative.overestimate.samples_1.points.normal.0_75
18 dEQP-VK.rasterization.conservative.overestimate.samples_1.points.normal.1_00
19 dEQP-VK.rasterization.conservative.overestimate.samples_1.points.normal.2_00
20 dEQP-VK.rasterization.conservative.overestimate.samples_1.points.normal.4_00
21 dEQP-VK.rasterization.conservative.overestimate.samples_1.points.normal.max
22 dEQP-VK.rasterization.conservative.overestimate.samples_1.points.normal.min
49 dEQP-VK.rasterization.conservative.overestimate.samples_16.points.normal.0_00
[all …]
/external/zxing/core/src/main/java/com/google/zxing/common/
DGridSampler.java23 * image, sample the right points in the image to reconstruct the QR code, accounting for
60 * transformation is determined by the coordinates of 4 points, in the original and transformed
82 * @return {@link BitMatrix} representing a grid of points sampled from the image within a region
85 * by the given points is invalid or results in sampling outside the image boundaries
105 * <p>Checks a set of points that have been transformed to sample points on an image against
112 * <p>For efficiency, the method will check points from either end of the line until one is found
113 * to be within the image. Because the set of points are assumed to be linear, this is valid.</p>
115 * @param image image into which the points should map
116 * @param points actual points in x1,y1,...,xn,yn form
120 float[] points) throws NotFoundException { in checkAndNudgePoints() argument
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/hull/
DAbstractConvexHullGenerator2D.java37 /** Tolerance below which points are considered identical. */
41 * Indicates if collinear points on the hull shall be present in the output.
42 * If {@code false}, only the extreme points are added to the hull.
49 * The default tolerance (1e-10) will be used to determine identical points.
51 * @param includeCollinearPoints indicates if collinear points on the hull shall be
61 * @param includeCollinearPoints indicates if collinear points on the hull shall be
63 * @param tolerance tolerance below which points are considered identical
71 * Get the tolerance below which points are considered identical.
72 * @return the tolerance below which points are considered identical
79 * Returns if collinear points on the hull will be added as hull vertices.
[all …]
/external/mesa3d/src/glx/
Deval.c18 const GLfloat * points, GLubyte * pc) in __glFillMap1f() argument
22 __GLX_PUT_FLOAT_ARRAY(0, points, order * k); in __glFillMap1f()
28 __GLX_PUT_FLOAT_ARRAY(0, points, k); in __glFillMap1f()
29 points += stride; in __glFillMap1f()
37 const GLdouble * points, GLubyte * pc) in __glFillMap1d() argument
41 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k); in __glFillMap1d()
46 __GLX_PUT_DOUBLE_ARRAY(0, points, k); in __glFillMap1d()
47 points += stride; in __glFillMap1d()
56 const GLfloat * points, GLfloat * data) in __glFillMap2f() argument
62 __GLX_MEM_COPY(data, points, majorOrder * majorStride * in __glFillMap2f()
[all …]
/external/skia/bench/
DHairlinePathBench.cpp26 static const int points[] = { variable
90 int size = std::size(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 = std::size(points); in makePath()
133 path->moveTo(SkIntToScalar(points[base1] + xTrans), in makePath()
[all …]

12345678910>>...366