H A D | CellLayout.java | 1336 int[] findNearestArea(int pixelX, int pixelY, int spanX, int spanY, View ignoreView, argument 1339 spanX, spanY, ignoreView, ignoreOccupied, result, null, mOccupied); 1374 View ignoreView, boolean ignoreOccupied, int[] result, int[] resultSpan, 1377 // mark space take by ignoreView as available (method checks if ignoreView is null) 1378 markCellsAsUnoccupiedForView(ignoreView, occupied); 1485 // re-mark space taken by ignoreView as occupied 1486 markCellsAsOccupiedForView(ignoreView, occupied); 1983 int[] direction, View ignoreView, ItemConfiguration solution) { 1991 ignoreView, solutio 1373 findNearestArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY, View ignoreView, boolean ignoreOccupied, int[] result, int[] resultSpan, boolean[][] occupied) argument 1982 attemptPushInDirection(ArrayList<View> intersectingViews, Rect occupied, int[] direction, View ignoreView, ItemConfiguration solution) argument 2076 rearrangementExists(int cellX, int cellY, int spanX, int spanY, int[] direction, View ignoreView, ItemConfiguration solution) argument 2748 findNearestVacantArea( int pixelX, int pixelY, int spanX, int spanY, View ignoreView, int[] result) argument 2768 findNearestVacantArea(int pixelX, int pixelY, int minSpanX, int minSpanY, int spanX, int spanY, View ignoreView, int[] result, int[] resultSpan) argument 2823 findCellForSpanIgnoring(int[] cellXY, int spanX, int spanY, View ignoreView) argument 2849 findCellForSpanThatIntersectsIgnoring(int[] cellXY, int spanX, int spanY, int intersectX, int intersectY, View ignoreView, boolean occupied[][]) argument [all...] |