fix indentation

Author: antoinerg

src/traces/sankey/convert-to-d3-sankey.js

@@ -24,7 +24,7 @@ module.exports = function(trace) {
     var i;
     for(i = 0; i < linkSpec.value.length; i++) {
         var val = linkSpec.value[i];
-    // remove negative values, but keep zeros with special treatment
+        // remove negative values, but keep zeros with special treatment
         var source = linkSpec.source[i];
         var target = linkSpec.target[i];
         if(!(val > 0 && isIndex(source, nodeCount) && isIndex(target, nodeCount))) {
@@ -62,7 +62,7 @@ module.exports = function(trace) {
         } else removedNodes = true;
     }
 
-  // need to re-index links now, since we didn't put all the nodes in
+    // need to re-index links now, since we didn't put all the nodes in
     if(removedNodes) {
         for(i = 0; i < links.length; i++) {
             links[i].source = nodeIndices[links[i].source];

src/traces/sankey/d3-sankey.js

@@ -149,14 +149,14 @@ module.exports = function() {
                 y1a = d.target.y + d.ty,
                 y1b = y1a + d.dy;
             return 'M' + x0 + ',' + y0a +
-           'C' + x2 + ',' + y0a +
-           ' ' + x3 + ',' + y1a +
-           ' ' + x1 + ',' + y1a +
-           'L' + x1 + ',' + y1b +
-           'C' + x3 + ',' + y1b +
-           ' ' + x2 + ',' + y0b +
-           ' ' + x0 + ',' + y0b +
-           'Z';
+                   'C' + x2 + ',' + y0a +
+                   ' ' + x3 + ',' + y1a +
+                   ' ' + x1 + ',' + y1a +
+                   'L' + x1 + ',' + y1b +
+                   'C' + x3 + ',' + y1b +
+                   ' ' + x2 + ',' + y0b +
+                   ' ' + x0 + ',' + y0b +
+                   'Z';
         }
 
         link.curvature = function(_) {
@@ -168,8 +168,8 @@ module.exports = function() {
         return link;
     };
 
-  // Populate the sourceLinks and targetLinks for each node.
-  // Also, if the source and target are not objects, assume they are indices.
+    // Populate the sourceLinks and targetLinks for each node.
+    // Also, if the source and target are not objects, assume they are indices.
     function computeNodeLinks() {
         nodes.forEach(function(node) {
             node.sourceLinks = [];
@@ -186,7 +186,7 @@ module.exports = function() {
         });
     }
 
-  // Compute the value (size) of each node by summing the associated links.
+    // Compute the value (size) of each node by summing the associated links.
     function computeNodeValues() {
         nodes.forEach(function(node) {
             node.value = Math.max(
@@ -196,10 +196,10 @@ module.exports = function() {
         });
     }
 
-  // Iteratively assign the breadth (x-position) for each node.
-  // Nodes are assigned the maximum breadth of incoming neighbors plus one;
-  // nodes with no incoming links are assigned breadth zero, while
-  // nodes with no outgoing links are assigned the maximum breadth.
+    // Iteratively assign the breadth (x-position) for each node.
+    // Nodes are assigned the maximum breadth of incoming neighbors plus one;
+    // nodes with no incoming links are assigned breadth zero, while
+    // nodes with no outgoing links are assigned the maximum breadth.
     function computeNodeDepths() {
         var remainingNodes = nodes,
             nextNodes,
@@ -228,14 +228,6 @@ module.exports = function() {
         scaleNodeBreadths((size[0] - dx) / (x - 1));
     }
 
-  // function moveSourcesRight() {
-  //   nodes.forEach(function(node) {
-  //     if (!node.targetLinks.length) {
-  //       node.x = min(node.sourceLinks, function(d) { return d.target.x; }) - 1;
-  //     }
-  //   });
-  // }
-
     function moveSinksRight(x) {
         nodes.forEach(function(node) {
             if(!node.sourceLinks.length) {
@@ -258,7 +250,7 @@ module.exports = function() {
         .entries(nodes)
         .map(function(d) { return d.values; });
 
-    //
+        //
         initializeNodeDepth();
         resolveCollisions();
         for(var alpha = 1; iterations > 0; --iterations) {
@@ -320,7 +312,7 @@ module.exports = function() {
                     n = nodes.length,
                     i;
 
-        // Push any overlapping nodes down.
+                // Push any overlapping nodes down.
                 nodes.sort(ascendingDepth);
                 for(i = 0; i < n; ++i) {
                     node = nodes[i];
@@ -329,12 +321,12 @@ module.exports = function() {
                     y0 = node.y + node.dy + py;
                 }
 
-        // If the bottommost node goes outside the bounds, push it back up.
+                // If the bottommost node goes outside the bounds, push it back up.
                 dy = y0 - py - size[1];
                 if(dy > 0) {
                     y0 = node.y -= dy;
 
-          // Push any overlapping nodes back up.
+                    // Push any overlapping nodes back up.
                     for(i = n - 2; i >= 0; --i) {
                         node = nodes[i];
                         dy = node.y + node.dy + py - y0;