Add comprehensive HashSet vs BitString intersection performance comparison #174
Conversation
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
Adding CLAUDE.md with task information for AI processing. This file will be removed when the task is complete. Issue: #52
…rison This commit addresses issue #52 by implementing a detailed benchmark suite that compares intersection performance between HashSet and BitString collections. **Key additions:** - New IntersectionPerformanceComparison.cs benchmark class with 11 different intersection methods - Comprehensive test matrix: 4 sizes × 3 fill rates × 3 intersection rates = 36 scenarios - Multiple BitString intersection variants: And, VectorAnd, ParallelAnd, ParallelVectorAnd - HashSet intersection methods: IntersectWith, Intersect.Count(), Overlaps - Updated Program.cs to support both benchmark types via command line arguments - Detailed documentation explaining usage and expected performance characteristics **Benchmark coverage:** - Collection sizes: 1K, 10K, 100K, 1M elements - Fill rates: 0.1 (sparse), 0.5 (medium), 0.9 (dense) - Intersection rates: 0.1, 0.3, 0.7 (low to high overlap) - Memory and CPU performance analysis across different data patterns **Usage:** - `dotnet run intersection` - Run intersection performance comparison - `dotnet run bitstring` - Run original BitString benchmarks - `dotnet run` - Show help 🤖 Generated with [Claude Code](https://claude.ai/code) Co-Authored-By: Claude <[email protected]>
konard
changed the title
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.
🤖 AI-Powered Solution
This pull request solves issue #52 by implementing a comprehensive benchmark suite to compare HashSet and BitString intersection performance.
📋 Issue Reference
Fixes #52
✅ Implementation Summary
New benchmark class:
IntersectionPerformanceComparison.cs[MemoryDiagnoser]attributeMultiple BitString intersection variants tested:
BitStringIntersection()- Basic And() operationBitStringVectorIntersection()- SIMD-optimized VectorAnd()BitStringParallelIntersection()- Multi-threaded ParallelAnd()BitStringParallelVectorIntersection()- Combined parallel + SIMDBitStringGetCommonIndices()- Direct common indices retrievalBitStringCountCommonBits()- Efficient bit countingBitStringHaveCommonBits()- Fast existence checkHashSet intersection methods:
HashSetIntersection()- Standard IntersectWith() [baseline]HashSetIntersectionCount()- LINQ-based countingHashSetHaveCommon()- Overlaps() method📊 Test Parameters
🚀 Usage
📈 Expected Performance Insights
📚 Documentation
Comprehensive documentation added in
examples/intersection-performance-comparison.mdcovering:🤖 Generated with Claude Code