[html5lib] triple slash comment style

pkg/third_party/html5lib/lib/src/treebuilder.dart

-/** Internals to the tree builders. */
+/// Internals to the tree builders.
 library treebuilder;
 
 import 'dart:collection';
 import 'package:html5lib/dom.dart';
 import 'package:source_maps/span.dart' show FileSpan;
 import 'constants.dart';
 import 'list_proxy.dart';
 import 'token.dart';
 import 'utils.dart';
 
@@ skipping 47 matching lines @@
   }
   return true;
 }
 
 
 bool _nodesEqual(Node node1, Node node2) {
   return node1.nameTuple == node2.nameTuple &&
       _mapEquals(node1.attributes, node2.attributes);
 }
 
-/** Basic treebuilder implementation. */
+/// Basic treebuilder implementation.
 class TreeBuilder {
   final String defaultNamespace;
 
   Document document;
 
   final openElements = <Node>[];
 
   final activeFormattingElements = new ActiveFormattingElements();
 
   Node headPointer;
 
   Node formPointer;
 
-  /**
-   * Switch the function used to insert an element from the
-   * normal one to the misnested table one and back again
-   */
+  /// Switch the function used to insert an element from the
+  /// normal one to the misnested table one and back again
   bool insertFromTable;
 
   TreeBuilder(bool namespaceHTMLElements)
       : defaultNamespace = namespaceHTMLElements ? Namespaces.html : null {
     reset();
   }
 
   void reset() {
     openElements.clear();
     activeFormattingElements.clear();
@@ skipping 108 matching lines @@
     }
   }
 
   void clearActiveFormattingElements() {
     var entry = activeFormattingElements.removeLast();
     while (activeFormattingElements.length > 0 && entry != Marker) {
       entry = activeFormattingElements.removeLast();
     }
   }
 
-  /**
-   * Check if an element exists between the end of the active
-   * formatting elements and the last marker. If it does, return it, else
-   * return null.
-   */
+  /// Check if an element exists between the end of the active
+  /// formatting elements and the last marker. If it does, return it, else
+  /// return null.
   Node elementInActiveFormattingElements(String name) {
     for (Node item in activeFormattingElements.reversed) {
       // Check for Marker first because if it's a Marker it doesn't have a
       // name attribute.
       if (item == Marker) {
         break;
       } else if (item.tagName == name) {
         return item;
       }
     }
@@ skipping 12 matching lines @@
     document.nodes.add(doctype);
   }
 
   void insertComment(StringToken token, [Node parent]) {
     if (parent == null) {
       parent = openElements.last;
     }
     parent.nodes.add(new Comment(token.data)..sourceSpan = token.span);
   }
 
-  /** Create an element but don't insert it anywhere */
+  /// Create an element but don't insert it anywhere
   Element createElement(StartTagToken token) {
     var name = token.name;
     var namespace = token.namespace;
     if (namespace == null) namespace = defaultNamespace;
     var element = new Element(name, namespace)
         ..attributes = token.data
         ..sourceSpan = token.span;
     return element;
   }
 
   Element insertElement(StartTagToken token) {
     if (insertFromTable) return insertElementTable(token);
     return insertElementNormal(token);
   }
 
   Element insertElementNormal(StartTagToken token) {
     var name = token.name;
     var namespace = token.namespace;
     if (namespace == null) namespace = defaultNamespace;
     var element = new Element(name, namespace)
         ..attributes = token.data
         ..sourceSpan = token.span;
     openElements.last.nodes.add(element);
     openElements.add(element);
     return element;
   }
 
   Element insertElementTable(token) {
-    /** Create an element and insert it into the tree */
+    /// Create an element and insert it into the tree
     var element = createElement(token);
     if (!tableInsertModeElements.contains(openElements.last.tagName)) {
       return insertElementNormal(token);
     } else {
       // We should be in the InTable mode. This means we want to do
       // special magic element rearranging
       var nodePos = getTableMisnestedNodePosition();
       if (nodePos[1] == null) {
         // TODO(jmesserly): I don't think this is reachable. If insertFromTable
         // is true, there will be a <table> element open, and it always has a
         // parent pointer.
         nodePos[0].nodes.add(element);
       } else {
         nodePos[0].insertBefore(element, nodePos[1]);
       }
       openElements.add(element);
     }
     return element;
   }
 
-  /** Insert text data. */
+  /// Insert text data.
   void insertText(String data, FileSpan span) {
     var parent = openElements.last;
 
     if (!insertFromTable || insertFromTable &&
         !tableInsertModeElements.contains(openElements.last.tagName)) {
       _insertText(parent, data, span);
     } else {
       // We should be in the InTable mode. This means we want to do
       // special magic element rearranging
       var nodePos = getTableMisnestedNodePosition();
       _insertText(nodePos[0], data, span, nodePos[1]);
     }
   }
 
-  /**
-   * Insert [data] as text in the current node, positioned before the
-   * start of node [refNode] or to the end of the node's text.
-   */
+  /// Insert [data] as text in the current node, positioned before the
+  /// start of node [refNode] or to the end of the node's text.
   static void _insertText(Node parent, String data, FileSpan span,
       [Element refNode]) {
     var nodes = parent.nodes;
     if (refNode == null) {
       if (nodes.length > 0 && nodes.last is Text) {
         Text last = nodes.last;
         last.data = '${last.data}$data';
 
         if (span != null) {
           last.sourceSpan = span.file.span(last.sourceSpan.start.offset,
               span.end.offset);
         }
       } else {
         nodes.add(new Text(data)..sourceSpan = span);
       }
     } else {
       int index = nodes.indexOf(refNode);
       if (index > 0 && nodes[index - 1] is Text) {
         Text last = nodes[index - 1];
         last.data = '${last.data}$data';
       } else {
         nodes.insert(index, new Text(data)..sourceSpan = span);
       }
     }
   }
 
-  /**
-   * Get the foster parent element, and sibling to insert before
-   * (or null) when inserting a misnested table node
-   */
+  /// Get the foster parent element, and sibling to insert before
+  /// (or null) when inserting a misnested table node
   List<Node> getTableMisnestedNodePosition() {
     // The foster parent element is the one which comes before the most
     // recently opened table element
     // XXX - this is really inelegant
     Node lastTable = null;
     Node fosterParent = null;
     var insertBefore = null;
     for (Node elm in openElements.reversed) {
       if (elm.tagName == "table") {
         lastTable = elm;
@@ skipping 20 matching lines @@
     // XXX td, th and tr are not actually needed
     if (name != exclude && const ["dd", "dt", "li", "option", "optgroup", "p",
         "rp", "rt"].contains(name)) {
       openElements.removeLast();
       // XXX This is not entirely what the specification says. We should
       // investigate it more closely.
       generateImpliedEndTags(exclude);
     }
   }
 
-  /** Return the final tree. */
+  /// Return the final tree.
   Document getDocument() => document;
 
-  /** Return the final fragment. */
+  /// Return the final fragment.
   DocumentFragment getFragment() {
     //XXX assert innerHTML
     var fragment = new DocumentFragment();
     openElements[0].reparentChildren(fragment);
     return fragment;
   }
 }