Fix quadratic performance issue in AsyncQueue<Serial>
#1840
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Adding an item to
AsyncQueue
was linear in the number of pending queue items, thus adding n items to anAsyncQueue
before any can execute is in O(n^2). This decision was made intentionally because the primary use case forAsyncQueue
was to track pending LSP requests, of which we don’t expect to have too many pending requests at any given time.While we can't fix the quadratic performance issue in general, we can resolve the quadratic issue of
AsyncQueue<Serial>
by making a new task only depend on the last item in the queue, which then transitively depends on all the previous items.AsyncQueue<Serial>
are the queues that are most likely to contain many items.Fixes #1725
rdar://137886469