Searched defs:points (Results 1 - 7 of 7) sorted by relevance

/packages/apps/TvSettings/Settings/src/com/android/tv/settings/util/
H A DWindowLocationUtil.java35 * map points inside view into locations of a screen
37 * multiple points.
39 * @param points x[0], y[0], x[1], y[1], ...
41 public static void getLocationsInWindow(View view, float[] points) { argument
43 if (points == null || (points.length & 1) != 0) {
46 int length = points.length;
49 matrix.mapPoints(points);
55 points[i] += deltax;
57 points[
[all...]
/packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/
H A DSplineMath.java19 double[][] points = new double[mPoints.length][2];
22 points[i][0] = mPoints[i][0];
23 points[i][1] = mPoints[i][1];
26 double[] derivatives = solveSystem(points);
27 float start = (float) points[0][0];
28 float end = (float) (points[points.length - 1][0]);
30 curve[0][0] = (float) (points[0][0]);
31 curve[0][1] = (float) (points[0][1]);
33 curve[last][0] = (float) (points[point
112 solveSystem(double[][] points) argument
[all...]
/packages/apps/Gallery2/src/com/android/gallery3d/data/
H A DLocationClustering.java87 final ArrayList<Point> points = new ArrayList<Point>();
93 points.add(new Point(s.lat, s.lng));
105 pointsArray = points.toArray(pointsArray);
201 // Input: n points
204 private static int[] kMeans(Point points[], int[] bestK) { argument
205 int n = points.length;
212 Point[] groupSum = new Point[maxK]; // sum of points in each group.
213 int[] groupCount = new int[maxK]; // number of points in each group.
233 // step 1: (arbitrarily) pick k points as the initial centers.
236 Point p = points[
[all...]
/packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/
H A DSpline.java150 ControlPoint[] points = new ControlPoint[mPoints.size()];
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[
348 solveSystem(ControlPoint[] points) argument
[all...]
/packages/apps/Launcher3/tests/src/com/android/launcher3/model/
H A DGridSizeMigrationTaskTest.java423 public MultiStepMigrationTaskVerifier(int... points) { argument
427 for (int i = 0; i < points.length; i += 2) {
428 mPoints.add(new Point(points[i], points[i + 1]));
/packages/apps/Launcher3/src/com/android/launcher3/
H A DInvariantDeviceProfile.java266 final float width, final float height, ArrayList<InvariantDeviceProfile> points) {
269 ArrayList<InvariantDeviceProfile> pointsByNearness = points;
282 ArrayList<InvariantDeviceProfile> points) {
285 InvariantDeviceProfile p = points.get(0);
291 for (int i = 0; i < points.size() && i < KNEARESTNEIGHBOR; ++i) {
292 p = new InvariantDeviceProfile(points.get(i));
341 // We will use these two data points to extrapolate how much the wallpaper parallax effect
265 findClosestDeviceProfiles( final float width, final float height, ArrayList<InvariantDeviceProfile> points) argument
281 invDistWeightedInterpolate(float width, float height, ArrayList<InvariantDeviceProfile> points) argument
/packages/apps/Calendar/src/com/android/calendar/
H A DUtils.java879 public float[] points; field in class:Utils.DNAStrand
901 * HashMap of strands which contain the draw points and are organized by
903 * strand's color and calling drawLines on its set of points. The points are
1164 // list of points to draw
1175 strand.points = new float[strand.count * 4];
1178 // Go through each segment and compute its points
1180 // Add the points to the strand of that color
1199 strand.points[strand.position++] = x;
1200 strand.points[stran
[all...]

Completed in 1890 milliseconds