Use ES2015-style default parameters

bower.json

@@ -1,6 +1,6 @@
 {
   "name": "timsort",
-  "version": "0.3.0",
+  "version": "0.3.1",
   "author": {
     "name": "Marco Ziccardi",
     "url": "http://mziccard.me/"

build/timsort.js

@@ -753,63 +753,59 @@
     return TimSort;
   })();
 
-  function sort(array, compare, lo, hi) {
-    if (!Array.isArray(array)) {
-      throw new TypeError('Can only sort arrays');
-    }
+  function sort(array) {
+    var compare = arguments.length <= 1 || arguments[1] === undefined ? alphabeticalCompare : arguments[1];
+    var lo = arguments.length <= 2 || arguments[2] === undefined ? 0 : arguments[2];
+    var hi = arguments.length <= 3 || arguments[3] === undefined ? array.length : arguments[3];
+    return (function () {
+      if (!Array.isArray(array)) {
+        throw new TypeError('Can only sort arrays');
+      }
 
-    if (!compare) {
-      compare = alphabeticalCompare;
-    } else if (typeof compare !== 'function') {
-      hi = lo;
-      lo = compare;
-      compare = alphabeticalCompare;
-    }
+      if (typeof compare !== 'function') {
+        hi = lo;
+        lo = compare;
+        compare = alphabeticalCompare;
+      }
 
-    if (!lo) {
-      lo = 0;
-    }
-    if (!hi) {
-      hi = array.length;
-    }
+      var remaining = hi - lo;
 
-    var remaining = hi - lo;
+      if (remaining < 2) {
+        return;
+      }
 
-    if (remaining < 2) {
-      return;
-    }
+      var runLength = 0;
 
-    var runLength = 0;
+      if (remaining < DEFAULT_MIN_MERGE) {
+        runLength = makeAscendingRun(array, lo, hi, compare);
+        binaryInsertionSort(array, lo, hi, lo + runLength, compare);
+        return;
+      }
 
-    if (remaining < DEFAULT_MIN_MERGE) {
-      runLength = makeAscendingRun(array, lo, hi, compare);
-      binaryInsertionSort(array, lo, hi, lo + runLength, compare);
-      return;
-    }
+      var ts = new TimSort(array, compare);
 
-    var ts = new TimSort(array, compare);
+      var minRun = minRunLength(remaining);
 
-    var minRun = minRunLength(remaining);
+      do {
+        runLength = makeAscendingRun(array, lo, hi, compare);
+        if (runLength < minRun) {
+          var force = remaining;
+          if (force > minRun) {
+            force = minRun;
+          }
 
-    do {
-      runLength = makeAscendingRun(array, lo, hi, compare);
-      if (runLength < minRun) {
-        var force = remaining;
-        if (force > minRun) {
-          force = minRun;
+          binaryInsertionSort(array, lo, lo + force, lo + runLength, compare);
+          runLength = force;
         }
 
-        binaryInsertionSort(array, lo, lo + force, lo + runLength, compare);
-        runLength = force;
-      }
-
-      ts.pushRun(lo, runLength);
-      ts.mergeRuns();
+        ts.pushRun(lo, runLength);
+        ts.mergeRuns();
 
-      remaining -= runLength;
-      lo += runLength;
-    } while (remaining !== 0);
+        remaining -= runLength;
+        lo += runLength;
+      } while (remaining !== 0);
 
-    ts.forceMergeRuns();
+      ts.forceMergeRuns();
+    })();
   }
 });

package.json

@@ -1,6 +1,6 @@
 {
   "name": "timsort",
-  "version": "0.3.0",
+  "version": "0.3.1",
   "author": {
     "name": "Marco Ziccardi",
     "url": "http://mziccard.me/"

src/timsort.js

@@ -907,7 +907,7 @@ class TimSort {
  * @param {number} hi - Last element in the range.
  *     comparator.
  */
-export function sort(array, compare, lo, hi) {
+export function sort(array, compare = alphabeticalCompare, lo = 0, hi = array.length) {
   if (!Array.isArray(array)) {
     throw new TypeError('Can only sort arrays');
   }
@@ -916,22 +916,12 @@ export function sort(array, compare, lo, hi) {
    * Handle the case where a comparison function is not provided. We do
    * lexicographic sorting
    */
-  if (!compare) {
-    compare = alphabeticalCompare;
-
-  } else if (typeof compare !== 'function') {
+  if (typeof compare !== 'function') {
     hi = lo;
     lo = compare;
     compare = alphabeticalCompare;
   }
 
-  if (!lo) {
-    lo = 0;
-  }
-  if (!hi) {
-    hi = array.length;
-  }
-
   let remaining = hi - lo;
 
   // The array is already sorted