-
Notifications
You must be signed in to change notification settings - Fork 119
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Use std::queue to simplify a complex loop #3261
base: master
Are you sure you want to change the base?
Conversation
fc754f0
to
0a52b1b
Compare
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## master #3261 +/- ##
==========================================
- Coverage 67.07% 67.07% -0.01%
==========================================
Files 571 571
Lines 111113 111110 -3
==========================================
- Hits 74531 74528 -3
Misses 36582 36582 ☔ View full report in Codecov by Sentry. |
✔️ 0a52b1b -> Azure artifacts URL |
✔️ c797c39 -> Azure artifacts URL |
This comment has been minimized.
This comment has been minimized.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The idea of using (essentially) two pointers into the list to keep track of which sections haven't had their children inserted yet is nicer than using this additional queue.
So you prefer to keep the previous algorithm? |
My impression is that the proposed implementation is nicer, but the previous algorithm is more elegant. |
Co-authored-by: Luc Grosheintz <[email protected]>
Quality Gate passedIssues Measures |
✔️ 06f7a64 -> Azure artifacts URL |
No description provided.