Lines Matching refs:minSpanX
1166 * @param minSpanX The minimum horizontal span required
1175 int[] findNearestVacantArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX,
1177 return findNearestArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, true,
1202 * @param minSpanX The minimum horizontal span required
1212 private int[] findNearestArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX,
1231 if (minSpanX <= 0 || minSpanY <= 0 || spanX <= 0 || spanY <= 0 ||
1232 spanX < minSpanX || spanY < minSpanY) {
1238 for (int x = 0; x < countX - (minSpanX - 1); x++) {
1243 for (int i = 0; i < minSpanX; i++) {
1250 xSize = minSpanX;
1989 private ItemConfiguration findReorderSolution(int pixelX, int pixelY, int minSpanX, int minSpanY,
2012 if (spanX > minSpanX && (minSpanY == spanY || decX)) {
2013 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX - 1, spanY,
2016 return findReorderSolution(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY - 1,
2293 private ItemConfiguration findConfigurationNoShuffle(int pixelX, int pixelY, int minSpanX, int minSpanY,
2297 findNearestVacantArea(pixelX, pixelY, minSpanX, minSpanY, spanX, spanY, result,
2443 int[] performReorder(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY,
2471 ItemConfiguration swapSolution = findReorderSolution(pixelX, pixelY, minSpanX, minSpanY,
2475 ItemConfiguration noShuffleSolution = findConfigurationNoShuffle(pixelX, pixelY, minSpanX,
