Lines Matching defs:row
70 * Used for getting path/row information.
128 throw new IllegalArgumentException("FixedHeightLayoutCache only supports row heights greater than 0");
161 * Returns true if the value identified by row is currently expanded.
204 * Returns the path for passed in row. If row is not visible
207 public TreePath getPathForRow(int row) {
208 if(row >= 0 && row < getRowCount()) {
209 if(root.getPathForRow(row, getRowCount(), info)) {
217 * Returns the row that the last item identified in path is visible
252 int row = getRowContainingYLocation(y);
254 return getPathForRow(row);
258 * Returns the number of visible children for row.
504 int row = changedNode.getRow();
505 parent.resetChildrenRowsFrom(row, index,
535 int row;
540 row = parent.getRow();
546 row = parent.getRowToModelIndex(childIndex);
552 Rectangle bounds = getNodeDimensions(value, row, level,
563 placeIn.y = row * placeIn.height;
569 * Adjust the large row count of the AbstractTreeUI the receiver was
611 root.row = 0;
615 root.row = -1;
630 * Returns the index of the row containing location. If there
632 * row index, the last row index is returned.
742 * obviously does not support variable sized row heights.
754 /** Row of the receiver. This is only valid if the row is expanded.
756 protected int row;
762 public FHTreeStateNode(Object userObject, int childIndex, int row) {
765 this.row = row;
854 * Returns the row of the receiver.
857 return row;
861 * Returns the row of the child with a model index of
875 return child.row;
878 return child.row - (child.childIndex - index);
902 return nextSibling.row - row -
987 child.row = childRow;
1005 row += amount;
1037 * the receivers children rows, as well as the total row count.
1040 int nextRow = setRowAndChildren(row);
1042 int childRowCount = nextRow - row - 1;
1051 * Sets the receivers row to <code>nextRow</code> and recursively
1053 * next row is to be placed as is returned.
1056 row = nextRow;
1059 return row + 1;
1061 int lastRow = row + 1;
1074 child.row = lastRow++;
1091 // the row of a particular node fast is very nice!
1107 node.row = lastRow++;
1229 int row = childNode.getRow();
1238 resetChildrenRowsFrom(row, index, modelIndex);
1318 * Returns true if there is a row for <code>row</code>.
1320 * Information about the found row is returned in <code>info</code>.
1324 protected boolean getPathForRow(int row, int nextRow,
1326 if(this.row == row) {
1339 if(child.row > row) {
1344 info.childIndex = row - this.row - 1;
1349 int lastChildEndRow = 1 + child.row -
1352 if(row < lastChildEndRow) {
1353 return lastChild.getPathForRow(row,
1359 info.childIndex = row - lastChildEndRow +
1373 if(row < lastChildEndRow) {
1374 return lastChild.getPathForRow(row, lastChildEndRow, info);
1379 info.childIndex = row - lastChildEndRow +
1385 int retChildIndex = row - this.row - 1;