1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
// Copyright (C) 2011 The Android Open Source Project
//
// 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.
package com.google.gerrit.server.util;
import java.io.PrintWriter;
import java.util.SortedSet;
public class TreeFormatter {
public interface TreeNode {
String getDisplayName();
boolean isVisible();
SortedSet<? extends TreeNode> getChildren();
}
public static final String NOT_VISIBLE_NODE = "(x)";
private static final String NODE_PREFIX = "|-- ";
private static final String LAST_NODE_PREFIX = "`-- ";
private static final String DEFAULT_TAB_SEPARATOR = "|";
private final PrintWriter stdout;
private String currentTabSeparator = " ";
public TreeFormatter(PrintWriter stdout) {
this.stdout = stdout;
}
public void printTree(SortedSet<? extends TreeNode> rootNodes) {
if (rootNodes.isEmpty()) {
return;
}
if (rootNodes.size() == 1) {
printTree(rootNodes.first());
} else {
currentTabSeparator = DEFAULT_TAB_SEPARATOR;
int i = 0;
final int size = rootNodes.size();
for (TreeNode rootNode : rootNodes) {
final boolean isLastRoot = ++i == size;
if (isLastRoot) {
currentTabSeparator = " ";
}
printTree(rootNode);
}
}
}
public void printTree(TreeNode rootNode) {
printTree(rootNode, 0, true);
}
private void printTree(TreeNode node, int level, boolean isLast) {
printNode(node, level, isLast);
final SortedSet<? extends TreeNode> childNodes = node.getChildren();
int i = 0;
final int size = childNodes.size();
for (TreeNode childNode : childNodes) {
final boolean isLastChild = ++i == size;
printTree(childNode, level + 1, isLastChild);
}
}
private void printIndention(int level) {
if (level > 0) {
stdout.print(String.format("%-" + 4 * level + "s", currentTabSeparator));
}
}
private void printNode(TreeNode node, int level, boolean isLast) {
printIndention(level);
stdout.print(isLast ? LAST_NODE_PREFIX : NODE_PREFIX);
if (node.isVisible()) {
stdout.print(node.getDisplayName());
} else {
stdout.print(NOT_VISIBLE_NODE);
}
stdout.print("\n");
}
}
|
