Lines Matching refs:spanY
725 void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) { in regionToCenterPoint() argument
729 result[1] = vStartPadding + cellY * mCellHeight + (spanY * mCellHeight) / 2; in regionToCenterPoint()
739 void regionToRect(int cellX, int cellY, int spanX, int spanY, Rect result) { in regionToRect() argument
744 result.set(left, top, left + (spanX * mCellWidth), top + (spanY * mCellHeight)); in regionToRect()
951 int spanX, int spanY, boolean resize, DropTarget.DragObject dragObject) { in visualizeDropLocation() argument
973 cellToRect(cellX, cellY, spanX, spanY, r); in visualizeDropLocation()
996 top += ((mCellHeight * spanY) - dragOutline.getHeight()) / 2; in visualizeDropLocation()
1010 top += ((mCellHeight * spanY) - dragOutline.getHeight()) / 2; in visualizeDropLocation()
1059 int spanY, int[] result, int[] resultSpan) { in findNearestVacantArea() argument
1060 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, true, in findNearestVacantArea()
1096 int spanY, boolean ignoreOccupied, int[] result, int[] resultSpan) { in findNearestArea() argument
1103 pixelY -= mCellHeight * (spanY - 1) / 2f; in findNearestArea()
1114 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 || in findNearestArea()
1115 spanX < minSpanX || spanY < minSpanY) { in findNearestArea()
1141 boolean hitMaxY = ySize >= spanY; in findNearestArea()
1165 hitMaxY |= ySize >= spanY; in findNearestArea()
1170 hitMaxY = ySize >= spanY; in findNearestArea()
1232 private int[] findNearestArea(int cellX, int cellY, int spanX, int spanY, int[] direction, in findNearestArea() argument
1242 for (int y = 0; y < countY - (spanY - 1); y++) { in findNearestArea()
1247 for (int j = 0; j < spanY; j++) { in findNearestArea()
1287 findNearestArea(c.cellX, c.cellY, c.spanX, c.spanY, direction, in addViewToTempLocation()
1349 for (int j = cs.cellY; j < cs.cellY + cs.spanY; j++) { in computeEdge()
1357 for (int j = cs.cellY; j < cs.cellY + cs.spanY; j++) { in computeEdge()
1372 int bottom = cs.cellY + cs.spanY; in computeEdge()
1393 for (int i = cs.cellY; i < cs.cellY + cs.spanY; i++) { in isViewTouchingEdge()
1400 for (int i = cs.cellY; i < cs.cellY + cs.spanY; i++) { in isViewTouchingEdge()
1408 if (topEdge[i] == cs.cellY + cs.spanY) { in isViewTouchingEdge()
1470 return (r.cellY + r.spanY) - (l.cellY + l.spanY); in compare()
1601 blockOccupied.markCells(c.cellX - left, c.cellY - top, c.spanX, c.spanY, true); in addViewsToTempLocation()
1727 private boolean rearrangementExists(int cellX, int cellY, int spanX, int spanY, int[] direction, in rearrangementExists() argument
1733 mOccupiedRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
1743 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
1749 r1.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in rearrangementExists()
1801 int spanX, int spanY, int[] direction, View dragView, boolean decX, in findReorderSolution() argument
1812 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in findReorderSolution()
1817 success = rearrangementExists(result[0], result[1], spanX, spanY, direction, dragView, in findReorderSolution()
1823 if (spanX > minSpanX && (minSpanY == spanY || decX)) { in findReorderSolution()
1824 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY, in findReorderSolution()
1826 } else if (spanY > minSpanY) { in findReorderSolution()
1827 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1, in findReorderSolution()
1836 solution.spanY = spanY; in findReorderSolution()
1869 lp.cellVSpan = c.spanY; in copySolutionToTempState()
1913 lp.cellY, c.cellX, c.cellY, c.spanX, c.spanY); in beginOrAdjustReorderPreviewAnimations()
1956 int cellY1, int spanX, int spanY) { in ReorderPreviewAnimation() argument
1957 regionToCenterPoint(cellX0, cellY0, spanX, spanY, mTmpPoint); in ReorderPreviewAnimation()
1960 regionToCenterPoint(cellX1, cellY1, spanX, spanY, mTmpPoint); in ReorderPreviewAnimation()
2111 || info.spanY != lp.cellVSpan); in commitTempPlacement()
2116 info.spanY = lp.cellVSpan; in commitTempPlacement()
2120 screenId, info.cellX, info.cellY, info.spanX, info.spanY); in commitTempPlacement()
2135 int spanX, int spanY, View dragView, ItemConfiguration solution) { in findConfigurationNoShuffle() argument
2138 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, result, in findConfigurationNoShuffle()
2145 solution.spanY = resultSpan[1]; in findConfigurationNoShuffle()
2162 int spanY, View dragView, int[] resultDirection) { in getDirectionVectorForDrop() argument
2165 findNearestArea(dragViewCenterX, dragViewCenterY, spanX, spanY, targetDestination); in getDirectionVectorForDrop()
2167 regionToRect(targetDestination[0], targetDestination[1], spanX, spanY, dragRect); in getDirectionVectorForDrop()
2171 getViewsIntersectingRegion(targetDestination[0], targetDestination[1], spanX, spanY, in getDirectionVectorForDrop()
2181 int deltaY = (dropRegionRect.centerY() - dragViewCenterY) / spanY; in getDirectionVectorForDrop()
2186 if (dropRegionSpanY == mCountY || spanY == mCountY) { in getDirectionVectorForDrop()
2200 private void getViewsIntersectingRegion(int cellX, int cellY, int spanX, int spanY, in getViewsIntersectingRegion() argument
2203 boundingRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2206 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2223 boolean isNearestDropLocationOccupied(int pixelX, int pixelY, int spanX, int spanY, in isNearestDropLocationOccupied() argument
2225 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in isNearestDropLocationOccupied()
2226 getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null, in isNearestDropLocationOccupied()
2249 boolean createAreaForResize(int cellX, int cellY, int spanX, int spanY, in createAreaForResize() argument
2252 regionToCenterPoint(cellX, cellY, spanX, spanY, pixelXY); in createAreaForResize()
2255 ItemConfiguration swapSolution = findReorderSolution(pixelXY[0], pixelXY[1], spanX, spanY, in createAreaForResize()
2256 spanX, spanY, direction, dragView, true, new ItemConfiguration()); in createAreaForResize()
2280 int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY, in performReorder() argument
2283 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in performReorder()
2302 getDirectionVectorForDrop(pixelX, pixelY, spanX, spanY, dragView, mDirectionVector); in performReorder()
2309 spanX, spanY, mDirectionVector, dragView, true, new ItemConfiguration()); in performReorder()
2313 minSpanY, spanX, spanY, dragView, new ItemConfiguration()); in performReorder()
2332 resultSpan[1] = finalSolution.spanY; in performReorder()
2348 resultSpan[1] = finalSolution.spanY; in performReorder()
2418 return spanX * spanY; in area()
2426 outRect.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in getBoundingRectForViews()
2429 outRect.union(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in getBoundingRectForViews()
2447 public int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, int[] result) { in findNearestArea() argument
2448 return findNearestArea(pixelX, pixelY, spanX, spanY, spanX, spanY, false, result, null); in findNearestArea()
2468 public boolean findCellForSpan(int[] cellXY, int spanX, int spanY) { in findCellForSpan() argument
2472 return mOccupied.findVacantCell(cellXY, spanX, spanY); in findCellForSpan()
2725 spanY = info.spanY; in CellInfo()
2749 itemInfo.minSpanY, itemInfo.spanX, itemInfo.spanY, mDirectionVector, null, in hasReorderSolution()
2758 public boolean isRegionVacant(int x, int y, int spanX, int spanY) { in isRegionVacant() argument
2759 return mOccupied.isRegionVacant(x, y, spanX, spanY); in isRegionVacant()