Lines Matching refs:result
806 void pointToCellExact(int x, int y, int[] result) { in pointToCellExact() argument
810 result[0] = (x - hStartPadding) / (mCellWidth + mWidthGap); in pointToCellExact()
811 result[1] = (y - vStartPadding) / (mCellHeight + mHeightGap); in pointToCellExact()
816 if (result[0] < 0) result[0] = 0; in pointToCellExact()
817 if (result[0] >= xAxis) result[0] = xAxis - 1; in pointToCellExact()
818 if (result[1] < 0) result[1] = 0; in pointToCellExact()
819 if (result[1] >= yAxis) result[1] = yAxis - 1; in pointToCellExact()
828 void pointToCellRounded(int x, int y, int[] result) { in pointToCellRounded() argument
829 pointToCellExact(x + (mCellWidth / 2), y + (mCellHeight / 2), result); in pointToCellRounded()
840 void cellToPoint(int cellX, int cellY, int[] result) { in cellToPoint() argument
844 result[0] = hStartPadding + cellX * (mCellWidth + mWidthGap); in cellToPoint()
845 result[1] = vStartPadding + cellY * (mCellHeight + mHeightGap); in cellToPoint()
856 void cellToCenterPoint(int cellX, int cellY, int[] result) { in cellToCenterPoint() argument
857 regionToCenterPoint(cellX, cellY, 1, 1, result); in cellToCenterPoint()
868 void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) { in regionToCenterPoint() argument
871 result[0] = hStartPadding + cellX * (mCellWidth + mWidthGap) + in regionToCenterPoint()
873 result[1] = vStartPadding + cellY * (mCellHeight + mHeightGap) + in regionToCenterPoint()
884 void regionToRect(int cellX, int cellY, int spanX, int spanY, Rect result) { in regionToRect() argument
889 result.set(left, top, left + (spanX * mCellWidth + (spanX - 1) * mWidthGap), in regionToRect()
1188 void estimateDropCell(int originX, int originY, int spanX, int spanY, int[] result) { in estimateDropCell() argument
1194 pointToCellRounded(originX, originY, result); in estimateDropCell()
1197 int rightOverhang = result[0] + spanX - countX; in estimateDropCell()
1199 result[0] -= rightOverhang; // Snap to right in estimateDropCell()
1201 result[0] = Math.max(0, result[0]); // Snap to left in estimateDropCell()
1202 int bottomOverhang = result[1] + spanY - countY; in estimateDropCell()
1204 result[1] -= bottomOverhang; // Snap to bottom in estimateDropCell()
1206 result[1] = Math.max(0, result[1]); // Snap to top in estimateDropCell()
1297 int[] result) { in findNearestVacantArea() argument
1298 return findNearestVacantArea(pixelX, pixelY, spanX, spanY, null, result); in findNearestVacantArea()
1317 int spanY, int[] result, int[] resultSpan) { in findNearestVacantArea() argument
1319 result, resultSpan); in findNearestVacantArea()
1337 boolean ignoreOccupied, int[] result) { in findNearestArea() argument
1339 spanX, spanY, ignoreView, ignoreOccupied, result, null, mOccupied); in findNearestArea()
1374 View ignoreView, boolean ignoreOccupied, int[] result, int[] resultSpan, in findNearestArea() argument
1387 final int[] bestXY = result != null ? result : new int[2]; in findNearestArea()
1519 boolean[][] occupied, boolean blockOccupied[][], int[] result) { in findNearestArea() argument
1521 final int[] bestXY = result != null ? result : new int[2]; in findNearestArea()
2134 private void computeDirectionVector(float deltaX, float deltaY, int[] result) { in computeDirectionVector() argument
2137 result[0] = 0; in computeDirectionVector()
2138 result[1] = 0; in computeDirectionVector()
2140 result[0] = (int) Math.signum(deltaX); in computeDirectionVector()
2143 result[1] = (int) Math.signum(deltaY); in computeDirectionVector()
2165 int result[] = new int[2]; in simpleSwap() local
2166 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in simpleSwap()
2171 success = rearrangementExists(result[0], result[1], spanX, spanY, direction, dragView, in simpleSwap()
2187 solution.dragViewX = result[0]; in simpleSwap()
2188 solution.dragViewY = result[1]; in simpleSwap()
2437 int[] result = new int[2]; in findConfigurationNoShuffle() local
2439 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, null, result, in findConfigurationNoShuffle()
2441 if (result[0] >= 0 && result[1] >= 0) { in findConfigurationNoShuffle()
2443 solution.dragViewX = result[0]; in findConfigurationNoShuffle()
2444 solution.dragViewY = result[1]; in findConfigurationNoShuffle()
2529 View dragView, int[] result) { in isNearestDropLocationOccupied() argument
2530 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in isNearestDropLocationOccupied()
2531 getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null, in isNearestDropLocationOccupied()
2585 View dragView, int[] result, int resultSpan[], int mode) { in createArea() argument
2587 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in createArea()
2631 result[0] = finalSolution.dragViewX; in createArea()
2632 result[1] = finalSolution.dragViewY; in createArea()
2658 result[0] = result[1] = resultSpan[0] = resultSpan[1] = -1; in createArea()
2666 return result; in createArea()
2749 int pixelX, int pixelY, int spanX, int spanY, View ignoreView, int[] result) { in findNearestVacantArea() argument
2750 return findNearestArea(pixelX, pixelY, spanX, spanY, ignoreView, true, result); in findNearestVacantArea()
2769 int spanX, int spanY, View ignoreView, int[] result, int[] resultSpan) { in findNearestVacantArea() argument
2771 result, resultSpan, mOccupied); in findNearestVacantArea()
2788 int pixelX, int pixelY, int spanX, int spanY, int[] result) { in findNearestArea() argument
2789 return findNearestArea(pixelX, pixelY, spanX, spanY, null, false, result); in findNearestArea()
2990 public int[] rectToCell(int width, int height, int[] result) { in rectToCell() argument
2991 return rectToCell(getResources(), width, height, result); in rectToCell()
2994 public static int[] rectToCell(Resources resources, int width, int height, int[] result) { in rectToCell() argument
3005 if (result == null) { in rectToCell()
3008 result[0] = spanX; in rectToCell()
3009 result[1] = spanY; in rectToCell()
3010 return result; in rectToCell()