Lines Matching refs:rows
43 * the paths in the selection change, not the rows. In order
681 * Returns the selection in terms of rows. There is not
692 * @return the selection in terms of rows
698 int[] rows = rowMapper.getRowsForPaths(selection);
700 if (rows != null) {
703 for (int counter = rows.length - 1; counter >= 0; counter--) {
704 if (rows[counter] == -1) {
709 if (invisCount == rows.length) {
710 rows = null;
713 int[] tempRows = new int[rows.length - invisCount];
715 for (int counter = rows.length - 1, visCounter = 0;
717 if (rows[counter] != -1) {
718 tempRows[visCounter++] = rows[counter];
721 rows = tempRows;
725 return rows;
756 * Updates this object's mapping from TreePath to rows. This should
771 int[] rows = rowMapper.getRowsForPaths(selection);
775 aRow = rows[counter];
780 if(leadIndex != -1 && rows != null) {
781 leadRow = rows[leadIndex];
786 rows = rowMapper.getRowsForPaths(tempPaths);
787 leadRow = (rows != null) ? rows[0] : -1;
873 * the rows are contiguous, that is, when sorted all the rows are
876 * reset to contain the first set, when sorted, of contiguous rows.
900 // rows of the new selection
938 int[] rows = rowMapper.getRowsForPaths(tempPath);
939 if (rows == null) {
942 anIndex = rows[0];
998 int[] rows = rowMapper.getRowsForPaths(tempPath);
999 if (rows == null) {
1002 anIndex = rows[0];
1034 int[] rows;
1036 /* Determine the rows for the removed entries. */
1046 rows = rowMapper.getRowsForPaths(tempPath);
1047 if(rows != null && rows[0] != -1 && !bitSet.get(rows[0])) {
1050 min = rows[0];
1052 min = Math.min(min, rows[0]);
1053 bitSet.set(rows[0]);
1140 int[] rows;
1143 rows = rowMapper.getRowsForPaths(selection);
1145 rows = null;
1148 if(rows != null)
1150 Integer.toString(rows[counter])+ " ");