Lines Matching refs:spanX
671 cellInfo.spanX = lp.cellHSpan;
688 cellInfo.spanX = 1;
720 cellInfo.spanX = 0;
1028 * @param spanX The number of horizontal cells that the item spans
1032 void estimateDropCell(int originX, int originY, int spanX, int spanY, int[] result) {
1041 int rightOverhang = result[0] + spanX - countX;
1054 int spanX, int spanY, Point dragOffset, Rect dragRegion) {
1058 final int[] nearest = findNearestVacantArea(originX, originY, spanX, spanY, v, mDragCell);
1092 left += ((mCellWidth * spanX) + ((spanX - 1) * mWidthGap)
1098 left += dragOffset.x + ((mCellWidth * spanX) + ((spanX - 1) * mWidthGap)
1103 left += ((mCellWidth * spanX) + ((spanX - 1) * mWidthGap)
1138 * @param spanX Horizontal span of the object.
1146 int pixelX, int pixelY, int spanX, int spanY, int[] result) {
1147 return findNearestVacantArea(pixelX, pixelY, spanX, spanY, null, result);
1156 * @param spanX Horizontal span of the object.
1164 int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, View ignoreView,
1169 // For items with a spanX / spanY > 1, the passed in point (pixelX, pixelY) corresponds
1172 pixelX -= (mCellWidth + mWidthGap) * (spanX - 1) / 2f;
1185 for (int x = 0; x < countX - (spanX - 1); x++) {
1187 for (int i = 0; i < spanX; i++) {
1227 * @param spanX Horizontal span of the object.
1235 int pixelX, int pixelY, int spanX, int spanY, View ignoreView, int[] result) {
1236 return findNearestArea(pixelX, pixelY, spanX, spanY, ignoreView, true, result);
1245 * @param spanX Horizontal span of the object.
1253 int pixelX, int pixelY, int spanX, int spanY, int[] result) {
1254 return findNearestArea(pixelX, pixelY, spanX, spanY, null, false, result);
1269 * @param spanX The horizontal span of the cell we want to find.
1274 boolean findCellForSpan(int[] cellXY, int spanX, int spanY) {
1275 return findCellForSpanThatIntersectsIgnoring(cellXY, spanX, spanY, -1, -1, null);
1283 * @param spanX The horizontal span of the cell we want to find.
1288 boolean findCellForSpanIgnoring(int[] cellXY, int spanX, int spanY, View ignoreView) {
1289 return findCellForSpanThatIntersectsIgnoring(cellXY, spanX, spanY, -1, -1, ignoreView);
1296 * @param spanX The horizontal span of the cell we want to find.
1304 boolean findCellForSpanThatIntersects(int[] cellXY, int spanX, int spanY,
1307 cellXY, spanX, spanY, intersectX, intersectY, null);
1313 boolean findCellForSpanThatIntersectsIgnoring(int[] cellXY, int spanX, int spanY,
1322 startX = Math.max(startX, intersectX - (spanX - 1));
1324 int endX = mCountX - (spanX - 1);
1326 endX = Math.min(endX, intersectX + (spanX - 1) + (spanX == 1 ? 1 : 0));
1340 for (int i = 0; i < spanX; i++) {
1476 int spanX = (int) Math.ceil(width / (float) smallerSize);
1480 return new int[] { spanX, spanY };
1482 result[0] = spanX;
1509 info.spanX = info.spanY = 1;
1513 info.spanX = spans[0];
1521 * @param spanX Horizontal cell span.
1526 public boolean getVacantCell(int[] vacant, int spanX, int spanY) {
1528 return findVacantCell(vacant, spanX, spanY, mCountX, mCountY, mOccupied);
1531 static boolean findVacantCell(int[] vacant, int spanX, int spanY,
1537 out: for (int i = x; i < x + spanX - 1 && x < xCount; i++) {
1631 private void markCellsForView(int cellX, int cellY, int spanX, int spanY, boolean value) {
1632 for (int x = cellX; x < cellX + spanX && x < mCountX; x++) {
1806 // its spanX, spanY, and the screen it is on
1814 int spanX;