Indentation and jsdoc fixes driven by jscs.

felipernb · Jun 9, 2014 · 713c6f6 · 713c6f6
1 parent 16b1470
commit 713c6f6
Show file tree

Hide file tree

Showing 5 changed files with 79 additions and 65 deletions.
diff --git a/algorithms/string/knuth_morris_pratt.js b/algorithms/string/knuth_morris_pratt.js
@@ -30,9 +30,9 @@
  *
  * Asymptotic Complexity: O(text.length)
  *
- * @param {Array} of Numbers, Strings or Characters
+ * @param {Array} text of Numbers, Strings or Characters
  *     or {String}
- * @param {Array} of Numbers, Strings or Characters
+ * @param {Array} pattern of Numbers, Strings or Characters
  *     or {String}
  * @return {Number}
  */
@@ -71,7 +71,7 @@ var knuthMorrisPratt = function (text, pattern) {
  *
  * Asymptotic Complexity: O(pattern.length)
  *
- * @param {Array} of Numbers, Strings or Characters
+ * @param {Array} pattern of Numbers, Strings or Characters
  *     or {String}
  * @return {Array} of Integers
  */

diff --git a/data_structures/linked_list.js b/data_structures/linked_list.js
@@ -59,8 +59,8 @@ LinkedList.prototype.isEmpty = function () {
 /**
  * Adds the element to the end of the list or to the desired index
  *
- * @param misc
- * @param Number
+ * @param { Object } n
+ * @param { Number } index
  */
 LinkedList.prototype.add = function (n, index) {
   if (index > this.length || index < 0) {
@@ -102,7 +102,7 @@ LinkedList.prototype.add = function (n, index) {
 /**
  * Return the value associated to the Node on the given index
  *
- * @param Number
+ * @param { Number } index
  * @return misc
  */
 LinkedList.prototype.get = function (index) {
@@ -112,7 +112,7 @@ LinkedList.prototype.get = function (index) {
 /**
  * O(n) get
  *
- * @param Number
+ * @param { Number } index
  * @return Node
  */
 LinkedList.prototype.getNode = function (index) {
@@ -131,7 +131,7 @@ LinkedList.prototype.getNode = function (index) {
 /**
  * Delete the element in the indexth position
  *
- * @param Number
+ * @param { Number } index
  */
 LinkedList.prototype.del = function (index) {
   if (index >= this.length || index < 0) {

diff --git a/test/algorithms/graph/euler_path.js b/test/algorithms/graph/euler_path.js
@@ -56,41 +56,45 @@ var graphFromEdges = function (directed, edges) {
 
 describe('Euler Path', function () {
   it('should compute Euler tour over the undirected graph', function () {
-    var graph = graphFromEdges(false, [[1, 2],
-                                       [1, 5],
-                                       [1, 7],
-                                       [1, 8],
-                                       [2, 3],
-                                       [2, 4],
-                                       [2, 5],
-                                       [3, 5],
-                                       [4, 6],
-                                       [4, 9],
-                                       [4, 10],
-                                       [5, 6],
-                                       [6, 9],
-                                       [6, 10],
-                                       [7, 8]]);
+    var graph = graphFromEdges(false, [
+      [1, 2],
+      [1, 5],
+      [1, 7],
+      [1, 8],
+      [2, 3],
+      [2, 4],
+      [2, 5],
+      [3, 5],
+      [4, 6],
+      [4, 9],
+      [4, 10],
+      [5, 6],
+      [6, 9],
+      [6, 10],
+      [7, 8]
+    ]);
     var trail = eulerPath(graph);
     verifyEulerPath(graph, trail);
     assert.equal(trail[0], trail.slice(-1)[0]);
   });
 
   it('should compute Euler walk over the undirected graph', function () {
-    var graph = graphFromEdges(false, [[1, 2],
-                                       [1, 5],
-                                       [1, 7],
-                                       [2, 3],
-                                       [2, 4],
-                                       [2, 5],
-                                       [3, 5],
-                                       [4, 6],
-                                       [4, 9],
-                                       [4, 10],
-                                       [5, 6],
-                                       [6, 9],
-                                       [6, 10],
-                                       [7, 8]]);
+    var graph = graphFromEdges(false, [
+      [1, 2],
+      [1, 5],
+      [1, 7],
+      [2, 3],
+      [2, 4],
+      [2, 5],
+      [3, 5],
+      [4, 6],
+      [4, 9],
+      [4, 10],
+      [5, 6],
+      [6, 9],
+      [6, 10],
+      [7, 8]
+    ]);
     var trail = eulerPath(graph);
     verifyEulerPath(graph, trail);
     var endpoints = [trail[0], trail.slice(-1)[0]];
@@ -100,29 +104,33 @@ describe('Euler Path', function () {
   });
 
   it('should compute Euler tour over the directed graph', function () {
-    var graph = graphFromEdges(true, [[0, 1],
-                                      [1, 2],
-                                      [2, 0],
-                                      [0, 3],
-                                      [3, 4],
-                                      [4, 0],
-                                      [4, 1],
-                                      [1, 5],
-                                      [5, 6],
-                                      [6, 4]]);
+    var graph = graphFromEdges(true, [
+      [0, 1],
+      [1, 2],
+      [2, 0],
+      [0, 3],
+      [3, 4],
+      [4, 0],
+      [4, 1],
+      [1, 5],
+      [5, 6],
+      [6, 4]
+    ]);
     var trail = eulerPath(graph);
     verifyEulerPath(graph, trail);
     assert.equal(trail[0], trail.slice(-1)[0]);
   });
 
   it('should compute Euler walk over the directed graph', function () {
-    var graph = graphFromEdges(true, [[5, 0],
-                                      [0, 2],
-                                      [2, 4],
-                                      [4, 0],
-                                      [1, 5],
-                                      [3, 1],
-                                      [5, 3]]);
+    var graph = graphFromEdges(true, [
+      [5, 0],
+      [0, 2],
+      [2, 4],
+      [4, 0],
+      [1, 5],
+      [3, 1],
+      [5, 3]
+    ]);
     var trail = eulerPath(graph);
     assert.deepEqual(trail, [5, 3, 1, 5, 0, 2, 4, 0]);
   });
@@ -143,19 +151,23 @@ describe('Euler Path', function () {
   it('should raise an error if there is no Euler path', function () {
     var graph = graphFromEdges(false, [[0, 1], [2, 3]]);
     assert.throws(eulerPath.bind(graph));
-    graph = graphFromEdges(false, [[0, 1],
-                                   [0, 2],
-                                   [0, 3]]);
+    graph = graphFromEdges(false, [
+      [0, 1],
+      [0, 2],
+      [0, 3]
+    ]);
     assert.throws(eulerPath.bind(graph));
     graph = graphFromEdges(true, [[0, 1], [0, 2]]);
     assert.throws(eulerPath.bind(graph));
     graph = graphFromEdges(true, [[1, 0], [2, 0]]);
     assert.throws(eulerPath.bind(graph));
-    graph = graphFromEdges(true, [[0, 1],
-                                  [1, 2],
-                                  [2, 3],
-                                  [3, 0],
-                                  [3, 1]]);
+    graph = graphFromEdges(true, [
+      [0, 1],
+      [1, 2],
+      [2, 3],
+      [3, 0],
+      [3, 1]
+    ]);
     assert.throws(eulerPath.bind(graph));
   });
 });
diff --git a/test/algorithms/graph/topological_sort.js b/test/algorithms/graph/topological_sort.js
@@ -59,7 +59,9 @@ describe('Topological Sort', function () {
       var stack = topologicalSort(graph);
       var a = [];
       while (!stack.isEmpty()) a.push(stack.pop());
-      assert.deepEqual(a, ['underwear', 'pants', 'socks', 'shoes',
-        'watch', 'shirt', 'tie', 'belt', 'jacket']);
+      assert.deepEqual(a, [
+        'underwear', 'pants', 'socks', 'shoes',
+        'watch', 'shirt', 'tie', 'belt', 'jacket'
+      ]);
     });
 });
diff --git a/util/comparator.js b/util/comparator.js
@@ -27,7 +27,7 @@
  * If the function is not passed, it will use the default
  * compare signs (<, > and ==)
  *
- * @param Function
+ * @param { Function } compareFn
  */
 function Comparator(compareFn) {
   if (compareFn) {