| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
applyMutations did a findIndex scan over the existing mutations array for every incoming mutation, making bulk operations quadratic: a single insert() of 50k rows spent most of its time in this scan. Merge through a globalKey-keyed Map instead, preserving insertion order and rebuilding the array in place to keep its identity for external holders. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
|
Important Review skippedDraft detected. Please check the settings in the CodeRabbit UI or the .coderabbit.yaml file in this repository. To trigger a single review, invoke the @coderabbitai review command. ⚙️ Run configurationConfiguration used: defaults Review profile: CHILL Plan: Pro Run ID: 548970d2-3d8c-4c4b-9c90-6951ac9e791e You can disable this status message by setting the reviews.review_status to false in the CodeRabbit configuration file. Use the checkbox below for a quick retry:
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. ❤️ ShareComment @coderabbitai help to get the list of available commands. |
Sorry, something went wrong.
| Back | FazBrowse Home | New Git URL |
Draft scope
This is the original exploratory branch from the incremental update benchmark investigation. It is intentionally broad and should be reviewed as a bundle of instrumentation, benchmark tooling, and candidate performance changes rather than as a narrow production fix.
The branch currently contains 32 commits over main across 43 files.
What it contains
Instrumentation and benchmark tooling
DB collection and sync hot paths
Query/live graph hot paths
Index/sorted map/hash/db-ivm changes
Why
The benchmark shared during the investigation showed very slow steady-state incremental updates for query shapes that look like filtered lists plus joins/includes/counts. The main question was whether the time was in source collection update application, hashing, live query scheduling, or the db-ivm query graph.
This branch keeps the instrumentation used to answer that question and the candidate optimizations that were explored from those traces.
Review notes
Validation performed during the investigation
No fresh full CI run was performed immediately before opening this draft PR.