| Index: lib/dartdoc/frog/tree.dart
|
| diff --git a/lib/dartdoc/frog/tree.dart b/lib/dartdoc/frog/tree.dart
|
| deleted file mode 100644
|
| index a0e09edfd91fdae90fd0f1654c7dbebadfbd529f..0000000000000000000000000000000000000000
|
| --- a/lib/dartdoc/frog/tree.dart
|
| +++ /dev/null
|
| @@ -1,131 +0,0 @@
|
| -// Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file
|
| -// for details. All rights reserved. Use of this source code is governed by a
|
| -// BSD-style license that can be found in the LICENSE file.
|
| -/**
|
| - * The base type for all nodes in a dart abstract syntax tree.
|
| - */
|
| -class Node {
|
| - /** The source code this [Node] represents. */
|
| - SourceSpan span;
|
| -
|
| - Node(this.span) {}
|
| -
|
| - /** Classic double-dispatch visitor for implementing passes. */
|
| - abstract visit(TreeVisitor visitor);
|
| -
|
| - /** A multiline string showing the node and its children. */
|
| - String toDebugString() {
|
| - var to = new TreeOutput();
|
| - var tp = new TreePrinter(to);
|
| - this.visit(tp);
|
| - return to.buf.toString();
|
| - }
|
| -}
|
| -
|
| -/** Represents all definitions allowed at the top-level. */
|
| -class Definition extends Statement {
|
| - Definition(SourceSpan span): super(span) {}
|
| -
|
| - List<TypeParameter> get typeParameters() => null;
|
| - NativeType get nativeType() => null;
|
| -}
|
| -
|
| -/** The base type for statements. */
|
| -class Statement extends Node {
|
| - Statement(SourceSpan span): super(span) {}
|
| -}
|
| -
|
| -/** The base type for expressions. */
|
| -class Expression extends Node {
|
| - Expression(SourceSpan span): super(span) {}
|
| -}
|
| -
|
| -/** The base type for a reference to a [Type]. */
|
| -class TypeReference extends Node {
|
| - TypeReference(SourceSpan span): super(span) {}
|
| -}
|
| -
|
| -// TODO(jimhug): Clean-up and factor out of core.
|
| -/** Simple class to provide a textual dump of trees for debugging. */
|
| -class TreeOutput {
|
| - int depth;
|
| - StringBuffer buf;
|
| -
|
| - var printer;
|
| -
|
| - static void dump(Node node) {
|
| - var o = new TreeOutput();
|
| - node.visit(new TreePrinter(o));
|
| - print(o.buf);
|
| - }
|
| -
|
| - TreeOutput(): this.depth = 0, this.buf = new StringBuffer() {
|
| - }
|
| -
|
| - void write(String s) {
|
| - for (int i=0; i < depth; i++) {
|
| - buf.add(' ');
|
| - }
|
| - buf.add(s);
|
| - }
|
| -
|
| - void writeln(String s) {
|
| - write(s);
|
| - buf.add('\n');
|
| - }
|
| -
|
| - void heading(String name, span) {
|
| - write(name);
|
| - buf.add(' (${span.locationText})');
|
| - buf.add('\n');
|
| - }
|
| -
|
| - String toValue(value) {
|
| - if (value == null) return 'null';
|
| - else if (value is Identifier) return value.name;
|
| - else return value.toString();
|
| - }
|
| -
|
| - void writeNode(String label, Node node) {
|
| - write(label + ': ');
|
| - depth += 1;
|
| - if (node != null) node.visit(printer);
|
| - else writeln('null');
|
| - depth -= 1;
|
| - }
|
| -
|
| - void writeValue(String label, value) {
|
| - var v = toValue(value);
|
| - writeln('${label}: ${v}');
|
| - }
|
| -
|
| - void writeList(String label, List list) {
|
| - write(label + ': ');
|
| - if (list == null) {
|
| - buf.add('null');
|
| - buf.add('\n');
|
| - } else {
|
| - for (var item in list) {
|
| - buf.add(item.toString());
|
| - buf.add(', ');
|
| - }
|
| - buf.add('\n');
|
| - }
|
| - }
|
| -
|
| - void writeNodeList(String label, List list) {
|
| - writeln('${label} [');
|
| - if (list != null) {
|
| - depth += 1;
|
| - for (var node in list) {
|
| - if (node != null) {
|
| - node.visit(printer);
|
| - } else {
|
| - writeln('null');
|
| - }
|
| - }
|
| - depth -= 1;
|
| - writeln(']');
|
| - }
|
| - }
|
| -}
|
|
|