Lines Matching refs:minSpanY
1296 * @param minSpanY The minimum vertical span required
1304 int[] findNearestVacantArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX,
1306 return findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, null,
1352 * @param minSpanY The minimum vertical span required
1361 int[] findNearestArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY,
1383 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 ||
1384 spanX < minSpanX || spanY < minSpanY) {
1388 for (int y = 0; y < countY - (minSpanY - 1); y++) {
1396 for (int j = 0; j < minSpanY; j++) {
1403 ySize = minSpanY;
2145 ItemConfiguration findReorderSolution(int pixelX, int pixelY, int minSpanX, int minSpanY,
2168 if (spanX > minSpanX && (minSpanY == spanY || decX)) {
2169 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY,
2171 } else if (spanY > minSpanY) {
2172 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1,
2442 ItemConfiguration findConfigurationNoShuffle(int pixelX, int pixelY, int minSpanX, int minSpanY,
2446 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, null, result,
2592 int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY,
2620 ItemConfiguration swapSolution = findReorderSolution(pixelX, pixelY, minSpanX, minSpanY,
2625 minSpanY, spanX, spanY, dragView, new ItemConfiguration());
2787 * @param minSpanY The minimum vertical span required
2795 int[] findNearestVacantArea(int pixelX, int pixelY, int minSpanX, int minSpanY,
2797 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, ignoreView, true,
