/frameworks/base/libs/hwui/ |
SpotShadow.h | 40 static void computeLightPolygon(int points, const Vector3& lightCenter, 47 static void xsort(Vector2* points, int pointsLength); 48 static int hull(Vector2* points, int pointsLength, Vector2* retPoly); 52 static void swap(Vector2* points, int i, int j); 53 static void quicksortCirc(Vector2* points, int low, int high, const Vector2& center); 54 static void quicksortX(Vector2* points, int low, int high);
|
/external/skia/bench/ |
PatchGridBench.cpp | 102 SkPoint points[12]; local 105 points[SkPatchUtils::kTopP0_CubicCtrlPts] = vertices[i][j]; 106 points[SkPatchUtils::kTopP3_CubicCtrlPts] = vertices[i][j + 1]; 107 points[SkPatchUtils::kBottomP0_CubicCtrlPts] = vertices[i + 1][j]; 108 points[SkPatchUtils::kBottomP3_CubicCtrlPts] = vertices[i + 1][j + 1]; 110 points[SkPatchUtils::kTopP1_CubicCtrlPts] = hrzCtrl[i][j * 2]; 111 points[SkPatchUtils::kTopP2_CubicCtrlPts] = hrzCtrl[i][j * 2 + 1]; 112 points[SkPatchUtils::kBottomP1_CubicCtrlPts] = hrzCtrl[i + 1][j * 2]; 113 points[SkPatchUtils::kBottomP2_CubicCtrlPts] = hrzCtrl[i + 1][j * 2 + 1]; 115 points[SkPatchUtils::kLeftP1_CubicCtrlPts] = vrtCtrl[i * 2][j] [all...] |
/external/icu/icu4c/source/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...] |
/packages/apps/LegacyCamera/tests/src/com/android/camera/unittest/ |
CameraTest.java | 78 float[] points; local 82 points = new float[] {-1000, -1000, 0, 0, 1000, 1000, 0, 1000, -750, 250}; 84 matrix.mapPoints(points); 85 assertEquals(expected, points); 88 points = new float[] {-1000, -1000, 0, 0, 1000, 1000, 0, 1000, -750, 250}; 90 matrix.mapPoints(points); 91 assertEquals(expected, points); 94 points = new float[] {-1000, -1000, 0, 0, 1000, 1000, 0, 1000, -750, 250}; 96 matrix.mapPoints(points); 97 assertEquals(expected, points); [all...] |
/external/libgdx/gdx/src/com/badlogic/gdx/math/ |
DelaunayTriangulator.java | 42 public ShortArray computeTriangles (FloatArray points, boolean sorted) {
43 return computeTriangles(points.items, 0, points.size, sorted);
52 * @param points x,y pairs describing points. Duplicate points will result in undefined behavior.
53 * @param sorted If false, the points will be sorted by the x coordinate, which is required by the triangulation algorithm. If
56 * @return triples of indices into the points that describe the triangles in clockwise order. Note the returned array is reused
58 public ShortArray computeTriangles (float[] points, int offset, int count, boolean sorted) {
66 System.arraycopy(points, offset, sortedPoints, 0, count); [all...] |
/art/tools/dexfuzz/src/dexfuzz/rawdex/ |
Offset.java | 28 * The Offsettable that this Offset points to. 34 * couldn't be written because what it points to hasn't been written 55 * Only one Offset should have this flag set, the MapItem that points 87 * Returns true if this Offset points at the provided RawDexObject. 97 * Returns true if this Offset points at the provided Offsettable. 111 Log.debug("Updating what an Offset points to..."); 122 * method is needed to indicate that this Offset now points at something. 127 Log.debug("Updating what an Offset points to...");
|
/development/perftests/panorama/feature_stab/db_vlvm/ |
db_rob_image_homography.h | 59 \param im first image points 60 \param im_p second image points 61 \param nr_points number of points 82 \param max_points only use this many points 91 Points are assumed to be given in 94 /*Nr of points in total*/ 97 used to normalize the points*/ 125 // its corresponding stereo pair's points
|
/external/chromium-trace/catapult/dashboard/dashboard/ |
new_points.py | 5 """Provides a web interface for seeing recently added points.""" 12 # Number of points to list if no number of points is specified. 20 """Shows a page with a list of recently added points.""" 23 """Gets the page for viewing recently added points. 29 A page showing recently added points. 64 # If a valid number of points was given, use it. Otherwise use the default. 87 'points from the first %s tests.' %
|
/external/guice/core/test/com/google/inject/spi/ |
InjectionPointTest.java | 244 Set<InjectionPoint> points; local 246 points = InjectionPoint.forInstanceMethodsAndFields(Super.class); 247 assertEquals(points.toString(), 6, points.size()); 248 assertPoints(points, Super.class, "atInject", "gInject", "privateAtAndPublicG", 251 points = InjectionPoint.forInstanceMethodsAndFields(Sub.class); 252 assertEquals(points.toString(), 7, points.size()); 255 assertPoints(points, Super.class, "privateAtAndPublicG", "privateGAndPublicAt", "gInject"); 258 assertPoints(points, Sub.class, "privateAtAndPublicG", "privateGAndPublicAt" 287 Set<InjectionPoint> points; local [all...] |
/external/libgdx/extensions/gdx-box2d/gdx-box2d/src/com/badlogic/gdx/physics/box2d/ |
Manifold.java | 28 final ManifoldPoint[] points = new ManifoldPoint[] {new ManifoldPoint(), new ManifoldPoint()}; field in class:Manifold 90 ManifoldPoint point = points[i]; 97 return points; 103 values[0] = manifold->points[idx].localPoint.x; 104 values[1] = manifold->points[idx].localPoint.y; 105 values[2] = manifold->points[idx].normalImpulse; 106 values[3] = manifold->points[idx].tangentImpulse; 108 return (jint)manifold->points[idx].id.key;
|
/external/libgdx/extensions/gdx-tools/src/com/badlogic/gdx/tools/hiero/unicodefont/effects/ |
OutlineWobbleEffect.java | 72 float points[] = new float[6];
local 79 type = it.currentSegment(points);
82 moveX = lastX = randomize(points[0]);
83 moveY = lastY = randomize(points[1]);
89 points[0] = moveX;
90 points[1] = moveY;
94 thisX = randomize(points[0]);
95 thisY = randomize(points[1]);
|
OutlineZigzagEffect.java | 71 float points[] = new float[6];
local 79 type = it.currentSegment(points);
82 moveX = lastX = points[0];
83 moveY = lastY = points[1];
89 points[0] = moveX;
90 points[1] = moveY;
94 thisX = points[0];
95 thisY = points[1];
|
/external/opencv3/modules/ml/src/ |
kdtree.hpp | 27 KDTree T(points, false); 58 CV_WRAP KDTree(InputArray points, bool copyAndReorderPoints = false); 60 CV_WRAP KDTree(InputArray points, InputArray _labels, 63 CV_WRAP void build(InputArray points, bool copyAndReorderPoints = false); 65 CV_WRAP void build(InputArray points, InputArray labels, 73 //! finds all the points from the initial set that belong to the specified box 88 CV_PROP Mat points; //!< all the points. It can be a reordered copy of the input vector set or the original vector set. member in class:cv::ml::KDTree
|
/external/skia/src/svg/parser/ |
SkSVGPolygon.cpp | 16 SVG_ATTRIBUTE(points) 29 SVG_ADD_ATTRIBUTE(points);
|
SkSVGPolyline.cpp | 22 SVG_ATTRIBUTE(points) 39 SVG_ADD_ATTRIBUTE(points);
|
/external/skia/tools/lua/ |
scrape_dashing_full.lua | 98 local points = t.points 99 increment(drawPoints_count, #points) 100 if 2 == #points then 101 if points[1].y == points[2].y then 103 elseif points[1].x == points[2].x then
|
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_rob_image_homography.h | 59 \param im first image points 60 \param im_p second image points 61 \param nr_points number of points 82 \param max_points only use this many points 91 Points are assumed to be given in 94 /*Nr of points in total*/ 97 used to normalize the points*/ 125 // its corresponding stereo pair's points
|
/external/skia/src/gpu/gl/ |
GrGLPath.cpp | 82 inline void points_to_coords(const SkPoint points[], size_t first_point, size_t amount, 85 coords[i * 2] = SkScalarToFloat(points[first_point + i].fX); 86 coords[i * 2 + 1] = SkScalarToFloat(points[first_point + i].fY); 101 SkPoint points[4]; local 104 while ((verb = iter.next(points)) != SkPath::kDone_Verb) { 113 points_to_coords(points, 0, 1, coords); 118 if (SkPath::IsLineDegenerate(points[0], points[1], true)) { 124 points_to_coords(points, 1, 1, coords); 129 if (SkPath::IsQuadDegenerate(points[0], points[1], points[2], true)) [all...] |
/dalvik/dx/tests/014-field-attrib-ConstantValue/ |
info.txt | 6 fields, each with a single ConstantValue attribute, which points at one
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
BivariateRealGridInterpolator.java | 24 * sample points must be specified on a regular grid. 32 * @param xval All the x-coordinates of the interpolation points, sorted 34 * @param yval All the y-coordinates of the interpolation points, sorted 36 * @param fval The values of the interpolation points on all the grid knots:
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
Clusterable.java | 23 * Interface for points that can be clustered together. 39 * Returns the centroid of the given Collection of points. 41 * @param p the Collection of points to compute the centroid of 42 * @return the centroid of the given Collection of Points
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
CRLDistPoint.java | 45 DistributionPoint[] points) 49 for (int i = 0; i != points.length; i++) 51 v.add(points[i]); 58 * Return the distribution points making up the sequence.
|
/external/llvm/test/Object/ |
objdump-shndx.test | 3 Test that llvm-objdump can handle shndx. The relocation points to a section
|
/external/pdfium/xfa/src/fxbarcode/pdf417/ |
BC_PDF417DetectorResult.h | 12 CBC_PDF417DetectorResult(CBC_CommonBitMatrix* bits, CFX_PtrArray* points);
|
/external/pdfium/xfa/src/fxbarcode/qrcode/ |
BC_QRDetectorResult.h | 17 CBC_QRDetectorResult(CBC_CommonBitMatrix* bits, CFX_PtrArray* points);
|