HomeSort by relevance Sort by last modified time
    Searched full:points (Results 1 - 25 of 2148) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/skia/src/svg/
SkSVGLinearGradient.cpp 39 SkString points; local
40 points.appendUnichar('[');
41 points.append(f_x1);
42 points.appendUnichar(',');
43 points.append(f_y1);
44 points.appendUnichar(',');
45 points.append(f_x2);
46 points.appendUnichar(',');
47 points.append(f_y2);
48 points.appendUnichar(']')
    [all...]
  /frameworks/base/graphics/java/android/graphics/
package.html 3 Provides low level graphics tools such as canvases, color filters, points, and
  /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/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/skia/src/animator/
SkParseSVGPath.cpp 39 //define our points
127 SkPoint points[3]; local
152 data = find_points(data, points, 1, relative, &c);
153 fPath.moveTo(points[0]);
155 c = points[0];
158 data = find_points(data, points, 1, relative, &c);
159 fPath.lineTo(points[0]);
160 c = points[0];
177 data = find_points(data, points, 3, relative, &c);
180 data = find_points(data, &points[1], 2, relative, &c)
    [all...]
  /external/webkit/WebCore/platform/graphics/cg/
PathCG.cpp 94 CGPoint* points = element->points; local
100 CGPathMoveToPoint(path, 0, points[0].x, points[0].y);
103 CGPathAddLineToPoint(path, 0, points[0].x, points[0].y);
106 CGPathAddQuadCurveToPoint(path, 0, points[0].x, points[0].y, points[1].x, points[1].y)
257 CGPoint* points = element->points; local
316 FloatPoint points[3]; local
    [all...]
  /external/webkit/WebCore/rendering/
SVGMarkerData.h 91 FloatPoint* points = element->points; local
96 m_origin = points[1];
99 m_inslopePoints[0] = points[1];
100 m_inslopePoints[1] = points[2];
101 m_origin = points[2];
104 m_subpathStart = points[0];
106 updateInslope(points[0]);
107 m_origin = points[0];
110 updateInslope(points[0])
    [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);
80 this.points = tmpPoints;
91 points = pts.clone();
97 return new GestureStroke(boundingBox, length, points, timestamps)
223 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...]
  /packages/wallpapers/MusicVisualization/res/raw/
waveform.rs 39 void makeIdleWave(float *points) {
55 points[i*8+1] = val + off;
56 points[i*8+5] = -val + off;
80 float *points = loadArrayF(RSID_POINTS, 0);
84 float val = absf(points[i*8+1]);
87 points[i*8+1] = val;
88 points[i*8+5] = -val;
99 makeIdleWave(points);
108 float *points = loadArrayF(RSID_POINTS, 0);
110 float val = absf(points[i*8+1])
    [all...]
  /frameworks/base/awt/org/apache/harmony/awt/gl/render/
JavaShapeRasterizer.java 42 boolean[] edgesExt; // Extremal points
63 void add(MultiRectArea.LineCash rect, int[] points, int[] orient, int length, int y) {
67 dst[0] = points[0];
73 dst[dstLength++] = points[i];
77 dst[dstLength++] = points[i];
99 void add(MultiRectArea.LineCash rect, int[] points, int[] orient, int length, int y) {
104 if (points[i] != points[i + 1]) {
105 buf[j++] = points[i];
110 points[i]--
    [all...]
  /frameworks/base/awt/java/awt/geom/
GeneralPath.java 65 * The points buffer.
67 float[] points; field in class:GeneralPath
75 * The points buffer size.
85 * The space amount in points buffer for different segmenet's types.
110 * The current cursor position in points buffer.
168 coords[i] = p.points[pointIndex + i];
184 System.arraycopy(p.points, pointIndex, coords, 0, count);
228 points = new float[initialCapacity * 2];
282 * whether to check for existing points.
296 if (pointSize + pointCount > points.length)
    [all...]
  /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/x509/
CRLDistPoint.java 44 DistributionPoint[] points)
48 for (int i = 0; i != points.length; i++)
50 v.add(points[i]);
57 * Return the distribution points making up the sequence.
  /external/icu4c/test/intltest/
punyref.h 61 /* is represented as an array of Unicode code points (not code */
63 /* will be represented as an array of ASCII code points. The */
67 /* needed.) The input_length is the number of code points in */
69 /* caller passes in the maximum number of code points that it */
71 /* number of code points actually output. The case_flags array */
75 /* it be forced to lowercase (if possible). ASCII code points */
79 /* letters are left as they are, and other code points are */
93 /* represented as an array of ASCII code points, and the output */
94 /* will be represented as an array of Unicode code points. The */
95 /* input_length is the number of code points in the input. The *
    [all...]
  /external/qemu/slirp/
sbuf.h 17 char *sb_wptr; /* write pointer. points to where the next
19 char *sb_rptr; /* read pointer. points to where the next
  /external/qemu/slirp-android/
sbuf.h 17 char *sb_wptr; /* write pointer. points to where the next
19 char *sb_rptr; /* read pointer. points to where the next
  /external/webkit/WebCore/svg/
SVGPolyElement.cpp 49 SVGPointList* SVGPolyElement::points() const function in class:WebCore::SVGPolyElement
68 points()->clear(ec);
70 if (!pointsListFromSVGData(points(), value)) {
71 points()->clear(ec);
72 document()->accessSVGExtensions()->reportError("Problem parsing points=\"" + value + "\"");
89 // The points property is not a regular SVGAnimatedProperty, still we use the same SVG<->XML DOM synchronization framework.
110 SVGAnimatedPropertySynchronizer<true>::synchronize(this, SVGNames::pointsAttr, points()->valueAsString());
117 SVGAnimatedPropertySynchronizer<true>::synchronize(this, attrName, points()->valueAsString());
  /dalvik/dx/tests/014-field-attrib-ConstantValue/
info.txt 6 fields, each with a single ConstantValue attribute, which points at one
  /external/openssl/crypto/ec/
ec_mult.c 87 EC_POINT **points; /* array with pre-calculated multiples of generator: member in struct:ec_pre_comp_st
115 ret->points = NULL;
144 if (pre->points)
148 for (p = pre->points; *p != NULL; p++)
150 OPENSSL_free(pre->points);
167 if (pre->points)
171 for (p = pre->points; *p != NULL; p++)
173 OPENSSL_cleanse(pre->points, sizeof pre->points);
174 OPENSSL_free(pre->points);
770 EC_POINT **points = NULL; local
    [all...]
  /external/proguard/examples/annotations/src/proguard/annotation/
KeepClassMemberNames.java 13 * from being optimized or obfuscated as entry points.
KeepClassMembers.java 13 * from being shrunk, optimized, or obfuscated as entry points.
KeepGettersSetters.java 13 * class from being shrunk, optimized, or obfuscated as entry points.
KeepImplementations.java 13 * annotated class as entry points.
KeepPublicClassMemberNames.java 13 * class from being optimized or obfuscated as entry points.
KeepPublicClassMembers.java 13 * class from being shrunk, optimized, or obfuscated as entry points.

Completed in 535 milliseconds

1 2 3 4 5 6 7 8 91011>>