H A D | CellLayout.java | 672 cellInfo.spanY = lp.cellVSpan; 689 cellInfo.spanY = 1; 721 cellInfo.spanY = 0; 1029 * @param spanY The number of vertical cells that the item spans 1032 void estimateDropCell(int originX, int originY, int spanX, int spanY, int[] result) { argument 1046 int bottomOverhang = result[1] + spanY - countY; 1054 int spanX, int spanY, Point dragOffset, Rect dragRegion) { 1058 final int[] nearest = findNearestVacantArea(originX, originY, spanX, spanY, v, mDragCell); 1105 top += ((mCellHeight * spanY) + ((spanY 1053 visualizeDropLocation(View v, Bitmap dragOutline, int originX, int originY, int spanX, int spanY, Point dragOffset, Rect dragRegion) argument 1145 findNearestVacantArea( int pixelX, int pixelY, int spanX, int spanY, int[] result) argument 1164 findNearestArea(int pixelX, int pixelY, int spanX, int spanY, View ignoreView, boolean ignoreOccupied, int[] result) argument 1234 findNearestVacantArea( int pixelX, int pixelY, int spanX, int spanY, View ignoreView, int[] result) argument 1252 findNearestArea( int pixelX, int pixelY, int spanX, int spanY, int[] result) argument 1274 findCellForSpan(int[] cellXY, int spanX, int spanY) argument 1288 findCellForSpanIgnoring(int[] cellXY, int spanX, int spanY, View ignoreView) argument 1304 findCellForSpanThatIntersects(int[] cellXY, int spanX, int spanY, int intersectX, int intersectY) argument 1313 findCellForSpanThatIntersectsIgnoring(int[] cellXY, int spanX, int spanY, int intersectX, int intersectY, View ignoreView) argument 1526 getVacantCell(int[] vacant, int spanX, int spanY) argument 1531 findVacantCell(int[] vacant, int spanX, int spanY, int xCount, int yCount, boolean[][] occupied) argument 1631 markCellsForView(int cellX, int cellY, int spanX, int spanY, boolean value) argument 1815 int spanY; field in class:CellLayout.CellInfo [all...] |