env. change

munderseth · munderseth · commit 3ee2bebe05ee · 2016-04-23T22:30:02.000Z
diff --git a/readme.md b/readme.md
@@ -1,7 +1,7 @@
 [![Testspace](http://www.testspace.com/public/img/testspace_logo.png)](http://www.testspace.com)
 ***
 
-## JavaScript/Jasmine sample for demonstrating Testspace based on the [javascript-algorithms repo](mgechev/javascript-algorithms)
+## JavaScript/Jasmine sample for demonstrating Testspace based on the [javascript-algorithms repo](https://github.com/mgechev/javascript-algorithms)
 
 Sample demonstrates techniques for using Testspace with Javascript code and the [Jasmine test framework](http://jasmine.github.io/) together with [Istanbul code coverage tool](https://gotwarlost.github.io/istanbul/) and [Gulp JS build system](http://gulpjs.com/).
 
diff --git a/test/others/levenshtein-distance.spec.js b/test/others/levenshtein-distance.spec.js
@@ -3,7 +3,7 @@
 var mod = require('../../src/others/levenshtein-distance.js');
 var levenshteinDistance = mod.levenshteinDistance;
 
-describe('Levenstein\'s minimum edit distance algorithm', function () {
+describe('Levenstein minimum edit distance algorithm', function () {
   it('should be defined', function () {
     expect(levenshteinDistance).toBeDefined();
   });
diff --git a/test/sorting/bubblesort.spec.js b/test/sorting/bubblesort.spec.js
@@ -1,5 +1,7 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var bubbleSort =
       require('../../src/sorting/bubblesort.js').bubbleSort;
 
-sortTestCase(bubbleSort, 'Bubble sort');
+describe('Bubble sort', function () {
+  sortTestCases(bubbleSort);
+});
diff --git a/test/sorting/heapsort.spec.js b/test/sorting/heapsort.spec.js
@@ -1,4 +1,6 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var heapSort = require('../../src/sorting/heapsort.js').heapSort;
 
-sortTestCase(heapSort, 'Heap sort');
+describe('Heap sort', function () {
+  sortTestCases(heapSort);
+});
diff --git a/test/sorting/insertionbinarysort.spec.js b/test/sorting/insertionbinarysort.spec.js
@@ -1,6 +1,8 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var insertionBinarySort =
       require('../../src/sorting/' +
       'insertion-binary-sort.js').insertionBinarySort;
 
-sortTestCase(insertionBinarySort, 'Insertion binary sort');
+describe('Insertion binary sort', function () {
+  sortTestCases(insertionBinarySort);
+});
diff --git a/test/sorting/insertionsort.spec.js b/test/sorting/insertionsort.spec.js
@@ -1,5 +1,7 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var insertionSort = require('../../src/sorting/' +
       'insertionsort.js').insertionSort;
 
-sortTestCase(insertionSort, 'Insertion sort');
+describe('Insertion sort', function () {
+  sortTestCases(insertionSort);
+});
diff --git a/test/sorting/mergesort.spec.js b/test/sorting/mergesort.spec.js
@@ -1,5 +1,7 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var mergeSort =
       require('../../src/sorting/mergesort.js').mergeSort;
 
-sortTestCase(mergeSort, 'Merge sort');
+describe('Merge sort', function () {
+  sortTestCases(mergeSort);
+});
diff --git a/test/sorting/quicksort-middle.spec.js b/test/sorting/quicksort-middle.spec.js
@@ -1,5 +1,7 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var quickSort =
       require('../../src/sorting/quicksort-middle.js').quickSort;
 
-sortTestCase(quickSort, 'Quick sort');
+describe('Quick sort middle', function () {
+  sortTestCases(quickSort);
+});
diff --git a/test/sorting/quicksort.spec.js b/test/sorting/quicksort.spec.js
@@ -1,5 +1,7 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var quickSort =
       require('../../src/sorting/quicksort.js').quickSort;
 
-sortTestCase(quickSort, 'Quick sort');
+describe('Quick sort', function () {
+  sortTestCases(quickSort);
+});
diff --git a/test/sorting/recursiveinsertionsort.spec.js b/test/sorting/recursiveinsertionsort.spec.js
@@ -1,5 +1,7 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var recursiveInsertionSort = require('../../src/sorting/' +
       'recursive-insertionsort.js').recursiveInsertionSort;
 
-sortTestCase(recursiveInsertionSort, 'Recursive insertion sort');
+describe('Recursive insertion sort', function () {
+  sortTestCases(recursiveInsertionSort);
+});
diff --git a/test/sorting/selectionsort.spec.js b/test/sorting/selectionsort.spec.js
@@ -1,6 +1,8 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var selectionSort =
       require('../../src/sorting/selectionsort.js')
       .selectionSort;
 
-sortTestCase(selectionSort, 'Selection sort');
+describe('Selection sort', function () {
+  sortTestCases(selectionSort);
+});
diff --git a/test/sorting/shellsort.spec.js b/test/sorting/shellsort.spec.js
@@ -1,5 +1,7 @@
-var sortTestCase = require('./sort.testcase.js');
+var sortTestCases = require('./sort.testcases.js');
 var shellSort = require('../../src/sorting/shellsort.js')
       .shellSort;
 
-sortTestCase(shellSort, 'Shell sort');
+describe('Shell sort', function () {
+  sortTestCases(shellSort);
+});
diff --git a/test/sorting/sort.testcase.js b/test/sorting/sort.testcase.js
diff --git a/test/sorting/sort.testcases.js b/test/sorting/sort.testcases.js
@@ -0,0 +1,61 @@
+module.exports = function (sort, options) {
+  'use strict';
+
+  options = options || {
+    integers: false,
+    reverse: true
+  };
+
+  function createRandomArray(config) {
+    config = config || {};
+    var size = config.size || 100;
+    var precision = config.precision || 2;
+    var multiplier = config.multiplier || 100;
+    var result = [];
+
+    for (var i = size; i > 0; i -= 1) {
+      result.push(parseFloat((Math.random() *
+          multiplier).toFixed(precision)));
+    }
+    return result;
+  }
+
+  it('should work with empty array', function () {
+    expect(sort([])).toEqual([]);
+  });
+
+  it('should work with sorted arrays', function () {
+    expect(sort([1, 2, 3, 4])).toEqual([1, 2, 3, 4]);
+  });
+
+  it('should work with random non-sorted arrays', function () {
+    var array;
+    if (options.integers) {
+      array = createRandomArray();
+    } else {
+      array = createRandomArray({
+        precision: 0
+      });
+    }
+    sort(array);
+    for (var i = 0; i < array.length - 1; i += 1) {
+      expect(array[i] <= array[i + 1]).toBeTruthy();
+    }
+  });
+
+  if (options.reverse) {
+    it('should sort the numbers in descending order ' +
+        'when such comparator is provided', function () {
+      function comparator(a, b) {
+        return b - a;
+      }
+
+      var array = createRandomArray();
+      sort(array, comparator);
+
+      for (var i = 0; i < array.length - 1; i += 1) {
+        expect(array[i] >= array[i + 1]).toBeTruthy();
+      }
+    });
+  }
+};
