Currently nevermore depends on an immutable queue implementation for passing back settled values. Here, immutability effectively creates a new queue for every insertion.
The lock mechanism also has a backlog queue containing all the resolvers of future keyholders.
It would be good to measure the promise backlogs on the lock and the queue lengths from settled values.
Perhaps nevermore could use a simple channel implementation without immutability as I think it may be affecting the very large test cases (e.g. with 100,000 events).
Currently nevermore depends on an immutable queue implementation for passing back settled values. Here, immutability effectively creates a new queue for every insertion.
The lock mechanism also has a backlog queue containing all the resolvers of future keyholders.
It would be good to measure the promise backlogs on the lock and the queue lengths from settled values.
Perhaps nevermore could use a simple channel implementation without immutability as I think it may be affecting the very large test cases (e.g. with 100,000 events).