punkfairie/odin-javascript-exercises
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Standardised function declaration calls across exercises

Browse source
This commit is contained in:
Michael Frank 2021-04-29 21:33:30 +12:00
parent c1b27dc68e
commit 791a579823
6 changed files with 27 additions and 31 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
calculator/calculator.js
View file

@ -1,24 +1,24 @@
function add () { const add = function() {
} }
function subtract () { const subtract = function() {
} }
function sum () { const sum = function() {
} }
function multiply () { const mulitply = function() {
} }
function power() { const power = function() {
} }
function factorial() { const factorial = function() {
} }

20
calculator/calculator.spec.js
View file

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

2
fibonacci/fibonacci.js
View file

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

2
findTheOldest/findTheOldest.js
View file

@ -1,4 +1,4 @@
let findTheOldest = function() { const findTheOldest = function() {
} }

2
palindromes/palindromes.js
View file

@ -2,4 +2,4 @@ const palindromes = function() {
} }
module.exports = palindromes module.exports = palindromes;

8
pig_latin/pigLatin.js
View file

@ -1,9 +1,5 @@
function translate() { const translate = function() {
// body... // body...
} }
module.exports = translate
module.exports = {
translate
}