Conversation
Cache.GetInto() injects TXID directly into shared cache entry, avoiding the make+copy allocation on every L1 hit. Lock is held through send to prevent concurrent mutation of shared entry.
|
Warning Rate limit exceeded
To keep reviews running without waiting, you can enable usage-based add-on for your organization. This allows additional reviews beyond the hourly cap. Account admins can enable it under billing. ⌛ 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: defaults Review profile: CHILL Plan: Pro Run ID: 📒 Files selected for processing (2)
✨ 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. Review rate limit: 0/1 reviews remaining, refill in 35 minutes and 50 seconds.Comment |
The fromL2 bool was replaced with a nil check on cachedData since the variable is already populated when L2 provides data.
1 participant
Summary
Cache.GetInto()method that injects TXID directly into shared cache entryChanges
GetInto()that injects TXID into shared entry, holds shard RLockGetInto()instead ofGet()+ mutation, keep per-key lock through sendTest plan
go build ./...passesgo test -short ./...passes