| TreeNode.java |
1 /**
2 * Copyright (c) 2000-2009 Liferay, Inc. All rights reserved.
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a copy
5 * of this software and associated documentation files (the "Software"), to deal
6 * in the Software without restriction, including without limitation the rights
7 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8 * copies of the Software, and to permit persons to whom the Software is
9 * furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
13 *
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
19 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
20 * SOFTWARE.
21 */
22
23 package com.liferay.portal.kernel.util;
24
25 import java.util.ArrayList;
26 import java.util.List;
27
28 /**
29 * <a href="TreeNode.java.html"><b><i>View Source</i></b></a>
30 *
31 * @author Shuyang Zhou
32 *
33 */
34 public class TreeNode<T extends Comparable<T>> {
35
36 public TreeNode(T value) {
37 this(value, null);
38 }
39
40 public TreeNode(T value, TreeNode<T> parentNode) {
41 this(value, parentNode, new ArrayList<TreeNode<T>>());
42 }
43
44 public TreeNode(
45 T value, TreeNode<T> parentNode, List<TreeNode<T>> childNodes) {
46
47 _value = value;
48 _parentNode = parentNode;
49 _childNodes = childNodes;
50 }
51
52 public TreeNode<T> addChildNode(T value) {
53 TreeNode<T> childNode = new TreeNode<T>(value, this);
54
55 _childNodes.add(childNode);
56
57 return childNode;
58 }
59
60 public List<TreeNode<T>> getChildNodes() {
61 return _childNodes;
62 }
63
64 public List<T> getChildValues() {
65 List<T> values = new ArrayList<T>(_childNodes.size());
66
67 for (TreeNode<T> childNode : _childNodes) {
68 values.add(childNode.getValue());
69 }
70
71 return values;
72 }
73
74 public TreeNode<T> getParentNode() {
75 return _parentNode;
76 }
77
78 public T getValue() {
79 return _value;
80 }
81
82 public boolean isRootNode() {
83 if (_parentNode == null) {
84 return true;
85 }
86 else {
87 return false;
88 }
89 }
90
91 private final List<TreeNode<T>> _childNodes;
92 private final TreeNode<T> _parentNode;
93 private final T _value;
94
95 }