ListTree.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="ListTree.java.html"><b><i>View Source</i></b></a> 30 * 31 * @author Shuyang Zhou 32 * 33 */ 34 public class ListTree<T extends Comparable<T>> { 35 36 public ListTree() { 37 this(null); 38 } 39 40 public ListTree(T value) { 41 _rootNode = new TreeNode<T>(value); 42 } 43 44 public List<TreeNode<T>> getChildNodes(TreeNode<T> node) { 45 List<TreeNode<T>> nodes = new ArrayList<TreeNode<T>>(); 46 47 getChildNodes(node, nodes); 48 49 return nodes; 50 } 51 52 public TreeNode<T> getRootNode() { 53 return _rootNode; 54 } 55 56 protected void getChildNodes(TreeNode<T> node, List<TreeNode<T>> nodes) { 57 List<TreeNode<T>> childNodes = node.getChildNodes(); 58 59 nodes.addAll(childNodes); 60 61 for (TreeNode<T> childNode : childNodes) { 62 getChildNodes(childNode, nodes); 63 } 64 } 65 66 private final TreeNode<T> _rootNode; 67 68 }