Lines Matching refs:spanY
742 cellInfo.spanY = lp.cellVSpan; in setTagToCellInfoForPoint()
759 cellInfo.spanY = 1; in setTagToCellInfoForPoint()
792 cellInfo.spanY = 0; in clearTagCellInfo()
868 void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) { in regionToCenterPoint() argument
874 (spanY * mCellHeight + (spanY - 1) * mHeightGap) / 2; in regionToCenterPoint()
884 void regionToRect(int cellX, int cellY, int spanX, int spanY, Rect result) { in regionToRect() argument
890 top + (spanY * mCellHeight + (spanY - 1) * mHeightGap)); in regionToRect()
1188 void estimateDropCell(int originX, int originY, int spanX, int spanY, int[] result) { in estimateDropCell() argument
1202 int bottomOverhang = result[1] + spanY - countY; in estimateDropCell()
1210 int cellY, int spanX, int spanY, boolean resize, Point dragOffset, Rect dragRegion) { in visualizeDropLocation() argument
1259 top += ((mCellHeight * spanY) + ((spanY - 1) * mHeightGap) in visualizeDropLocation()
1269 cellToRect(cellX, cellY, spanX, spanY, r); in visualizeDropLocation()
1296 int[] findNearestVacantArea(int pixelX, int pixelY, int spanX, int spanY, in findNearestVacantArea() argument
1298 return findNearestVacantArea(pixelX, pixelY, spanX, spanY, null, result); in findNearestVacantArea()
1317 int spanY, int[] result, int[] resultSpan) { in findNearestVacantArea() argument
1318 return findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, null, in findNearestVacantArea()
1336 int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, View ignoreView, in findNearestArea() argument
1338 return findNearestArea(pixelX, pixelY, spanX, spanY, in findNearestArea()
1339 spanX, spanY, ignoreView, ignoreOccupied, result, null, mOccupied); in findNearestArea()
1373 int[] findNearestArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY, in findNearestArea() argument
1384 pixelY -= (mCellHeight + mHeightGap) * (spanY - 1) / 2f; in findNearestArea()
1395 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 || in findNearestArea()
1396 spanX < minSpanX || spanY < minSpanY) { in findNearestArea()
1422 boolean hitMaxY = ySize >= spanY; in findNearestArea()
1446 hitMaxY |= ySize >= spanY; in findNearestArea()
1451 hitMaxY = ySize >= spanY; in findNearestArea()
1518 private int[] findNearestArea(int cellX, int cellY, int spanX, int spanY, int[] direction, in findNearestArea() argument
1528 for (int y = 0; y < countY - (spanY - 1); y++) { in findNearestArea()
1533 for (int j = 0; j < spanY; j++) { in findNearestArea()
1574 markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, false); in addViewToTempLocation()
1577 findNearestArea(c.x, c.y, c.spanX, c.spanY, direction, mTmpOccupied, null, mTempLocation); in addViewToTempLocation()
1584 markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, true); in addViewToTempLocation()
1640 for (int j = cs.y; j < cs.y + cs.spanY; j++) { in computeEdge()
1648 for (int j = cs.y; j < cs.y + cs.spanY; j++) { in computeEdge()
1663 int bottom = cs.y + cs.spanY; in computeEdge()
1681 for (int i = cs.y; i < cs.y + cs.spanY; i++) { in isViewTouchingEdge()
1688 for (int i = cs.y; i < cs.y + cs.spanY; i++) { in isViewTouchingEdge()
1696 if (edge[i] == cs.y + cs.spanY) { in isViewTouchingEdge()
1745 boundingRect.set(c.x, c.y, c.x + c.spanX, c.y + c.spanY); in getBoundingRect()
1748 boundingRect.union(c.x, c.y, c.x + c.spanX, c.y + c.spanY); in getBoundingRect()
1809 return (r.y + r.spanY) - (l.y + l.spanY); in compare()
1856 markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, false); in pushViewsToTempLocation()
1886 markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, false); in pushViewsToTempLocation()
1912 markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, true); in pushViewsToTempLocation()
1928 boundingRect = new Rect(c.x, c.y, c.x + c.spanX, c.y + c.spanY); in addViewsToTempLocation()
1930 boundingRect.union(c.x, c.y, c.x + c.spanX, c.y + c.spanY); in addViewsToTempLocation()
1937 markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, false); in addViewsToTempLocation()
1947 markCellsForView(c.x - left, c.y - top, c.spanX, c.spanY, blockOccupied, true); in addViewsToTempLocation()
1970 markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, true); in addViewsToTempLocation()
2076 private boolean rearrangementExists(int cellX, int cellY, int spanX, int spanY, int[] direction, in rearrangementExists() argument
2082 mOccupiedRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
2092 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in rearrangementExists()
2098 r1.set(c.x, c.y, c.x + c.spanX, c.y + c.spanY); in rearrangementExists()
2156 int spanY, int[] direction, View dragView, boolean decX, ItemConfiguration solution) { in simpleSwap() argument
2166 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in simpleSwap()
2171 success = rearrangementExists(result[0], result[1], spanX, spanY, direction, dragView, in simpleSwap()
2177 if (spanX > minSpanX && (minSpanY == spanY || decX)) { in simpleSwap()
2178 return simpleSwap(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY, direction, in simpleSwap()
2180 } else if (spanY > minSpanY) { in simpleSwap()
2181 return simpleSwap(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1, direction, in simpleSwap()
2190 solution.dragViewSpanY = spanY; in simpleSwap()
2227 lp.cellVSpan = c.spanY; in copySolutionToTempState()
2228 markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, true); in copySolutionToTempState()
2253 markCellsForView(c.x, c.y, c.spanX, c.spanY, occupied, true); in animateItemsToSolution()
2272 c.x, c.y, c.spanX, c.spanY); in beginOrAdjustHintAnimations()
2292 int spanX, int spanY) { in ReorderHintAnimation() argument
2293 regionToCenterPoint(cellX0, cellY0, spanX, spanY, mTmpPoint); in ReorderHintAnimation()
2296 regionToCenterPoint(cellX1, cellY1, spanX, spanY, mTmpPoint); in ReorderHintAnimation()
2415 info.spanX != lp.cellHSpan || info.spanY != lp.cellVSpan) { in commitTempPlacement()
2421 info.spanY = lp.cellVSpan; in commitTempPlacement()
2436 int spanX, int spanY, View dragView, ItemConfiguration solution) { in findConfigurationNoShuffle() argument
2439 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, null, result, in findConfigurationNoShuffle()
2467 int spanY, View dragView, int[] resultDirection) { in getDirectionVectorForDrop() argument
2470 findNearestArea(dragViewCenterX, dragViewCenterY, spanX, spanY, targetDestination); in getDirectionVectorForDrop()
2472 regionToRect(targetDestination[0], targetDestination[1], spanX, spanY, dragRect); in getDirectionVectorForDrop()
2476 getViewsIntersectingRegion(targetDestination[0], targetDestination[1], spanX, spanY, in getDirectionVectorForDrop()
2486 int deltaY = (dropRegionRect.centerY() - dragViewCenterY) / spanY; in getDirectionVectorForDrop()
2491 if (dropRegionSpanY == mCountY || spanY == mCountY) { in getDirectionVectorForDrop()
2505 private void getViewsIntersectingRegion(int cellX, int cellY, int spanX, int spanY, in getViewsIntersectingRegion() argument
2508 boundingRect.set(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2511 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY); in getViewsIntersectingRegion()
2528 boolean isNearestDropLocationOccupied(int pixelX, int pixelY, int spanX, int spanY, in isNearestDropLocationOccupied() argument
2530 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in isNearestDropLocationOccupied()
2531 getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null, in isNearestDropLocationOccupied()
2553 boolean createAreaForResize(int cellX, int cellY, int spanX, int spanY, in createAreaForResize() argument
2556 regionToCenterPoint(cellX, cellY, spanX, spanY, pixelXY); in createAreaForResize()
2559 ItemConfiguration swapSolution = simpleSwap(pixelXY[0], pixelXY[1], spanX, spanY, in createAreaForResize()
2560 spanX, spanY, direction, dragView, true, new ItemConfiguration()); in createAreaForResize()
2584 int[] createArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY, in createArea() argument
2587 result = findNearestArea(pixelX, pixelY, spanX, spanY, result); in createArea()
2606 getDirectionVectorForDrop(pixelX, pixelY, spanX, spanY, dragView, mDirectionVector); in createArea()
2612 spanX, spanY, mDirectionVector, dragView, true, new ItemConfiguration()); in createArea()
2616 minSpanY, spanX, spanY, dragView, new ItemConfiguration()); in createArea()
2710 int spanX, spanY; field in CellLayout.CellAndSpan
2719 copy.spanY = spanY; in copy()
2722 public CellAndSpan(int x, int y, int spanX, int spanY) { in CellAndSpan() argument
2726 this.spanY = spanY; in CellAndSpan()
2730 return "(" + x + ", " + y + ": " + spanX + ", " + spanY + ")"; in toString()
2749 int pixelX, int pixelY, int spanX, int spanY, View ignoreView, int[] result) { in findNearestVacantArea() argument
2750 return findNearestArea(pixelX, pixelY, spanX, spanY, ignoreView, true, result); in findNearestVacantArea()
2769 int spanX, int spanY, View ignoreView, int[] result, int[] resultSpan) { in findNearestVacantArea() argument
2770 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, ignoreView, true, in findNearestVacantArea()
2788 int pixelX, int pixelY, int spanX, int spanY, int[] result) { in findNearestArea() argument
2789 return findNearestArea(pixelX, pixelY, spanX, spanY, null, false, result); in findNearestArea()
2809 boolean findCellForSpan(int[] cellXY, int spanX, int spanY) { in findCellForSpan() argument
2810 return findCellForSpanThatIntersectsIgnoring(cellXY, spanX, spanY, -1, -1, null, mOccupied); in findCellForSpan()
2823 boolean findCellForSpanIgnoring(int[] cellXY, int spanX, int spanY, View ignoreView) { in findCellForSpanIgnoring() argument
2824 return findCellForSpanThatIntersectsIgnoring(cellXY, spanX, spanY, -1, -1, in findCellForSpanIgnoring()
2840 boolean findCellForSpanThatIntersects(int[] cellXY, int spanX, int spanY, in findCellForSpanThatIntersects() argument
2843 cellXY, spanX, spanY, intersectX, intersectY, null, mOccupied); in findCellForSpanThatIntersects()
2849 boolean findCellForSpanThatIntersectsIgnoring(int[] cellXY, int spanX, int spanY, in findCellForSpanThatIntersectsIgnoring() argument
2866 startY = Math.max(startY, intersectY - (spanY - 1)); in findCellForSpanThatIntersectsIgnoring()
2868 int endY = mCountY - (spanY - 1); in findCellForSpanThatIntersectsIgnoring()
2870 endY = Math.min(endY, intersectY + (spanY - 1) + (spanY == 1 ? 1 : 0)); in findCellForSpanThatIntersectsIgnoring()
2877 for (int j = 0; j < spanY; j++) { in findCellForSpanThatIntersectsIgnoring()
3003 int spanY = (int) Math.ceil(height / (float) smallerSize); in rectToCell() local
3006 return new int[] { spanX, spanY }; in rectToCell()
3009 result[1] = spanY; in rectToCell()
3035 info.spanX = info.spanY = 1; in calculateSpans()
3040 info.spanY = spans[1]; in calculateSpans()
3052 public boolean getVacantCell(int[] vacant, int spanX, int spanY) { in getVacantCell() argument
3054 return findVacantCell(vacant, spanX, spanY, mCountX, mCountY, mOccupied); in getVacantCell()
3057 static boolean findVacantCell(int[] vacant, int spanX, int spanY, in findVacantCell() argument
3064 for (int j = y; j < y + spanY - 1 && y < yCount; j++) { in findVacantCell()
3112 private void markCellsForView(int cellX, int cellY, int spanX, int spanY, boolean[][] occupied, in markCellsForView() argument
3116 for (int y = cellY; y < cellY + spanY && y < mCountY; y++) { in markCellsForView()
3324 int spanY; field in CellLayout.CellInfo