Home
last modified time | relevance | path

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

12345678910>>...169

/external/chromium-trace/catapult/tracing/tracing/ui/tracks/
Dmemory_dump_track_util_test.html70 assert.lengthOf(sa.points, 4);
71 assert.lengthOf(sb.points, 4);
72 assert.lengthOf(sc.points, 4);
77 assert.equal(sa.points[0].x, 0);
78 assert.equal(sb.points[0].x, 0);
79 assert.equal(sc.points[0].x, 0);
80 assert.equal(sa.points[0].y, 111);
81 assert.equal(sb.points[0].y, 111);
82 assert.equal(sc.points[0].y, 111);
83 assert.equal(sa.points[0].yBase, 0);
[all …]
Dchart_series.html48 // Minimum distance between points in physical pixels. Points which are
52 // Density in points per physical pixel at which unselected point dots
56 // Density in points per physical pixel at which unselected point dots
79 * A series of points corresponding to a single chart on a chart track.
84 function ChartSeries(points, axis, opt_renderingConfig) {
85 this.points = points;
110 this.points.forEach(function(point) {
117 if (this.points === undefined || this.points.length === 0)
132 // Draw the points.
151 // Find the index of the first and last (partially) visible points.
[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/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/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/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/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/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/chromium-trace/catapult/third_party/flot/
Djquery.flot.errorbars.js11 This plugin allows you to plot error-bars over points. Set "errorbars" inside
12 the points series to the axis name over which there will be error values in
19 points: {
57 Color and radius both default to the same ones of the points series if not
60 points (with radius: 0), and still showing end caps on the error-bars.
61 shadowSize and lineWidth are derived as well from the points series.
68 points: { property
77 if (!series.points.errorbars)
86 var errors = series.points.errorbars;
90 if (series.points.xerr.asymmetric) {
[all …]
Djquery.flot.errorbars.min.js7 …points:{errorbars:null,xerr:{err:"x",show:null,asymmetric:null,upperCap:null,lowerCap:null,color:n… property
/external/opencv3/modules/java/common_test/src/org/opencv/test/utils/
DConvertersTest.java111 List<Point> points = new ArrayList<Point>(); in testMat_to_vector_Point() local
113 Converters.Mat_to_vector_Point(src, points); in testMat_to_vector_Point()
120 assertListPointEquals(truth, points, EPS); in testMat_to_vector_Point()
126 List<Point> points = new ArrayList<Point>(); in testMat_to_vector_Point2d() local
128 Converters.Mat_to_vector_Point2d(src, points); in testMat_to_vector_Point2d()
135 assertListPointEquals(truth, points, EPS); in testMat_to_vector_Point2d()
141 List<Point> points = new ArrayList<Point>(); in testMat_to_vector_Point2f() local
143 Converters.Mat_to_vector_Point(src, points); in testMat_to_vector_Point2f()
150 assertListPointEquals(truth, points, EPS); in testMat_to_vector_Point2f()
156 List<Point3> points = new ArrayList<Point3>(); in testMat_to_vector_Point3() local
[all …]
/external/skia/src/animator/
DSkParseSVGPath.cpp31 //define our points in quadApprox()
119 SkPoint points[3]; in parseSVG() local
144 data = find_points(data, points, 1, relative, &c); in parseSVG()
145 fPath.moveTo(points[0]); in parseSVG()
147 c = points[0]; in parseSVG()
150 data = find_points(data, points, 1, relative, &c); in parseSVG()
151 fPath.lineTo(points[0]); in parseSVG()
152 c = points[0]; in parseSVG()
169 data = find_points(data, points, 3, relative, &c); in parseSVG()
172 data = find_points(data, &points[1], 2, relative, &c); in parseSVG()
[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/src/fxbarcode/qrcode/
DBC_QRGridSampler.cpp34 CFX_FloatArray* points, in CheckAndNudgePoints() argument
40 for (offset = 0; offset < points->GetSize() && nudged; offset += 2) { in CheckAndNudgePoints()
41 int32_t x = (int32_t)(*points)[offset]; in CheckAndNudgePoints()
42 int32_t y = (int32_t)(*points)[offset + 1]; in CheckAndNudgePoints()
49 (*points)[offset] = 0.0f; in CheckAndNudgePoints()
52 (*points)[offset] = (FX_FLOAT)(width - 1); in CheckAndNudgePoints()
56 (*points)[offset + 1] = 0.0f; in CheckAndNudgePoints()
59 (*points)[offset + 1] = (FX_FLOAT)(height - 1); in CheckAndNudgePoints()
64 for (offset = (*points).GetSize() - 2; offset >= 0 && nudged; offset -= 2) { in CheckAndNudgePoints()
65 int32_t x = (int32_t)(*points)[offset]; in CheckAndNudgePoints()
[all …]
/external/opencv3/modules/flann/include/opencv2/flann/
Dsimplex_downhill.h38 Adds val to array vals (and point to array points) and keeping the arrays sorted by vals.
41 void addValue(int pos, float val, float* vals, T* point, T* points, int n) in addValue() argument
45 points[pos*n+i] = point[i]; in addValue()
53 swap(points[j*n+i],points[(j-1)*n+i]); in addValue()
62 Preconditions: points is a 2D mattrix of size (n+1) x n
64 vals is the cost function in the n+1 simplex points, if NULL it will be computed
66 Postcondition: returns optimum value and points[0..n] are the optimum parameters
69 float optimizeSimplexDownhill(T* points, int n, F func, float* vals = NULL )
88 float val = func(points+i*n);
89 addValue(i, val, vals, points+i*n, points, n);
[all …]
/external/opencv3/modules/imgproc/src/
Dlinefit.cpp48 static void fitLine2D_wods( const Point2f* points, int count, float *weights, float *line ) in fitLine2D_wods() argument
60 x += points[i].x; in fitLine2D_wods()
61 y += points[i].y; in fitLine2D_wods()
62 x2 += points[i].x * points[i].x; in fitLine2D_wods()
63 y2 += points[i].y * points[i].y; in fitLine2D_wods()
64 xy += points[i].x * points[i].y; in fitLine2D_wods()
72 x += weights[i] * points[i].x; in fitLine2D_wods()
73 y += weights[i] * points[i].y; in fitLine2D_wods()
74 x2 += weights[i] * points[i].x * points[i].x; in fitLine2D_wods()
75 y2 += weights[i] * points[i].y * points[i].y; in fitLine2D_wods()
[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/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/opencv3/samples/cpp/
Dlkdemo.cpp21 "\tc - delete all the points\n" in help()
65 vector<Point2f> points[2]; in main() local
82 goodFeaturesToTrack(gray, points[1], MAX_COUNT, 0.01, 10, Mat(), 3, 0, 0.04); in main()
83 cornerSubPix(gray, points[1], subPixWinSize, Size(-1,-1), termcrit); in main()
86 else if( !points[0].empty() ) in main()
92 calcOpticalFlowPyrLK(prevGray, gray, points[0], points[1], status, err, winSize, in main()
95 for( i = k = 0; i < points[1].size(); i++ ) in main()
99 if( norm(point - points[1][i]) <= 5 ) in main()
109 points[1][k++] = points[1][i]; in main()
110 circle( image, points[1][i], 3, Scalar(0,255,0), -1, 8); in main()
[all …]
/external/skia/include/core/
DSkPathRef.h24 * Holds the path verbs and points. It is versioned by a generation ID. None of its public methods
25 * modify the contents. To modify or append to the verbs/points wrap the SkPathRef in an
31 * The points and verbs are stored in a single allocation. The points are at the begining of the
32 * allocation while the verbs are stored at end of the allocation, in reverse order. Thus the points
49 * Returns the array of points.
51 SkPoint* points() { return fPathRef->getPoints(); } in points() function
52 const SkPoint* points() const { return fPathRef->points(); } in points() function
55 * Gets the ith point. Shortcut for this->points() + i
59 return this->points() + i; in atPoint()
63 return this->points() + i; in atPoint()
[all …]
/external/skia/src/utils/
DSkParsePath.cpp81 SkPoint points[3]; in FromSVGString() local
113 data = find_points(data, points, 1, relative, &c); in FromSVGString()
114 path.moveTo(points[0]); in FromSVGString()
117 c = points[0]; in FromSVGString()
120 data = find_points(data, points, 1, relative, &c); in FromSVGString()
121 path.lineTo(points[0]); in FromSVGString()
122 c = points[0]; in FromSVGString()
137 data = find_points(data, points, 3, relative, &c); in FromSVGString()
140 data = find_points(data, &points[1], 2, relative, &c); in FromSVGString()
141 points[0] = c; in FromSVGString()
[all …]

12345678910>>...169