Lines Matching defs:spanX
635 int spanX = mDragOutlines[i].cellHSpan;
640 mCellWidth * spanX + mBorderSpace.x * (spanX - 1) - paddingX,
898 public void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) {
899 cellToRect(cellX, cellY, spanX, spanY, mTempRect);
941 public float getReorderRadius(int[] targetCell, int spanX, int spanY) {
946 cellToRect(targetCell[0], targetCell[1], spanX, spanY, cellBoundsWithSpacing);
949 if (canCreateFolder(getChildAt(targetCell[0], targetCell[1])) && spanX == 1 && spanY == 1) {
960 return (float) Math.hypot(spanX * cellBoundsWithSpacing.width() / 2f,
1161 void visualizeDropLocation(int cellX, int cellY, int spanX, int spanY,
1163 if (mDragCell[0] != cellX || mDragCell[1] != cellY || mDragCellSpan[0] != spanX
1167 mDragCellSpan[0] = spanX;
1171 applyColorExtractionOnWidget(dragObject, mDragCell, spanX, spanY);
1180 cell.cellHSpan = spanX;
1195 int spanX, int spanY) {
1200 cellToRect(targetCell[0], targetCell[1], spanX, spanY, mTempRect);
1245 * @param spanX Horizontal span of the object.
1253 int spanX, int spanY, int[] result, int[] resultSpan) {
1254 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, false,
1267 * @param spanX Horizontal span of the object.
1276 int spanX, int spanY, boolean ignoreOccupied, int[] result, int[] resultSpan) {
1277 // For items with a spanX / spanY > 1, the passed in point (relativeXPos, relativeYPos)
1280 relativeXPos = (int) (relativeXPos - (mCellWidth + mBorderSpace.x) * (spanX - 1) / 2f);
1292 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 ||
1293 spanX < minSpanX || spanY < minSpanY) {
1318 boolean hitMaxX = xSize >= spanX;
1342 hitMaxX |= xSize >= spanX;
1402 lp.cellHSpan = c.spanX;
1448 mode, lp.getCellX(), lp.getCellY(), c.cellX, c.cellY, c.spanX, c.spanY);
1491 int cellX1, int cellY1, int spanX, int spanY) {
1492 regionToCenterPoint(cellX0, cellY0, spanX, spanY, mTmpPoint);
1495 regionToCenterPoint(cellX1, cellY1, spanX, spanY, mTmpPoint);
1643 || presenterPos.cellY != lp.getTmpCellY() || info.spanX != lp.cellHSpan
1666 public void getViewsIntersectingRegion(int cellX, int cellY, int spanX, int spanY,
1669 boundingRect.set(cellX, cellY, cellX + spanX, cellY + spanY);
1672 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY);
1691 public boolean isNearestDropLocationOccupied(int pixelX, int pixelY, int spanX, int spanY,
1693 result = findNearestAreaIgnoreOccupied(pixelX, pixelY, spanX, spanY, result);
1694 getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null,
1718 boolean createAreaForResize(int cellX, int cellY, int spanX, int spanY,
1721 regionToCenterPoint(cellX, cellY, spanX, spanY, pixelXY);
1724 ItemConfiguration swapSolution = findReorderSolution(pixelXY[0], pixelXY[1], spanX, spanY,
1725 spanX, spanY, direction, dragView, true, new ItemConfiguration());
1757 * @param spanX Horizontal span of the object.
1762 * cellY, spanX, spanY) are occupied. This is used when try to move a group of views.
1768 private int[] findNearestArea(int cellX, int cellY, int spanX, int spanY, int[] direction,
1780 for (int x = 0; x < countX - (spanX - 1); x++) {
1782 for (int i = 0; i < spanX; i++) {
1823 findNearestArea(c.cellX, c.cellY, c.spanX, c.spanY, direction,
1987 int right = cs.cellX + cs.spanX;
1996 for (int j = cs.cellX; j < cs.cellX + cs.spanX; j++) {
2004 for (int j = cs.cellX; j < cs.cellX + cs.spanX; j++) {
2025 if (leftEdge[i] == cs.cellX + cs.spanX) {
2038 for (int i = cs.cellX; i < cs.cellX + cs.spanX; i++) {
2045 for (int i = cs.cellX; i < cs.cellX + cs.spanX; i++) {
2097 return (r.cellX + r.spanX) - (l.cellX + l.spanX);
2237 public void getDirectionVectorForDrop(int dragViewCenterX, int dragViewCenterY, int spanX,
2243 findNearestAreaIgnoreOccupied(dragViewCenterX, dragViewCenterY, spanX, spanY,
2246 cellToRect(targetDestination[0], targetDestination[1], spanX, spanY, dragRect);
2250 getViewsIntersectingRegion(targetDestination[0], targetDestination[1], spanX, spanY,
2259 int deltaX = (dropRegionRect.centerX() - dragViewCenterX) / spanX;
2262 if (dropRegionSpanX == mCountX || spanX == mCountX) {
2300 blockOccupied.markCells(c.cellX - left, c.cellY - top, c.spanX, c.spanY, true);
2329 public boolean rearrangementExists(int cellX, int cellY, int spanX, int spanY, int[] direction,
2335 mOccupiedRect.set(cellX, cellY, cellX + spanX, cellY + spanY);
2345 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY);
2360 r1.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY);
2399 int minSpanY, int spanX, int spanY, int[] direction, View dragView, boolean decX,
2402 spanX, spanY, direction, dragView, decX, solution);
2429 * @param spanX occupied horizontal span
2436 int spanX, int spanY, View dragView) {
2438 spanX, spanY, dragView);
2441 int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY,
2455 finalSolution = calculateReorder(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY,
2471 resultSpan[0] = finalSolution.spanX;
2567 return spanX * spanY;
2575 outRect.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY);
2578 outRect.union(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY);
2590 * @param spanX Horizontal span of the object.
2596 public int[] findNearestAreaIgnoreOccupied(int pixelX, int pixelY, int spanX, int spanY,
2598 return findNearestArea(pixelX, pixelY, spanX, spanY, spanX, spanY, true, result, null);
2613 * @param spanX The horizontal span of the cell we want to find.
2618 public boolean findCellForSpan(int[] cellXY, int spanX, int spanY) {
2622 return mOccupied.findVacantCell(cellXY, spanX, spanY);
2705 mOccupied.markCells(pos.cellX, pos.cellY, info.spanX, info.spanY, true);
2719 mOccupied.markCells(pos.cellX, pos.cellY, info.spanX, info.spanY, false);
2765 // its spanX, spanY, and the screen it is on
2777 spanX = info.spanX;
2820 itemInfo.minSpanY, itemInfo.spanX, itemInfo.spanY, mDirectionVector, null,
2859 public boolean isRegionVacant(int x, int y, int spanX, int spanY) {
2860 return mOccupied.isRegionVacant(x, y, spanX, spanY);