| /* |
| * Licensed to the Apache Software Foundation (ASF) under one |
| * or more contributor license agreements. See the NOTICE file |
| * distributed with this work for additional information |
| * regarding copyright ownership. The ASF licenses this file |
| * to you under the Apache License, Version 2.0 (the |
| * "License"); you may not use this file except in compliance |
| * with the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, |
| * software distributed under the License is distributed on an |
| * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
| * KIND, either express or implied. See the License for the |
| * specific language governing permissions and limitations |
| * under the License. |
| */ |
| |
| package org.apache.myfaces.tobago.model; |
| |
| import javax.swing.tree.TreeNode; |
| import java.io.Serializable; |
| import java.util.ArrayList; |
| import java.util.Arrays; |
| import java.util.List; |
| |
| /** |
| * Handles a path in a tree from the root node to the position inside this tree. |
| * The position of the root node is dropped in the list, because it would always be zero. |
| * The path of the root node as length 0. |
| * <br> |
| * Example: |
| * <pre> |
| * + Root Path: [] |
| * | |
| * +-+ Node Path: [0] |
| * | | |
| * | +-+ Sub-Node Path: [0, 0] |
| * | | |
| * | +-+ Sub-Node Path: [0, 1] |
| * | |
| * +-+ Node Path: [1] |
| * | |
| * +-+ Sub-Node Path: [1, 0] |
| * | |
| * +-+ Sub-Node Path: [1, 1] |
| * | |
| * +-+ Sub-Node Path: [1, 2] |
| * </pre> |
| * |
| * @since 1.5.0 |
| */ |
| public class TreePath implements Serializable { |
| |
| private final int[] path; |
| |
| public TreePath(final int... path) { |
| this.path = path; |
| } |
| |
| public TreePath(final List<Integer> pathList) { |
| path = new int[pathList.size()]; |
| for (int i = 0; i < path.length; i++) { |
| path[i] = pathList.get(i); |
| } |
| } |
| |
| public TreePath(final TreeNode node) { |
| if (node == null) { |
| throw new IllegalArgumentException(); |
| } |
| |
| TreeNode p = node; |
| final List<TreeNode> list = new ArrayList<>(); |
| int n = 0; |
| while (p != null) { |
| list.add(p); |
| p = p.getParent(); |
| n++; |
| } |
| path = new int[n - 1]; |
| for (int i = n - 2; i >= 0; i--) { |
| final TreeNode parent = list.get(i + 1); |
| final TreeNode child = list.get(i); |
| for (int j = 0; j < parent.getChildCount(); j++) { |
| if (parent.getChildAt(j) == child) { // == is okay in this case |
| path[n - 2 - i] = j; |
| break; |
| } |
| } |
| } |
| } |
| |
| public int[] getPath() { |
| return path; |
| } |
| |
| public TreePath getParent() { |
| return new TreePath(Arrays.copyOf(path, path.length - 1)); |
| } |
| |
| public boolean isRoot() { |
| return path.length == 0; |
| } |
| |
| public int getLength() { |
| return path.length; |
| } |
| |
| @Override |
| public boolean equals(final Object o) { |
| if (this == o) { |
| return true; |
| } |
| if (o == null || getClass() != o.getClass()) { |
| return false; |
| } |
| final TreePath nodeIndex = (TreePath) o; |
| return Arrays.equals(path, nodeIndex.path); |
| |
| } |
| |
| @Override |
| public int hashCode() { |
| return path != null ? Arrays.hashCode(path) : 0; |
| } |
| |
| @Override |
| public String toString() { |
| return Arrays.toString(path); |
| } |
| } |