Lines Matching refs:spanX
600 int spanX = mDragOutlines[i].cellHSpan; in visualizeGrid() local
605 mCellWidth * spanX + mBorderSpace.x * (spanX - 1) - paddingX, in visualizeGrid()
862 void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) { in regionToCenterPoint() argument
863 cellToRect(cellX, cellY, spanX, spanY, mTempRect); in regionToCenterPoint()
1124 void visualizeDropLocation(int cellX, int cellY, int spanX, int spanY, in visualizeDropLocation() argument
1126 if (mDragCell[0] != cellX || mDragCell[1] != cellY || mDragCellSpan[0] != spanX in visualizeDropLocation()
1130 mDragCellSpan[0] = spanX; in visualizeDropLocation()
1134 applyColorExtractionOnWidget(dragObject, mDragCell, spanX, spanY); in visualizeDropLocation()
1143 cell.cellHSpan = spanX; in visualizeDropLocation()
1158 int spanX, int spanY) { in applyColorExtractionOnWidget() argument
1165 cellToRect(targetCell[0], targetCell[1], spanX, spanY, mTempRect); in applyColorExtractionOnWidget()
1203 int[] findNearestVacantArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, in findNearestVacantArea() argument
1205 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, true, in findNearestVacantArea()
1240 private int[] findNearestArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, in findNearestArea() argument
1247 pixelX -= mCellWidth * (spanX - 1) / 2f; in findNearestArea()
1259 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 || in findNearestArea()
1260 spanX < minSpanX || spanY < minSpanY) { in findNearestArea()
1285 boolean hitMaxX = xSize >= spanX; in findNearestArea()
1309 hitMaxX |= xSize >= spanX; in findNearestArea()
1314 hitMaxX = xSize >= spanX; in findNearestArea()
1377 private int[] findNearestArea(int cellX, int cellY, int spanX, int spanY, int[] direction, in findNearestArea() argument
1389 for (int x = 0; x < countX - (spanX - 1); x++) { in findNearestArea()
1391 for (int i = 0; i < spanX; i++) { in findNearestArea()
1432 findNearestArea(c.cellX, c.cellY, c.spanX, c.spanY, direction, in addViewToTempLocation()
1501 int right = cs.cellX + cs.spanX; in computeEdge()
1510 for (int j = cs.cellX; j < cs.cellX + cs.spanX; j++) { in computeEdge()
1518 for (int j = cs.cellX; j < cs.cellX + cs.spanX; j++) { in computeEdge()
1539 if (leftEdge[i] == cs.cellX + cs.spanX) { in isViewTouchingEdge()
1552 for (int i = cs.cellX; i < cs.cellX + cs.spanX; i++) { in isViewTouchingEdge()
1559 for (int i = cs.cellX; i < cs.cellX + cs.spanX; i++) { in isViewTouchingEdge()
1611 return (r.cellX + r.spanX) - (l.cellX + l.spanX); in compare()
1746 blockOccupied.markCells(c.cellX - left, c.cellY - top, c.spanX, c.spanY, true); in addViewsToTempLocation()
1872 private boolean rearrangementExists(int cellX, int cellY, int spanX, int spanY, int[] direction, in rearrangementExists() argument
1878 mOccupiedRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
1888 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
1894 r1.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in rearrangementExists()
1946 int spanX, int spanY, int[] direction, View dragView, boolean decX, in findReorderSolution() argument
1957 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in findReorderSolution()
1962 success = rearrangementExists(result[0], result[1], spanX, spanY, direction, dragView, in findReorderSolution()
1968 if (spanX > minSpanX && (minSpanY == spanY || decX)) { in findReorderSolution()
1969 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY, in findReorderSolution()
1972 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1, in findReorderSolution()
1980 solution.spanX = spanX; in findReorderSolution()
2013 lp.cellHSpan = c.spanX; in copySolutionToTempState()
2059 mode, lp.cellX, lp.cellY, c.cellX, c.cellY, c.spanX, c.spanY); in beginOrAdjustReorderPreviewAnimations()
2102 int cellX1, int cellY1, int spanX, int spanY) { in ReorderPreviewAnimation() argument
2103 regionToCenterPoint(cellX0, cellY0, spanX, spanY, mTmpPoint); in ReorderPreviewAnimation()
2106 regionToCenterPoint(cellX1, cellY1, spanX, spanY, mTmpPoint); in ReorderPreviewAnimation()
2253 || info.cellY != lp.tmpCellY || info.spanX != lp.cellHSpan in commitTempPlacement()
2258 info.spanX = lp.cellHSpan; in commitTempPlacement()
2263 screenId, info.cellX, info.cellY, info.spanX, info.spanY); in commitTempPlacement()
2278 int spanX, int spanY, View dragView, ItemConfiguration solution) { in findConfigurationNoShuffle() argument
2281 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, result, in findConfigurationNoShuffle()
2287 solution.spanX = resultSpan[0]; in findConfigurationNoShuffle()
2304 private void getDirectionVectorForDrop(int dragViewCenterX, int dragViewCenterY, int spanX, in getDirectionVectorForDrop() argument
2310 findNearestArea(dragViewCenterX, dragViewCenterY, spanX, spanY, targetDestination); in getDirectionVectorForDrop()
2312 cellToRect(targetDestination[0], targetDestination[1], spanX, spanY, dragRect); in getDirectionVectorForDrop()
2316 getViewsIntersectingRegion(targetDestination[0], targetDestination[1], spanX, spanY, in getDirectionVectorForDrop()
2325 int deltaX = (dropRegionRect.centerX() - dragViewCenterX) / spanX; in getDirectionVectorForDrop()
2328 if (dropRegionSpanX == mCountX || spanX == mCountX) { in getDirectionVectorForDrop()
2345 private void getViewsIntersectingRegion(int cellX, int cellY, int spanX, int spanY, in getViewsIntersectingRegion() argument
2348 boundingRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2351 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2368 boolean isNearestDropLocationOccupied(int pixelX, int pixelY, int spanX, int spanY, in isNearestDropLocationOccupied() argument
2370 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in isNearestDropLocationOccupied()
2371 getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null, in isNearestDropLocationOccupied()
2394 boolean createAreaForResize(int cellX, int cellY, int spanX, int spanY, in createAreaForResize() argument
2397 regionToCenterPoint(cellX, cellY, spanX, spanY, pixelXY); in createAreaForResize()
2400 ItemConfiguration swapSolution = findReorderSolution(pixelXY[0], pixelXY[1], spanX, spanY, in createAreaForResize()
2401 spanX, spanY, direction, dragView, true, new ItemConfiguration()); in createAreaForResize()
2425 int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY, in performReorder() argument
2428 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in performReorder()
2447 getDirectionVectorForDrop(pixelX, pixelY, spanX, spanY, dragView, mDirectionVector); in performReorder()
2454 spanX, spanY, mDirectionVector, dragView, true, new ItemConfiguration()); in performReorder()
2458 minSpanY, spanX, spanY, dragView, new ItemConfiguration()); in performReorder()
2476 resultSpan[0] = finalSolution.spanX; in performReorder()
2492 resultSpan[0] = finalSolution.spanX; in performReorder()
2564 return spanX * spanY; in area()
2572 outRect.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in getBoundingRectForViews()
2575 outRect.union(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in getBoundingRectForViews()
2593 public int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, int[] result) { in findNearestArea() argument
2594 return findNearestArea(pixelX, pixelY, spanX, spanY, spanX, spanY, false, result, null); in findNearestArea()
2614 public boolean findCellForSpan(int[] cellXY, int spanX, int spanY) { in findCellForSpan() argument
2618 return mOccupied.findVacantCell(cellXY, spanX, spanY); in findCellForSpan()
2900 spanX = info.spanX; in CellInfo()
2943 itemInfo.minSpanY, itemInfo.spanX, itemInfo.spanY, mDirectionVector, null, in hasReorderSolution()
2982 public boolean isRegionVacant(int x, int y, int spanX, int spanY) { in isRegionVacant() argument
2983 return mOccupied.isRegionVacant(x, y, spanX, spanY); in isRegionVacant()