1 /*
2 * Copyright (c) 2011-2024 PrimeFaces Extensions
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
20 * THE SOFTWARE.
21 */
22 package org.primefaces.extensions.component.orgchart;
23
24 import java.util.ArrayList;
25 import java.util.HashMap;
26 import java.util.List;
27 import java.util.Map;
28
29 /**
30 * <code>orgchart</code> component.
31 *
32 * @author @jxmai / last modified by $Author$
33 * @version $Revision$
34 * @since 6.3
35 */
36 public class OrgChartHelper {
37
38 private OrgChartHelper() {
39 // prevent instantiation
40 }
41
42 public static List<OrgChartNode> getAllNodesTraverseFromRoot(final OrgChartNode root) {
43 final List<OrgChartNode> orgChartNodes = new ArrayList<>();
44
45 treeTraversal(root, orgChartNodes);
46
47 return orgChartNodes;
48 }
49
50 public static Map<String, OrgChartNode> parseOrgChartNodesIntoHashMap(
51 final List<OrgChartNode> orgChartNodes) {
52
53 final HashMap<String, OrgChartNode> hashMap = new HashMap<>();
54
55 if (orgChartNodes != null && !orgChartNodes.isEmpty()) {
56
57 if (null == orgChartNodes.get(0).getId() || orgChartNodes.get(0).getId().isEmpty()) {
58 return hashMap;
59 }
60 else {
61 for (final OrgChartNode o : orgChartNodes) {
62 hashMap.put(o.getId(), o);
63 }
64 }
65 }
66
67 return hashMap;
68 }
69
70 private static void treeTraversal(final OrgChartNode orgChartNode, final List<OrgChartNode> orgChartNodes) {
71 if (orgChartNode.getChildCount() > 0) {
72 for (final OrgChartNode o : orgChartNode.getChildren()) {
73 treeTraversal(o, orgChartNodes);
74 }
75 }
76 orgChartNodes.add(orgChartNode);
77 }
78
79 }