Fix linting errors

mgechev · mgechev · commit bbfebd0084a6 · 2016-02-03T10:53:55.000+02:00
diff --git a/src/data-structures/interval-tree.js b/src/data-structures/interval-tree.js
@@ -151,6 +151,11 @@
     return contains(point, this.root);
   };
 
+  function intersects(a, b) {
+    return (a[0] <= b[0] && a[1] >= b[0]) || (a[0] <= b[1] && a[1] >= b[1]) ||
+      (b[0] <= a[0] && b[1] >= a[0]) || (b[0] <= a[1] && b[1] >= a[1]);
+  }
+
   function intersectsHelper(interval, node) {
     if (!node) {
       return false;
@@ -169,11 +174,6 @@
     return result;
   }
 
-  function intersects(a, b) {
-    return (a[0] <= b[0] && a[1] >= b[0]) || (a[0] <= b[1] && a[1] >= b[1]) ||
-           (b[0] <= a[0] && b[1] >= a[0]) || (b[0] <= a[1] && b[1] >= a[1]);
-  }
-
   /**
    * Checks or interval belongs to at least one intarval from the tree.<br><br>
    * Complexity: O(log N).
diff --git a/src/graphics/bresenham-line-drawing.js b/src/graphics/bresenham-line-drawing.js
@@ -1,6 +1,15 @@
 (function (exports) {
   'use strict';
 
+  /**
+   * Draws (prints) the given coordinates
+   * @param  {number} x The first coordinate of the point
+   * @param  {number} y The second coordinate of the point
+   */
+  function drawPoint(x, y) {
+    console.log(x, y);
+  }
+
   /**
    * Bresenham's line drawing algorithm.
    * It has complexity O(n)
@@ -33,15 +42,6 @@
     }
   }
 
-  /**
-   * Draws (prints) the given coordinates
-   * @param  {number} x The first coordinate of the point
-   * @param  {number} y The second coordinate of the point
-   */
-  function drawPoint(x, y) {
-    console.log(x, y);
-  }
-
   exports.drawLine = drawLine;
 
 }(typeof exports === 'undefined' ? window : exports));
diff --git a/src/graphs/spanning-trees/prim.js b/src/graphs/spanning-trees/prim.js
@@ -71,15 +71,6 @@
   exports.Graph.prototype.prim = (function () {
     var queue;
 
-    /**
-     * Initialize the algorithm.
-     *
-     * @private
-     */
-    function init() {
-      queue = new Heap(compareEdges);
-    }
-
     /**
      * Used for comparitions in the heap
      *
@@ -94,6 +85,15 @@
       return b.distance - a.distance;
     }
 
+    /**
+     * Initialize the algorithm.
+     *
+     * @private
+     */
+    function init() {
+      queue = new Heap(compareEdges);
+    }
+
     return function () {
       init.call(this);
       var inTheTree = {};
diff --git a/src/searching/binarysearch.js b/src/searching/binarysearch.js
@@ -1,6 +1,9 @@
 (function (exports) {
   'use strict';
 
+  function id (val) { return val; }
+  function get (key) { return function (val) { return val[key]; }; }
+
   /**
    * Searchs for specific element in a given array using
    * the binary search algorithm.<br><br>
@@ -37,8 +40,6 @@
     }
     return -middle - 1;
   }
-  function id (val) { return val; }
-  function get (key) { return function (val) { return val[key]; }; }
 
   exports.binarySearch = binarySearch;
 
diff --git a/src/sorting/quicksort.js b/src/sorting/quicksort.js
@@ -13,6 +13,22 @@
       return a - b;
     }
 
+    /**
+     * Swap the places of two elements
+     *
+     * @private
+     * @param {array} array The array which contains the elements
+     * @param {number} i The index of the first element
+     * @param {number} j The index of the second element
+     * @returns {array} array The array with swaped elements
+     */
+    function swap(array, i, j) {
+      var temp = array[i];
+      array[i] = array[j];
+      array[j] = temp;
+      return array;
+    }
+
     /**
      * Partitions given subarray using Lomuto's partitioning algorithm.
      *
@@ -35,22 +51,6 @@
       return minEnd;
     }
 
-    /**
-     * Swap the places of two elements
-     *
-     * @private
-     * @param {array} array The array which contains the elements
-     * @param {number} i The index of the first element
-     * @param {number} j The index of the second element
-     * @returns {array} array The array with swaped elements
-     */
-    function swap(array, i, j) {
-      var temp = array[i];
-      array[i] = array[j];
-      array[j] = temp;
-      return array;
-    }
-
     /**
      * Sorts given array.
      *
