/packages/apps/Camera2/tests_camera/src/com/android/camera/unittest/ |
CameraUnitTest.java | 30 float[] points; local 34 points = new float[] {-1000, -1000, 0, 0, 1000, 1000, 0, 1000, -750, 250}; 36 matrix.mapPoints(points); 37 assertEquals(expected, points); 40 points = new float[] {-1000, -1000, 0, 0, 1000, 1000, 0, 1000, -750, 250}; 42 matrix.mapPoints(points); 43 assertEquals(expected, points); 46 points = new float[] {-1000, -1000, 0, 0, 1000, 1000, 0, 1000, -750, 250}; 48 matrix.mapPoints(points); 49 assertEquals(expected, points); [all...] |
/external/autotest/client/site_tests/firmware_TouchMTB/tests/ |
geometry_unittest.py | 25 # a list of points: [center, radius] 36 # three points at the same coordinates 39 # two points at the same coordinates, a diagonal line 42 # two points at the same coordinates, a vertical line 45 # two points at the same coordinates, a vertical line, one outlier 52 # an equilateral triangle with a few points inside 57 # a list of random points: 59 # > points = [1,1; 1,0; 2,1; 2,2; 12,22; 11,21; 30,30; 31,30; 61 # > enclosingCircle(points) 66 # another list of random points [all...] |
/external/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/ |
DelaunayTriangulatorTest.java | 34 FloatArray points = new FloatArray(); field in class:DelaunayTriangulatorTest 66 points.clear(); 71 } while (points.contains(value)); 72 points.add(value); 75 } while (points.contains(value)); 76 points.add(value); 78 points.add(Gdx.input.getX()); 79 points.add(Gdx.graphics.getHeight() - Gdx.input.getY()); 81 triangles = trianglulator.computeTriangles(points, false); 89 for (int i = 0; i < points.size; i += 2 [all...] |
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/com/badlogic/gdx/physics/box2d/ |
Manifold.java | 23 final ManifoldPoint[] points = new ManifoldPoint[] {new ManifoldPoint(), new ManifoldPoint()}; field in class:Manifold 58 for (int i = 0; i < manifold.points.length; i++) { 59 points[i].contactID = manifold.points[i].id.getKey(); 60 points[i].localPoint.set(manifold.points[i].localPoint.x, manifold.points[i].localPoint.y); 61 points[i].normalImpulse = manifold.points[i].normalImpulse; 62 points[i].tangentImpulse = manifold.points[i].tangentImpulse [all...] |
/external/opencv3/samples/cpp/ |
minarea.cpp | 12 << "of points using functions: minAreaRect() minEnclosingTriangle() minEnclosingCircle().\n" 13 << "Random points are generated and then enclosed.\n\n" 14 << "Press ESC, 'q' or 'Q' to exit and any other key to regenerate the set of points.\n\n" 30 vector<Point> points; local 32 // Generate a random set of points 39 points.push_back(pt); 43 RotatedRect box = minAreaRect(Mat(points)); 48 minEnclosingTriangle(points, triangle); 53 minEnclosingCircle(Mat(points), center, radius); 54 box.points(vtx) [all...] |
convexhull.cpp | 28 vector<Point> points; local 36 points.push_back(pt); 40 convexHull(Mat(points), hull, true); 44 circle(img, points[i], 3, Scalar(0, 0, 255), FILLED, LINE_AA); 47 Point pt0 = points[hull[hullcount-1]]; 51 Point pt = points[hull[i]];
|
/external/valgrind/memcheck/tests/ |
execve1.stderr.exp-kfail | 1 Syscall param execve(filename) points to unaddressable byte(s) 5 Syscall param execve(argv[i]) points to unaddressable byte(s) 9 Syscall param execve(envp[i]) points to unaddressable byte(s)
|
execve2.stderr.exp-kfail | 1 Syscall param execve(filename) points to unaddressable byte(s)
|
buflen_check.stderr.exp-kfail | 1 Syscall param socketcall.getsockname(name) points to unaddressable byte(s) 5 Syscall param socketcall.getsockname(namelen_in) points to unaddressable byte(s)
|
/external/opencv3/modules/flann/include/opencv2/flann/ |
simplex_downhill.h | 38 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) 45 points[pos*n+i] = point[i]; 53 swap(points[j*n+i],points[(j-1)*n+i]); 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) [all...] |
/external/libgdx/gdx/src/com/badlogic/gdx/math/ |
Bezier.java | 117 public Array<T> points = new Array<T>(); field in class:Bezier 125 public Bezier (final T... points) { 126 set(points); 129 public Bezier (final T[] points, final int offset, final int length) { 130 set(points, offset, length); 133 public Bezier (final Array<T> points, final int offset, final int length) { 134 set(points, offset, length); 137 public Bezier set (final T... points) { 138 return set(points, 0, points.length) [all...] |
/external/chromium-trace/catapult/third_party/flot/ |
jquery.flot.fillbetween.min.js | 7 (function($){var options={series:{fillBetween:null}};function init(plot){function findBottomSeries(s,allseries){var i;for(i=0;i<allseries.length;++i){if(allseries[i].id===s.fillBetween){return allseries[i]}}if(typeof s.fillBetween==="number"){if(s.fillBetween<0||s.fillBetween>=allseries.length){return null}return allseries[s.fillBetween]}return null}function computeFillBottoms(plot,s,datapoints){if(s.fillBetween==null){return}var other=findBottomSeries(s,plot.getData());if(!other){return}var ps=datapoints.pointsize,points=datapoints.points,otherps=other.datapoints.pointsize,otherpoints=other.datapoints.points,newpoints=[],px,py,intery,qx,qy,bottom,withlines=s.lines.show,withbottom=ps>2&&datapoints.format[2].y,withsteps=withlines&&s.lines.steps,fromgap=true,i=0,j=0,l,m;while(true){if(i>=points.length){break}l=newpoints.length;if(points[i]==null){for(m=0;m<ps;++m){newpoints.push(points[i+m])}i+=ps}else if(j>=otherpoints.length){if(!withlines){for(m=0;m<ps;++m){newpoints.push(points[i+m])}}i+=ps}else if(otherpoints[j]==null){for(m=0;m<ps;++m){newpoints.push(null)}fromgap=true;j+=otherps}else{px=points[i];py=points[i+1];qx=otherpoints[j];qy=otherpoints[j+1];bottom=0;if(px===qx){for(m=0;m<ps;++m){newpoints.push(points[i+m])}bottom=qy;i+=ps;j+=otherps}else if(px>qx){if(withlines&&i>0&&points[i-ps]!=null){intery=py+( (…) [all...] |
jquery.flot.stack.min.js | 7 (function($){var options={series:{stack:null}};function init(plot){function findMatchingSeries(s,allseries){var res=null;for(var i=0;i<allseries.length;++i){if(s==allseries[i])break;if(allseries[i].stack==s.stack)res=allseries[i]}return res}function stackData(plot,s,datapoints){if(s.stack==null||s.stack===false)return;var other=findMatchingSeries(s,plot.getData());if(!other)return;var ps=datapoints.pointsize,points=datapoints.points,otherps=other.datapoints.pointsize,otherpoints=other.datapoints.points,newpoints=[],px,py,intery,qx,qy,bottom,withlines=s.lines.show,horizontal=s.bars.horizontal,withbottom=ps>2&&(horizontal?datapoints.format[2].x:datapoints.format[2].y),withsteps=withlines&&s.lines.steps,fromgap=true,keyOffset=horizontal?1:0,accumulateOffset=horizontal?0:1,i=0,j=0,l,m;while(true){if(i>=points.length)break;l=newpoints.length;if(points[i]==null){for(m=0;m<ps;++m)newpoints.push(points[i+m]);i+=ps}else if(j>=otherpoints.length){if(!withlines){for(m=0;m<ps;++m)newpoints.push(points[i+m])}i+=ps}else if(otherpoints[j]==null){for(m=0;m<ps;++m)newpoints.push(null);fromgap=true;j+=otherps}else{px=points[i+keyOffset];py=points[i+accumulateOffset];qx=otherpoints[j+keyOffset];qy=otherpoints[j+accumulateOffset];bottom=0;if(px==qx){for(m=0;m<ps;++m)newpoints.push(points[i+m]);newpoints[l+accumulateOffset]+=qy;bottom=qy;i+=ps;j+=otherps}else if(px>qx){if(withlines&&i> (…) [all...] |
/external/opencv3/samples/cpp/tutorial_code/calib3d/real_time_pose_estimation/src/ |
ModelRegistration.h | 33 /** The current number of registered points */ 35 /** The total number of points to register */ 37 /** The list of 2D points to register the model */ 39 /** The list of 3D points to register the model */
|
/external/speex/libspeex/ |
kiss_fftr.h | 31 input timedata has nfft scalar points 32 output freqdata has nfft/2+1 complex points 42 input freqdata has nfft/2+1 complex points 43 output timedata has nfft scalar points
|
/external/valgrind/memcheck/tests/solaris/ |
execx.stderr.exp | 1 Syscall param execve(filename) points to unaddressable byte(s)
|
/external/skia/src/utils/ |
SkPatchUtils.h | 19 * as a parameter to the function getVertexData which sets the points, colors and texture 45 // Enums for control points based on the order specified in the constructor (clockwise). 88 * Get the points corresponding to the top cubic of cubics. 90 static void getTopCubic(const SkPoint cubics[12], SkPoint points[4]); 93 * Get the points corresponding to the bottom cubic of cubics. 95 static void getBottomCubic(const SkPoint cubics[12], SkPoint points[4]); 98 * Get the points corresponding to the left cubic of cubics. 100 static void getLeftCubic(const SkPoint cubics[12], SkPoint points[4]); 103 * Get the points corresponding to the right cubic of cubics. 105 static void getRightCubic(const SkPoint cubics[12], SkPoint points[4]) [all...] |
/external/e2fsprogs/tests/f_bbinode/ |
expect.1 | 3 Entry 'a6' in / (2) points to inode (17) located in a bad block. 6 Entry 'a7' in / (2) points to inode (18) located in a bad block. 9 Entry 'a8' in / (2) points to inode (19) located in a bad block. 12 Entry 'b1' in / (2) points to inode (20) located in a bad block. 15 Entry 'b2' in / (2) points to inode (21) located in a bad block. 18 Entry 'b3' in / (2) points to inode (22) located in a bad block. 21 Entry 'b4' in / (2) points to inode (23) located in a bad block. 24 Entry 'b5' in / (2) points to inode (24) located in a bad block.
|
/external/opencv3/samples/python2/ |
gaussian_mix.py | 8 points = [] 16 points.append( pts ) 18 points = np.float32( np.vstack(points) ) 19 return points, ref_distrs 37 points, ref_distrs = make_gaussians(cluster_n, img_size) 41 em.train(points) 48 for x, y in np.int32(points):
|
/external/fonttools/Lib/fontTools/pens/ |
basePen.py | 58 def curveTo(self, *points): 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): 83 points. 86 using 'implied points': between each two consequtive off-curve points, [all...] |
/external/v8/src/ |
char-predicates.cc | 18 // This only works for code points in the SMPs, since ICU does not exclude 19 // code points with properties 'Pattern_Syntax' or 'Pattern_White_Space'. 20 // Code points in the SMP do not have those properties. 32 // This only works for code points in the SMPs, since ICU does not exclude 33 // code points with properties 'Pattern_Syntax' or 'Pattern_White_Space'. 34 // Code points in the SMP do not have those properties.
|
/external/opencv3/modules/java/common_test/src/org/opencv/test/utils/ |
ConvertersTest.java | 111 List<Point> points = new ArrayList<Point>(); local 113 Converters.Mat_to_vector_Point(src, points); 120 assertListPointEquals(truth, points, EPS); 126 List<Point> points = new ArrayList<Point>(); local 128 Converters.Mat_to_vector_Point2d(src, points); 135 assertListPointEquals(truth, points, EPS); 141 List<Point> points = new ArrayList<Point>(); local 143 Converters.Mat_to_vector_Point(src, points); 150 assertListPointEquals(truth, points, EPS); 156 List<Point3> points = new ArrayList<Point3>() local 171 List<Point3> points = new ArrayList<Point3>(); local 186 List<Point3> points = new ArrayList<Point3>(); local 201 List<Point3> points = new ArrayList<Point3>(); local 355 List<Point> points = new ArrayList<Point>(); local 377 List<Point> points = new ArrayList<Point>(); local 390 List<Point> points = new ArrayList<Point>(); local 403 List<Point3> points = new ArrayList<Point3>(); local 417 List<Point3> points = new ArrayList<Point3>(); local 430 List<Point3> points = new ArrayList<Point3>(); local 443 List<Point3> points = new ArrayList<Point3>(); local [all...] |
/external/skia/src/animator/ |
SkParseSVGPath.cpp | 31 //define our points 119 SkPoint points[3]; local 144 data = find_points(data, points, 1, relative, &c); 145 fPath.moveTo(points[0]); 147 c = points[0]; 150 data = find_points(data, points, 1, relative, &c); 151 fPath.lineTo(points[0]); 152 c = points[0]; 169 data = find_points(data, points, 3, relative, &c); 172 data = find_points(data, &points[1], 2, relative, &c) [all...] |
/external/libgdx/extensions/gdx-bullet/jni/swig-src/collision/com/badlogic/gdx/physics/bullet/collision/ |
btConvexPointCloudShape.java | 65 public btConvexPointCloudShape(btVector3 points, int numPoints, Vector3 localScaling, boolean computeAabb) { 66 this(CollisionJNI.new_btConvexPointCloudShape__SWIG_1(btVector3.getCPtr(points), points, numPoints, localScaling, computeAabb), true); 69 public btConvexPointCloudShape(btVector3 points, int numPoints, Vector3 localScaling) { 70 this(CollisionJNI.new_btConvexPointCloudShape__SWIG_2(btVector3.getCPtr(points), points, numPoints, localScaling), true); 73 public void setPoints(btVector3 points, int numPoints, boolean computeAabb, Vector3 localScaling) { 74 CollisionJNI.btConvexPointCloudShape_setPoints__SWIG_0(swigCPtr, this, btVector3.getCPtr(points), points, numPoints, computeAabb, localScaling); 77 public void setPoints(btVector3 points, int numPoints, boolean computeAabb) [all...] |
/external/opencv/cvaux/src/ |
cvcorrimages.cpp | 55 /* 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) 68 if( image == 0 || points == 0 ) 84 if( !CV_IS_MAT(points) ) 86 CV_ERROR( CV_StsUnsupportedFormat, "Input parameter points must be a matrix" ); 90 needNumPoints = points->cols; 93 CV_ERROR( CV_StsOutOfRange, "Number of need points must be > 0" ); 96 if( points->rows != 2 [all...] |