Refactor tests to use arrow functions.

Author: Andre Stackhouse

test/check_permutation_test.js

@@ -1,19 +1,19 @@
 mocha.setup('bdd');
 
-describe('check_permutation_test', function() {
-  describe('valid_permutation', function() {
-    it('should return true for "read" and "dear"', function() {
+describe('check_permutation_test', () => {
+  describe('valid_permutation', () => {
+    it('should return true for "read" and "dear"', () => {
       chai.assert.equal(check_permutation('read', 'dear'), true);
     });
-    it('should return true for equivalent strings', function() {
+    it('should return true for equivalent strings', () => {
       chai.assert.equal(check_permutation('equivalent', 'equivalent'), true);
     });
-    it('should return true for two empty strings', function() {
+    it('should return true for two empty strings', () => {
       chai.assert.equal(check_permutation('', ''), true);
     });
   });
-  describe('invalid_permutation', function() {
-    it('should return false for "noon" and "moon"', function() {
+  describe('invalid_permutation', () => {
+    it('should return false for "noon" and "moon"', () => {
       chai.assert.equal(check_permutation('noon', 'moon'), false);
     });
   });

test/corresponding_bracket_index_test.js

@@ -1,40 +1,40 @@
-describe('corresponding_bracket_index_test', function() {
-  describe('valid_source_code', function() {
-    it('should return 6 when the caret index is 0', function() {
+describe('corresponding_bracket_index_test', () => {
+  describe('valid_source_code', () => {
+    it('should return 6 when the caret index is 0', () => {
       chai.assert.equal(corresponding_bracket_index(valid_source_code, 0), 6);
     });
 
-    it('should return 0 when the caret index is 6', function() {
+    it('should return 0 when the caret index is 6', () => {
       chai.assert.equal(corresponding_bracket_index(valid_source_code, 6), 0);
     });
 
-    it('should return 26 when the caret index is 9', function() {
+    it('should return 26 when the caret index is 9', () => {
       chai.assert.equal(corresponding_bracket_index(valid_source_code, 9), 26);
     });
 
-    it('should return 8 when the caret index is 27', function() {
+    it('should return 8 when the caret index is 27', () => {
       chai.assert.equal(corresponding_bracket_index(valid_source_code, 27), 8);
     });
   });
 
   describe('invalid_source_code', () => {
-    it('should throw "invalid brackets in source code" on improper nesting', function() {
+    it('should throw "invalid brackets in source code" on improper nesting', () => {
       chai.assert.throws(() => { corresponding_bracket_index(improper_nesting, 2) }, Error, 'Invalid brackets in source code.');
     });
 
-    it('should throw "invalid brackets in source code" on incorrect closing bracket', function() {
+    it('should throw "invalid brackets in source code" on incorrect closing bracket', () => {
       chai.assert.throws(() => { corresponding_bracket_index(wrong_closing_bracket, 2) }, Error, 'Invalid brackets in source code.');
     });
 
-    it('should throw "Unclosed brackets in source code" on unclosed bracket', function() {
+    it('should throw "Unclosed brackets in source code" on unclosed bracket', () => {
       chai.assert.throws(() => { corresponding_bracket_index(unclosed_bracket, 2) }, Error, 'Unclosed brackets in source code.');
     });
 
-    it('should throw "Invalid caret index. Caret must point to a bracket" if no braces', function() {
+    it('should throw "Invalid caret index. Caret must point to a bracket" if no braces', () => {
       chai.assert.throws(() => { corresponding_bracket_index(no_braces, 2) }, Error, 'Invalid caret index. Caret must point to a bracket.');
     });
 
-    it('should throw "Invalid caret index. Caret must point to a bracket" on invalid caret index', function() {
+    it('should throw "Invalid caret index. Caret must point to a bracket" on invalid caret index', () => {
       chai.assert.throws(() => { corresponding_bracket_index(valid_source_code, 2) }, Error, 'Invalid caret index. Caret must point to a bracket.');
     });
   });

test/one_away_test.js

@@ -1,25 +1,25 @@
-describe('one_away_test', function() {
-  describe('insert/remove', function() {
-    it('should return true for "pale and "ple"', function() {
+describe('one_away_test', () => {
+  describe('insert/remove', () => {
+    it('should return true for "pale and "ple"', () => {
       chai.assert.equal(one_away('pale', 'ple'), true);
     });
-    it('should return false for "pale and "pl"', function() {
+    it('should return false for "pale and "pl"', () => {
       chai.assert.equal(one_away('pale', 'pl'), false);
     });
   });
-  describe('replace', function() {
-    it('should return true for "pale" and "bale"', function() {
+  describe('replace', () => {
+    it('should return true for "pale" and "bale"', () => {
       chai.assert.equal(one_away("pale", "pales"), true);
     });
-    it('should return false for "pale" and "bald"', function() {
+    it('should return false for "pale" and "bald"', () => {
       chai.assert.equal(one_away("pale", "bald"), false);
     });
   });
   describe('equivalent', function () {
-    it('should return true for "hello" and "hello"', function() {
+    it('should return true for "hello" and "hello"', () => {
       chai.assert.equal(one_away("hello", "hello"), true);
     });
-    it('should return true for two empty strings', function() {
+    it('should return true for two empty strings', () => {
       chai.assert.equal(one_away("", ""), true);
     });
   });

test/sort_stack_test.js

@@ -1,16 +1,16 @@
-describe('sort_stack_test', function() {
-  describe('mixed_order', function() {
-    it('should return [6, 5, 4, 3, 2, 1]', function() {
+describe('sort_stack_test', () => {
+  describe('mixed_order', () => {
+    it('should return [6, 5, 4, 3, 2, 1]', () => {
       chai.assert.deepEqual(sort_stack(mixed_order), [6, 5, 4, 3, 2, 1]);
     });
   });
-  describe('sorted_order', function() {
-    it('should return [10, 9, 8, 7, 6, 5]', function() {
+  describe('sorted_order', () => {
+    it('should return [10, 9, 8, 7, 6, 5]', () => {
       chai.assert.deepEqual(sort_stack(sorted_order), [10, 9, 8, 7, 6, 5]);
     });
   });
-  describe('reverse_sorted', function() {
-    it('should return [95, 94, 93, 92, 91, 90]', function() {
+  describe('reverse_sorted', () => {
+    it('should return [95, 94, 93, 92, 91, 90]', () => {
       chai.assert.deepEqual(sort_stack(reverse_sorted), [95, 94, 93, 92, 91, 90]);
     });
   });

test/string_compression_test.js

@@ -1,17 +1,17 @@
-describe('string_compression_test', function() {
-  describe('compressable_strings', function() {
-    it('should return "a3b1c5a3" for "aaabcccccaaa"', function() {
+describe('string_compression_test', () => {
+  describe('compressable_strings', () => {
+    it('should return "a3b1c5a3" for "aaabcccccaaa"', () => {
       chai.assert.deepEqual(string_compression('aaabcccccaaa'), 'a3b1c5a3');
     });
-    it('should return "r2e2d3i2t2" for "rreedddiitt"', function() {
+    it('should return "r2e2d3i2t2" for "rreedddiitt"', () => {
       chai.assert.deepEqual(string_compression('rreedddiitt'), 'r2e2d3i2t2');
     });
   });
-  describe('uncompressable_strings', function() {
-    it('should return "andre" for "andre"', function() {
+  describe('uncompressable_strings', () => {
+    it('should return "andre" for "andre"', () => {
       chai.assert.deepEqual(string_compression('andre'), 'andre');
     });
-    it('should return "" for ""', function() {
+    it('should return "" for ""', () => {
       chai.assert.deepEqual(string_compression(''), '');
     });
   });