< prev index next >
src/java.desktop/share/classes/javax/swing/tree/DefaultTreeSelectionModel.java
Print this page
*** 1,7 ****
/*
! * Copyright (c) 1997, 2015, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
--- 1,7 ----
/*
! * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
*** 380,390 ****
if(leadPath == null) {
leadPath = beginLeadPath;
}
if(validCount > 0) {
! TreePath newSelection[] = new TreePath[oldCount +
validCount];
/* And build the new selection. */
if(oldCount > 0)
System.arraycopy(selection, 0, newSelection, 0,
--- 380,390 ----
if(leadPath == null) {
leadPath = beginLeadPath;
}
if(validCount > 0) {
! TreePath[] newSelection = new TreePath[oldCount +
validCount];
/* And build the new selection. */
if(oldCount > 0)
System.arraycopy(selection, 0, newSelection, 0,
*** 899,909 ****
if(counter == min) {
clearSelection();
}
else {
TreePath[] newSel = new TreePath[counter - min];
! int selectionIndex[] = rowMapper.getRowsForPaths(selection);
// find the actual selection pathes corresponded to the
// rows of the new selection
for (int i = 0; i < selectionIndex.length; i++) {
if (selectionIndex[i]<counter) {
newSel[selectionIndex[i]-min] = selection[i];
--- 899,909 ----
if(counter == min) {
clearSelection();
}
else {
TreePath[] newSel = new TreePath[counter - min];
! int[] selectionIndex = rowMapper.getRowsForPaths(selection);
// find the actual selection pathes corresponded to the
// rows of the new selection
for (int i = 0; i < selectionIndex.length; i++) {
if (selectionIndex[i]<counter) {
newSel[selectionIndex[i]-min] = selection[i];
< prev index next >