| /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/ |
| CachedPathIteratorFactory.java | 38 * float arrays store always points where the first element is X and the second is Y.
55 float[] points = new float[6]; local
57 int type = iterator.currentSegment(points);
62 System.arraycopy(points, 0, itemPoints, 0, nPoints);
156 // Calculate the points at t0 and t1 for the quadratic curves formed by (P0, P1, P2) and
198 * Returns the number of points stored in a coordinates array for the given segment type.
290 * Stores the coordinates array of the current segment. The number of points stored depends
350 float[] points = new float[8]; local
353 points[0] = points[1] = 0f
[all...] |
| /external/valgrind/memcheck/tests/solaris/ |
| scalar.stderr.exp | 25 Syscall param write(buf) points to unaddressable byte(s)
53 Syscall param linkat(path1) points to unaddressable byte(s)
57 Syscall param linkat(path2) points to unaddressable byte(s)
73 Syscall param symlinkat(path1) points to unaddressable byte(s)
77 Syscall param symlinkat(path2) points to unaddressable byte(s)
87 Syscall param chdir(path) points to unaddressable byte(s)
130 Syscall param mount(spec) points to unaddressable byte(s)
134 Syscall param mount(dir) points to unaddressable byte(s)
153 Syscall param mount(spec) points to unaddressable byte(s)
157 Syscall param mount(dir) points to unaddressable byte(s
[all...] |
| scalar_obsolete.stderr.exp | 10 Syscall param open(filename) points to unaddressable byte(s)
26 Syscall param open(filename) points to unaddressable byte(s)
39 Syscall param link(oldpath) points to unaddressable byte(s)
43 Syscall param link(newpath) points to unaddressable byte(s)
53 Syscall param unlink(pathname) points to unaddressable byte(s)
66 Syscall param chmod(path) points to unaddressable byte(s)
82 Syscall param chown(path) points to unaddressable byte(s)
95 Syscall param stat(path) points to unaddressable byte(s)
99 Syscall param stat(buf) points to unaddressable byte(s)
112 Syscall param fstat(buf) points to unaddressable byte(s
[all...] |
| /external/icu/icu4c/source/data/sprep/ |
| rfc4013.txt | 19 # This table contains code points from Table A.1 from RFC 3454
418 # Total code points 3653
420 # code points from Table C.1.2
440 # Total code points 17
442 # code points from Table C.2.1
447 # Total code points 18
449 # code points from Table C.2.2
468 # Total code points 30
470 # code points from Table C.3
476 # Total code points 205
[all...] |
| /external/icu/icu4c/source/common/ |
| utrie.h | 31 * Unicode code points (0..0x10ffff).
63 * Lead surrogate code points' index displacement in the index array.
96 * Maximum number of Unicode code points (0x110000) shifted right by UTRIE_SHIFT.
109 * (Number of Unicode code points + one all-initial-value block +
122 * BMP index + 1 index block for lead surrogate code points +
123 * Latin-1-linear array + 1 data block for lead surrogate code points
210 /* BMP code points */ \
270 * @return (const uint16_t *) pointer to values for Latin-1 code points
281 * @return (const uint32_t *) pointer to values for Latin-1 code points
307 * Even lead surrogate code points are treated as normal code points
[all...] |
| bmpset.cpp | 36 * U+0800 is the first 3-byte-UTF-8 code point. Lower code points are
38 * The last pair of indexes is for finding supplementary code points.
165 // Mixed-value block of 64 code points.
173 // Multiple all-ones blocks of 64 code points each.
178 // Mixed-value block of 64 code points.
286 // All 64 code points with the same bits 15..6
290 // Look up the code point in its 4k block of code points.
297 // Out-of-range code points get FALSE, consistent with long-standing
305 * Handle single surrogates as surrogate code points as usual in ICU.
327 // All 64 code points with the same bits 15..
[all...] |
| /external/opencv3/modules/calib3d/src/ |
| circlesgrid.cpp | 60 void drawPoints(const std::vector<Point2f> &points, Mat &outImage, int radius = 2, Scalar color = Scalar::all(255), int thickness = -1)
62 for(size_t i=0; i<points.size(); i++)
64 circle(outImage, points[i], radius, color, thickness);
69 void CirclesGridClusterFinder::hierarchicalClustering(const std::vector<Point2f> &points, const Size &patternSz, std::vector<Point2f> &patternPoints)
72 if(tegra::useTegra() && tegra::hierarchicalClustering(points, patternSz, patternPoints))
75 int j, n = (int)points.size();
79 if (pn >= points.size())
81 if (pn == points.size())
82 patternPoints = points;
92 dists.at<float>(i, j) = (float)norm(points[i] - points[j])
[all...] |
| /external/skia/experimental/docs/ |
| svgbaseddoc.htm | 116 containing a range of points.
329 var points = [];
363 data = find_points(data, points, 1, relative, c);
364 var mid = { x: (c.x + points[0].x) / 2, y: (c.y + points[0].y) / 2 };
372 + points[0].x + "," + points[0].y + "," + radius + ");\n";
373 c = points[0];
376 data = find_points(data, points, 1, relative, c);
377 path += "ctx.moveTo(" + points[0].x + "," + points[0].y + ");\n"
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| PolynomialFunctionLagrangeForm.java | 48 * Interpolating points (abscissas).
53 * Function values at interpolating points.
64 * values. The order of interpolating points are not important.
68 * @param x interpolating points
69 * @param y function values at interpolating points
102 * Returns a copy of the interpolating points array.
106 * @return a fresh copy of the interpolating points array
154 * @param x the interpolating points array
281 * The interpolating points must be distinct. However it is not
285 * @param x the interpolating points arra
[all...] |
| /external/freetype/src/smooth/ |
| ftsmooth.c | 266 FT_Vector* points = outline->points; local
267 FT_Vector* points_end = points + outline->n_points;
272 for ( vec = points; vec < points_end; vec++ )
276 for ( vec = points; vec < points_end; vec++ )
285 FT_Vector* points = outline->points; local
286 FT_Vector* points_end = points + outline->n_points;
291 for ( vec = points; vec < points_end; vec++ )
295 for ( vec = points; vec < points_end; vec++
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| punyref.c | 142 /* Handle the basic code points: */
151 /* (not needed for Punycode with unsigned code points) */
156 /* h is the number of code points that have been handled, b is the */
157 /* number of basic code points, and out is the number of characters */
165 /* All non-basic code points < n have been */
232 /* Handle the basic code points: Let b be the number of input code */
233 /* points before the last delimiter, or 0 if there is none, then */
234 /* copy the first b code points to the output. */
246 /* basic code points were copied; start at the beginning otherwise. */
251 /* out is the number of code points in the output array. *
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/smooth/ |
| ftsmooth.c | 266 FT_Vector* points = outline->points; local
267 FT_Vector* points_end = points + outline->n_points;
272 for ( vec = points; vec < points_end; vec++ )
276 for ( vec = points; vec < points_end; vec++ )
285 FT_Vector* points = outline->points; local
286 FT_Vector* points_end = points + outline->n_points;
291 for ( vec = points; vec < points_end; vec++ )
295 for ( vec = points; vec < points_end; vec++
[all...] |
| /external/opencv3/doc/tutorials/imgproc/imgtrans/hough_lines/ |
| hough_lines.markdown | 53 We consider only points such that \f$r > 0\f$ and \f$0< \theta < 2 \pi\f$.
55 -# We can do the same operation above for all the points in an image. If the curves of two
56 different points intersect in the plane \f$\theta\f$ - \f$r\f$, that means that both points belong to a
58 points: \f$x_{1} = 4\f$, \f$y_{1} = 9\f$ and \f$x_{2} = 12\f$, \f$y_{2} = 3\f$, we get:
68 line represented by that intersection have more points. In general, we can define a *threshold*
171 - *minLinLength*: The minimum number of points that can form a line. Lines with less than
172 this number of points are disregarded.
173 - *maxLineGap*: The maximum gap between two points to be considered in the same line.
211 (since you will need more points to declare a line detected)
[all...] |
| /external/pdfium/third_party/freetype/src/smooth/ |
| ftsmooth.c | 266 FT_Vector* points = outline->points; local
267 FT_Vector* points_end = points + outline->n_points;
272 for ( vec = points; vec < points_end; vec++ )
276 for ( vec = points; vec < points_end; vec++ )
285 FT_Vector* points = outline->points; local
286 FT_Vector* points_end = points + outline->n_points;
291 for ( vec = points; vec < points_end; vec++ )
295 for ( vec = points; vec < points_end; vec++
[all...] |
| /external/skia/src/pathops/ |
| SkReduceOrder.cpp | 49 // look for identical points
50 // look for all four points in a line
51 // note that three points in a line doesn't simplify a cubic
162 Given points c1, c2, c3 and c4 of a cubic Bezier, the points of the
164 points):
170 Of course, this curve does not interpolate the end-points, but it would
180 // look for identical points
181 // look for all four points in a line
182 // note that three points in a line doesn't simplify a cubi
[all...] |
| /external/ImageMagick/tests/ |
| drawtest.c | 143 const PointInfo points[37] =
167 DrawPolygon(picasso,37,points);
187 const PointInfo points[48] =
213 DrawPolygon(picasso,48,points);
247 const PointInfo points[6] =
263 DrawPolygon(picasso,6,points);
268 const PointInfo points[11] =
285 DrawPolygon(picasso,11,points);
290 const PointInfo points[15] =
308 DrawPolygon(picasso,15,points);
142 const PointInfo points[37] = local
186 const PointInfo points[48] = local
246 const PointInfo points[6] = local
267 const PointInfo points[11] = local
289 const PointInfo points[15] = local
312 const PointInfo points[7] = local
333 const PointInfo points[193] = local
[all...] |
| /external/chromium-trace/catapult/dashboard/ |
| index.yaml | 108 # This index would enable querying for points for a particular test,
117 # Used in find_anomalies.GetRowsToAnalyze when getting latest points,
127 # and value for points from a particular test.
136 # points for a test.
143 # This composite index enables querying for points for a particular test,
152 # Likely used in new_points.py to query newest points for a particular test.
153 # However listing the latest points for a test also works when not logged in
|
| /external/icu/icu4c/source/data/mappings/ |
| README.emoji | 9 - kddi-jisx-208 contains Emoji (emoticon) code points in
13 - kddi-shift_jis contains Emoji code points in
17 - docomo-shift_jis contains Emoji code points in
20 - softbank-shift_jis contains Emoji code points in
23 - softbank-jisx-208 contains Emoji code points in
83 to and from Unicode 6 standard code points
84 and also include fallback mappings from the Google PUA code points
|
| /external/opencv3/doc/tutorials/core/ |
| mat_operations.markdown | 69 array of 2D or 3D points in the form of Mat. Matrix should contain exactly one column, each row
73 vector<Point2f> points;
75 Mat pointsMat = Mat(points);
90 std::vector<Point3f> points;
92 Mat pointsMat = Mat(points).reshape(1);
95 uses data from points and will not deallocate the memory when destroyed. In this particular
96 instance, however, developer has to make sure that lifetime of points is longer than of pointsMat.
|
| /external/skia/gm/ |
| convex_all_line_paths.cpp | 169 const SkPoint* points; local
173 points = gPoints[index];
217 points = data.get();
223 path.moveTo(points[0]);
225 path.lineTo(points[i]);
228 path.moveTo(points[numPts-1]);
230 path.lineTo(points[i]);
|
| /external/skia/src/gpu/ |
| GrPathUtils.cpp | 38 uint32_t GrPathUtils::quadraticPointCount(const SkPoint points[],
45 SkScalar d = points[1].distanceToLineSegmentBetween(points[0], points[2]);
51 // points.
74 SkPoint** points,
78 (*points)[0] = p2;
79 *points += 1;
90 uint32_t a = generateQuadraticPoints(p0, q[0], r, tolSqd, points, pointsLeft);
91 uint32_t b = generateQuadraticPoints(r, q[1], p2, tolSqd, points, pointsLeft)
[all...] |
| /external/skia/src/gpu/batches/ |
| GrAAConvexTessellator.h | 23 // device space distance which we inset / outset points in order to create the soft antialiased edge
28 // The AAConvexTessellator holds the global pool of points and the triangulation
65 // being generated. Its main function is to de-dup the points.
171 // Movable points are those that can be slid along their bisector.
231 // movable points are those that can be slid further along their bisector
240 // Tracks whether a given point is interior to a curve. Such points are
246 // The triangulation of the points
|
| /frameworks/base/packages/SettingsLib/src/com/android/settingslib/graph/ |
| UsageGraph.java | 117 public void addPath(SparseIntArray points) {
118 for (int i = 0; i < points.size(); i++) {
119 mPaths.put(points.keyAt(i), points.valueAt(i));
121 mPaths.put(points.keyAt(points.size() - 1) + 1, PATH_DELIM);
159 // Clear out any pending points.
|
| /external/icu/icu4c/source/common/unicode/ |
| uidna.h | 53 * Option to allow unassigned code points in domain names and labels.
56 * (UTS #46 disallows unassigned code points.)
525 * containing non-ASCII code points are processed by the
548 * - UIDNA_DEFAULT Use default options, i.e., do not process unassigned code points
550 * If unassigned code points are found the operation fails with
554 * If this option is set, the unassigned code points are in the input
555 * are treated as normal Unicode code points.
567 * too many code points.
593 * - UIDNA_DEFAULT Use default options, i.e., do not process unassigned code points
595 * If unassigned code points are found the operation fails with
[all...] |
| /external/libchrome/base/third_party/icu/ |
| icu_utf.h | 33 * (take or) return single code points (UChar32).
65 * Code points that are not characters include:
66 * - single surrogate code points (U+d800..U+dfff, 2048 code points)
67 * - the last two code points on each plane (U+__fffe and U+__ffff, 34 code points)
68 * - U+fdd0..U+fdef (new with Unicode 3.1, 32 code points)
71 * This means that all code points below U+d800 are character code points,
186 * If the offset points to a trail byte or an illegal UTF-8 sequence, the
[all...] |
