Lines Matching defs:minSpanY
1115 * @param minSpanY The minimum vertical span required
1123 int[] findNearestVacantArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX,
1125 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, true,
1151 * @param minSpanY The minimum vertical span required
1160 private int[] findNearestArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX,
1179 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 ||
1180 spanX < minSpanX || spanY < minSpanY) {
1184 for (int y = 0; y < countY - (minSpanY - 1); y++) {
1192 for (int j = 0; j < minSpanY; j++) {
1199 ySize = minSpanY;
1937 private ItemConfiguration findReorderSolution(int pixelX, int pixelY, int minSpanX, int minSpanY,
1960 if (spanX > minSpanX && (minSpanY == spanY || decX)) {
1961 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY,
1963 } else if (spanY > minSpanY) {
1964 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1,
2234 private ItemConfiguration findConfigurationNoShuffle(int pixelX, int pixelY, int minSpanX, int minSpanY,
2238 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, result,
2384 int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY,
2412 ItemConfiguration swapSolution = findReorderSolution(pixelX, pixelY, minSpanX, minSpanY,
2417 minSpanY, spanX, spanY, dragView, new ItemConfiguration());