Home | History | Annotate | Download | only in impl

Lines Matching refs:rows

27  * Rows of primitive integers in a contiguous array store the range limits and
36 * self-contained rows allow to later sort them by contents.
43 private int rows;
106 int limit = rows;
152 rows = 2 + (MAX_CP - FIRST_SPECIAL_CP);
166 * In rows for code points [start..end], select the column, reset the mask
192 // find the rows whose ranges overlap with the input range
198 * Rows need to be split if they partially overlap with the input range
199 * (only possible for the first and last rows) and if their value
205 // split first/last rows if necessary
215 if ((rows + rowsToExpand) > maxRows) {
226 System.arraycopy(v, 0, temp, 0, rows * columns);
233 int count = (rows * columns) - (lastRow + columns);
238 rows += rowsToExpand;
243 // copy all affected rows up one and move the lastRow pointer
266 // set the input value in all remaining rows
303 if (rowIndex < 0 || rowIndex > rows) {
325 if (rowIndex < 0 || rowIndex > rows) {
344 if (rowIndex < 0 || rowIndex > rows) {
379 Integer[] indexArray = new Integer[rows];
380 for (int i = 0; i < rows; ++i) {
411 * rows will move.
414 for (int i = 0; i < rows; ++i) {
448 for (int i = 0; i < rows; ++i) {
469 rows = count / valueColumns + 1;
486 * Get the number of rows for the compacted array.
495 return rows;