fix(features): enforce dependsOn constraints in overrideFeatureInstallOrder#151
Conversation
✅ Deploy Preview for devsydev canceled.
|
|
Warning Rate limit exceeded
Your organization is not enrolled in usage-based pricing. Contact your admin to enable usage-based pricing to continue reviews beyond the rate limit, or try again in 58 minutes and 35 seconds. ⌛ 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. ℹ️ Review info⚙️ Run configurationConfiguration used: Organization UI Review profile: CHILL Plan: Pro Run ID: 📒 Files selected for processing (16)
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 |
|
If you're new to commit signing, there are different ways to set it up: Sign commits with
|
…lOrder Replace the two-phase sort (Kahn topo-sort then post-sort reorder) with a spec-compliant round-based priority algorithm that integrates override priorities directly into the topological sort. Validate that overrideFeatureInstallOrder does not place a feature before any of its dependsOn dependencies, returning an error if violated.
94e74e9 to
73762e6
Compare
Two ginkgo tests for overrideFeatureInstallOrder + dependsOn interaction: - reject override that violates dependsOn constraints (consumer before base) - respect valid override ordering and verify install order via marker file
Summary
overrideFeatureInstallOrdernow returns an error if it places a feature before any of itsdependsOndependencies, rather than silently accepting the violationoverrideFeatureInstallOrderpriorities directly into each round of the algorithmSortWithPriority()to the graph package, which performs topological sort with priority-based tie-breaking within each round of zero in-degree nodes