return false;
if (rowMapper == null || isSelectionEmpty() || selectionMode == DISCONTIGUOUS_TREE_SELECTION) return true;  HashSet set = new HashSet(); for (int i = 0; i < selection.length; i++) set.add(selection[i]);  for (int i = 0; i < paths.length; i++) set.remove(paths[i]);  TreePath[] remaining = new TreePath[set.size()]; Iterator iter = set.iterator();  for (int i = 0; i < remaining.length; i++) remaining[i] = (TreePath) iter.next();  return arePathsContiguous(remaining);
	protected boolean canPathsBeRemoved(TreePath[] paths)      throws NotImplementedException  {		return false; // STUB  }