/** * If {@code updatingListSelectionModel} is false, this will * reset the selected paths from the selected rows in the list * selection model. */ private void updateSelectedPathsFromSelectedRows() { if (!updatingListSelectionModel) { updatingListSelectionModel = true; try { // This is way expensive, ListSelectionModel needs an // enumerator for iterating. final int min = listSelectionModel.getMinSelectionIndex(); final int max = listSelectionModel.getMaxSelectionIndex(); clearSelection(); if (min != -1 && max != -1) { for (int counter = min; counter <= max; counter++) { updateSelectedPathIfRowIsSelected(counter); } } } finally { updatingListSelectionModel = false; } } }
@Override public int getMaxSelectionIndex() { if (noSelection) { return -1; } else { return super.getMaxSelectionIndex(); } }
public int getSelectedIndex() { int i1 = selection.getMinSelectionIndex(), i2 = selection.getMaxSelectionIndex(); if (i1 == i2 && i1 >= 0 && i1 < filters.size()) { return i1; } else { return -1; } }
@Override public int getMaxSelectionIndex() { int maxFormDelegate = delegate.getMaxSelectionIndex(); if(maxFormDelegate != -1) { return inset.toOuterSpace(new InsetPart(InsetPart.PartKind.CONTENT, maxFormDelegate), informer.getContentSize()); } return super.getMaxSelectionIndex(); }
/** * If {@code updatingListSelectionModel} is false, this will * reset the selected paths from the selected rows in the list * selection model. */ private void updateSelectedPathsFromSelectedRows() { if (!updatingListSelectionModel) { updatingListSelectionModel = true; try { // This is way expensive, ListSelectionModel needs an // enumerator for iterating. final int min = listSelectionModel.getMinSelectionIndex(); final int max = listSelectionModel.getMaxSelectionIndex(); clearSelection(); if (min != -1 && max != -1) { for (int counter = min; counter <= max; counter++) { updateSelectedPathIfRowIsSelected(counter); } } } finally { updatingListSelectionModel = false; } } }
try { int min = listSelectionModel.getMinSelectionIndex(); int max = listSelectionModel.getMaxSelectionIndex();
int max = listSelectionModel.getMaxSelectionIndex();
int max = listSelectionModel.getMaxSelectionIndex();
/** * If <code>updatingListSelectionModel</code> is false, this will * reset the selected paths from the selected rows in the list selection * model. */ protected void updateSelectedPathsFromSelectedRows() { if (!updatingListSelectionModel) { updatingListSelectionModel = true; try { // This is way expensive, ListSelectionModel needs an // enumerator for iterating. int min = listSelectionModel.getMinSelectionIndex(); int max = listSelectionModel.getMaxSelectionIndex(); clearSelection(); if ((min != -1) && (max != -1)) { for (int counter = min; counter <= max; counter++) { if (listSelectionModel.isSelectedIndex(counter)) { TreePath selPath = tree.getPathForRow(counter); if (selPath != null) { addSelectionPath(selPath); } } } } } finally { updatingListSelectionModel = false; } } }
/** * If {@code updatingListSelectionModel} is false, this will * reset the selected paths from the selected rows in the list * selection model. */ protected void updateSelectedPathsFromSelectedRows () { if (!updatingListSelectionModel) { updatingListSelectionModel = true; try { // This is way expensive, ListSelectionModel needs an // enumerator for iterating. int min = listSelectionModel.getMinSelectionIndex(); int max = listSelectionModel.getMaxSelectionIndex(); clearSelection(); if ((min != -1) && (max != -1)) { for (int counter = min; counter <= max; counter++) { if (listSelectionModel.isSelectedIndex(counter)) { TreePath selPath = tree.getPathForRow(counter); if (selPath != null) { addSelectionPath(selPath); } } } } } finally { updatingListSelectionModel = false; } } }
/** * If <code>updatingListSelectionModel</code> is false, this will * reset the selected paths from the selected rows in the list * selection model. */ protected void updateSelectedPathsFromSelectedRows() { if (!updatingListSelectionModel) { updatingListSelectionModel = true; try { // This is way expensive, ListSelectionModel needs an // enumerator for iterating. int min = listSelectionModel.getMinSelectionIndex(); int max = listSelectionModel.getMaxSelectionIndex(); clearSelection(); if ((min != -1) && (max != -1)) { for (int counter = min; counter <= max; counter++) { if (listSelectionModel.isSelectedIndex(counter)) { TreePath selPath = tree.getPathForRow(counter); if (selPath != null) { addSelectionPath(selPath); } } } } } finally { updatingListSelectionModel = false; } } }
int max = listSelectionModel.getMaxSelectionIndex();
/** * If <code>updatingListSelectionModel</code> is false, this will * reset the selected paths from the selected rows in the list selection * model. */ protected void updateSelectedPathsFromSelectedRows() { if (!updatingListSelectionModel) { updatingListSelectionModel = true; try { // This is way expensive, ListSelectionModel needs an // enumerator for iterating. int min = listSelectionModel.getMinSelectionIndex(); int max = listSelectionModel.getMaxSelectionIndex(); clearSelection(); if ((min != -1) && (max != -1)) { for (int counter = min; counter <= max; counter++) { if (listSelectionModel.isSelectedIndex(counter)) { TreePath selPath = tree.getPathForRow(counter); if (selPath != null) { addSelectionPath(selPath); } } } } } finally { updatingListSelectionModel = false; } } }
int max = listSelectionModel.getMaxSelectionIndex();
int max = listSelectionModel.getMaxSelectionIndex();
int max = listSelectionModel.getMaxSelectionIndex();
int max = listSelectionModel.getMaxSelectionIndex();
int max = listSelectionModel.getMaxSelectionIndex();
int max = listSelectionModel.getMaxSelectionIndex();
try { int min = listSelectionModel.getMinSelectionIndex(); int max = listSelectionModel.getMaxSelectionIndex();