Lines Matching refs:spanY
752 void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) { in regionToCenterPoint() argument
756 result[1] = vStartPadding + cellY * mCellHeight + (spanY * mCellHeight) / 2; in regionToCenterPoint()
766 void regionToRect(int cellX, int cellY, int spanX, int spanY, Rect result) { in regionToRect() argument
771 result.set(left, top, left + (spanX * mCellWidth), top + (spanY * mCellHeight)); in regionToRect()
988 int spanX, int spanY, boolean resize, DropTarget.DragObject dragObject) { in visualizeDropLocation() argument
1010 cellToRect(cellX, cellY, spanX, spanY, r); in visualizeDropLocation()
1033 top += ((mCellHeight * spanY) - dragOutline.getHeight()) / 2; in visualizeDropLocation()
1047 top += ((mCellHeight * spanY) - dragOutline.getHeight()) / 2; in visualizeDropLocation()
1095 int spanY, int[] result, int[] resultSpan) { in findNearestVacantArea() argument
1096 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, true, in findNearestVacantArea()
1132 int spanY, boolean ignoreOccupied, int[] result, int[] resultSpan) { in findNearestArea() argument
1139 pixelY -= mCellHeight * (spanY - 1) / 2f; in findNearestArea()
1150 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 || in findNearestArea()
1151 spanX < minSpanX || spanY < minSpanY) { in findNearestArea()
1177 boolean hitMaxY = ySize >= spanY; in findNearestArea()
1201 hitMaxY |= ySize >= spanY; in findNearestArea()
1206 hitMaxY = ySize >= spanY; in findNearestArea()
1268 private int[] findNearestArea(int cellX, int cellY, int spanX, int spanY, int[] direction, in findNearestArea() argument
1278 for (int y = 0; y < countY - (spanY - 1); y++) { in findNearestArea()
1283 for (int j = 0; j < spanY; j++) { in findNearestArea()
1323 findNearestArea(c.cellX, c.cellY, c.spanX, c.spanY, direction, in addViewToTempLocation()
1385 for (int j = cs.cellY; j < cs.cellY + cs.spanY; j++) { in computeEdge()
1393 for (int j = cs.cellY; j < cs.cellY + cs.spanY; j++) { in computeEdge()
1408 int bottom = cs.cellY + cs.spanY; in computeEdge()
1429 for (int i = cs.cellY; i < cs.cellY + cs.spanY; i++) { in isViewTouchingEdge()
1436 for (int i = cs.cellY; i < cs.cellY + cs.spanY; i++) { in isViewTouchingEdge()
1444 if (topEdge[i] == cs.cellY + cs.spanY) { in isViewTouchingEdge()
1506 return (r.cellY + r.spanY) - (l.cellY + l.spanY); in compare()
1637 blockOccupied.markCells(c.cellX - left, c.cellY - top, c.spanX, c.spanY, true); in addViewsToTempLocation()
1763 private boolean rearrangementExists(int cellX, int cellY, int spanX, int spanY, int[] direction, in rearrangementExists() argument
1769 mOccupiedRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
1779 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
1785 r1.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in rearrangementExists()
1837 int spanX, int spanY, int[] direction, View dragView, boolean decX, in findReorderSolution() argument
1848 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in findReorderSolution()
1853 success = rearrangementExists(result[0], result[1], spanX, spanY, direction, dragView, in findReorderSolution()
1859 if (spanX > minSpanX && (minSpanY == spanY || decX)) { in findReorderSolution()
1860 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY, in findReorderSolution()
1862 } else if (spanY > minSpanY) { in findReorderSolution()
1863 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1, in findReorderSolution()
1872 solution.spanY = spanY; in findReorderSolution()
1905 lp.cellVSpan = c.spanY; in copySolutionToTempState()
1949 lp.cellY, c.cellX, c.cellY, c.spanX, c.spanY); in beginOrAdjustReorderPreviewAnimations()
1978 int cellY1, int spanX, int spanY) { in ReorderPreviewAnimation() argument
1979 regionToCenterPoint(cellX0, cellY0, spanX, spanY, mTmpPoint); in ReorderPreviewAnimation()
1982 regionToCenterPoint(cellX1, cellY1, spanX, spanY, mTmpPoint); in ReorderPreviewAnimation()
2135 || info.spanY != lp.cellVSpan); in commitTempPlacement()
2140 info.spanY = lp.cellVSpan; in commitTempPlacement()
2144 info.cellX, info.cellY, info.spanX, info.spanY); in commitTempPlacement()
2159 int spanX, int spanY, View dragView, ItemConfiguration solution) { in findConfigurationNoShuffle() argument
2162 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, result, in findConfigurationNoShuffle()
2169 solution.spanY = resultSpan[1]; in findConfigurationNoShuffle()
2186 int spanY, View dragView, int[] resultDirection) { in getDirectionVectorForDrop() argument
2189 findNearestArea(dragViewCenterX, dragViewCenterY, spanX, spanY, targetDestination); in getDirectionVectorForDrop()
2191 regionToRect(targetDestination[0], targetDestination[1], spanX, spanY, dragRect); in getDirectionVectorForDrop()
2195 getViewsIntersectingRegion(targetDestination[0], targetDestination[1], spanX, spanY, in getDirectionVectorForDrop()
2205 int deltaY = (dropRegionRect.centerY() - dragViewCenterY) / spanY; in getDirectionVectorForDrop()
2210 if (dropRegionSpanY == mCountY || spanY == mCountY) { in getDirectionVectorForDrop()
2224 private void getViewsIntersectingRegion(int cellX, int cellY, int spanX, int spanY, in getViewsIntersectingRegion() argument
2227 boundingRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2230 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2247 boolean isNearestDropLocationOccupied(int pixelX, int pixelY, int spanX, int spanY, in isNearestDropLocationOccupied() argument
2249 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in isNearestDropLocationOccupied()
2250 getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null, in isNearestDropLocationOccupied()
2273 boolean createAreaForResize(int cellX, int cellY, int spanX, int spanY, in createAreaForResize() argument
2276 regionToCenterPoint(cellX, cellY, spanX, spanY, pixelXY); in createAreaForResize()
2279 ItemConfiguration swapSolution = findReorderSolution(pixelXY[0], pixelXY[1], spanX, spanY, in createAreaForResize()
2280 spanX, spanY, direction, dragView, true, new ItemConfiguration()); in createAreaForResize()
2304 int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY, in performReorder() argument
2307 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in performReorder()
2326 getDirectionVectorForDrop(pixelX, pixelY, spanX, spanY, dragView, mDirectionVector); in performReorder()
2333 spanX, spanY, mDirectionVector, dragView, true, new ItemConfiguration()); in performReorder()
2337 minSpanY, spanX, spanY, dragView, new ItemConfiguration()); in performReorder()
2356 resultSpan[1] = finalSolution.spanY; in performReorder()
2372 resultSpan[1] = finalSolution.spanY; in performReorder()
2442 return spanX * spanY; in area()
2450 outRect.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in getBoundingRectForViews()
2453 outRect.union(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY); in getBoundingRectForViews()
2471 public int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, int[] result) { in findNearestArea() argument
2472 return findNearestArea(pixelX, pixelY, spanX, spanY, spanX, spanY, false, result, null); in findNearestArea()
2492 public boolean findCellForSpan(int[] cellXY, int spanX, int spanY) { in findCellForSpan() argument
2496 return mOccupied.findVacantCell(cellXY, spanX, spanY); in findCellForSpan()
2786 spanY = info.spanY; in CellInfo()
2810 itemInfo.minSpanY, itemInfo.spanX, itemInfo.spanY, mDirectionVector, null, in hasReorderSolution()
2819 public boolean isRegionVacant(int x, int y, int spanX, int spanY) { in isRegionVacant() argument
2820 return mOccupied.isRegionVacant(x, y, spanX, spanY); in isRegionVacant()