Lines Matching defs:paths
461 // of the paths that are going to be removed. They will
464 // 4 - continue until selected contains only null paths.
473 * located in <code>paths</code>.
475 private void removeSiblings(TreePath path, TreePath[] paths) {
479 for (int counter = paths.length - 1; counter >= 0; counter--) {
480 paths[counter] = null;
490 // First pass, find paths with a parent TreePath of parent
491 for (int counter = paths.length - 1; counter >= 0; counter--) {
492 if (paths[counter] != null && paths[counter].getParentPath().
494 toRemove.add(paths[counter]);
495 paths[counter] = null;
499 // Second pass, remove any paths that are descendants of the
500 // paths that are going to be removed. These paths are
501 // implicitly removed as a result of removing the paths in
504 for (int counter = paths.length - 1; counter >= 0; counter--) {
505 if (paths[counter] != null) {
509 paths[counter])) {
510 paths[counter] = null;
535 * <code>paths</code>. Will return null if there is no non-null
536 * TreePath is <code>paths</code>.
538 private TreePath findShallowestPath(TreePath[] paths) {
542 for (int counter = paths.length - 1; counter >= 0; counter--) {
543 if (paths[counter] != null) {
545 if (paths[counter].getPathCount() < shallowest) {
546 shallowest = paths[counter].getPathCount();
547 shallowestPath = paths[counter];
553 shallowestPath = paths[counter];
554 shallowest = paths[counter].getPathCount();