Add disallowTrailingSpaces rule

mgechev · mgechev · commit 401936a8b6f1 · 2015-01-11T19:13:48.000+02:00
diff --git a/.jscsrc b/.jscsrc
@@ -23,6 +23,7 @@
   "disallowMultipleLineBreaks": true,
   "disallowKeywordsOnNewLine": ["else"],
   "requireLineFeedAtFileEnd": true,
+  "disallowTrailingWhitespace": true,
   "excludeFiles": ["node_modules/**", "bower_components/**"],
   "validateIndentation": 2
 }
diff --git a/src/compression/runlength/runlength.js b/src/compression/runlength/runlength.js
@@ -1,6 +1,6 @@
 /**
  * Run-length encoding.
- * The idea of this algorithm is to remove the usless zeros and 
+ * The idea of this algorithm is to remove the usless zeros and
  * give us representation of string in binary which in which the
  * zeros will be stripped and replaced with their count.
  */
diff --git a/src/data-structures/binary-search-tree.js b/src/data-structures/binary-search-tree.js
@@ -190,7 +190,7 @@
   /**
    * Finds a node by it's value in a given sub-tree.
    * Average time complexity: O(log N).
-   * 
+   *
    * @private
    * @param {Number|String} Value of the node which should be found.
    * @param {Node} Current node to be checked.
@@ -221,7 +221,7 @@
    * @param {Node} oldChild Child to be replaced.
    * @param {Node} newChild Child replacement.
    */
-  exports.BinaryTree.prototype._replaceChild = 
+  exports.BinaryTree.prototype._replaceChild =
    function (parent, oldChild, newChild) {
     if (!parent) {
       this._root = newChild;
diff --git a/src/data-structures/heap.js b/src/data-structures/heap.js
@@ -97,7 +97,7 @@
   /**
    * Changes the key.<br><br>
    * Complexity: O(log N).
-   * 
+   *
    * @public
    * @param {Number} index Index of the value which should be changed.
    * @param {Number|Object} value New value according to the index.
diff --git a/src/data-structures/interval-tree.js b/src/data-structures/interval-tree.js
@@ -24,7 +24,7 @@
 
   /**
    * Node which describes an interval.
-   * 
+   *
    * @public
    * @constructor
    * @param {Number} start Start of the interval.
@@ -39,7 +39,7 @@
      */
     this.interval = [start, end];
     /**
-     * Max endpoint in subtree which starts from this node. 
+     * Max endpoint in subtree which starts from this node.
      * @member {Number}
      */
     this.max = -Infinity;
@@ -106,7 +106,7 @@
 
   /**
    * Add new interval to the tree.
-   * 
+   *
    * @public
    * @param {Array} intreval Array with start and end points of the interval.
    */
@@ -141,7 +141,7 @@
   /**
    * Checks or point belongs to at least one intarval from the tree.<br><br>
    * Complexity: O(log N).
-   * 
+   *
    * @public
    * @method
    * @param {Number} point Point which should be checked.
@@ -196,7 +196,7 @@
 
   /**
    * Returns height of the tree.
-   * 
+   *
    * @public
    * @method
    * @return {Number} Height of the tree.
diff --git a/src/data-structures/red-black-tree.js b/src/data-structures/red-black-tree.js
@@ -1,7 +1,7 @@
 /**
  * Red-Black tree is a data structure which is
  * a type of self-balancing binary search tree.
- * 
+ *
  * @example
  *
  * var RBTree = require('../src/data-structures/red-black-tree').RBTree;
@@ -25,7 +25,7 @@
  * });
  *
  * console.log(rbTree.get(1989)); // { name: 'Garry', surname: 'Fisher' }
- * 
+ *
  * @module data-structures/red-black-tree
  */
 (function (exports) {
@@ -43,7 +43,7 @@
 
   /**
    * Node of the Red-Black tree.
-   * 
+   *
    * @private
    * @constructor
    * @param {Number} key Key of the node.
@@ -105,7 +105,7 @@
 
   /**
    * Red-Black Tree.
-   * 
+   *
    * @public
    * @constructor
    */
@@ -116,7 +116,7 @@
   /**
    * Add value associated with a given key.<br><br>
    * Complexity: O(log N).
-   * 
+   *
    * @public
    * @method
    * @param {Number} key Key.
@@ -130,7 +130,7 @@
   /**
    * Returns true or false depending on whether
    * given node is red.
-   * 
+   *
    * @private
    * @method
    * @param {Node} node Node which sould be checked.
@@ -146,7 +146,7 @@
   /**
    * Helper function for insertion of given key,
    * value pair into the Red-Black tree.
-   * 
+   *
    * @private
    * @method
    * @param {Number} key Key.
diff --git a/src/graphs/shortest-path/dijkstra.js b/src/graphs/shortest-path/dijkstra.js
@@ -63,21 +63,21 @@
     }
 
     /**
-     * Dijkstra's shortest path algorithm. Finds the minimum 
+     * Dijkstra's shortest path algorithm. Finds the minimum
      * distance between two given nodes using a distance matrix.<br><br>
      * For the implementation is not used the most suitable data structure
      * (Fibonacci heap) but the Binary heap gives also good results.<br><br>
      *
      * Time complexity: O(|E|+|V|log(|V|)) where V and E are the number of
      * vertices and edges respectively.
-     * 
+     *
      * @public
      * @module graphs/shortest-path/dijkstra
      * @param {Number} src Source node.
      * @param {Number} dest Destination node.
      * @param {Array} graph A distance matrix of the graph.
      * @returns {Number} The shortest distance between two nodes.
-     * 
+     *
      * @example
      * var dijkstra =
      * require('path-to-algorithms/src/graphs/shortest-path/dijkstra').dijkstra;
diff --git a/test/graphs/searching/bfs.spec.js b/test/graphs/searching/bfs.spec.js
@@ -41,7 +41,7 @@ describe('BFS', function () {
    *
    *  0 ---> 1
    *   \     |
-   *    \    v 
+   *    \    v
    *      -> 2
    */
   it('should not update the parent node once set', function () {

Original file line number	Diff line number	Diff line change
`@@ -23,6 +23,7 @@`
`23`	`23`	`"disallowMultipleLineBreaks": true,`
`24`	`24`	`"disallowKeywordsOnNewLine": ["else"],`
`25`	`25`	`"requireLineFeedAtFileEnd": true,`
	`26`	`+ "disallowTrailingWhitespace": true,`
`26`	`27`	`"excludeFiles": ["node_modules/", "bower_components/"],`
`27`	`28`	`"validateIndentation": 2`
`28`	`29`	`}`
Original file line number	Diff line number	Diff line change
`@@ -41,7 +41,7 @@ describe('BFS', function () {`
`41`	`41`	`*`
`42`	`42`	`* 0 ---> 1`
`43`	`43`	`* \ \|`
`44`		`- * \ v`
	`44`	`+ * \ v`
`45`	`45`	`* -> 2`
`46`	`46`	`*/`
`47`	`47`	`it('should not update the parent node once set', function () {`