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

com.liferay.portal.kernel.util.TreeNode Maven / Gradle / Ivy

The newest version!
/**
 * Copyright (c) 2000-2009 Liferay, Inc. All rights reserved.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

package com.liferay.portal.kernel.util;

import java.util.ArrayList;
import java.util.List;

/**
 * View Source
 *
 * @author Shuyang Zhou
 *
 */
public class TreeNode> {

	public TreeNode(T value) {
		this(value, null);
	}

	public TreeNode(T value, TreeNode parentNode) {
		this(value, parentNode, new ArrayList>());
	}

	public TreeNode(
		T value, TreeNode parentNode, List> childNodes) {

		_value = value;
		_parentNode = parentNode;
		_childNodes = childNodes;
	}

	public TreeNode addChildNode(T value) {
		TreeNode childNode = new TreeNode(value, this);

		_childNodes.add(childNode);

		return childNode;
	}

	public List> getChildNodes() {
		return _childNodes;
	}

	public List getChildValues() {
		List values = new ArrayList(_childNodes.size());

		for (TreeNode childNode : _childNodes) {
			values.add(childNode.getValue());
		}

		return values;
	}

	public TreeNode getParentNode() {
		return _parentNode;
	}

	public T getValue() {
		return _value;
	}

	public boolean isRootNode() {
		if (_parentNode == null) {
			return true;
		}
		else {
			return false;
		}
	}

	private final List> _childNodes;
	private final TreeNode _parentNode;
	private final T _value;

}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy