Added jest

Removed generator-exercises folder as it breaks jest-codemods

run jest-codemods on .spec.js files, move generator-exercises back in

Change references from Jasmine to Jest in main readme

Update README with Jest specific language. Update some spec files with new syntax

update tests, multiple exercises

.gitignore: Added package-lock.json, package.json that were used when I ran code-blocks over the tests.

Standardised function declaration calls across exercises

fix typo in caesar.spec.js

Ignoring package-lock.json, package.json

Backtrack on .gitignore modification, add instructions to readme

move files from testing repo to this repo

Typo fixes, remove duplicate exercise folder

Remove solution from non-solution branch

Minor grammatical fixes

added trailing semicolon to all function and module exports

Fix words caught by search/replace action.

remove doubled semicolon.

Correct words caught by search/replace action.

Add missing semicolon.

Add .DS_Store to .gitignore

multiple files: Added a blank line at the end of each file

Ignore generator-exercise when linting exercise files

Update exercise number of each exercise

Update exercise number

Author: Michael Frank

.eslintignore

@@ -0,0 +1 @@
+generator-exercise/

.eslintrc.json

@@ -0,0 +1,12 @@
+{
+    "plugins": [
+        "import"
+    ],
+    "parserOptions": {
+        "ecmaVersion": 12,
+        "sourceType": "module"
+    },
+    "rules": {
+        "eol-last": ["error", "always"]
+    }
+}

.gitignore

@@ -1 +1,3 @@
-.vscode
+.vscode
+node_modules/
+.DS_Store

README.md

@@ -9,10 +9,12 @@ There will eventually be a suggested order of completion, but at this time since
 ## How To Use These Exercises
 Before you start you should have a few things installed on your machine:
 1. NPM. To check if you have NPM installed, type `npm --version` in your terminal. If you get back `Command 'npm' not found, but can be installed with:`, do NOT follow the instructions in the terminal to install with `apt-get`. (This causes permission issues.) Instead, install Node with NVM by following the instructions [here](https://github.com/TheOdinProject/curriculum/blob/master/foundations/installations/installing_node.md).
-2. Jasmine. Jasmine is a testing framework for JavaScript. Type `jasmine -v` to check for it. If you need to install it, type `npm install -g jasmine` to do so.
-3. A copy of this repository. Copies of repositories on your machine are called clones. If you need help cloning, you can learn how [here](https://docs.github.com/en/github/creating-cloning-and-archiving-repositories/cloning-a-repository)
+2. Jest. Jest is a testing framework for JavaScript. To install it, type `npm install --save-dev jest`. We use `--save-dev` here to specify this module is for development purposes only.
+3. A copy of this repository. Copies of repositories on your machine are called clones. If you need help cloning, you can learn how [here](https://docs.github.com/en/github/creating-cloning-and-archiving-repositories/cloning-a-repository).
 
-Each exercise includes 3 files: a markdown file with a description of the task, an empty (or mostly empty) JavaScript file, and a set of tests. To complete an exercise, you'll need to go to the exercise directory with `cd exerciseName` in the terminal and run `jasmine exerciseName.spec.js`. This should run the test file and show you the output. When you first run a test, it will fail. This is by design! You must open the exercise file and write the code needed to get the test to pass. Some of the exercises have test conditions defined in their spec file that are defined as 'xit' compared to 'it'. This is purposeful. After you pass your first 'it', you will change the next 'xit' to an 'it' and test your code again. You'll do this until all conditions are satisfied.
+Each exercise includes 3 files: a markdown file with a description of the task, an empty (or mostly empty) JavaScript file, and a set of tests. To complete an exercise, you'll need to go to the exercise directory with `cd exerciseName` in the terminal and run `npm test exerciseName.spec.js`. This should run the test file and show you the output. When you first run a test, it will fail. This is by design! You must open the exercise file and write the code needed to get the test to pass. Some of the exercises have test conditions defined in their spec file that are defined as 'test.skip' compared to 'test'. This is purposeful. After you pass your first 'test', you will change the next 'test.skip' to an 'test' and test your code again. You'll do this until all conditions are satisfied.
+
+**Note**: Due to the way Jest handles failed tests, it may return an exit code of 1 if any tests fail. NPM will interpret this as an error and you may see some `npm ERR!` messages after Jest runs. You can ignore these, or run your test with `npm test exerciseName.spec.js --silent` to supress the errors.
 
 The first exercise, `helloWorld`, will walk you through the process in-depth.
 

caesar/README.md

@@ -1,6 +1,6 @@
-# Exercise XX - caesar cipher
+# Exercise 13 - Caesar cipher
 
-Implement the legendary caesar cipher:
+Implement the legendary Caesar cipher:
 
 > In cryptography, a Caesar cipher, also known as Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on. The method is named after Julius Caesar, who used it in his private correspondence.
 
@@ -31,5 +31,3 @@ negative numbers should work as well:
 ```javascript
 caesar('Mjqqt, Btwqi!', -5) // returns 'Hello, World!'
 ```
-
-

caesar/caesar.js

@@ -1,5 +1,5 @@
 const caesar = function() {
 
-}
+};
 
-module.exports = caesar
+module.exports = caesar;

caesar/caesar.spec.js

@@ -1,25 +1,23 @@
 const caesar = require('./caesar')
 
-describe('caesar', function() {
-  it('works with single letters', function() {
-    expect(caesar('A', 1)).toEqual('B');
-  });
-  xit('works with words', function() {
-    expect(caesar('Aaa', 1)).toEqual('Bbb');
-  });
-  xit('works with phrases', function() {
-    expect(caesar('Hello, World!', 5)).toEqual('Mjqqt, Btwqi!');
-  });
-  xit('works with negative shift', function() {
-    expect(caesar('Mjqqt, Btwqi!', -5)).toEqual('Hello, World!');
-  });
-  xit('wraps', function() {
-    expect(caesar('Z', 1)).toEqual('A');
-  });
-  xit('works with large shift factors', function() {
-    expect(caesar('Hello, World!', 75)).toEqual('Ebiil, Tloia!');
-  });
-  xit('works with large negative shift factors', function() {
-    expect(caesar('Hello, World!', -29)).toEqual('Ebiil, Tloia!');
-  });
+test('works with single letters', () => {
+  expect(caesar('A', 1)).toBe('B');
+});
+test.skip('works with words', () => {
+  expect(caesar('Aaa', 1)).toBe('Bbb');
+});
+test.skip('works with phrases', () => {
+  expect(caesar('Hello, World!', 5)).toBe('Mjqqt, Btwqi!');
+});
+test.skip('works with negative shift', () => {
+  expect(caesar('Mjqqt, Btwqi!', -5)).toBe('Hello, World!');
+});
+test.skip('wraps', () => {
+  expect(caesar('Z', 1)).toBe('A');
+});
+test.skip('works with large shift factors', () => {
+  expect(caesar('Hello, World!', 75)).toBe('Ebiil, Tloia!');
+});
+test.skip('works with large negative shift factors', () => {
+  expect(caesar('Hello, World!', -29)).toBe('Ebiil, Tloia!');
 });

calculator/README.md

@@ -1,6 +1,8 @@
+# Exercise 08 - Calculator
+
 The goal for this exercise is to create a calculator that does the following:
 
 add, subtract, get the sum, multiply, get the power, and find the factorial
 
-In order to do this please fill out each function with your solution. Make sure to return the value so you can test it in Jasmine! To see the expected value
-take a look at the spec file that houses the Jasmine test cases.
+In order to do this please fill out each function with your solution. Make sure to return the value so you can test it in Jest! To see the expected value
+take a look at the spec file that houses the Jest test cases.

calculator/calculator.js

@@ -1,32 +1,32 @@
-function add () {
+const add = function() {
 
-}
+};
 
-function subtract () {
+const subtract = function() {
 
-}
+};
 
-function sum () {
+const sum = function() {
 
-}
+};
 
-function multiply () {
-	
-}
+const multiply = function() {
+
+};;
 
-function power() {
+const power = function() {
 
-}
+};
 
-function factorial() {
+const factorial = function() {
 
-}
+};
 
 module.exports = {
-	add,
-	subtract,
-	sum,
-	multiply,
-    power,
-	factorial
-}
+  add,
+  subtract,
+  sum,
+  multiply,
+  power,
+  factorial
+};

calculator/calculator.spec.js

@@ -1,77 +1,77 @@
-const calculator = require ('./calculator.js');
+const calculator = require('./calculator');
 
-describe('add', function() {
-	it('adds 0 and 0', function() {
-		expect(calculator.add(0,0)).toEqual(0);
+describe('add', () => {
+	test('adds 0 and 0', () => {
+		expect(calculator.add(0,0)).toBe(0);
 	});
 
-	xit('adds 2 and 2', function() {
-		expect(calculator.add(2,2)).toEqual(4);
+	test.skip('adds 2 and 2', () => {
+		expect(calculator.add(2,2)).toBe(4);
 	});
 
-	xit('adds positive numbers', function() {
-		expect(calculator.add(2,6)).toEqual(8);
+	test.skip('adds positive numbers', () => {
+		expect(calculator.add(2,6)).toBe(8);
 	});
 });
 
-describe('subtract', function() {
-	xit('subtracts numbers', function() {
-		expect(calculator.subtract(10,4)).toEqual(6);
+describe('subtract', () => {
+	test.skip('subtracts numbers', () => {
+		expect(calculator.subtract(10,4)).toBe(6);
 	});
 });
 
-describe('sum', function() {
-	xit('computes the sum of an empty array', function() {
-		expect(calculator.sum([])).toEqual(0);
+describe('sum', () => {
+	test.skip('computes the sum of an empty array', () => {
+		expect(calculator.sum([])).toBe(0);
 	});
 
-	xit('computes the sum of an array of one number', function() {
-		expect(calculator.sum([7])).toEqual(7);
+	test.skip('computes the sum of an array of one number', () => {
+		expect(calculator.sum([7])).toBe(7);
 	});
 
-	xit('computes the sum of an array of two numbers', function() {
-		expect(calculator.sum([7,11])).toEqual(18);
+	test.skip('computes the sum of an array of two numbers', () => {
+		expect(calculator.sum([7,11])).toBe(18);
 	});
 
-	xit('computes the sum of an array of many numbers', function() {
-		expect(calculator.sum([1,3,5,7,9])).toEqual(25);
+	test.skip('computes the sum of an array of many numbers', () => {
+		expect(calculator.sum([1,3,5,7,9])).toBe(25);
 	});
 });
 
-describe('multiply', function() {
-	xit('multiplies two numbers', function() {
-		expect(calculator.multiply([2,4])).toEqual(8);
+describe('multiply', () => {
+	test.skip('multiplies two numbers', () => {
+		expect(calculator.multiply([2,4])).toBe(8);
 	});
 
-	xit('multiplies several numbers', function() {
-		expect(calculator.multiply([2,4,6,8,10,12,14])).toEqual(645120);
+	test.skip('multiplies several numbers', () => {
+		expect(calculator.multiply([2,4,6,8,10,12,14])).toBe(645120);
 	});
 });
 
-describe('power', function() {
-	xit('raises one number to the power of another number', function() {
-		expect(calculator.power(4,3)).toEqual(64); // 4 to third power is 64
+describe('power', () => {
+	test.skip('raises one number to the power of another number', () => {
+		expect(calculator.power(4,3)).toBe(64); // 4 to third power is 64
 	});
 });
 
-describe('factorial', function() {
-	xit('computes the factorial of 0', function() {
-		expect(calculator.factorial(0)).toEqual(1); // 0! = 1
+describe('factorial', () => {
+	test.skip('computes the factorial of 0', () => {
+		expect(calculator.factorial(0)).toBe(1); // 0! = 1
 	});
 
-	xit('computes the factorial of 1', function() {
-		expect(calculator.factorial(1)).toEqual(1);
+	test.skip('computes the factorial of 1', () => {
+		expect(calculator.factorial(1)).toBe(1);
 	});
 
-	xit('computes the factorial of 2', function() {
-		expect(calculator.factorial(2)).toEqual(2);
+	test.skip('computes the factorial of 2', () => {
+		expect(calculator.factorial(2)).toBe(2);
 	});
 
-	xit('computes the factorial of 5', function() {
-		expect(calculator.factorial(5)).toEqual(120);
+	test.skip('computes the factorial of 5', () => {
+		expect(calculator.factorial(5)).toBe(120);
 	});
 
-	xit('computes the factorial of 10', function() {
-		expect(calculator.factorial(10)).toEqual(3628800);
+	test.skip('computes the factorial of 10', () => {
+		expect(calculator.factorial(10)).toBe(3628800);
 	});
 });

fibonacci/README.md

@@ -1,8 +1,8 @@
-# Exercise XX - fibonacci
+# Exercise 10 - Fibonacci
 
-Create a function that returns a specific member of the fibonacci sequence:
+Create a function that returns a specific member of the Fibonacci sequence:
 
-> a series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc.
+> A series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc.
 
 ```javascript
 fibonacci(4) // returns the 4th member of the series: 3  (1, 1, 2, 3)

fibonacci/fibonacci.js

@@ -1,5 +1,5 @@
 const fibonacci = function() {
 
-}
+};
 
-module.exports = fibonacci
+module.exports = fibonacci;

fibonacci/fibonacci.spec.js

@@ -1,31 +1,31 @@
 const fibonacci = require('./fibonacci')
 
-describe('fibonacci', function() {
-  it('works', function() {
-    expect(fibonacci(4)).toEqual(3);
+describe('fibonacci', () => {
+  test('4th fibonacci number is 3', () => {
+    expect(fibonacci(4)).toBe(3);
   });
-  xit('works', function() {
-    expect(fibonacci(6)).toEqual(8);
+  test.skip('6th fibonacci number is 8', () => {
+    expect(fibonacci(6)).toBe(8);
   });
-  xit('works', function() {
-    expect(fibonacci(10)).toEqual(55);
+  test.skip('10th fibonacci number is 55', () => {
+    expect(fibonacci(10)).toBe(55);
   });
-  xit('works', function() {
-    expect(fibonacci(15)).toEqual(610);
+  test.skip('15th fibonacci number is 610', () => {
+    expect(fibonacci(15)).toBe(610);
   });
-  xit('works', function() {
-    expect(fibonacci(25)).toEqual(75025);
+  test.skip('25th fibonacci number is 75025', () => {
+    expect(fibonacci(25)).toBe(75025);
   });
-  xit('doesn\'t accept negatives', function() {
-    expect(fibonacci(-25)).toEqual("OOPS");
+  test.skip('doesn\'t accept negatives', () => {
+    expect(fibonacci(-25)).toBe("OOPS");
   });
-  xit('DOES accept strings', function() {
-    expect(fibonacci("1")).toEqual(1);
+  test.skip('DOES accept strings', () => {
+    expect(fibonacci("1")).toBe(1);
   });
-  xit('DOES accept strings', function() {
-    expect(fibonacci("2")).toEqual(1);
+  test.skip('DOES accept strings', () => {
+    expect(fibonacci("2")).toBe(1);
   });
-  xit('DOES accept strings', function() {
-    expect(fibonacci("8")).toEqual(21);
+  test.skip('DOES accept strings', () => {
+    expect(fibonacci("8")).toBe(21);
   });
 });

findTheOldest/README.md

@@ -1,9 +1,8 @@
-# Find the Oldest
+# Exercise 12 - Find the Oldest
 
-given an array of objects representing people with a birth and death year, return the oldest person.
+Given an array of objects representing people with a birth and death year, return the oldest person.
 
 ## Hints
 - You should return the whole person object, but the tests mostly just check to make sure the name is correct.
 - this can be done with a couple of chained array methods, or by using `reduce`.
 - One of the tests checks for people with no death-date.. use JavaScript's Date function to get their age as of today.
-

findTheOldest/findTheOldest.js

@@ -1,5 +1,5 @@
-let findTheOldest = function() {
+const findTheOldest = function() {
 
-}
+};
 
-module.exports = findTheOldest
+module.exports = findTheOldest;