Home
last modified time | relevance | path

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

12345678910>>...167

/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/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/autotest/client/site_tests/graphics_dEQP/expectations/rogue/
DdEQP-GLES3.functional.NotSupported.bz2
/external/autotest/client/site_tests/graphics_dEQP/expectations/mali-t760/
Dgles3-master.NotSupported.bz2 ... GLES3.functional.transform_feedback.array.separate.points.highp_ivec3 73dEQP-GLES3.functional.transform_feedback ...
DdEQP-GLES3.functional.NotSupported.bz2 ... GLES3.functional.transform_feedback.array.separate.points.highp_ivec3 74dEQP-GLES3.functional.transform_feedback ...
/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/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/fonttools/Lib/fontTools/pens/
DbasePen.py58 def curveTo(self, *points): argument
59 """Draw a cubic bezier with an arbitrary number of control points.
62 (control) points. If the number of control points is > 2, the
66 Let n be the number of control points (which is the number of
75 points" principle. See also decomposeQuadraticSegment().
79 def qCurveTo(self, *points): argument
83 points.
86 using 'implied points': between each two consequtive off-curve points,
91 This is to support contours that have NO on-curve points (a rarely
128 def curveTo(self, *points): argument
[all …]
/external/autotest/client/site_tests/graphics_dEQP/expectations/skylake/
Dgles3-master.NotSupported.bz2 ... GLES3.functional.transform_feedback.array.separate.points.highp_mat3 64dEQP-GLES3.functional.transform_feedback ...
DdEQP-GLES3.functional.hasty.NotSupported.bz2 ... GLES3.functional.transform_feedback.array.separate.points.highp_mat3 65dEQP-GLES3.functional.transform_feedback ...
DdEQP-GLES3.functional.NotSupported.bz2
/external/opencv/cvaux/src/
Dcvcorrimages.cpp55 /* Create feature points on image and return number of them. Array points fills by found points */
56 int icvCreateFeaturePoints(IplImage *image, CvMat *points, CvMat *status) in icvCreateFeaturePoints() argument
68 if( image == 0 || points == 0 ) in icvCreateFeaturePoints()
84 if( !CV_IS_MAT(points) ) in icvCreateFeaturePoints()
86 CV_ERROR( CV_StsUnsupportedFormat, "Input parameter points must be a matrix" ); in icvCreateFeaturePoints()
90 needNumPoints = points->cols; in icvCreateFeaturePoints()
93 CV_ERROR( CV_StsOutOfRange, "Number of need points must be > 0" ); in icvCreateFeaturePoints()
96 if( points->rows != 2 ) in icvCreateFeaturePoints()
111 CV_ERROR( CV_StsUnmatchedSizes, "Size of points and statuses must be the same" ); in icvCreateFeaturePoints()
125 /* Create points */ in icvCreateFeaturePoints()
[all …]
/external/mesa3d/src/mesa/main/
Deval.c201 /*** Copy and deallocate control points ***/
206 * Copy 1-parametric evaluator control points from user-specified
207 * memory space to a buffer of contiguous control points.
209 * \return pointer to buffer of contiguous control points or NULL if out
213 const GLfloat *points ) in _mesa_copy_map_points1f() argument
218 if (!points || !size) in _mesa_copy_map_points1f()
224 for (i = 0, p = buffer; i < uorder; i++, points += ustride) in _mesa_copy_map_points1f()
226 *p++ = points[k]; in _mesa_copy_map_points1f()
237 const GLdouble *points ) in _mesa_copy_map_points1d() argument
242 if (!points || !size) in _mesa_copy_map_points1d()
[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/pdfium/xfa/fde/
Dcfde_path.cpp17 const std::vector<FX_PATHPOINT>& points = m_Path.GetPoints(); in FigureClosed() local
18 return points.empty() ? true : points.back().m_CloseFigure; in FigureClosed()
72 void CFDE_Path::AddBezier(const std::vector<CFX_PointF>& points) { in AddBezier() argument
73 if (points.size() != 4) in AddBezier()
76 MoveTo(points[0]); in AddBezier()
77 BezierTo(points[1], points[2], points[3]); in AddBezier()
80 void CFDE_Path::AddBeziers(const std::vector<CFX_PointF>& points) { in AddBeziers() argument
81 int32_t iCount = points.size(); in AddBeziers()
85 const CFX_PointF* p = points.data(); in AddBeziers()
92 void CFDE_Path::GetCurveTangents(const std::vector<CFX_PointF>& points, in GetCurveTangents() argument
[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/opencv/cv/src/
Dcvlinefit.cpp46 icvFitLine2D_wods( CvPoint2D32f * points, int _count, float *weights, float *line ) in icvFitLine2D_wods() argument
60 x += points[i].x; in icvFitLine2D_wods()
61 y += points[i].y; in icvFitLine2D_wods()
62 x2 += points[i].x * points[i].x; in icvFitLine2D_wods()
63 y2 += points[i].y * points[i].y; in icvFitLine2D_wods()
64 xy += points[i].x * points[i].y; in icvFitLine2D_wods()
72 x += weights[i] * points[i].x; in icvFitLine2D_wods()
73 y += weights[i] * points[i].y; in icvFitLine2D_wods()
74 x2 += weights[i] * points[i].x * points[i].x; in icvFitLine2D_wods()
75 y2 += weights[i] * points[i].y * points[i].y; in icvFitLine2D_wods()
[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/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/valgrind/memcheck/tests/solaris/
Dscalar_spawn.stderr.exp19 Syscall param spawn(path) points to unaddressable byte(s)
23 Syscall param spawn(attrs->ksa_version) points to unaddressable byte(s)
27 Syscall param spawn(attrs->ksa_size) points to unaddressable byte(s)
31 Syscall param spawn(attrs->ksa_attr_off) points to unaddressable byte(s)
35 Syscall param spawn(attrs->ksa_path_off) points to unaddressable byte(s)
39 Syscall param spawn(attrs->ksa_shell_off) points to unaddressable byte(s)
43 Syscall param spawn(argenv) points to unaddressable byte(s)
62 Syscall param spawn(path) points to unaddressable byte(s)
66 Syscall param spawn(attrs->ksa_version) points to uninitialised byte(s)
70 Syscall param spawn(attrs->ksa_size) points to uninitialised byte(s)
[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 points[1].distanceToLineSegmentBetween(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/core/
DSkPathRef.h25 * Holds the path verbs and points. It is versioned by a generation ID. None of its public methods
26 * modify the contents. To modify or append to the verbs/points wrap the SkPathRef in an
32 * The points and verbs are stored in a single allocation. The points are at the begining of the
33 * allocation while the verbs are stored at end of the allocation, in reverse order. Thus the points
50 * Returns the array of points.
52 SkPoint* points() { return fPathRef->getPoints(); } in points() function
53 const SkPoint* points() const { return fPathRef->points(); } in points() function
56 * Gets the ith point. Shortcut for this->points() + i
60 return this->points() + i; in atPoint()
64 return this->points() + i; in atPoint()
[all …]

12345678910>>...167