|
|||||||||||||||||||
30 day Evaluation Version distributed via the Maven Jar Repository. Clover is not free. You have 30 days to evaluate it. Please visit http://www.thecortex.net/clover to obtain a licensed version of Clover | |||||||||||||||||||
Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
NodePrinter.java | 0% | 0% | 0% | 0% |
|
1 |
/*
|
|
2 |
$Id: NodePrinter.java,v 1.3 2004/05/17 07:53:29 jstrachan Exp $
|
|
3 |
|
|
4 |
Copyright 2003 (C) James Strachan and Bob Mcwhirter. All Rights Reserved.
|
|
5 |
|
|
6 |
Redistribution and use of this software and associated documentation
|
|
7 |
("Software"), with or without modification, are permitted provided
|
|
8 |
that the following conditions are met:
|
|
9 |
|
|
10 |
1. Redistributions of source code must retain copyright
|
|
11 |
statements and notices. Redistributions must also contain a
|
|
12 |
copy of this document.
|
|
13 |
|
|
14 |
2. Redistributions in binary form must reproduce the
|
|
15 |
above copyright notice, this list of conditions and the
|
|
16 |
following disclaimer in the documentation and/or other
|
|
17 |
materials provided with the distribution.
|
|
18 |
|
|
19 |
3. The name "groovy" must not be used to endorse or promote
|
|
20 |
products derived from this Software without prior written
|
|
21 |
permission of The Codehaus. For written permission,
|
|
22 |
please contact info@codehaus.org.
|
|
23 |
|
|
24 |
4. Products derived from this Software may not be called "groovy"
|
|
25 |
nor may "groovy" appear in their names without prior written
|
|
26 |
permission of The Codehaus. "groovy" is a registered
|
|
27 |
trademark of The Codehaus.
|
|
28 |
|
|
29 |
5. Due credit should be given to The Codehaus -
|
|
30 |
http://groovy.codehaus.org/
|
|
31 |
|
|
32 |
THIS SOFTWARE IS PROVIDED BY THE CODEHAUS AND CONTRIBUTORS
|
|
33 |
``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT
|
|
34 |
NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
35 |
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
36 |
THE CODEHAUS OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
|
|
37 |
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
38 |
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
39 |
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
40 |
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
41 |
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
42 |
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
|
43 |
OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
44 |
|
|
45 |
*/
|
|
46 |
package groovy.util;
|
|
47 |
|
|
48 |
|
|
49 |
import org.codehaus.groovy.runtime.InvokerHelper;
|
|
50 |
|
|
51 |
import java.io.OutputStreamWriter;
|
|
52 |
import java.io.PrintWriter;
|
|
53 |
import java.util.Iterator;
|
|
54 |
import java.util.List;
|
|
55 |
import java.util.Map;
|
|
56 |
|
|
57 |
/**
|
|
58 |
* A helper class for creating nested trees of data
|
|
59 |
*
|
|
60 |
* @author <a href="mailto:james@coredevelopers.net">James Strachan</a>
|
|
61 |
* @version $Revision: 1.3 $
|
|
62 |
*/
|
|
63 |
public class NodePrinter { |
|
64 |
|
|
65 |
private IndentPrinter out;
|
|
66 |
|
|
67 | 0 |
public NodePrinter() {
|
68 | 0 |
this(new IndentPrinter(new PrintWriter(new OutputStreamWriter(System.out)))); |
69 |
} |
|
70 |
|
|
71 | 0 |
public NodePrinter(PrintWriter out) {
|
72 | 0 |
this(new IndentPrinter(out)); |
73 |
} |
|
74 |
|
|
75 | 0 |
public NodePrinter(IndentPrinter out) {
|
76 | 0 |
this.out = out;
|
77 |
} |
|
78 |
|
|
79 | 0 |
public void print(Node node) { |
80 | 0 |
out.printIndent(); |
81 | 0 |
printName(node); |
82 | 0 |
Map attributes = node.attributes(); |
83 | 0 |
boolean hasAttributes = attributes != null && !attributes.isEmpty(); |
84 | 0 |
if (hasAttributes) {
|
85 | 0 |
printAttributes(attributes); |
86 |
} |
|
87 | 0 |
Object value = node.value(); |
88 | 0 |
if (value instanceof List) { |
89 | 0 |
if (!hasAttributes) {
|
90 | 0 |
out.print("()");
|
91 |
} |
|
92 | 0 |
printList((List) value); |
93 |
} |
|
94 |
else {
|
|
95 | 0 |
if (value instanceof String) { |
96 | 0 |
out.print("('");
|
97 | 0 |
out.print((String) value); |
98 | 0 |
out.println("')");
|
99 |
} |
|
100 |
else {
|
|
101 | 0 |
out.println("()");
|
102 |
} |
|
103 |
} |
|
104 | 0 |
out.flush(); |
105 |
} |
|
106 |
|
|
107 | 0 |
protected void printName(Node node) { |
108 | 0 |
Object name = node.name(); |
109 | 0 |
if (name != null) { |
110 | 0 |
out.print(name.toString()); |
111 |
} |
|
112 |
else {
|
|
113 | 0 |
out.print("null");
|
114 |
} |
|
115 |
} |
|
116 |
|
|
117 | 0 |
protected void printList(List list) { |
118 | 0 |
if (list.isEmpty()) {
|
119 | 0 |
out.println("");
|
120 |
} |
|
121 |
else {
|
|
122 | 0 |
out.println(" {");
|
123 | 0 |
out.incrementIndent(); |
124 | 0 |
for (Iterator iter = list.iterator(); iter.hasNext();) {
|
125 | 0 |
Object value = iter.next(); |
126 | 0 |
if (value instanceof Node) { |
127 | 0 |
print((Node) value); |
128 |
} |
|
129 |
else {
|
|
130 | 0 |
out.printIndent(); |
131 | 0 |
out.print("builder.append(");
|
132 | 0 |
out.print(InvokerHelper.toString(value)); |
133 | 0 |
out.println(")");
|
134 |
} |
|
135 |
} |
|
136 | 0 |
out.decrementIndent(); |
137 | 0 |
out.printIndent(); |
138 | 0 |
out.println("}");
|
139 |
} |
|
140 |
} |
|
141 |
|
|
142 |
|
|
143 | 0 |
protected void printAttributes(Map attributes) { |
144 | 0 |
out.print("(");
|
145 | 0 |
boolean first = true; |
146 | 0 |
for (Iterator iter = attributes.entrySet().iterator(); iter.hasNext();) {
|
147 | 0 |
Map.Entry entry = (Map.Entry) iter.next(); |
148 | 0 |
if (first) {
|
149 | 0 |
first = false;
|
150 |
} |
|
151 |
else {
|
|
152 | 0 |
out.print(", ");
|
153 |
} |
|
154 | 0 |
out.print(entry.getKey().toString()); |
155 | 0 |
out.print(":");
|
156 | 0 |
if (entry.getValue() instanceof String) { |
157 | 0 |
out.print("'" + entry.getValue() + "'"); |
158 |
} |
|
159 |
else {
|
|
160 | 0 |
out.print(InvokerHelper.toString(entry.getValue())); |
161 |
} |
|
162 |
} |
|
163 | 0 |
out.print(")");
|
164 |
} |
|
165 |
|
|
166 |
} |
|
167 |
|
|