All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.teamapps.ux.component.node.TreeNode Maven / Gradle / Ivy

There is a newer version: 0.9.194
Show newest version
/*-
 * ========================LICENSE_START=================================
 * TeamApps
 * ---
 * Copyright (C) 2014 - 2024 TeamApps.org
 * ---
 * Licensed 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.
 * =========================LICENSE_END==================================
 */
package org.teamapps.ux.component.node;

import org.teamapps.ux.component.tree.TreeNodeInfo;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;

public interface TreeNode extends TreeNodeInfo {

	@Override
	TreeNode getParent();

	default int getDepth() {
		TreeNode node = this;
		int i = 0;
		while (node.getParent() != null) {
			i++;
			node = node.getParent();
		}
		return i;
	}

	default List getPath() {
		return getPathToNode(this);
	}

	default boolean isDescendantOf(TreeNode potentialAncestor) {
		TreeNode ancestor = this.getParent();
		while (ancestor != null) {
			if (ancestor == potentialAncestor) {
				return true;
			}
			ancestor = ancestor.getParent();
		}
		return false;
	}

	default boolean isDescendantOf(Collection potentialAncestors) {
		TreeNode ancestor = this.getParent();
		while (ancestor != null) {
			if (potentialAncestors.contains(ancestor)) {
				return true;
			}
			ancestor = ancestor.getParent();
		}
		return false;
	}

	static List getPathToNode(TreeNode node) {
		List path = new ArrayList<>();
		TreeNode selfOrAncestor = node;
		while (selfOrAncestor != null) {
			path.add(selfOrAncestor);
			selfOrAncestor = selfOrAncestor.getParent();
		}
		Collections.reverse(path);
		return path;
	}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy