Lines Matching refs:spanY
778 void regionToCenterPoint(int cellX, int cellY, int spanX, int spanY, int[] result) {
784 (spanY * mCellHeight + (spanY - 1) * mHeightGap) / 2;
794 void regionToRect(int cellX, int cellY, int spanX, int spanY, Rect result) {
800 top + (spanY * mCellHeight + (spanY - 1) * mHeightGap));
1053 int spanX, int spanY, boolean resize, DropTarget.DragObject dragObject) {
1075 cellToRect(cellX, cellY, spanX, spanY, r);
1111 top += ((mCellHeight * spanY) + ((spanY - 1) * mHeightGap)
1151 * @param spanY Vertical span of the object.
1158 int spanY, int[] result, int[] resultSpan) {
1159 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, true,
1187 * @param spanY Vertical span of the object.
1195 int spanY, boolean ignoreOccupied, int[] result, int[] resultSpan) {
1198 // For items with a spanX / spanY > 1, the passed in point (pixelX, pixelY) corresponds
1202 pixelY -= (mCellHeight + mHeightGap) * (spanY - 1) / 2f;
1213 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 ||
1214 spanX < minSpanX || spanY < minSpanY) {
1240 boolean hitMaxY = ySize >= spanY;
1264 hitMaxY |= ySize >= spanY;
1269 hitMaxY = ySize >= spanY;
1321 * @param spanY Vertical span of the object.
1325 * cellY, spanX, spanY) are occupied. This is used when try to move a group of views.
1331 private int[] findNearestArea(int cellX, int cellY, int spanX, int spanY, int[] direction,
1341 for (int y = 0; y < countY - (spanY - 1); y++) {
1346 for (int j = 0; j < spanY; j++) {
1386 findNearestArea(c.cellX, c.cellY, c.spanX, c.spanY, direction,
1448 for (int j = cs.cellY; j < cs.cellY + cs.spanY; j++) {
1456 for (int j = cs.cellY; j < cs.cellY + cs.spanY; j++) {
1471 int bottom = cs.cellY + cs.spanY;
1492 for (int i = cs.cellY; i < cs.cellY + cs.spanY; i++) {
1499 for (int i = cs.cellY; i < cs.cellY + cs.spanY; i++) {
1507 if (topEdge[i] == cs.cellY + cs.spanY) {
1569 return (r.cellY + r.spanY) - (l.cellY + l.spanY);
1700 blockOccupied.markCells(c.cellX - left, c.cellY - top, c.spanX, c.spanY, true);
1826 private boolean rearrangementExists(int cellX, int cellY, int spanX, int spanY, int[] direction,
1832 mOccupiedRect.set(cellX, cellY, cellX + spanX, cellY + spanY);
1842 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY);
1848 r1.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY);
1900 int spanX, int spanY, int[] direction, View dragView, boolean decX,
1911 result = findNearestArea(pixelX, pixelY, spanX, spanY, result);
1916 success = rearrangementExists(result[0], result[1], spanX, spanY, direction, dragView,
1922 if (spanX > minSpanX && (minSpanY == spanY || decX)) {
1923 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY,
1925 } else if (spanY > minSpanY) {
1926 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1,
1935 solution.spanY = spanY;
1968 lp.cellVSpan = c.spanY;
2012 lp.cellY, c.cellX, c.cellY, c.spanX, c.spanY);
2039 int cellY1, int spanX, int spanY) {
2040 regionToCenterPoint(cellX0, cellY0, spanX, spanY, mTmpPoint);
2043 regionToCenterPoint(cellX1, cellY1, spanX, spanY, mTmpPoint);
2176 || info.spanY != lp.cellVSpan);
2181 info.spanY = lp.cellVSpan;
2185 info.cellX, info.cellY, info.spanX, info.spanY);
2200 int spanX, int spanY, View dragView, ItemConfiguration solution) {
2203 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, result,
2210 solution.spanY = resultSpan[1];
2231 int spanY, View dragView, int[] resultDirection) {
2234 findNearestArea(dragViewCenterX, dragViewCenterY, spanX, spanY, targetDestination);
2236 regionToRect(targetDestination[0], targetDestination[1], spanX, spanY, dragRect);
2240 getViewsIntersectingRegion(targetDestination[0], targetDestination[1], spanX, spanY,
2250 int deltaY = (dropRegionRect.centerY() - dragViewCenterY) / spanY;
2255 if (dropRegionSpanY == mCountY || spanY == mCountY) {
2269 private void getViewsIntersectingRegion(int cellX, int cellY, int spanX, int spanY,
2272 boundingRect.set(cellX, cellY, cellX + spanX, cellY + spanY);
2275 Rect r0 = new Rect(cellX, cellY, cellX + spanX, cellY + spanY);
2292 boolean isNearestDropLocationOccupied(int pixelX, int pixelY, int spanX, int spanY,
2294 result = findNearestArea(pixelX, pixelY, spanX, spanY, result);
2295 getViewsIntersectingRegion(result[0], result[1], spanX, spanY, dragView, null,
2318 boolean createAreaForResize(int cellX, int cellY, int spanX, int spanY,
2321 regionToCenterPoint(cellX, cellY, spanX, spanY, pixelXY);
2324 ItemConfiguration swapSolution = findReorderSolution(pixelXY[0], pixelXY[1], spanX, spanY,
2325 spanX, spanY, direction, dragView, true, new ItemConfiguration());
2349 int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY,
2352 result = findNearestArea(pixelX, pixelY, spanX, spanY, result);
2371 getDirectionVectorForDrop(pixelX, pixelY, spanX, spanY, dragView, mDirectionVector);
2378 spanX, spanY, mDirectionVector, dragView, true, new ItemConfiguration());
2382 minSpanY, spanX, spanY, dragView, new ItemConfiguration());
2401 resultSpan[1] = finalSolution.spanY;
2417 resultSpan[1] = finalSolution.spanY;
2487 return spanX * spanY;
2495 outRect.set(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY);
2498 outRect.union(c.cellX, c.cellY, c.cellX + c.spanX, c.cellY + c.spanY);
2511 * @param spanY Vertical span of the object.
2517 public int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, int[] result) {
2518 return findNearestArea(pixelX, pixelY, spanX, spanY, spanX, spanY, false, result, null);
2534 * @param spanY The vertical span of the cell we want to find.
2538 public boolean findCellForSpan(int[] cellXY, int spanX, int spanY) {
2542 return mOccupied.findVacantCell(cellXY, spanX, spanY);
2815 // its spanX, spanY, and the screen it is on
2828 spanY = info.spanY;
2852 itemInfo.minSpanY, itemInfo.spanX, itemInfo.spanY, mDirectionVector, null,
2861 public boolean isRegionVacant(int x, int y, int spanX, int spanY) {
2862 return mOccupied.isRegionVacant(x, y, spanX, spanY);
