Home
last modified time | relevance | path

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

12345678910>>...234

/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/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/autotest/client/site_tests/firmware_TouchMTB/geometry/
Dtwo_farthest_clusters.py5 """Classify a set of points into two farthest clusters
7 - get_two_farthest_clusters(): Classify the points into two farthest clusters
18 def get_two_farthest_points(points): argument
19 """Calculate two farthest points from the list of given points.
21 Use a dumb brute force search for now since there are only a few points
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
[all …]
Dminicircle.py5 """minicircle: calculating the minimal enclosing circle given a set of points
12 - get_two_farthest_clusters(): Classify the points into two farthest clusters
38 """Derive the mini circle enclosing arbitrary three points, A, B, C.
46 # (1) the 3 points are on the same line
47 # (2) any 2 points are located at the same coordinate
48 # (3) all 3 points are located at the same coordinate
77 @param R: boundary points, a set of points which should be on the boundary
96 @param P: a set of points that should be enclosed in the circle to be built
97 @param R: boundary points, a set of points which should be on the boundary
113 def _make_Set_of_Points(points): argument
[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/fonttools/Lib/fontTools/pens/
DbasePen.py59 def curveTo(self, *points): argument
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): argument
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
129 def curveTo(self, *points): argument
[all …]
DpointPen.py10 steps through all the points in a call from glyph.drawPoints().
57 as points, do use this base implementation as it properly takes
75 (segmentType, points)
82 The 'points' field in the 2-tuple is a list of point info
91 The 'points' list of "move" and "line" segments always contains
98 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":
[all …]
/external/angle/src/tests/compiler_tests/
DGeometryShader_test.cpp98 const std::string kInputLayout = "layout (points) in;\n";
99 const std::string kOutputLayout = "layout (points, max_vertices = 1) out;\n";
103 {"points", 1},
179 layout(points) in; in TEST_F()
180 layout(points, max_vertices = 1) out; in TEST_F()
198 layout(points, max_vertices = 1) out; in TEST_F()
210 // primitives except 'points'.
211 // Skip testing "points" as it can be used as both input and output primitives.
236 {"points", "lines", "lines_adjacency", "triangles", "triangles_adjacency"}}; in TEST_F()
265 layout (points, triangles) in; in TEST_F()
[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/skia/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/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/boringssl/src/third_party/wycheproof_testvectors/
Dx25519_test.txt24 # Curve25519 or its twist contains some points of low order. This test vector
35 # Public keys are either points on curve25519 or points on its twist.
47 # Public keys are either points on curve25519 or points on its twist.
59 # Public keys are either points on curve25519 or points on its twist.
71 # Public keys are either points on curve25519 or points on its twist.
83 # Public keys are either points on curve25519 or points on its twist.
115 # Public keys are either points on curve25519 or points on its twist.
127 # Public keys are either points on curve25519 or points on its twist.
139 # Public keys are either points on curve25519 or points on its twist.
151 # Public keys are either points on curve25519 or points on its twist.
[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/swiftshader/third_party/llvm-7.0/llvm/unittests/tools/llvm-exegesis/
DClusteringTest.cpp26 std::vector<InstructionBenchmark> Points(6); in TEST() local
28 // Cluster around (x=0, y=1, z=2): points {0, 3}. in TEST()
29 Points[0].Measurements = {{"x", 0.01, ""}, {"y", 1.02, ""}, {"z", 1.98, "A"}}; in TEST()
30 Points[3].Measurements = {{"x", -0.01, ""}, {"y", 1.02, ""}, {"z", 1.98, ""}}; in TEST()
31 // Cluster around (x=1, y=1, z=2): points {1, 4}. in TEST()
32 Points[1].Measurements = {{"x", 1.01, ""}, {"y", 1.02, ""}, {"z", 1.98, ""}}; in TEST()
33 Points[4].Measurements = {{"x", 0.99, ""}, {"y", 1.02, ""}, {"z", 1.98, ""}}; in TEST()
34 // Cluster around (x=0, y=0, z=0): points {5}, marked as noise. in TEST()
35 Points[5].Measurements = {{"x", 0.0, ""}, {"y", 0.01, ""}, {"z", -0.02, ""}}; in TEST()
36 // Error cluster: points {2} in TEST()
[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/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/skqp/tests/
DPathCoverageTest.cpp26 // For determining the maximum possible number of points to use in
39 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()
[all …]
/external/skia/tests/
DPathCoverageTest.cpp26 // For determining the maximum possible number of points to use in
39 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()
[all …]
/external/skia/include/private/
DSkPathRef.h27 * Holds the path verbs and points. It is versioned by a generation ID. None of its public methods
28 * modify the contents. To modify or append to the verbs/points wrap the SkPathRef in an
34 * The points and verbs are stored in a single allocation. The points are at the begining of the
35 * allocation while the verbs are stored at end of the allocation, in reverse order. Thus the points
52 * Returns the array of points.
55 const SkPoint* points() const { return fPathRef->points(); } in points() function
58 * Gets the ith point. Shortcut for this->points() + i
64 * Adds the verb and allocates space for the number of points indicated by the verb. The
65 * return value is a pointer to where the points for the verb should be written.
75 * requisite points & weights.
[all …]

12345678910>>...234