| /external/autotest/client/site_tests/security_RootfsStatefulSymlinks/ |
| security_RootfsStatefulSymlinks.py | 32 Given a symlink, validate that the file it points to
39 "Expected '%s' to point to '%s', but it points to '%s'",
44 # By this point, we know it points to the right place, but we
48 logging.warning("'%s' points to '%s', but it's dangling",
91 # If it is, proceed to validate other attributes (where it points,
92 # permissions of what it points to, etc).
|
| /external/chromium-trace/catapult/dashboard/docs/ |
| pages-and-endpoints.md | 23 - *num\_points*: Number of points to plot (optional).
34 - *test\_path*: Full test path (Master/bot/benchmark/...) to get points for.
36 - *num\_before*: Number of points to fetch before rev.
37 - *num\_after*: Number of points to fetch starting from rev.
40 **/new\_points**: View recently-added points for some set of tests, and verify whether or not data was received.
41 - *num\_points*: Max number of points to fetch.
|
| /external/chromium-trace/catapult/third_party/flot/ |
| jquery.flot.categories.min.js | 7 (function($){var options={xaxis:{categories:null},yaxis:{categories:null}};function processRawData(plot,series,data,datapoints){var xCategories=series.xaxis.options.mode=="categories",yCategories=series.yaxis.options.mode=="categories";if(!(xCategories||yCategories))return;var format=datapoints.format;if(!format){var s=series;format=[];format.push({x:true,number:true,required:true});format.push({y:true,number:true,required:true});if(s.bars.show||s.lines.show&&s.lines.fill){var autoscale=!!(s.bars.show&&s.bars.zero||s.lines.show&&s.lines.zero);format.push({y:true,number:true,required:false,defaultValue:0,autoscale:autoscale});if(s.bars.horizontal){delete format[format.length-1].y;format[format.length-1].x=true}}datapoints.format=format}for(var m=0;m<format.length;++m){if(format[m].x&&xCategories)format[m].number=false;if(format[m].y&&yCategories)format[m].number=false}}function getNextIndex(categories){var index=-1;for(var v in categories)if(categories[v]>index)index=categories[v];return index+1}function categoriesTickGenerator(axis){var res=[];for(var label in axis.categories){var v=axis.categories[label];if(v>=axis.min&&v<=axis.max)res.push([v,label])}res.sort(function(a,b){return a[0]-b[0]});return res}function setupCategoriesForAxis(series,axis,datapoints){if(series[axis].options.mode!="categories")return;if(!series[axis].categories){var c={},o=series[axis].options.categories||{};if($.isArray(o)){for(var i=0;i<o.length;++i)c[o[i]]=i}else{for(var v in o)c[v]=o[v]}series[axis].categories=c}if(!series[axis].options.ticks)series[axis].options.ticks=categoriesTickGenerator;transformPointsOnAxis(datapoints,axis,series[axis].categories)}function transformPointsOnAxis(datapoints,axis,categories){var points=datapoints.points,ps=datapoints.pointsize,format=datapoints.format,formatColumn=axis.charAt(0),index=getNextIndex(categories);for(var i=0;i<points.length;i+=ps){if(points[i]==null)continue;for(var m=0;m<ps;++m){var val=points[i+m];if(val==null||!format[m][formatColumn])continue;if(!(val in categories)){categories[val]=index;++index}points[i+m]=categories[val]}}}function processDatapoints(plot,series,datapoints){setupCategoriesForAxis(s (…)
|
| jquery.flot.image.js | 43 Note that because the data format is different from usual data points, you
69 var urls = [], points = [];
83 points.push(p);
89 $.each(points, function (i, p) {
124 var points = series.datapoints.points,
127 for (var i = 0; i < points.length; i += ps) {
128 var img = points[i],
129 x1 = points[i + 1], y1 = points[i + 2]
[all...] |
| jquery.flot.symbol.js | 1 /* Flot plugin that adds some extra symbols for plotting points.
9 points: {
57 var s = series.points.symbol;
59 series.points.symbol = handlers[s];
|
| /external/opencv3/modules/ml/src/ |
| kdtree.cpp | 140 computeSums( const Mat& points, const size_t* ofs, int a, int b, double* sums )
142 int i, j, dims = points.cols;
143 const float* data = points.ptr<float>(0);
171 points = _points;
174 points.release();
175 points.create(_points.size(), _points.type());
180 float* dstdata = points.ptr<float>(0);
182 size_t dstep = points.step1();
204 computeSums(points, ptofs, 0, n-1, sumstack.ptr<double>(top));
255 computeSums(points, ptofs, middle+1, last, rsums)
[all...] |
| /external/skia/gm/ |
| patch.cpp | 25 //draw control points
70 // The order of the colors and points is clockwise starting at upper-left corner.
72 //top points
74 //right points
76 //bottom points
78 //left points
|
| /external/skia/src/utils/win/ |
| SkDWriteGeometrySink.cpp | 75 void STDMETHODCALLTYPE SkDWriteGeometrySink::AddLines(const D2D1_POINT_2F *points, UINT pointsCount) {
76 for (const D2D1_POINT_2F *end = &points[pointsCount]; points < end; ++points) {
77 fPath->lineTo(points->x, points->y);
|
| /external/v8/test/mjsunit/ |
| debug-multiple-breakpoints.js | 32 // Simple debug event handler which just counts the number of break points hit.
49 // This test sets several break points at the same place and checks that
50 // several break points at the same place only makes one debug break event
65 // Remove one of the break points.
75 // Perform the same test using function g (this time removing the break points
91 // Finally test with many break points.
|
| /external/ImageMagick/PerlMagick/demo/ |
| shapes.pl | 18 points=>'30,30 100,10 190,290 30,290');
20 strokewidth=>5,points=>'100,100 50,75 0,360');
22 points=>'30,30 100,10 190,290 30,290');
|
| /external/chromium-trace/catapult/dashboard/dashboard/ |
| find_change_points.py | 23 # Maximum number of points to consider at one time.
26 # Minimum number of points in a segment. This can help filter out erroneous
27 # results by ignoring results that were found from looking at too few points.
40 # The "standard deviation" is based on a subset of points in the series.
52 # Number of points before and after the change point.
58 # Standard deviation of points before.
80 Only the last |max_window_size| points are examined, regardless of
81 how many points are passed in. The reason why it might make sense to
82 limit the number of points to look at is that if there are multiple
83 change-points in the window that's looked at, then this function wil
[all...] |
| /external/chromium-trace/catapult/third_party/graphy/graphy/ |
| pie_chart.py | 74 def __init__(self, points=None, labels=None, colors=None):
80 points: A list of data points for the pie chart;
94 if points:
95 self.AddPie(points, labels, colors)
97 def AddPie(self, points, labels=None, colors=None):
101 points: A list of pie segment sizes
112 for i, pt in enumerate(points):
122 def AddSegments(self, points, labels, colors):
127 for i, pt in enumerate(points)
[all...] |
| /external/eigen/unsupported/doc/examples/ |
| BVH_Example.cpp | 14 struct PointPointMinimizer //how to compute squared distances between points and rectangles
31 for(int i = 0; i < 100; ++i) { //initialize random set of red points and blue points
|
| /external/opencv3/doc/py_tutorials/py_calib3d/py_pose/ |
| py_pose.markdown | 36 **cv2.findChessboardCorners()**) and **axis points** to draw a 3D axis.
45 Then as in previous case, we create termination criteria, object points (3D points of corners in
46 chessboard) and axis points. Axis points are points in 3D space for drawing the axis. We draw axis
60 points** to the image plane. In simple words, we find the points on image plane corresponding to
62 to each of these points using our draw() function. Done !!!
75 # project 3D points to image plan
[all...] |
| /external/opencv3/doc/tutorials/features2d/detection_of_planar_objects/ |
| detection_of_planar_objects.markdown | 40 - Find the homography transformation between two sets of points: :
43 // fill the arrays with the points
47 - Create a set of inlier matches and draw them. Use perspectiveTransform function to map points
|
| /external/skia/src/pathops/ |
| SkDCubicToQuads.cpp | 9 http://stackoverflow.com/questions/2009160/how-do-i-convert-the-2-control-points-of-a-cubic-curve-to-the-single-control-poi
13 Let's call the control points of the cubic Q0..Q3 and the control points of the quadratic P0..P2.
|
| /frameworks/base/libs/hwui/ |
| PathParser.cpp | 187 std::vector<float> points; local
188 getFloats(&points, result, pathStr, start, end);
194 // If either verb or points is not valid, return immediately.
199 data->verbSizes.push_back(points.size());
200 data->points.insert(data->points.end(), points.begin(), points.end());
225 os << " " << data.points[start + j];
232 for (size_t i = 0; i < data.points.size(); i++)
[all...] |
| /frameworks/compile/mclinker/include/mcld/LD/ |
| DiagSymbolResolutions.inc | 27 "indirect symbol %0 points to a common symbol",
28 "indirect symbol %0 points to a common symbol")
31 "indirect symbol %0 points to a undefined symbol",
|
| /art/test/800-smali/smali/ |
| b_20224106.smali | 10 # Two failure points here:
|
| /cts/tests/tests/gesture/src/android/gesture/cts/ |
| LineGestureStrokeHelper.java | 34 // points have identical x and y coordinates
89 GestureStroke createGestureStroke(GesturePoint... points) {
90 ArrayList<GesturePoint> list = new ArrayList<GesturePoint>(points.length);
91 for (GesturePoint point : points) {
|
| /development/samples/devbytes/animation/CurvedMotion/src/com/example/android/curvedmotion/ |
| AnimatorPath.java | 22 * A simple Path object that holds information about the points along
30 // The points in the path
55 * point, the control points (c0X, c0Y) and (c1X, c1Y), and (x, y) as the end anchor.
62 * Returns a Collection of PathPoint objects that describe all points in the path.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
| RealConvergenceChecker.java | 39 /** Check if the optimization algorithm has converged considering the last points.
42 * different points. This can be detected by checking the iteration number at each
44 * correspond to points with the same role at each iteration, so they can be
46 * points of the simplex, not only for the best or worst ones.
|
| VectorialConvergenceChecker.java | 39 /** Check if the optimization algorithm has converged considering the last points.
42 * different points. This can be detected by checking the iteration number at each
44 * correspond to points with the same role at each iteration, so they can be
46 * points of the simplex, not only for the best or worst ones.
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/interfaces/ |
| ECPointEncoder.java | 13 * Set the formatting for encoding of points. If the String "UNCOMPRESSED" is passed
|
| /external/clang/test/CodeGen/ |
| debug-info-typedef.c | 2 // Test that the location of the typedef points to the header file.
|
