758     void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) {  in regionToCenterPoint()  argument
764                 (spanY * mCellHeight + (spanY - 1) * mHeightGap) / 2;  in regionToCenterPoint()
774      void regionToRect(int cellX, int cellY, int spanX, int spanY, Rect result) {  in regionToRect()  argument
780                 top + (spanY * mCellHeight + (spanY - 1) * mHeightGap));  in regionToRect()
1066     void estimateDropCell(int originX, int originY, int spanX, int spanY, int[] result) {  in estimateDropCell()  argument
1080         int bottomOverhang = result[1] + spanY - countY;  in estimateDropCell()
1088             int cellY, int spanX, int spanY, boolean resize, Point dragOffset, Rect dragRegion) {  in visualizeDropLocation()  argument
1133                     top += ((mCellHeight * spanY) + ((spanY - 1) * mHeightGap)  in visualizeDropLocation()
1143                 cellToRect(cellX, cellY, spanX, spanY, r);  in visualizeDropLocation()
1170     int[] findNearestVacantArea(int pixelX, int pixelY, int spanX, int spanY,  in findNearestVacantArea()  argument
1172         return findNearestVacantArea(pixelX, pixelY, spanX, spanY, null, result);  in findNearestVacantArea()
1191             int spanY, int[] result, int[] resultSpan) {  in findNearestVacantArea()  argument
1192         return findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, null,  in findNearestVacantArea()
1210     int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, View ignoreView,  in findNearestArea()  argument
1212         return findNearestArea(pixelX, pixelY, spanX, spanY,  in findNearestArea()
1213                 spanX, spanY, ignoreView, ignoreOccupied, result, null, mOccupied);  in findNearestArea()
1247     int[] findNearestArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY,  in findNearestArea()  argument
1258         pixelY -= (mCellHeight + mHeightGap) * (spanY - 1) / 2f;  in findNearestArea()
1269         if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 ||  in findNearestArea()
1270                 spanX < minSpanX || spanY < minSpanY) {  in findNearestArea()
1296                     boolean hitMaxY = ySize >= spanY;  in findNearestArea()
1320                         hitMaxY |= ySize >= spanY;  in findNearestArea()
1325                     hitMaxY = ySize >= spanY;  in findNearestArea()
1392     private int[] findNearestArea(int cellX, int cellY, int spanX, int spanY, int[] direction,  in findNearestArea()  argument
1402         for (int y = 0; y < countY - (spanY - 1); y++) {  in findNearestArea()
1407                     for (int j = 0; j < spanY; j++) {  in findNearestArea()
1448         markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, false);  in addViewToTempLocation()
1451         findNearestArea(c.x, c.y, c.spanX, c.spanY, direction, mTmpOccupied, null, mTempLocation);  in addViewToTempLocation()
1458         markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, true);  in addViewToTempLocation()
1514                         for (int j = cs.y; j < cs.y + cs.spanY; j++) {  in computeEdge()
1522                         for (int j = cs.y; j < cs.y + cs.spanY; j++) {  in computeEdge()
1537                         int bottom = cs.y + cs.spanY;  in computeEdge()
1555                     for (int i = cs.y; i < cs.y + cs.spanY; i++) {  in isViewTouchingEdge()
1562                     for (int i = cs.y; i < cs.y + cs.spanY; i++) {  in isViewTouchingEdge()
1570                         if (edge[i] == cs.y + cs.spanY) {  in isViewTouchingEdge()
1619                         boundingRect.set(c.x, c.y, c.x + c.spanX, c.y + c.spanY);  in getBoundingRect()
1622                         boundingRect.union(c.x, c.y, c.x + c.spanX, c.y + c.spanY);  in getBoundingRect()
1683                         return (r.y + r.spanY) - (l.y + l.spanY);  in compare()
1730             markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, false);  in pushViewsToTempLocation()
1760                         markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, false);  in pushViewsToTempLocation()
1786             markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, true);  in pushViewsToTempLocation()
1802                 boundingRect = new Rect(c.x, c.y, c.x + c.spanX, c.y + c.spanY);  in addViewsToTempLocation()
1804                 boundingRect.union(c.x, c.y, c.x + c.spanX, c.y + c.spanY);  in addViewsToTempLocation()
1811             markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, false);  in addViewsToTempLocation()
1821             markCellsForView(c.x - left, c.y - top, c.spanX, c.spanY, blockOccupied, true);  in addViewsToTempLocation()
1844             markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, true);  in addViewsToTempLocation()
1950     private boolean rearrangementExists(int cellX, int cellY, int spanX, int spanY, int[] direction,  in rearrangementExists()  argument
1956         mOccupiedRect.set(cellX, cellY, cellX + spanX, cellY + spanY);  in rearrangementExists()
1966         Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY);  in rearrangementExists()
1972             r1.set(c.x, c.y, c.x + c.spanX, c.y + c.spanY);  in rearrangementExists()
2032             int spanX, int spanY, int[] direction, View dragView, boolean decX,  in findReorderSolution()  argument
2043         result = findNearestArea(pixelX, pixelY, spanX, spanY, result);  in findReorderSolution()
2048         success = rearrangementExists(result[0], result[1], spanX, spanY, direction, dragView,  in findReorderSolution()
2054             if (spanX > minSpanX && (minSpanY == spanY || decX)) {  in findReorderSolution()
2055                 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY,  in findReorderSolution()
2057             } else if (spanY > minSpanY) {  in findReorderSolution()
2058                 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1,  in findReorderSolution()
2067             solution.dragViewSpanY = spanY;  in findReorderSolution()
2104                 lp.cellVSpan = c.spanY;  in copySolutionToTempState()
2105                 markCellsForView(c.x, c.y, c.spanX, c.spanY, mTmpOccupied, true);  in copySolutionToTempState()
2130                 markCellsForView(c.x, c.y, c.spanX, c.spanY, occupied, true);  in animateItemsToSolution()
2154                         lp.cellY, c.x, c.y, c.spanX, c.spanY);  in beginOrAdjustReorderPreviewAnimations()
2181                 int cellY1, int spanX, int spanY) {  in ReorderPreviewAnimation()  argument
2182             regionToCenterPoint(cellX0, cellY0, spanX, spanY, mTmpPoint);  in ReorderPreviewAnimation()
2185             regionToCenterPoint(cellX1, cellY1, spanX, spanY, mTmpPoint);  in ReorderPreviewAnimation()
2308                         info.spanX != lp.cellHSpan || info.spanY != lp.cellVSpan) {  in commitTempPlacement()
2314                 info.spanY = lp.cellVSpan;  in commitTempPlacement()
2329             int spanX, int spanY, View dragView, ItemConfiguration solution) {  in findConfigurationNoShuffle()  argument
2332         findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, null, result,  in findConfigurationNoShuffle()
2360             int spanY, View dragView, int[] resultDirection) {  in getDirectionVectorForDrop()  argument
2363         findNearestArea(dragViewCenterX, dragViewCenterY, spanX, spanY, targetDestination);  in getDirectionVectorForDrop()
2365         regionToRect(targetDestination[0], targetDestination[1], spanX, spanY, dragRect);  in getDirectionVectorForDrop()
2369         getViewsIntersectingRegion(targetDestination[0], targetDestination[1], spanX, spanY,  in getDirectionVectorForDrop()
2379         int deltaY = (dropRegionRect.centerY() - dragViewCenterY) / spanY;  in getDirectionVectorForDrop()
2384         if (dropRegionSpanY == mCountY || spanY == mCountY) {  in getDirectionVectorForDrop()
2398     private void getViewsIntersectingRegion(int cellX, int cellY, int spanX, int spanY,  in getViewsIntersectingRegion()  argument
2401             boundingRect.set(cellX, cellY, cellX + spanX, cellY + spanY);  in getViewsIntersectingRegion()
2404         Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY);  in getViewsIntersectingRegion()
2421     boolean isNearestDropLocationOccupied(int pixelX, int pixelY, int spanX, int spanY,  in isNearestDropLocationOccupied()  argument
2423         result = findNearestArea(pixelX, pixelY, spanX, spanY, result);  in isNearestDropLocationOccupied()
2424         getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null,  in isNearestDropLocationOccupied()
2447     boolean createAreaForResize(int cellX, int cellY, int spanX, int spanY,  in createAreaForResize()  argument
2450         regionToCenterPoint(cellX, cellY, spanX, spanY, pixelXY);  in createAreaForResize()
2453         ItemConfiguration swapSolution = findReorderSolution(pixelXY[0], pixelXY[1], spanX, spanY,  in createAreaForResize()
2454                  spanX,  spanY, direction, dragView,  true,  new ItemConfiguration());  in createAreaForResize()
2478     int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY,  in performReorder()  argument
2481         result = findNearestArea(pixelX, pixelY, spanX, spanY, result);  in performReorder()
2500             getDirectionVectorForDrop(pixelX, pixelY, spanX, spanY, dragView, mDirectionVector);  in performReorder()
2507                  spanX,  spanY, mDirectionVector, dragView,  true,  new ItemConfiguration());  in performReorder()
2511                 minSpanY, spanX, spanY, dragView, new ItemConfiguration());  in performReorder()
2623         int spanX, spanY;  field in CellLayout.CellAndSpan
2632             copy.spanY = spanY;  in copy()
2635         public CellAndSpan(int x, int y, int spanX, int spanY) {  in CellAndSpan()  argument
2639             this.spanY = spanY;  in CellAndSpan()
2643             return "(" + x + ", " + y + ": " + spanX + ", " + spanY + ")";  in toString()
2662             int pixelX, int pixelY, int spanX, int spanY, View ignoreView, int[] result) {  in findNearestVacantArea()  argument
2663         return findNearestArea(pixelX, pixelY, spanX, spanY, ignoreView, true, result);  in findNearestVacantArea()
2682             int spanX, int spanY, View ignoreView, int[] result, int[] resultSpan) {  in findNearestVacantArea()  argument
2683         return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, ignoreView, true,  in findNearestVacantArea()
2701             int pixelX, int pixelY, int spanX, int spanY, int[] result) {  in findNearestArea()  argument
2702         return findNearestArea(pixelX, pixelY, spanX, spanY, null, false, result);  in findNearestArea()
2722     boolean findCellForSpan(int[] cellXY, int spanX, int spanY) {  in findCellForSpan()  argument
2723         return findCellForSpanThatIntersectsIgnoring(cellXY, spanX, spanY, -1, -1, null, mOccupied);  in findCellForSpan()
2736     boolean findCellForSpanIgnoring(int[] cellXY, int spanX, int spanY, View ignoreView) {  in findCellForSpanIgnoring()  argument
2737         return findCellForSpanThatIntersectsIgnoring(cellXY, spanX, spanY, -1, -1,  in findCellForSpanIgnoring()
2753     boolean findCellForSpanThatIntersects(int[] cellXY, int spanX, int spanY,  in findCellForSpanThatIntersects()  argument
2756                 cellXY, spanX, spanY, intersectX, intersectY, null, mOccupied);  in findCellForSpanThatIntersects()
2762     boolean findCellForSpanThatIntersectsIgnoring(int[] cellXY, int spanX, int spanY,  in findCellForSpanThatIntersectsIgnoring()  argument
2779                 startY = Math.max(startY, intersectY - (spanY - 1));  in findCellForSpanThatIntersectsIgnoring()
2781             int endY = mCountY - (spanY - 1);  in findCellForSpanThatIntersectsIgnoring()
2783                 endY = Math.min(endY, intersectY + (spanY - 1) + (spanY == 1 ? 1 : 0));  in findCellForSpanThatIntersectsIgnoring()
2790                         for (int j = 0; j < spanY; j++) {  in findCellForSpanThatIntersectsIgnoring()
2919         int spanY = (int) Math.ceil(height / (float) smallerSize);  in rectToCell()  local
2922             return new int[] { spanX, spanY };  in rectToCell()
2925         result[1] = spanY;  in rectToCell()
2951             info.spanX = info.spanY = 1;  in calculateSpans()
2956         info.spanY = spans[1];  in calculateSpans()
2968     public boolean getVacantCell(int[] vacant, int spanX, int spanY) {  in getVacantCell()  argument
2970         return findVacantCell(vacant, spanX, spanY, mCountX, mCountY, mOccupied);  in getVacantCell()
2973     static boolean findVacantCell(int[] vacant, int spanX, int spanY,  in findVacantCell()  argument
2980                     for (int j = y; j < y + spanY - 1 && y < yCount; j++) {  in findVacantCell()
3028     private void markCellsForView(int cellX, int cellY, int spanX, int spanY, boolean[][] occupied,  in markCellsForView()  argument
3032             for (int y = cellY; y < cellY + spanY && y < mCountY; y++) {  in markCellsForView()
3245         int spanY;  field in CellLayout.CellInfo
3254             spanY = info.spanY;  in CellInfo()