Lines Matching refs:columns
46 * @param columns the width of the PackedIntVector.
48 public PackedIntVector(int columns) {
49 mColumns = columns;
56 mValueGap = new int[2 * columns];
72 final int columns = mColumns;
74 if (((row | column) < 0) || (row >= size()) || (column >= columns)) {
82 int value = mValues[row * columns + column];
86 value += valuegap[column + columns];
248 * @return the number of columns.
259 final int columns = mColumns;
261 GrowingArrayUtils.growSize(size()) * columns);
262 int newsize = newvalues.length / columns;
270 System.arraycopy(mValues, 0, newvalues, 0, columns * rowgapstart);
271 System.arraycopy(mValues, (mRows - after) * columns,
272 newvalues, (newsize - after) * columns,
273 after * columns);
276 for (int i = 0; i < columns; i++) {
298 final int columns = mColumns;
304 values[i * columns + column] += valuegap[column + columns];
308 values[i * columns + column] -= valuegap[column + columns];
323 final int columns = mColumns;
331 for (int j = 0; j < columns; j++) {
332 int val = values[i * columns+ j];
335 val += valuegap[j + columns];
339 val -= valuegap[j + columns];
342 values[destrow * columns + j] = val;
347 final int columns = mColumns;
355 for (int j = 0; j < columns; j++) {
356 int val = values[i * columns+ j];
359 val += valuegap[j + columns];
363 val -= valuegap[j + columns];
366 values[destrow * columns + j] = val;
