mirror of
https://github.com/chanzuckerberg/cellxgene.git
synced 2026-09-23 02:48:12 +08:00
* revert all commits to before Typescript migration * update compat workflow to match latest deps (#2335) * update compat workflow to match latest deps * attempt to debug * attempt to debug * remove debugging code * typo * update deps to match desktop (#2340) * fix: don't run lint with `--fix` on push tests (#2273) * fix: don't run lint with `--fix` on push tests * npx Co-authored-by: maniarathi <mani.arathi@gmail.com> Co-authored-by: Madison Dunitz <madison.dunitz@chanzuckerberg.com> * rename X_approx_distribution to X_approximate_distribution (#2337) * Correctly handle non-finite numbers in heuristic determination of X distribution (#2342) * handle non-finites explicitly * improve and test edge case handling for distribution estimation * revert debugging changes * code readability * clean up type inferencing (#2332) * unit tests for 64 bit conversion * clean up type handling * type inference tests * more type inference fixes * use schema to determine user intent for data typing * stop using deprecated API * fbs type encoding test * add missing test * add more tests * correctly infer X type for CXG adaptor * lint * fix typo * ts migration * cleanup from PR review * lint * PR review changes * remove unused packages from client (#2359) * remove unused packages from client * add missing peer dep * fix: disable FE auth testing on compatibility tests (#2377) * update: release process (#2277) Co-authored-by: maniarathi <mani.arathi@gmail.com> * fix: remove spaces in param setup (#2380) * delete deploy workflow (#2396) * undo reformatting which now does not pass lint * fix snapshots which changed due to npm dep changes * add missing quoting to snapshot * another snapshot typo fix * TS Revert (2) - replay PR #2347 and #2354 (#2403) * replay edits from PR 2347 * TS Revert (3) - replay edits in PR #2327 (#2404) * replay edits in PR 2327 * TS Revert (4) - replay PR #2355 (#2405) * replay edits in PR 2355 * add additional babel config * reformat with new prettier config Co-authored-by: Severiano Badajoz <sbadajoz@chanzuckerberg.com> Co-authored-by: maniarathi <mani.arathi@gmail.com> Co-authored-by: Madison Dunitz <madison.dunitz@chanzuckerberg.com>
92 lines
2.3 KiB
JavaScript
92 lines
2.3 KiB
JavaScript
/*
|
|
This class provides a means to resolve Promises asynchronously,
|
|
and limit the number concurrently executed. For example, if
|
|
you want to involve a large number of API endpoints using fetch(),
|
|
but want to limit the number simultaneously outstanding.
|
|
|
|
Example usage:
|
|
|
|
const plimit = new PromiseLimit(2);
|
|
return Promise.all([
|
|
plimit.add(() => fetch('/foo')),
|
|
plimit.add(() => fetch('/bar')),
|
|
plimit.add(() => fetch('/baz'))
|
|
])
|
|
|
|
if you want a priority queue based implementation, just
|
|
use priorityAdd() instead of add():
|
|
|
|
const plimit = new PromiseLimit(2);
|
|
return Promise.all([
|
|
plimit.priorityAdd(0, () => fetch('/foo')),
|
|
plimit.priorityAdd(10, () => fetch('/bar')),
|
|
plimit.priorityAdd(-1, () => fetch('/baz'))
|
|
])
|
|
|
|
Priority is a numeric value. Lower first. Stable ordering.
|
|
*/
|
|
|
|
import TinyQueue from "tinyqueue";
|
|
|
|
function compare(a, b) {
|
|
const diff = a.priority - b.priority;
|
|
if (diff) return diff;
|
|
return a.order - b.order;
|
|
}
|
|
|
|
export default class PromiseLimit {
|
|
constructor(maxConcurrency = 5) {
|
|
this.queue = new TinyQueue([], compare);
|
|
this.maxConcurrency = maxConcurrency;
|
|
this.pending = 0;
|
|
this.insertCounter = 0;
|
|
}
|
|
|
|
priorityAdd(p, fn, ...args) {
|
|
// p - numermic priority (lower first)
|
|
// fn - must return a promise
|
|
// args - will be passed to fn
|
|
return this._push(p, fn, args);
|
|
}
|
|
|
|
add(fn, ...args) {
|
|
// fn - must return a promise
|
|
// args - will be passed to fn
|
|
return this._push(0, fn, args);
|
|
}
|
|
|
|
/**
|
|
Private below
|
|
**/
|
|
|
|
_push(priority, fn, args) {
|
|
const order = this.insertCount;
|
|
this.insertCount += 1;
|
|
return new Promise((resolve, reject) => {
|
|
this.queue.push({ priority, order, fn, args, resolve, reject });
|
|
this._resolveNext(false);
|
|
});
|
|
}
|
|
|
|
_resolveNext = (completed = true) => {
|
|
if (completed) this.pending -= 1;
|
|
|
|
while (this.queue.length > 0 && this.pending < this.maxConcurrency) {
|
|
const task = this.queue.pop(); // order of insertion
|
|
this.pending += 1;
|
|
const { resolve, reject, fn, args } = task;
|
|
|
|
try {
|
|
const result = fn(...args);
|
|
result.then(
|
|
() => this._resolveNext(true),
|
|
() => this._resolveNext(true)
|
|
);
|
|
result.then(resolve, reject);
|
|
} catch (err) {
|
|
reject(err);
|
|
}
|
|
}
|
|
};
|
|
}
|