Detect recursive subtree cycles at parse time (fixes #979)#1085
Detect recursive subtree cycles at parse time (fixes #979)#1085facontidavide merged 2 commits intomasterfrom
Conversation
Use an ancestor set passed through recursivelyCreateSubtree to detect cycles, avoiding the substring-matching false positives of a prefix path check. Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>
|
Warning Rate limit exceeded
⌛ How to resolve this issue?After the wait time has elapsed, a review can be triggered using the We recommend that you space out your commits to avoid hitting the rate limit. 🚦 How do rate limits work?CodeRabbit enforces hourly rate limits for each developer per organization. Our paid plans have higher rate limits than the trial, open-source and free plans. In all cases, we re-allow further reviews after a brief timeout. Please see our FAQ for further information. ✨ Finishing touches🧪 Generate unit tests (beta)
Thanks for using CodeRabbit! It's free for OSS, and your support helps us grow. If you like it, consider giving us a shout-out. Comment |
Avoids copying the set at each recursive call. Uses insert-on-entry and erase-on-exit (DFS backtracking) so sibling subtrees sharing the same ID are handled correctly. Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## master #1085 +/- ##
==========================================
+ Coverage 65.90% 66.11% +0.20%
==========================================
Files 225 225
Lines 12727 12791 +64
Branches 1186 1194 +8
==========================================
+ Hits 8388 8457 +69
+ Misses 4289 4283 -6
- Partials 50 51 +1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Replaces #980