Skip to content

Commit ebdb46a

Browse files
author
Jon Myrick
authored
Merge pull request CodewarsClone#49 from CodewarsClone/dataBaseEntry
Data base entry
2 parents f321204 + dcc8bc2 commit ebdb46a

5 files changed

Lines changed: 11 additions & 8 deletions

File tree

controllers/kataCtrl.js

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ module.exports = {
1414
res.status(500).json(err);
1515
}
1616
return res.status(200).json(kata[0]);
17-
})
17+
})
1818
},
1919

2020
getRandomKata: (req, res, next) => {
@@ -24,7 +24,7 @@ module.exports = {
2424
res.status(500).json(err);
2525
}
2626
return res.status(200).json(katas[Math.floor(Math.random() * katas.length + 1)]);
27-
})
27+
})
2828
},
2929

3030
getRandomKataList: (req, res, next) => {
@@ -34,15 +34,15 @@ module.exports = {
3434
res.status(500).json(err);
3535
}
3636
return res.status(200).json(katas);
37-
})
37+
})
3838
},
3939

4040
getKatasByKyu: (req, res, next) => {
4141
db.read.katas_by_kyu([req.params.kyu], (err, katas) => {
4242
if (err) {
4343
console.log(err);
4444
res.status(500).json(err);
45-
}
45+
}
4646
return res.status(200).json(katas);
4747
})
4848
},

controllers/testCtrl.js

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,6 @@ module.exports = {
2525
let promiseArr = [];
2626

2727

28-
2928
kata.test_script.forEach((ele, i) =>{
3029
let deffered = Q.defer();
3130

db/start/kataTest.sql

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,3 @@
11
INSERT INTO katas (kyu, name, starter_code, description, examples, test_script)
2-
VALUES (6, 'Coding 3min : Symmetric Sort', 'function sc(a) {}', 'Please do a "Symmetric Sort" with it.', '[{"test":"Test.assertSimilar(sc([1,2,3,4,5,6,7,8,9]), [1,3,5,7,9,8,6,4,2], \"good luck!\");","result":""}]', '[{"test":" const fcode=function(str){ const isChar = function(a) { if(a){ var code = a.toLowerCase().charCodeAt(0) return code >= 97 && code <= 122; } return false; } return str.replace(/ ? | /g, '').split('').filter((a,i,x) => { return a==='' ''?isChar(x[i-1])&&isChar(x[i+1])?true:false:true; }).join(''''); } function an(array){//198 var a=array.slice(); a.sort((x,y)=>x-y) for (var i=0,left=[],right=[];i<a.length;i++){ if (i%2==0) left.push(a[i]) else right.unshift(a[i]) } return left.concat(right); } function rndc(){ return String.fromCharCode(~~(26*Math.random())+97); } function rnds(){ var len= ~~(8*Math.random())+1; for (var i=0,rs=[];i<len;i++) rs[i]=rndword(); return rs.join(\" \"); } function rndarray(){ var len= ~~(35*Math.random())+6; for (var i=0,rs=[];i<len;i++){ rs[i]= ~~(99*Math.random())+1; } return rs; } function rndsx(){ var t=~~(100*Math.random())%3; if (t==0) return rndword(~~(100*Math.random())+4); if (t==1) return rnds(~~(100*Math.random())+4) if (t==2) { var nn= ~~(100*Math.random())+4, a= rnds(nn), b=rndword(nn); for (var i=0,rs=[];i<nn;i++) { var x=~~(100*Math.random())%2; rs[i]= x==1 ? a[i] : b[i]; } return rs.join(\"\"); } } console.log(\"<br><font size=4><b>-------- Basic Test --------</b></font>\") console.log(\"\") Test.assertSimilar(sc([1,2,3,4,5,6,7,8,9]), [1,3,5,7,9,8,6,4,2], \"good luck!\"); Test.assertSimilar(sc([1,1,2,2,3,3,4,4,5]), [1,2,3,4,5,4,3,2,1], \"good luck!\"); Test.assertSimilar(sc([9,8,7,6,5,4,3,2,1]), [1,3,5,7,9,8,6,4,2], \"good luck!\"); Test.assertSimilar(sc([5,4,4,3,3,2,2,1,1]), [1,2,3,4,5,4,3,2,1], \"good luck!\"); Test.assertSimilar(sc([11,2,33,4,55,6]), [2,6,33,55,11,4], \"good luck!\"); Test.assertSimilar(sc([5,12,5,8,33,13]), [5,8,13,33,12,5], \"good luck!\"); //anti-cheat and calc the code length console.log(\"<br><font size=4><b>--------Code length check --------</b></font>\") var limit=120; const fs = require(''fs''); const allcode = fs.readFileSync(''/home/codewarrior/solution.txt'', ''utf8''); var code=fcode(allcode.replace(///.* /g,\"\")); var codelen=code.length; if (codelen<=limit) Test.assertSimilar(\"code length<=\"+limit,\"code length>\"+limit, \"your code length = \"+codelen+\", please try this code in challage version. the simple version only accept the solution which length>\"+limit); else Test.assertSimilar(\"PASS\", \"PASS\", \";-)\"); //end of anti-cheat console.log(\"<br><font size=4><b>--------100 Random Test --------</b></font>\") console.log(\"\") for (var myjinxini=0;myjinxini<100;myjinxini++){ var aa=rndarray(),answer=an(aa); console.log(\"<font color=''#CD7F32''>Test: array=[\"+aa+\"]</font>\",\"\") Test.assertSimilar(sc(aa), answer, \"good luck!\"); } console.log(''<br><font size=4><b>Congratulations, You pass the test!</b></font>'','''') console.log(\"<br><font size=4><b>After you submit your solution, <font color=''yellow''>DON''T FORGET UPVOTE&RANK THIS KATA, THANK YOU!</b></font>\",\"\") ","result":""}]')
2+
VALUES (6, 'Symmetric Sort', 'function sc(a) {}', 'Give you a number array(element range:1-99, array length range: 6-40), please do a "Symmetric Sort" with it.', '[{"test":" for (var myjinxini=0;myjinxini<100;myjinxini++){ function rndarray(){ var len= ~~(35*Math.random())+6; for (var i=0,rs=[];i<len;i++){ rs[i]= ~~(99*Math.random())+1; } return rs; } function an(array){ var a=array.slice(); a.sort((x,y)=>x-y) for (var i=0,left=[],right=[];i<a.length;i++){ if (i%2==0) left.push(a[i]) else right.unshift(a[i]) } return left.concat(right); } var aa=rndarray(),answer=an(aa); Test.assertSimilar(sc(aa), answer, ''good luck!''); } ","result":""}]' , '[{"test":"Test.assertSimilar(sc([1,2,3,4,5,6,7,8,9]), [1,3,5,7,9,8,6,4,2], ''good luck!''); ","result":""},{"test":"Test.assertSimilar(sc([1,1,2,2,3,3,4,4,5]), [1,2,3,4,5,4,3,2,1], ''good luck!''); ","result":""},{"test":"Test.assertSimilar(sc([9,8,7,6,5,4,3,2,1]), [1,3,5,7,9,8,6,4,2], ''good luck!'');","result":""},{"test":"Test.assertSimilar(sc([5,4,4,3,3,2,2,1,1]), [1,2,3,4,5,4,3,2,1], ''good luck!''); ","result":""},{"test":"Test.assertSimilar(sc([11,2,33,4,55,6]), [2,6,33,55,11,4], ''good luck!''); ","result":""},{"test":"Test.assertSimilar(sc([5,12,5,8,33,13]), [5,8,13,33,12,5], ''good luck!''); ","result":""},{"test":"for (var myjinxini=0;myjinxini<100;myjinxini++){ var aa=rndarray(),answer=an(aa); Test.assertSimilar(sc(aa), answer, ''good luck!''); }","result":""}]')
3+
;

db/start/katas.sql

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
INSERT INTO katas (kyu, name, starter_code, description, examples, test_script)
22
VALUES (8, 'Generate range of integers', 'function generateRange(min, max, step){}', 'Implement a function named generateRange(min, max, step), which takes three arguments and generates a range of integers from min to max, with the step. The first integer is the minimum value, the second is the maximum of the range and the third is the step. (min < max)', '[{"test":"Test.assertSimilar(generateRange(2, 10, 2), [2,4,6,8,10]);","result":""}]','[{"test":"Test.assertSimilar(generateRange(2, 10, 2), [2,4,6,8,10]);","result":""},{"test":"Test.assertSimilar(generateRange(1, 10, 3), [1,4,7,10]);","result":""},{"test":"var generateRandom = function(min, max){ return Math.floor(Math.random() * max) + min; }; var range = function(min, max, step){ var z = []; for(var i = min; i <= max; i += step){ z.push(i); } return z; }; for(var i = 0; i < 10; i++){ var randomMax = generateRandom(30, 100), randomMin = generateRandom(1, 20), randomStep = generateRandom(1, 10); Test.assertSimilar(generateRange(randomMin, randomMax, randomStep), range(randomMin, randomMax, randomStep)); }","result":""}]'),
33

4-
(7, 'Descending Order', 'function descendingOrder(n){}', 'Descending Order', '[{"test":"Test.assertEquals(descendingOrder(15), 51)","result":""}]', '[{"test":"Test.assertEquals(descendingOrder(0), 0)","result":""},{"test":"Test.assertEquals(descendingOrder(1), 1)","result":""},{"test":"Test.assertEquals(descendingOrder(111), 111)","result":""},{"test":"Test.assertEquals(descendingOrder(15), 51)","result":""},{"test":"Test.assertEquals(descendingOrder(1021), 2110)","result":""},{"test":"Test.assertEquals(descendingOrder(123456789), 987654321)","result":""}]')
4+
(7, 'Descending Order', 'function descendingOrder(n){}', 'Descending Order', '[{"test":"Test.assertEquals(descendingOrder(15), 51)","result":""}]', '[{"test":"Test.assertEquals(descendingOrder(0), 0)","result":""},{"test":"Test.assertEquals(descendingOrder(1), 1)","result":""},{"test":"Test.assertEquals(descendingOrder(111), 111)","result":""},{"test":"Test.assertEquals(descendingOrder(15), 51)","result":""},{"test":"Test.assertEquals(descendingOrder(1021), 2110)","result":""},{"test":"Test.assertEquals(descendingOrder(123456789), 987654321)","result":""}]'),
5+
6+
(7, 'Disemvowel Trolls', 'function disemvowel(str) {}', 'Your task is to write a function that takes a string and return a new string with all vowels removed.', '[{"test":"Test.assertEquals(disemvowel(''This website is for losers LOL!''), ''Ths wbst s fr lsrs LL!'');","result":""}]', '[{"test":"Test.assertEquals(disemvowel(''This website is for losers LOL!''), ''Ths wbst s fr lsrs LL!'') Test.assertEquals(disemvowel(''No offense but,Your writing is among the worst I''ve ever read''), ''N ffns bt,Yr wrtng s mng th wrst ''v vr rd'') Test.assertEquals(disemvowel(''What are you, a communist?''), ''Wht r y, cmmnst?'')","result":""}]')
57
;
Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,8 @@ let db = massive.connect({
1313
if (err) {
1414
console.log(err)
1515
} else {
16-
console.log('Kata can be inserted!!')
16+
console.log('Kata can be inserted!!');
17+
process.exit();
1718
}
1819
});
1920

0 commit comments

Comments
 (0)