for (int counter = newMinIndex; counter <= newMaxIndex; counter++) selection[counter - newMinIndex] = ui.getPathForRow(tree, counter);
for (int counter = newMinIndex; counter <= newMaxIndex; counter++) { selection[counter - newMinIndex] = ui.getPathForRow(tree, counter); }
		private TreePath[] getPathBetweenRows(int index0, int index1) {			int newMinIndex, newMaxIndex;			TreeUI ui = tree.getUI();			newMinIndex = Math.min(index0, index1);			newMaxIndex = Math.max(index0, index1);			if(tree != null) {				TreePath[] selection = new TreePath[newMaxIndex - newMinIndex + 1];			for (int counter = newMinIndex; counter <= newMaxIndex; counter++)				selection[counter - newMinIndex] = ui.getPathForRow(tree, counter);				return selection;			}			return null;		}