1 /*
2 * Portions of this software was developed by employees of the National Institute
3 * of Standards and Technology (NIST), an agency of the Federal Government and is
4 * being made available as a public service. Pursuant to title 17 United States
5 * Code Section 105, works of NIST employees are not subject to copyright
6 * protection in the United States. This software may be subject to foreign
7 * copyright. Permission in the United States and in foreign countries, to the
8 * extent that NIST may hold copyright, to use, copy, modify, create derivative
9 * works, and distribute this software and its documentation without fee is hereby
10 * granted on a non-exclusive basis, provided that this notice and disclaimer
11 * of warranty appears in all copies.
12 *
13 * THE SOFTWARE IS PROVIDED 'AS IS' WITHOUT ANY WARRANTY OF ANY KIND, EITHER
14 * EXPRESSED, IMPLIED, OR STATUTORY, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTY
15 * THAT THE SOFTWARE WILL CONFORM TO SPECIFICATIONS, ANY IMPLIED WARRANTIES OF
16 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND FREEDOM FROM
17 * INFRINGEMENT, AND ANY WARRANTY THAT THE DOCUMENTATION WILL CONFORM TO THE
18 * SOFTWARE, OR ANY WARRANTY THAT THE SOFTWARE WILL BE ERROR FREE. IN NO EVENT
19 * SHALL NIST BE LIABLE FOR ANY DAMAGES, INCLUDING, BUT NOT LIMITED TO, DIRECT,
20 * INDIRECT, SPECIAL OR CONSEQUENTIAL DAMAGES, ARISING OUT OF, RESULTING FROM,
21 * OR IN ANY WAY CONNECTED WITH THIS SOFTWARE, WHETHER OR NOT BASED UPON WARRANTY,
22 * CONTRACT, TORT, OR OTHERWISE, WHETHER OR NOT INJURY WAS SUSTAINED BY PERSONS OR
23 * PROPERTY OR OTHERWISE, AND WHETHER OR NOT LOSS WAS SUSTAINED FROM, OR AROSE OUT
24 * OF THE RESULTS OF, OR USE OF, THE SOFTWARE OR SERVICES PROVIDED HEREUNDER.
25 */
26
27 package gov.nist.secauto.metaschema.core.datatype.markup.flexmark;
28
29 import com.vladsch.flexmark.util.ast.Node;
30 import com.vladsch.flexmark.util.ast.NodeVisitorBase;
31
32 import edu.umd.cs.findbugs.annotations.NonNull;
33
34 public class AstCollectingVisitor
35 extends NodeVisitorBase {
36 public static final String EOL = "\n";
37 @NonNull
38 protected StringBuilder output = new StringBuilder(); // NOPMD - intentional
39 protected int indent; // 0;
40 protected boolean eolPending; // false;
41
42 @NonNull
43 public static String asString(@NonNull Node node) {
44 AstCollectingVisitor visitor = new AstCollectingVisitor();
45 visitor.collect(node);
46 return visitor.getAst();
47 }
48
49 @SuppressWarnings("null")
50 @NonNull
51 public String getAst() {
52 return output.toString();
53 }
54
55 public void clear() {
56 output = new StringBuilder();
57 indent = 0;
58 eolPending = false;
59 }
60
61 protected void appendIndent() {
62 for (int i = 0; i < indent * 2; i++) {
63 output.append(' ');
64 }
65 eolPending = true;
66 }
67
68 protected void appendEOL() {
69 output.append(EOL);
70 eolPending = false;
71 }
72
73 protected void appendPendingEOL() {
74 if (eolPending) {
75 appendEOL();
76 }
77 }
78
79 public void collect(@NonNull Node node) {
80 visit(node);
81 }
82
83 @Override
84 protected void visit(Node node) {
85 assert node != null;
86 appendIndent();
87 node.astString(output, true);
88 output.append(EOL);
89 indent++;
90
91 try {
92 super.visitChildren(node);
93 } finally {
94 indent--;
95 }
96 }
97 }