perf(sorted_set): O(n+m) co-iteration for set operations#3324
Open
perf(sorted_set): O(n+m) co-iteration for set operations#3324
Conversation
Replace O(n*log m) implementations of subset, disjoint, intersection, difference, and symmetric_difference with O(n+m) co-iteration over both sorted iterators. Before: each element of self was looked up via contains() at O(log m) each, giving O(n*log m) total. After: both iterators advance in lockstep using compare(), giving O(n+m) total with zero tree allocations on the input sets. Also resolves the TODO in symmetric_difference to avoid creating two intermediate sets. Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
Collaborator
Pull Request Test Coverage Report for Build 3103Details
💛 - Coveralls |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Summary
Replace O(n*log m) implementations of
subset,disjoint,intersection,difference, andsymmetric_differencewith O(n+m) co-iteration over both sorted iterators.Before
Each operation iterated
selfand calledcontains()onsrcfor each element — O(log m) per lookup, O(n*log m) total:symmetric_differencewas even worse — it created two intermediate sets viadifference()then calledunion()(with a TODO acknowledging this).After
Co-iterate both sorted iterators in lockstep using
compare(), advancing the smaller side — O(n+m) total, zero allocations on the input sets:Complexity comparison
subsetdisjointintersectiondifferencesymmetric_differenceCodex review
Test plan
🤖 Generated with Claude Code