HomeSort by relevance Sort by last modified time
    Searched full:points (Results 326 - 350 of 7862) sorted by null

<<11121314151617181920>>

  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/base/
ftgloadr.c 110 FT_FREE( loader->base.outline.points );
149 current->points = base->points + base->n_points;
153 /* handle extra points table - if any */
198 /* it DOESN'T change the number of points within the loader! */
214 /* check points & tags */
226 if ( FT_RENEW_ARRAY( base->points, old_max, new_max ) ||
380 FT_ARRAY_COPY( out->points, in->points,
387 /* do we need to copy the extra points? *
    [all...]
  /external/pdfium/third_party/freetype/src/base/
ftgloadr.c 110 FT_FREE( loader->base.outline.points );
149 current->points = base->points + base->n_points;
153 /* handle extra points table - if any */
198 /* it DOESN'T change the number of points within the loader! */
214 /* check points & tags */
226 if ( FT_RENEW_ARRAY( base->points, old_max, new_max ) ||
380 FT_ARRAY_COPY( out->points, in->points,
387 /* do we need to copy the extra points? *
    [all...]
  /external/skia/gm/
dcshader.cpp 177 struct Points : public Prim {
178 Points(SkCanvas::PointMode mode) : fMode(mode) {}
182 SkPoint points[500]; variable
184 int count = SkToInt(SK_ARRAY_COUNT(points));
189 points[p].fX = random.nextUScalar1() * bounds.width();
190 points[p].fY = random.nextUScalar1() * bounds.width();
192 canvas->drawPoints(fMode, count, points, paint);
224 fPrims.push_back(new Points(SkCanvas::kPoints_PointMode));
225 fPrims.push_back(new Points(SkCanvas::kLines_PointMode));
226 fPrims.push_back(new Points(SkCanvas::kPolygon_PointMode))
    [all...]
  /libcore/ojluni/src/main/java/sun/security/x509/
CRLDistributionPointsExtension.java 38 * Represent the CRL Distribution Points Extension (OID = 2.5.29.31).
40 * The CRL distribution points extension identifies how CRL information
96 public static final String POINTS = "points";
109 * @param distributionPoints the list of distribution points
123 * @param distributionPoints the list of distribution points
227 if (name.equalsIgnoreCase(POINTS)) {
244 if (name.equalsIgnoreCase(POINTS)) {
257 if (name.equalsIgnoreCase(POINTS)) {
273 elements.addElement(POINTS);
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/
GuidelinePainter.java 179 List<Point> points = new ArrayList<Point>(); local
180 points.add(fromCenter);
188 points.add(toCenter);
194 points.add(toCenter);
201 points.add(fromCenter);
202 points.add(points.get(0));
204 for (int i = 1, n = points.size(); i < n; i++) {
205 gc.drawLine(points.get(i-1), points.get(i))
    [all...]
  /external/valgrind/memcheck/tests/solaris/
scalar_ioctl.stderr.exp 13 Syscall param ioctl(POOL_STATUSQ) points to unaddressable byte(s)
29 Syscall param ioctl(MNTIOC_GETMNTANY) points to unaddressable byte(s)
45 Syscall param ioctl(MNTIOC_GETMNTANY) points to uninitialised byte(s)
49 Syscall param ioctl(MNTIOC_GETMNTANY, embuf->mbuf_emp) points to unaddressable byte(s)
53 Syscall param ioctl(MNTIOC_GETMNTANY, embuf->mbuf_buf) points to unaddressable byte(s)
69 Syscall param ioctl(MNTIOC_GETMNTANY) points to uninitialised byte(s)
73 Syscall param ioctl(MNTIOC_GETMNTANY, embuf->mbuf_emp) points to uninitialised byte(s)
77 Syscall param ioctl(MNTIOC_GETMNTANY, embuf->mbuf_buf) points to unaddressable byte(s)
81 Syscall param ioctl(MNTIOC_GETMNTANY, mnt->mnt_special) points to unaddressable byte(s)
85 Syscall param ioctl(MNTIOC_GETMNTANY, mnt->mnt_mountp) points to unaddressable byte(s
    [all...]
  /external/opencv3/modules/calib3d/test/
test_solvepnp_ransac.cpp 66 void generate3DPointCloud(vector<Point3f>& points, Point3f pmin = Point3f(-1,
70 for (size_t i = 0; i < points.size(); i++)
78 points[i] = p;
115 virtual bool runTest(RNG& rng, int mode, int method, const vector<Point3f>& points, const double* epsilon, double& maxError)
130 projectedPoints.resize(points.size());
131 projectPoints(Mat(points), trueRvec, trueTvec, intrinsics, distCoeffs, projectedPoints);
136 projectedPoints[i] = projectedPoints[rng.uniform(0,(int)points.size()-1)];
140 solvePnPRansac(points, projectedPoints, intrinsics, distCoeffs, rvec, tvec,
143 bool isTestSuccess = inliers.size() >= points.size()*0.95;
159 vector<Point3f> points, points_dls local
    [all...]
  /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/geometry/
Quad.java 27 * A Quad instance holds 4 points that define its shape. The points may represent any rectangle that
84 * Return a Quad that spans the specified points and height.
86 * The returned Quad has the specified top-left and top-right points, and the specified height
92 * @return Quad that spans the specified points and height.
137 // We only use the first 3 points as they sufficiently specify the transform
205 float[] points = asCoords(); local
206 matrix.mapPoints(points);
207 return new Quad(points);
241 * This method moves the corner points of the Quad outward along the diagonals that connec
    [all...]
  /external/icu/icu4c/source/common/unicode/
usetiter.h 27 * iterates over either code points or code point ranges. After all
28 * code points or ranges have been returned, it returns the
35 * <p>To iterate over code points and strings, use a loop like this:
43 * consisting of single code points are returned as strings containing
46 * <p>To iterate over code point ranges, instead of individual code points,
66 * Value of <tt>codepoint</tt> if the iterator points to a string.
75 * the iterator points to a string.
84 * iterating over code points using <tt>next()</tt>, or if
92 * If <tt>codepoint == IS_STRING</tt>, then <tt>string</tt> points
181 * <p>The order of iteration is all code points in sorted order
    [all...]
  /external/opencv3/doc/py_tutorials/py_calib3d/py_epipolar_geometry/
py_epipolar_geometry.markdown 31 consider the right image also. Now different points on the line \f$OX\f$ projects to different points
35 The projection of the different points on \f$OX\f$ form a line on right plane (line \f$l'\f$). We call it
40 all points will have its corresponding epilines in the other image. The plane \f$XOO'\f$ is called
65 calculated from matching points from both the images. A minimum of 8 such points are required to
66 find the fundamental matrix (while using 8-point algorithm). More points are preferred and use
113 # We select only inlier points
117 Next we find the epilines. Epilines corresponding to the points in first image is drawn on second
122 ''' img1 - image on which we draw the epilines for the points in img
    [all...]
  /external/zxing/qr_scanner/src/com/google/zxing/client/android/
CaptureActivity.java 221 * @param rawResult The decoded results which contains the points to draw.
224 ResultPoint[] points = rawResult.getResultPoints(); local
225 if (points != null && points.length > 0) {
235 if (points.length == 2) {
237 drawLine(canvas, paint, points[0], points[1]);
238 } else if (points.length == 4 && (rawResult.getBarcodeFormat() == BarcodeFormat.UPC_A
241 drawLine(canvas, paint, points[0], points[1])
    [all...]
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/docs/
raster.txt 49 already done. The glyph is thus described by a list of points in
95 of successive points of the points table.
99 points indicate a line segment joining the two points.
101 One `off' point amidst two `on' points indicates a second-degree
102 (conic) Bézier parametric arc, defined by these three points
104 start and end points). Similarly, a third-degree (cubic) Bézier
105 curve is described by four points (two `off' control points
    [all...]
  /external/libvorbis/vq/
vqgen.c 53 * solution. Individual input points, collected from libvorbis, are
277 if(v->points>=v->allocated){
283 memcpy(_point(v,v->points),p,sizeof(float)*v->elements);
284 if(v->aux)memcpy(_point(v,v->points)+v->elements,a,sizeof(float)*v->aux);
290 _point(v,v->points)[k]=
291 rint(_point(v,v->points)[k]/v->mindist)*v->mindist;
293 v->points++;
294 if(!(v->points&0xff))spinnit("loading... ",v->points);
312 qsort(v->pointlist,v->points,sortsize,meshcomp)
    [all...]
  /external/opencv/cvaux/src/
cv3dtracker.cpp 82 CvPoint3D32f *object_points = NULL; // real-world coordinates of checkerboard points
83 CvPoint2D32f *points = NULL; // 2d coordinates of checkerboard points as seen by a camera local
128 CV_CALL(points = (CvPoint2D32f *)cvAlloc(num_points * sizeof(CvPoint2D32f)));
130 // fill in the real-world coordinates of the checkerboard points
172 etalon_size, points, &count) != 0;
176 // If found is true, it means all the points were found (count = num_points).
177 // If found is false but count is non-zero, it means that not all points were found.
179 cvFindCornerSubPix(img, points, count, cvSize(5,5), cvSize(-1,-1),
187 points[i].y = samples[c]->height - 1 - points[i].y
    [all...]
  /external/opencv3/modules/calib3d/src/
p3p.cpp 37 std::vector<double> points; local
41 extract_points<cv::Point3f,cv::Point2f>(opoints, ipoints, points);
43 extract_points<cv::Point3d,cv::Point2d>(opoints, ipoints, points);
46 extract_points<cv::Point3f,cv::Point2d>(opoints, ipoints, points);
48 extract_points<cv::Point3d,cv::Point2f>(opoints, ipoints, points);
50 bool result = solve(rotation_matrix, translation, points[0], points[1], points[2], points[3], points[4], points[5]
    [all...]
  /external/deqp/android/cts/master/
gles31-multisample.txt 137 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_fragment.default_framebuffer_bbox_equal
138 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_fragment.default_framebuffer_bbox_larger
139 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_fragment.default_framebuffer_bbox_smaller
140 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_tessellation_fragment.default_framebuffer_bbox_equal
141 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_tessellation_fragment.default_framebuffer_bbox_larger
142 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_tessellation_fragment.default_framebuffer_bbox_smaller
143 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_geometry_fragment.default_framebuffer_bbox_equal
144 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_geometry_fragment.default_framebuffer_bbox_larger
145 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_geometry_fragment.default_framebuffer_bbox_smaller
146 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_tessellation_geometry_fragment.default_framebuffer_bbox_equa
    [all...]
  /external/deqp/android/cts/mnc/
gles31-multisample.txt 137 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_fragment.default_framebuffer_bbox_equal
138 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_fragment.default_framebuffer_bbox_larger
139 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_fragment.default_framebuffer_bbox_smaller
140 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_tessellation_fragment.default_framebuffer_bbox_equal
141 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_tessellation_fragment.default_framebuffer_bbox_larger
142 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_tessellation_fragment.default_framebuffer_bbox_smaller
143 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_geometry_fragment.default_framebuffer_bbox_equal
144 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_geometry_fragment.default_framebuffer_bbox_larger
145 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_geometry_fragment.default_framebuffer_bbox_smaller
146 dEQP-GLES31.functional.primitive_bounding_box.points.global_state.vertex_tessellation_geometry_fragment.default_framebuffer_bbox_equa
    [all...]
  /external/icu/icu4c/source/data/sprep/
rfc3530cs.txt 18 # This table contains code points from Table A.1 from RFC 3454
417 # Total code points 3653
419 # This table contains code points from Table B.1 from RFC 3454
449 # Total code points 27
451 # code points from Table C.3
457 # Total code points 2051
459 # code points from Table C.4
480 # Total code points 18
482 # code points from Table C.5
486 # Total code points
    [all...]
  /external/icu/icu4c/source/test/testdata/
nfs4_cs_prep_cs.txt 10 # This table contains code points from Table A.1 from RFC 3454
409 # Total code points 3653
411 # This table contains code points from Table B.1 from RFC 3454
441 # Total code points 27
443 # code points from Table C.3
449 # Total code points 2051
451 # code points from Table C.4
472 # Total code points 18
474 # code points from Table C.5
478 # Total code points
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/
SplineInterpolator.java 31 * x[0] < x[i] ... < x[n]. The x values are referred to as "knot points."</p>
42 * <li>Adjacent polynomials are equal through two derivatives at the knot points (i.e., adjacent polynomials
43 * "match up" at the knot points, as do their first and second derivatives).</li>
57 * @param x the arguments for the interpolation points
58 * @param y the values for the interpolation points
77 // Number of intervals. The number of data points is n + 1.
82 // Differences between knot points
  /external/chromium-trace/catapult/third_party/flot/
jquery.flot.categories.js 147 // go through the points, transforming them
148 var points = datapoints.points,
154 for (var i = 0; i < points.length; i += ps) {
155 if (points[i] == null)
159 var val = points[i + m];
169 points[i + m] = categories[val];
  /external/eigen/unsupported/Eigen/src/Splines/
SplineFitting.h 56 * \param[in] pts The data points to which a spline should be fit.
91 * \brief Fits an interpolating Spline to the given data points.
93 * \param pts The points for which an interpolating spline will be computed.
96 * \returns A spline interpolating the initially provided points.
102 * \brief Fits an interpolating Spline to the given data points.
104 * \param pts The points for which an interpolating spline will be computed.
108 * \returns A spline interpolating the initially provided points.
  /external/pdfium/xfa/src/fxbarcode/pdf417/
BC_PDF417Reader.cpp 68 CFX_PtrArray* points = (CFX_PtrArray*)detectorResult->getPoints()->GetAt(i); local
70 detectorResult->getBits(), (CBC_ResultPoint*)points->GetAt(4),
71 (CBC_ResultPoint*)points->GetAt(5), (CBC_ResultPoint*)points->GetAt(6),
72 (CBC_ResultPoint*)points->GetAt(7), getMinCodewordWidth(*points),
73 getMaxCodewordWidth(*points), e);
  /external/skia/src/animator/
SkDrawPath.cpp 184 SK_MEMBER_ARRAY(points, Float)
197 if (points.count() <= 0)
200 fPath.moveTo(points[0], points[1]);
201 int count = points.count();
203 fPath.lineTo(points[index], points[index+1]);
  /external/valgrind/memcheck/tests/x86-solaris/
scalar_obsolete.stderr.exp 10 Syscall param stat64(path) points to unaddressable byte(s)
14 Syscall param stat64(buf) points to unaddressable byte(s)
27 Syscall param lstat64(path) points to unaddressable byte(s)
31 Syscall param lstat64(buf) points to unaddressable byte(s)
44 Syscall param fstat64(buf) points to unaddressable byte(s)
57 Syscall param open(filename) points to unaddressable byte(s)
73 Syscall param open(filename) points to unaddressable byte(s)

Completed in 2050 milliseconds

<<11121314151617181920>>