H A D | CellLayout.java | 1087 boolean[][] occupied = mOccupied; 1089 occupied = mTmpOccupied; 1105 occupied[lp.cellX][lp.cellY] = false; 1106 occupied[cellX][cellY] = true; 1319 * @param ignoreOccupied If true, the result can be an occupied cell 1356 * @param ignoreOccupied If true, the result can be an occupied cell 1364 boolean[][] occupied) { 1367 markCellsAsUnoccupiedForView(ignoreView, occupied); 1398 if (occupied[x + i][y + j]) { 1415 if (x + xSize > countX -1 || occupied[ 1362 findNearestArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY, View ignoreView, boolean ignoreOccupied, int[] result, int[] resultSpan, boolean[][] occupied) argument 1507 findNearestArea(int cellX, int cellY, int spanX, int spanY, int[] direction, boolean[][] occupied, boolean blockOccupied[][], int[] result) argument 1964 markCellsForRect(Rect r, boolean[][] occupied, boolean value) argument 1971 attemptPushInDirection(ArrayList<View> intersectingViews, Rect occupied, int[] direction, View ignoreView, ItemConfiguration solution) argument 2136 copyOccupiedArray(boolean[][] occupied) argument 2838 findCellForSpanThatIntersectsIgnoring(int[] cellXY, int spanX, int spanY, int intersectX, int intersectY, View ignoreView, boolean occupied[][]) argument 3046 findVacantCell(int[] vacant, int spanX, int spanY, int xCount, int yCount, boolean[][] occupied) argument 3086 markCellsAsOccupiedForView(View view, boolean[][] occupied) argument 3095 markCellsAsUnoccupiedForView(View view, boolean occupied[][]) argument 3101 markCellsForView(int cellX, int cellY, int spanX, int spanY, boolean[][] occupied, boolean value) argument [all...] |