mirror of
https://github.com/lovell/sharp.git
synced 2025-12-06 03:51:40 +01:00
b36237ddcb
Uses the recommended rules apart from complexity/useArrowFunction, which would affect about 1700 lines of code with little benefit right now. This is something that can be addressed over time.
45 lines
1.1 KiB
JavaScript
45 lines
1.1 KiB
JavaScript
// Copyright 2013 Lovell Fuller and others.
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
process.env.UV_THREADPOOL_SIZE = 64;
|
|
|
|
const assert = require('node:assert');
|
|
const async = require('async');
|
|
|
|
const sharp = require('../../');
|
|
const fixtures = require('../fixtures');
|
|
|
|
const width = 720;
|
|
const height = 480;
|
|
|
|
sharp.concurrency(1);
|
|
|
|
const timer = setInterval(function () {
|
|
console.dir(sharp.counters());
|
|
}, 100);
|
|
|
|
async.mapSeries([1, 1, 2, 4, 8, 16, 32, 64], function (parallelism, next) {
|
|
const start = Date.now();
|
|
async.times(parallelism,
|
|
function (_id, callback) {
|
|
sharp(fixtures.inputJpg).resize(width, height).toBuffer(function (err, buffer) {
|
|
buffer = null;
|
|
callback(err, Date.now() - start);
|
|
});
|
|
},
|
|
function (err, ids) {
|
|
assert(!err);
|
|
assert(ids.length === parallelism);
|
|
ids.sort();
|
|
const mean = ids.reduce(function (a, b) {
|
|
return a + b;
|
|
}) / ids.length;
|
|
console.log(`${parallelism} parallel calls: fastest=${ids[0]}ms slowest=${ids[ids.length - 1]}ms mean=${mean}ms`);
|
|
next();
|
|
}
|
|
);
|
|
}, function () {
|
|
clearInterval(timer);
|
|
console.dir(sharp.counters());
|
|
});
|