Call describe with name in order to allow runner to group examples into folders based on local folder structure.

Add a metadata in the travis' testspace publish command.

Author: Krum Motsov

.travis.yml

@@ -12,4 +12,4 @@ script:
   - export PATH="${HOME}/testspace:${PATH}"
   # Testspace credentials: "[email protected]/myproject/myspace"
   - testspace config url ${TESTSPACE_USER_TOKEN}:@${TESTSPACE_URL}
-  - testspace publish [Tests]test/reports/junitresults.xml test/reports/coverage/clover.xml
+  - testspace publish [Tests]test/reports/junitresults.xml{test} test/reports/coverage/clover.xml

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();
   });

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);
+});

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);
+});

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);
+});

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);
+});

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);
+});

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);
+});

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);
+});

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);
+});