Lines Matching refs:result
696 public void pointToCellExact(int x, int y, int[] result) { in pointToCellExact() argument
700 result[0] = (x - hStartPadding) / (mCellWidth + mWidthGap); in pointToCellExact()
701 result[1] = (y - vStartPadding) / (mCellHeight + mHeightGap); in pointToCellExact()
706 if (result[0] < 0) result[0] = 0; in pointToCellExact()
707 if (result[0] >= xAxis) result[0] = xAxis - 1; in pointToCellExact()
708 if (result[1] < 0) result[1] = 0; in pointToCellExact()
709 if (result[1] >= yAxis) result[1] = yAxis - 1; in pointToCellExact()
718 void pointToCellRounded(int x, int y, int[] result) { in pointToCellRounded() argument
719 pointToCellExact(x + (mCellWidth / 2), y + (mCellHeight / 2), result); in pointToCellRounded()
730 void cellToPoint(int cellX, int cellY, int[] result) { in cellToPoint() argument
734 result[0] = hStartPadding + cellX * (mCellWidth + mWidthGap); in cellToPoint()
735 result[1] = vStartPadding + cellY * (mCellHeight + mHeightGap); in cellToPoint()
746 void cellToCenterPoint(int cellX, int cellY, int[] result) { in cellToCenterPoint() argument
747 regionToCenterPoint(cellX, cellY, 1, 1, result); in cellToCenterPoint()
758 void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) { in regionToCenterPoint() argument
761 result[0] = hStartPadding + cellX * (mCellWidth + mWidthGap) + in regionToCenterPoint()
763 result[1] = vStartPadding + cellY * (mCellHeight + mHeightGap) + in regionToCenterPoint()
774 void regionToRect(int cellX, int cellY, int spanX, int spanY, Rect result) { in regionToRect() argument
779 result.set(left, top, left + (spanX * mCellWidth + (spanX - 1) * mWidthGap), in regionToRect()
1104 int[] findNearestVacantArea(int pixelX, int pixelY, int spanX, int spanY, int[] result) { in findNearestVacantArea() argument
1105 return findNearestVacantArea(pixelX, pixelY, spanX, spanY, spanX, spanY, result, null); in findNearestVacantArea()
1124 int spanY, int[] result, int[] resultSpan) { in findNearestVacantArea() argument
1126 result, resultSpan); in findNearestVacantArea()
1161 int spanY, boolean ignoreOccupied, int[] result, int[] resultSpan) { in findNearestArea() argument
1171 final int[] bestXY = result != null ? result : new int[2]; in findNearestArea()
1300 boolean[][] occupied, boolean blockOccupied[][], int[] result) { in findNearestArea() argument
1302 final int[] bestXY = result != null ? result : new int[2]; in findNearestArea()
1916 private void computeDirectionVector(float deltaX, float deltaY, int[] result) { in computeDirectionVector() argument
1919 result[0] = 0; in computeDirectionVector()
1920 result[1] = 0; in computeDirectionVector()
1922 result[0] = (int) Math.signum(deltaX); in computeDirectionVector()
1925 result[1] = (int) Math.signum(deltaY); in computeDirectionVector()
1948 int result[] = new int[2]; in findReorderSolution() local
1949 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in findReorderSolution()
1954 success = rearrangementExists(result[0], result[1], spanX, spanY, direction, dragView, in findReorderSolution()
1970 solution.dragViewX = result[0]; in findReorderSolution()
1971 solution.dragViewY = result[1]; in findReorderSolution()
2236 int[] result = new int[2]; in findConfigurationNoShuffle() local
2238 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, result, in findConfigurationNoShuffle()
2240 if (result[0] >= 0 && result[1] >= 0) { in findConfigurationNoShuffle()
2242 solution.dragViewX = result[0]; in findConfigurationNoShuffle()
2243 solution.dragViewY = result[1]; in findConfigurationNoShuffle()
2328 View dragView, int[] result) { in isNearestDropLocationOccupied() argument
2329 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in isNearestDropLocationOccupied()
2330 getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null, in isNearestDropLocationOccupied()
2385 View dragView, int[] result, int resultSpan[], int mode) { in performReorder() argument
2387 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in performReorder()
2433 result[0] = finalSolution.dragViewX; in performReorder()
2434 result[1] = finalSolution.dragViewY; in performReorder()
2438 result[0] = result[1] = resultSpan[0] = resultSpan[1] = -1; in performReorder()
2440 return result; in performReorder()
2449 result[0] = finalSolution.dragViewX; in performReorder()
2450 result[1] = finalSolution.dragViewY; in performReorder()
2476 result[0] = result[1] = resultSpan[0] = resultSpan[1] = -1; in performReorder()
2484 return result; in performReorder()
2567 int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, int[] result) { in findNearestArea() argument
2568 return findNearestArea(pixelX, pixelY, spanX, spanY, spanX, spanY, false, result, null); in findNearestArea()