andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix gcd and add test for fromCamelCase

Browse Source
This commit is contained in:
Stefan Feješ
2018-01-10 16:55:01 +01:00
parent e59c66676c
commit ae4385750b
3 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
test/fromCamelCase/fromCamelCase.test.js
View File

@ -5,6 +5,7 @@ test('Testing fromCamelCase', (t) => {
//For more information on all the methods supported by tape
//Please go to https://github.com/substack/tape
t.true(typeof fromCamelCase === 'function', 'fromCamelCase is a Function');
t.equal(fromCamelCase('someDatabaseFieldName', ' '), 'some database field name', "Converts a string from camelcase");
//t.deepEqual(fromCamelCase(args..), 'Expected');
//t.equal(fromCamelCase(args..), 'Expected');
//t.false(fromCamelCase(args..), 'Expected');

2
test/gcd/gcd.js
View File

@ -1,4 +1,4 @@
module.exports = (...arr) => {
const _gcd = (x, y) => (!y ? x : gcd(y, x % y));
const _gcd = (x, y) => (!y ? x : _gcd(y, x % y));
return [...arr].reduce((a, b) => _gcd(a, b));
};

3
test/gcd/gcd.test.js
View File

@ -6,7 +6,8 @@ test('Testing gcd', (t) => {
//Please go to https://github.com/substack/tape
t.true(typeof gcd === 'function', 'gcd is a Function');
t.equal(gcd(8, 36), 4, "Calculates the greatest common divisor between two or more numbers/arrays");
t.equal(gcd(...[12, 8, 32]), 4, "Calculates the greatest common divisor between two or more numbers/arrays"); //t.deepEqual(gcd(args..), 'Expected');
t.deepEqual(gcd(...[12, 8, 32]), 4, "Calculates the greatest common divisor between two or more numbers/arrays");
//t.deepEqual(gcd(args..), 'Expected');
//t.equal(gcd(args..), 'Expected');
//t.false(gcd(args..), 'Expected');
//t.throws(gcd(args..), 'Expected');