Lines Matching refs:spanY
567 int spanY = mDragOutlines[i].cellVSpan; in visualizeGrid() local
572 mCellHeight * spanY + mBorderSpacing * (spanY - 1) - paddingY); in visualizeGrid()
828 void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) { in regionToCenterPoint() argument
829 cellToRect(cellX, cellY, spanX, spanY, mTempRect); in regionToCenterPoint()
1036 void visualizeDropLocation(int cellX, int cellY, int spanX, int spanY, in visualizeDropLocation() argument
1039 || mDragCellSpan[1] != spanY) { in visualizeDropLocation()
1043 mDragCellSpan[1] = spanY; in visualizeDropLocation()
1046 applyColorExtractionOnWidget(dragObject, mDragCell, spanX, spanY); in visualizeDropLocation()
1056 cell.cellVSpan = spanY; in visualizeDropLocation()
1070 int spanX, int spanY) { in applyColorExtractionOnWidget() argument
1078 cellToRect(targetCell[0], targetCell[1], spanX, spanY, mTempRect); in applyColorExtractionOnWidget()
1122 int spanY, int[] result, int[] resultSpan) { in findNearestVacantArea() argument
1123 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, true, in findNearestVacantArea()
1159 int spanY, boolean ignoreOccupied, int[] result, int[] resultSpan) { in findNearestArea() argument
1166 pixelY -= mCellHeight * (spanY - 1) / 2f; in findNearestArea()
1177 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 || in findNearestArea()
1178 spanX < minSpanX || spanY < minSpanY) { in findNearestArea()
1204 boolean hitMaxY = ySize >= spanY; in findNearestArea()
1228 hitMaxY |= ySize >= spanY; in findNearestArea()
1233 hitMaxY = ySize >= spanY; in findNearestArea()
1295 private int[] findNearestArea(int cellX, int cellY, int spanX, int spanY, int[] direction, in findNearestArea() argument
1305 for (int y = 0; y < countY - (spanY - 1); y++) { in findNearestArea()
1310 for (int j = 0; j < spanY; j++) { in findNearestArea()
1350 findNearestArea(c.cellX, c.cellY, c.spanX, c.spanY, direction, in addViewToTempLocation()
1412 for (int j = cs.cellY; j < cs.cellY + cs.spanY; j++) { in computeEdge()
1420 for (int j = cs.cellY; j < cs.cellY + cs.spanY; j++) { in computeEdge()
1435 int bottom = cs.cellY + cs.spanY; in computeEdge()
1456 for (int i = cs.cellY; i < cs.cellY + cs.spanY; i++) { in isViewTouchingEdge()
1463 for (int i = cs.cellY; i < cs.cellY + cs.spanY; i++) { in isViewTouchingEdge()
1471 if (topEdge[i] == cs.cellY + cs.spanY) { in isViewTouchingEdge()
1533 return (r.cellY + r.spanY) - (l.cellY + l.spanY); in compare()
1664 blockOccupied.markCells(c.cellX - left, c.cellY - top, c.spanX, c.spanY, true); in addViewsToTempLocation()
1790 private boolean rearrangementExists(int cellX, int cellY, int spanX, int spanY, int[] direction, in rearrangementExists() argument
1796 mOccupiedRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
1806 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
1812 r1.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in rearrangementExists()
1864 int spanX, int spanY, int[] direction, View dragView, boolean decX, in findReorderSolution() argument
1875 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in findReorderSolution()
1880 success = rearrangementExists(result[0], result[1], spanX, spanY, direction, dragView, in findReorderSolution()
1886 if (spanX > minSpanX && (minSpanY == spanY || decX)) { in findReorderSolution()
1887 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY, in findReorderSolution()
1889 } else if (spanY > minSpanY) { in findReorderSolution()
1890 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1, in findReorderSolution()
1899 solution.spanY = spanY; in findReorderSolution()
1932 lp.cellVSpan = c.spanY; in copySolutionToTempState()
1977 mode, lp.cellX, lp.cellY, c.cellX, c.cellY, c.spanX, c.spanY); in beginOrAdjustReorderPreviewAnimations()
2020 int cellX1, int cellY1, int spanX, int spanY) { in ReorderPreviewAnimation() argument
2021 regionToCenterPoint(cellX0, cellY0, spanX, spanY, mTmpPoint); in ReorderPreviewAnimation()
2024 regionToCenterPoint(cellX1, cellY1, spanX, spanY, mTmpPoint); in ReorderPreviewAnimation()
2172 || info.spanY != lp.cellVSpan); in commitTempPlacement()
2177 info.spanY = lp.cellVSpan; in commitTempPlacement()
2181 screenId, info.cellX, info.cellY, info.spanX, info.spanY); in commitTempPlacement()
2196 int spanX, int spanY, View dragView, ItemConfiguration solution) { in findConfigurationNoShuffle() argument
2199 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, result, in findConfigurationNoShuffle()
2206 solution.spanY = resultSpan[1]; in findConfigurationNoShuffle()
2223 int spanY, View dragView, int[] resultDirection) { in getDirectionVectorForDrop() argument
2228 findNearestArea(dragViewCenterX, dragViewCenterY, spanX, spanY, targetDestination); in getDirectionVectorForDrop()
2230 cellToRect(targetDestination[0], targetDestination[1], spanX, spanY, dragRect); in getDirectionVectorForDrop()
2234 getViewsIntersectingRegion(targetDestination[0], targetDestination[1], spanX, spanY, in getDirectionVectorForDrop()
2244 int deltaY = (dropRegionRect.centerY() - dragViewCenterY) / spanY; in getDirectionVectorForDrop()
2249 if (dropRegionSpanY == mCountY || spanY == mCountY) { in getDirectionVectorForDrop()
2263 private void getViewsIntersectingRegion(int cellX, int cellY, int spanX, int spanY, in getViewsIntersectingRegion() argument
2266 boundingRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2269 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2286 boolean isNearestDropLocationOccupied(int pixelX, int pixelY, int spanX, int spanY, in isNearestDropLocationOccupied() argument
2288 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in isNearestDropLocationOccupied()
2289 getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null, in isNearestDropLocationOccupied()
2312 boolean createAreaForResize(int cellX, int cellY, int spanX, int spanY, in createAreaForResize() argument
2315 regionToCenterPoint(cellX, cellY, spanX, spanY, pixelXY); in createAreaForResize()
2318 ItemConfiguration swapSolution = findReorderSolution(pixelXY[0], pixelXY[1], spanX, spanY, in createAreaForResize()
2319 spanX, spanY, direction, dragView, true, new ItemConfiguration()); in createAreaForResize()
2343 int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY, in performReorder() argument
2346 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in performReorder()
2365 getDirectionVectorForDrop(pixelX, pixelY, spanX, spanY, dragView, mDirectionVector); in performReorder()
2372 spanX, spanY, mDirectionVector, dragView, true, new ItemConfiguration()); in performReorder()
2376 minSpanY, spanX, spanY, dragView, new ItemConfiguration()); in performReorder()
2395 resultSpan[1] = finalSolution.spanY; in performReorder()
2411 resultSpan[1] = finalSolution.spanY; in performReorder()
2481 return spanX * spanY; in area()
2489 outRect.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in getBoundingRectForViews()
2492 outRect.union(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in getBoundingRectForViews()
2510 public int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, int[] result) { in findNearestArea() argument
2511 return findNearestArea(pixelX, pixelY, spanX, spanY, spanX, spanY, false, result, null); in findNearestArea()
2531 public boolean findCellForSpan(int[] cellXY, int spanX, int spanY) { in findCellForSpan() argument
2535 return mOccupied.findVacantCell(cellXY, spanX, spanY); in findCellForSpan()
2818 spanY = info.spanY; in CellInfo()
2860 itemInfo.minSpanY, itemInfo.spanX, itemInfo.spanY, mDirectionVector, null, in hasReorderSolution()
2899 public boolean isRegionVacant(int x, int y, int spanX, int spanY) { in isRegionVacant() argument
2900 return mOccupied.isRegionVacant(x, y, spanX, spanY); in isRegionVacant()