| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| BSpline.java | 28 * @param points The control points
32 public static <T extends Vector<T>> T cubic (final T out, final float t, final T[] points, final boolean continuous,
34 final int n = continuous ? points.length : points.length - 3;
38 return cubic(out, i, u, points, continuous, tmp);
44 * @param points The control points
48 public static <T extends Vector<T>> T cubic_derivative (final T out, final float t, final T[] points,
50 final int n = continuous ? points.length : points.length - 3
[all...] |
| /external/skia/src/utils/ |
| SkParsePath.cpp | 81 SkPoint points[3]; local
113 data = find_points(data, points, 1, relative, &c);
114 path.moveTo(points[0]);
117 c = points[0];
120 data = find_points(data, points, 1, relative, &c);
121 path.lineTo(points[0]);
122 c = points[0];
137 data = find_points(data, points, 3, relative, &c);
140 data = find_points(data, &points[1], 2, relative, &c);
141 points[0] = c
[all...] |
| /frameworks/base/core/java/android/gesture/ |
| GestureStroke.java | 31 * consists of a sequence of timed points. One or multiple strokes form a gesture.
39 public final float[] points; field in class:GestureStroke
45 * A constructor that constructs a gesture stroke from a list of gesture points.
47 * @param points
49 public GestureStroke(ArrayList<GesturePoint> points) {
50 final int count = points.size();
59 final GesturePoint p = points.get(i);
79 this.points = tmpPoints;
90 points = pts.clone();
96 return new GestureStroke(boundingBox, length, points, timestamps)
222 final ArrayList<GesturePoint> points = new ArrayList<GesturePoint>(count); local
[all...] |
| GestureUtils.java | 141 float[] strokepoints = stroke.points;
262 * points.
265 * @param numPoints the number of points
266 * @return the sampled points in the form of [x1, y1, x2, y2, ..., xn, yn]
273 float[] pts = stroke.points;
325 * Calculates the centroid of a set of points.
327 * @param points the points in the form of [x1, y1, x2, y2, ..., xn, yn]
330 static float[] computeCentroid(float[] points) {
333 int count = points.length
472 float[] points = new float[count * 2]; local
491 float[] points = new float[size]; local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| Cluster.java | 25 * Cluster holding a set of {@link Clusterable} points.
26 * @param <T> the type of points that can be clustered
35 /** The points contained in this cluster. */
36 private final List<T> points; field in class:Cluster
47 points = new ArrayList<T>();
55 points.add(point);
59 * Get the points contained in the cluster.
60 * @return points contained in the cluster
63 return points;
|
| /external/chromium-trace/catapult/third_party/flot/ |
| jquery.flot.errorbars.min.js | 7 (function($){var options={series:{points:{errorbars:null,xerr:{err:"x",show:null,asymmetric:null,upperCap:null,lowerCap:null,color:null,radius:null},yerr:{err:"y",show:null,asymmetric:null,upperCap:null,lowerCap:null,color:null,radius:null}}}};function processRawData(plot,series,data,datapoints){if(!series.points.errorbars)return;var format=[{x:true,number:true,required:true},{y:true,number:true,required:true}];var errors=series.points.errorbars;if(errors=="x"||errors=="xy"){if(series.points.xerr.asymmetric){format.push({x:true,number:true,required:true});format.push({x:true,number:true,required:true})}else format.push({x:true,number:true,required:true})}if(errors=="y"||errors=="xy"){if(series.points.yerr.asymmetric){format.push({y:true,number:true,required:true});format.push({y:true,number:true,required:true})}else format.push({y:true,number:true,required:true})}datapoints.format=format}function parseErrors(series,i){var points=series.datapoints.points;var exl=null,exu=null,eyl=null,eyu=null;var xerr=series.points.xerr,yerr=series.points.yerr;var eb=series.points.errorbars;if(eb=="x"||eb=="xy"){if(xerr.asymmetric){exl=points[i+2];exu=points[i+3];if(eb=="xy")if (…)
[all...] |
| jquery.flot.fillbetween.js | 25 extra data points might be inserted through interpolation. Note that at points
75 points = datapoints.points,
77 otherpoints = other.datapoints.points,
90 if ( i >= points.length ) {
96 if ( points[ i ] == null ) {
101 newpoints.push( points[ i + m ] );
108 // for lines, we can't use the rest of the points
112 newpoints.push( points[ i + m ] )
[all...] |
| jquery.flot.stack.js | 32 offset to the y value. For line series, extra data points are inserted through
66 points = datapoints.points,
68 otherpoints = other.datapoints.points,
81 if (i >= points.length)
86 if (points[i] == null) {
89 newpoints.push(points[i + m]);
93 // for lines, we can't use the rest of the points
96 newpoints.push(points[i + m]);
108 // cases where we actually got two points
[all...] |
| /external/opencv3/modules/calib3d/test/ |
| test_undistort_points.cpp | 15 void generate3DPointCloud(vector<Point3f>& points, Point3f pmin = Point3f(-1,
30 void CV_UndistortTest::generate3DPointCloud(vector<Point3f>& points, Point3f pmin, Point3f pmax)
33 for (size_t i = 0; i < points.size(); i++)
41 points[i] = p;
67 vector<Point3f> points(500);
68 generate3DPointCloud(points);
70 projectedPoints.resize(points.size());
76 projectPoints(Mat(points), Mat::zeros(3,1,CV_64FC1), Mat::zeros(3,1,CV_64FC1), intrinsics, distCoeffs, projectedPoints);
79 projectPoints(Mat(points), Mat::zeros(3,1,CV_64FC1), Mat::zeros(3,1,CV_64FC1), intrinsics, Mat::zeros(4,1,CV_64FC1), realUndistortedPoints);
|
| /external/autotest/client/site_tests/firmware_TouchMTB/geometry/ |
| minicircle.py | 5 """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 boundar
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/src/com/badlogic/gdx/physics/box2d/ |
| WorldManifold.java | 24 protected final Vector2[] points = {new Vector2(), new Vector2()}; field in class:WorldManifold
36 /** Returns the contact points of this manifold. Use getNumberOfContactPoints to determine how many contact points there are
39 return points;
48 /** @return the number of contact points */
|
| /external/pdfium/xfa/src/fdp/include/ |
| fde_pth.h | 17 virtual void AddBezier(const CFX_PointsF& points) = 0;
18 virtual void AddBeziers(const CFX_PointsF& points) = 0;
19 virtual void AddCurve(const CFX_PointsF& points,
23 virtual void AddLines(const CFX_PointsF& points) = 0;
26 virtual void AddPolygon(const CFX_PointsF& points) = 0;
|
| /external/skia/tests/ |
| PathCoverageTest.cpp | 26 // For determining the maximum possible number of points to use in
39 static inline int estimate_distance(const SkPoint points[]) {
40 return cheap_distance(points[1].fX * 2 - points[2].fX - points[0].fX,
41 points[1].fY * 2 - points[2].fY - points[0].fY);
44 static inline SkScalar compute_distance(const SkPoint points[]) {
45 return points[1].distanceToLineSegmentBetween(points[0], points[2])
[all...] |
| /external/mesa3d/src/mesa/main/ |
| eval.c | 201 /*** 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 )
218 if (!points || !size)
224 for (i = 0, p = buffer; i < uorder; i++, points += ustride)
226 *p++ = points[k];
237 const GLdouble *points )
242 if (!points || !size
437 map1(target, (GLfloat) u1, (GLfloat) u2, stride, order, points, GL_DOUBLE); local
542 (GLfloat) v1, (GLfloat) v2, vstride, vorder, points, GL_DOUBLE); local
[all...] |
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_image_homography.h | 67 Image points have to be of unit norm for the least squares to be meaningful.
75 /*Image points have to be of unit norm
94 If signed_disambiguation is true, the points are
95 required to be in front of the camera. No specific normalization of the homogenous points
105 takes the nr_points inhomogenous 2D points X to Xp,
119 0.9 microseconds with 2 points
120 1.0 microseconds with 3 points
121 1.1 microseconds with 4 points
122 1.3 microseconds with 5 points
123 1.4 microseconds with 6 points
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| LeastSquares.h | 19 * For a set of points, this function tries to express
23 * generality, for points in a space of arbitrary dimension, and also over
27 * So let us work with the following set of 5 points given by their
30 Vector3d points[5];
31 points[0] = Vector3d( 3.02, 6.89, -4.32 );
32 points[1] = Vector3d( 2.01, 5.39, -3.79 );
33 points[2] = Vector3d( 2.41, 6.01, -4.01 );
34 points[3] = Vector3d( 2.09, 5.55, -3.86 );
35 points[4] = Vector3d( 2.58, 6.32, -4.10 );
42 * best the five above points. To do that, call this function as follows
[all...] |
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_image_homography.h | 67 Image points have to be of unit norm for the least squares to be meaningful.
75 /*Image points have to be of unit norm
94 If signed_disambiguation is true, the points are
95 required to be in front of the camera. No specific normalization of the homogenous points
105 takes the nr_points inhomogenous 2D points X to Xp,
119 0.9 microseconds with 2 points
120 1.0 microseconds with 3 points
121 1.1 microseconds with 4 points
122 1.3 microseconds with 5 points
123 1.4 microseconds with 6 points
[all...] |
| /developers/build/prebuilts/gradle/SpeedTracker/Application/src/main/java/com/example/android/wearable/speedtracker/ |
| LocationDataManager.java | 45 * objects for the day that the {@link java.util.Calendar} object points at. Internally it uses
54 List<LocationEntry> points = mDbHelper.read(calendar); local
55 mPointsMap.put(day, points);
79 List<LocationEntry> points = getPoints(entry.calendar); local
80 if (points == null || points.isEmpty()) {
82 if (points == null) {
83 points = new ArrayList<LocationEntry>();
85 points.add(entry);
86 mPointsMap.put(entry.day, points);
[all...] |
| /developers/samples/android/wearable/wear/SpeedTracker/Application/src/main/java/com/example/android/wearable/speedtracker/ |
| LocationDataManager.java | 45 * objects for the day that the {@link java.util.Calendar} object points at. Internally it uses
54 List<LocationEntry> points = mDbHelper.read(calendar); local
55 mPointsMap.put(day, points);
79 List<LocationEntry> points = getPoints(entry.calendar); local
80 if (points == null || points.isEmpty()) {
82 if (points == null) {
83 points = new ArrayList<LocationEntry>();
85 points.add(entry);
86 mPointsMap.put(entry.day, points);
[all...] |
| /development/samples/browseable/SpeedTracker/Application/src/com.example.android.wearable.speedtracker/ |
| LocationDataManager.java | 45 * objects for the day that the {@link java.util.Calendar} object points at. Internally it uses
54 List<LocationEntry> points = mDbHelper.read(calendar); local
55 mPointsMap.put(day, points);
79 List<LocationEntry> points = getPoints(entry.calendar); local
80 if (points == null || points.isEmpty()) {
82 if (points == null) {
83 points = new ArrayList<LocationEntry>();
85 points.add(entry);
86 mPointsMap.put(entry.day, points);
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/ |
| Manifold.java | 57 /** The points of contact. */
58 public final ManifoldPoint[] points; field in class:Manifold
68 /** The number of manifold points. */
72 * creates a manifold with 0 points, with it's points array full of instantiated ManifoldPoints.
75 points = new ManifoldPoint[Settings.maxManifoldPoints];
77 points[i] = new ManifoldPoint();
90 points = new ManifoldPoint[Settings.maxManifoldPoints];
97 points[i] = new ManifoldPoint(other.points[i])
[all...] |
| /external/opencv3/modules/features2d/perf/opencl/ |
| perf_fast.cpp | 37 vector<KeyPoint> points; local
39 OCL_TEST_CYCLE() fd->detect(frame, points);
41 SANITY_CHECK_KEYPOINTS(points);
|
| /external/opencv3/modules/features2d/perf/ |
| perf_fast.cpp | 35 vector<KeyPoint> points; local
37 TEST_CYCLE() fd->detect(frame, points);
39 SANITY_CHECK_KEYPOINTS(points);
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue177/ |
| Points.java | 20 public class Points {
21 public Map<String, PointBean> points; field in class:Points
25 return "All Points";
|
| /external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
| TweenPath.java | 17 * @param points The waypoints of the tween, from start to target values.
18 * @param pointsCnt The number of valid points in the array.
21 public float compute(float t, float[] points, int pointsCnt);
|
