Lines Matching refs:mCountX
68 private int mCountX;
206 mCountX = (int) grid.numColumns;
208 mOccupied = new boolean[mCountX][mCountY];
209 mTmpOccupied = new boolean[mCountX][mCountY];
296 mCountX, mCountY);
317 mCountX, mCountY);
321 mCountX = x;
323 mOccupied = new boolean[mCountX][mCountY];
324 mTmpOccupied = new boolean[mCountX][mCountY];
327 mCountX, mCountY);
457 (mCountX * mCellWidth);
471 for (int i = 0; i < mCountX; i++) {
605 return mCountX;
632 if (lp.cellX >= 0 && lp.cellX <= mCountX - 1 && lp.cellY >= 0 && lp.cellY <= mCountY - 1) {
635 if (lp.cellHSpan < 0) lp.cellHSpan = mCountX;
812 final int xAxis = mCountX;
954 int cw = grid.calculateCellWidth(childWidthSize, mCountX);
960 mHeightGap, mCountX, mCountY);
973 int numWidthGaps = mCountX - 1;
979 int hFreeSpace = hSpace - (mCountX * mCellWidth);
984 mHeightGap, mCountX, mCountY);
1012 (mCountX * mCellWidth);
1181 final int countX = mCountX;
1333 for (int i = 0; i < mCountX * mCountY; i++) {
1380 final int countX = mCountX;
1513 final int countX = mCountX;
1594 int[] topEdge = new int[mCountX];
1595 int[] bottomEdge = new int[mCountX];
1606 for (int i = 0; i < mCountX; i++) {
1890 if (!fail && clusterRect.left >= 0 && clusterRect.right <= mCountX && clusterRect.top >= 0 &&
2138 for (int i = 0; i < mCountX; i++) {
2202 for (int i = 0; i < mCountX; i++) {
2230 for (int i = 0; i < mCountX; i++) {
2408 for (int i = 0; i < mCountX; i++) {
2495 if (dropRegionSpanX == mCountX || spanX == mCountX) {
2887 int endX = mCountX - (spanX - 1);
3084 return findVacantCell(vacant, spanX, spanY, mCountX, mCountY, mOccupied);
3112 for (int x = 0; x < mCountX; x++) {
3145 for (int x = cellX; x < cellX + spanX && x < mCountX; x++) {
3153 return getPaddingLeft() + getPaddingRight() + (mCountX * mCellWidth) +
3154 (Math.max((mCountX - 1), 0) * mWidthGap);
3163 if (x < mCountX && y < mCountY) {
