| /external/valgrind/memcheck/tests/ |
| execve1.stderr.exp | 1 Syscall param execve(filename) points to unaddressable byte(s)
6 Syscall param execve(argv[i]) points to unaddressable byte(s)
11 Syscall param execve(envp[i]) points to unaddressable byte(s)
|
| buflen_check.stderr.exp | 1 Syscall param socketcall.getsockname(name) points to unaddressable byte(s)
6 Syscall param socketcall.getsockname(namelen_in) points to unaddressable byte(s)
|
| execve2.stderr.exp | 1 Syscall param execve(filename) points to unaddressable byte(s)
|
| /frameworks/base/core/java/android/transition/ |
| ArcMotion.java | 27 * the two points. If the horizontal distance between the points is less than the vertical
32 * When the two points are near horizontal or vertical, the curve of the motion will be
33 * small as the center of the circle will be far from both points. To force curvature of
36 * arc between two points.
79 * Sets the minimum arc along the circle between two points aligned near horizontally.
80 * When start and end points are close to horizontal, the calculated center point of the
81 * circle will be far from both points, giving a near straight path between the points.
87 * between two nearly horizontally-separated points
[all...] |
| /external/opencv3/samples/cpp/ |
| kmeans.cpp | 12 // "It generates an image with random points, then assigns a random number of cluster\n"
37 Mat points(sampleCount, 1, CV_32FC2), labels;
48 Mat pointChunk = points.rowRange(k*sampleCount/clusterCount,
54 randShuffle(points, 1, &rng);
56 kmeans(points, clusterCount, labels,
65 Point ipt = points.at<Point2f>(i);
|
| /external/pdfium/xfa/src/fdp/src/fde/ |
| fde_geobject.h | 19 virtual void AddBezier(const CFX_PointsF& points);
20 virtual void AddBeziers(const CFX_PointsF& points);
21 virtual void AddCurve(const CFX_PointsF& points,
25 virtual void AddLines(const CFX_PointsF& points);
28 virtual void AddPolygon(const CFX_PointsF& points);
48 void GetCurveTangents(const CFX_PointsF& points,
|
| /external/chromium-trace/catapult/third_party/flot/ |
| jquery.flot.errorbars.js | 11 This plugin allows you to plot error-bars over points. Set "errorbars" inside
12 the points series to the axis name over which there will be error values in
19 points: {
57 Color and radius both default to the same ones of the points series if not
60 points (with radius: 0), and still showing end caps on the error-bars.
61 shadowSize and lineWidth are derived as well from the points series.
68 points: {
77 if (!series.points.errorbars)
86 var errors = series.points.errorbars;
90 if (series.points.xerr.asymmetric)
[all...] |
| /device/google/contexthub/firmware/inc/platform/stm32f4xx/cmsis/ |
| arm_math.h | 198 * float32_t *pData; // points to the data of the matrix.
203 * The structure specifies the size of the matrix and then points to
229 * specifies the number of columns, and <code>pData</code> points to the
1073 q7_t *pState; /**< points to the state variable array. The array is of length numTaps+blockSize-1. */
1074 q7_t *pCoeffs; /**< points to the coefficient array. The array is of length numTaps.*/
1083 q15_t *pState; /**< points to the state variable array. The array is of length numTaps+blockSize-1. */
1084 q15_t *pCoeffs; /**< points to the coefficient array. The array is of length numTaps.*/
1093 q31_t *pState; /**< points to the state variable array. The array is of length numTaps+blockSize-1. */
1094 q31_t *pCoeffs; /**< points to the coefficient array. The array is of length numTaps. */
1103 float32_t *pState; /**< points to the state variable array. The array is of length numTaps+blockSize-1. */
[all...] |
| /external/clang/test/Analysis/ |
| return-ptr-range.cpp | 15 return ptr; // expected-warning{{Returned pointer value points outside the original object (potential buffer overflow)}}
26 return local_ptr; // expected-warning{{Returned pointer value points outside the original object (potential buffer overflow)}}
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| CatmullRomSpline.java | 24 * @param points The control points
28 public static <T extends Vector<T>> T calculate (final T out, final float t, final T[] points, final boolean continuous,
30 final int n = continuous ? points.length : points.length - 3;
34 return calculate(out, i, u, points, continuous, tmp);
39 * @param i The span (0<=i<spanCount) spanCount = continuous ? points.length : points.length - degree
41 * @param points The control points
[all...] |
| ConvexHull.java | 23 /** Computes the convex hull of a set of points using the monotone chain convex hull algorithm (aka Andrew's algorithm).
33 public FloatArray computePolygon (FloatArray points, boolean sorted) {
34 return computePolygon(points.items, 0, points.size, sorted);
42 /** Returns a list of points on the convex hull in counter-clockwise order. Note: the last point in the returned list is the
45 * @param points x,y pairs describing points. Duplicate points will result in undefined behavior.
46 * @param sorted If false, the points will be sorted by the x coordinate then the y coordinate, which is required by the convex
50 public FloatArray computePolygon (float[] points, int offset, int count, boolean sorted) {
[all...] |
| /external/opencv3/modules/calib3d/src/ |
| p3p.h | 34 void extract_points(const cv::Mat& opoints, const cv::Mat& ipoints, std::vector<double>& points)
36 points.clear();
37 points.resize(20);
40 points[i*5] = ipoints.at<IpointType>(i).x*fx + cx;
41 points[i*5+1] = ipoints.at<IpointType>(i).y*fy + cy;
42 points[i*5+2] = opoints.at<OpointType>(i).x;
43 points[i*5+3] = opoints.at<OpointType>(i).y;
44 points[i*5+4] = opoints.at<OpointType>(i).z;
|
| /external/skia/tools/lua/ |
| scrape_dashing.lua | 67 local points = t.points
68 increment(drawPointsTable, #points)
69 if 2 == #points then
70 if points[1].y == points[2].y then
72 elseif points[1].x == points[2].x then
|
| /external/valgrind/memcheck/tests/solaris/ |
| sendfilev.stderr.exp | 1 Syscall param sendfilev(vec[0].sfv_off points to unaddressable byte(s)
6 Syscall param sendfilev(vec) points to uninitialised byte(s)
|
| /external/valgrind/memcheck/tests/x86-linux/ |
| scalar_supp.c | 10 // uninitialised, but we know pc[0] points to 0x0
17 // - the 2nd arg points to unaddressable memory.
|
| /external/chromium-trace/catapult/tracing/tracing/base/ |
| math.html | 81 vec2.interpolatePiecewiseFunction = function(points, x) {
82 if (x < points[0][0])
83 return points[0][1];
84 for (var i = 1; i < points.length; ++i) {
85 if (x < points[i][0]) {
86 var percent = normalize(x, points[i - 1][0], points[i][0]);
87 return lerp(percent, points[i - 1][1], points[i][1]);
90 return points[points.length - 1][1]
[all...] |
| /external/chromium-trace/catapult/tracing/tracing/ui/tracks/ |
| chart_series.html | 48 // Minimum distance between points in physical pixels. Points which are
52 // Density in points per physical pixel at which unselected point dots
56 // Density in points per physical pixel at which unselected point dots
79 * A series of points corresponding to a single chart on a chart track.
84 function ChartSeries(points, axis, opt_renderingConfig) {
85 this.points = points;
110 this.points.forEach(function(point) {
117 if (this.points === undefined || this.points.length === 0
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/ |
| Spline.java | 150 ControlPoint[] points = new ControlPoint[mPoints.size()]; local
153 points[i] = new ControlPoint(p.x, p.y);
155 double[] derivatives = solveSystem(points);
158 if (points[0].x != 0) {
159 start = (int) (points[0].x * 256);
161 if (points[points.length - 1].x != 1) {
162 end = (int) (points[points.length - 1].x * 256);
165 curve[i] = 1.0f - points[0].y
267 ControlPoint[] points = new ControlPoint[mPoints.size()]; local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| KMeansPlusPlusClusterer.java | 31 * @param <T> type of the points to cluster
44 /** Split the cluster with largest number of points. */
86 * @param points the points to cluster
90 * @return a list of clusters containing the points
92 public List<Cluster<T>> cluster(final Collection<T> points,
95 List<Cluster<T>> clusters = chooseInitialCenters(points, k, random);
96 assignPointsToClusters(clusters, points);
131 assignPointsToClusters(newClusters, points);
138 * Adds the given points to the closest {@link Cluster}
290 final List<T> points = cluster.getPoints(); local
[all...] |
| /external/opencv/cv/src/ |
| cvrotcalipers.cpp | 65 // points - convex hull vertices ( any orientation )
70 // left, bottom, right, top - indexes of extremal points
72 // In case CV_CALIPERS_MAXDIST it points to float value -
93 icvRotatingCalipers( CvPoint2D32f* points, int n, int mode, float* out )
113 CvPoint2D32f pt0 = points[0];
134 CvPoint2D32f pt = points[(i+1) & (i+1 < n ? -1 : 0)];
250 float dx = points[seq[opposite_el]].x - points[seq[main_element]].x;
251 float dy = points[seq[opposite_el]].y - points[seq[main_element]].y
352 CvPoint2D32f* points = 0; local
[all...] |
| /external/skia/include/core/ |
| SkPathRef.h | 24 * Holds the path verbs and points. It is versioned by a generation ID. None of its public methods
25 * modify the contents. To modify or append to the verbs/points wrap the SkPathRef in an
31 * The points and verbs are stored in a single allocation. The points are at the begining of the
32 * allocation while the verbs are stored at end of the allocation, in reverse order. Thus the points
49 * Returns the array of points.
51 SkPoint* points() { return fPathRef->getPoints(); } function in class:SkPathRef::Editor
52 const SkPoint* points() const { return fPathRef->points(); } function in class:SkPathRef::Editor
55 * Gets the ith point. Shortcut for this->points() +
240 const SkPoint* points() const { SkDEBUGCODE(this->validate();) return fPoints; } function in class:SkPathRef
[all...] |
| /external/mesa3d/src/gallium/state_trackers/d3d1x/docs/ |
| source_layout.txt | 9 gd3d10 contains the implementation of Direct3D 10 and 10.1 with Gallium-specific entry points
10 gd3d11 contains the implementation of Direct3D 11 with Gallium-specific entry points
12 dxgid3d10 contains the DXGI-based "official" entry points to Direct3D 10.0 and 10.1
13 dxgid3d11 contains the DXGI-based "official" entry points to Direct3D 11
|
| /external/skia/platform_tools/android/skp_gen/apps/ |
| geniewidget.json | 12 "points": 10
|
| /external/vboot_reference/firmware/linktest/ |
| main_vbinit.c | 12 /* vboot_api.h - entry points INTO vboot_reference */
|
| main_vbsf.c | 12 /* vboot_api.h - entry points INTO vboot_reference */
|
