github/overleaf
1
0
Fork 0
mirror of https://github.com/overleaf/overleaf.git synced 2025-01-31 12:42:17 +00:00
Code Issues Projects Releases Packages Wiki Activity

decaffeinate: Run post-processing cleanups on loadTest.coffee

Browse source
This commit is contained in:
decaffeinate 2020-02-25 17:03:58 +01:00 committed by mserranom
parent 3901fe9cd2
commit 252f4c704b
1 changed files with 10 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
services/clsi/test/load/coffee/loadTest.js
View file

@ -1,3 +1,8 @@
/* eslint-disable
standard/no-callback-literal,
*/
// TODO: This file was created by bulk-decaffeinate.
// Fix any style issues and re-enable lint.
/* /*
* decaffeinate suggestions: * decaffeinate suggestions:
* DS102: Remove unnecessary code created because of implicit returns * DS102: Remove unnecessary code created because of implicit returns
@ -50,7 +55,7 @@ ${bodyContent}
] ]
} }
} }
}, function(err, response, body){ }, (err, response, body) => {
if (response.statusCode !== 200) { if (response.statusCode !== 200) {
failedCount++; failedCount++;
return callback(`compile ${compileNumber} failed`); return callback(`compile ${compileNumber} failed`);
@ -72,7 +77,7 @@ const jobs = _.map(__range__(1, totalCompiles, true), i=>
); );
const startTime = new Date(); const startTime = new Date();
async.parallelLimit(jobs, concurentCompiles, function(err){ async.parallelLimit(jobs, concurentCompiles, (err) => {
if (err != null) { if (err != null) {
console.error(err); console.error(err);
} }
@ -87,9 +92,9 @@ async.parallelLimit(jobs, concurentCompiles, function(err){
function __range__(left, right, inclusive) { function __range__(left, right, inclusive) {
let range = []; const range = [];
let ascending = left < right; const ascending = left < right;
let end = !inclusive ? right : ascending ? right + 1 : right - 1; const end = !inclusive ? right : ascending ? right + 1 : right - 1;
for (let i = left; ascending ? i < end : i > end; ascending ? i++ : i--) { for (let i = left; ascending ? i < end : i > end; ascending ? i++ : i--) {
range.push(i); range.push(i);
} }