p-queue

Yes, but he was giving the simplest implementation for the sake of brevity. Also, nobody said that we need callback error propagation in a priority queue to act the same exact way that callback error propagation works in a straight promise chain... but if you just want to reject all waiters in case of an error, you can do that. Take a look at sindresorhus' p-queue project - https://github.com/sindresorhus/p-queue - which is about 40 lines of code that take care of queueing exactly the way you want. And it's easy to modify if you want to reject the whole queue in case of an error, which is something that I've done myself in the past. You can see them discussing the possibility of that feature right here - https://github.com/sindresorhus/p-queue/issues/29 Long story short: Your problem is with ordering, not locking.

While writing async code can indeed be challenging, I just disagree with the idea that JavaScript is lacking good "locking primitives": > All this async code without decent locking primitives is leading to a rabbit hole of race conditions... No, it's not. Here's a lock: let lock = Promise.resolve() // ... lock = lock.then(() => { /* critical section */ }) For the rare instances where more complex async flow control is required, there are a bunch of libraries for that (e.g. async[0], p-queue[1], etc.). [0] https://caolan.github.io/async/v3/docs.html [1] https://github.com/sindresorhus/p-queue