Skip to content
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

Simplify breadth-first tree-traversal code in subtree1. #3261

Merged
merged 6 commits into from
Dec 4, 2024

Conversation

alkino
Copy link
Member

@alkino alkino commented Dec 2, 2024

No description provided.

@alkino alkino force-pushed the cornu/simplify_loop branch from fc754f0 to 0a52b1b Compare December 2, 2024 15:14
Copy link

codecov bot commented Dec 2, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 67.06%. Comparing base (d24a901) to head (557a827).
Report is 1 commits behind head on master.

Additional details and impacted files
@@            Coverage Diff             @@
##           master    #3261      +/-   ##
==========================================
- Coverage   67.07%   67.06%   -0.01%     
==========================================
  Files         571      571              
  Lines      111113   111110       -3     
==========================================
- Hits        74531    74519      -12     
- Misses      36582    36591       +9     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

Copy link

✔️ 0a52b1b -> Azure artifacts URL

Copy link

✔️ c797c39 -> Azure artifacts URL

@bbpbuildbot

This comment has been minimized.

@alkino alkino enabled auto-merge (squash) December 3, 2024 07:31
@alkino alkino disabled auto-merge December 3, 2024 07:31
@alkino alkino enabled auto-merge (squash) December 3, 2024 07:31
Copy link
Collaborator

@1uc 1uc left a 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.

@alkino
Copy link
Member Author

alkino commented Dec 3, 2024

So you prefer to keep the previous algorithm?

@1uc
Copy link
Collaborator

1uc commented Dec 3, 2024

My impression is that the proposed implementation is nicer, but the previous algorithm is more elegant.

Nicolas Cornu and others added 3 commits December 3, 2024 16:19
Copy link

✔️ 06f7a64 -> Azure artifacts URL

@bbpbuildbot

This comment has been minimized.

@1uc 1uc changed the title Use std::queue to simplify a complex loop Simplify breadth-first traversal code in subtree1. Dec 4, 2024
@1uc 1uc changed the title Simplify breadth-first traversal code in subtree1. Simplify breadth-first tree-traversal code in subtree1. Dec 4, 2024
Co-authored-by: Luc Grosheintz <luc.grosheintz@gmail.com>
Copy link

sonarqubecloud bot commented Dec 4, 2024

@alkino alkino disabled auto-merge December 4, 2024 09:50
@alkino alkino enabled auto-merge (squash) December 4, 2024 09:50
Copy link

✔️ 557a827 -> Azure artifacts URL

@alkino alkino merged commit d177f5b into master Dec 4, 2024
36 checks passed
@alkino alkino deleted the cornu/simplify_loop branch December 4, 2024 10:09
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants