return false;
if (rowMapper == null || paths.length < 2) return true;  int[] rows = rowMapper.getRowsForPaths(paths);   Arrays.sort(rows);  for (int i = 1; i < rows.length; i++) { if (rows[i-1] != rows[i] - 1) return false; } return true;
	protected boolean arePathsContiguous(TreePath[] paths)      throws NotImplementedException  {		return false; // STUB  }