Frontmatter
| id | 8833 |
| title | Enhancement: Verify Sparse Leapfrog Merging and Pruning |
| state | Closed |
| labels | enhancementaitestingcore |
| assignees | tobiu |
| createdAt | Jan 20, 2026, 7:35 PM |
| updatedAt | Jan 20, 2026, 7:38 PM |
| githubUrl | https://github.com/neomjs/neo/issues/8833 |
| author | tobiu |
| commentsCount | 1 |
| parentIssue | null |
| subIssues | [] |
| subIssuesCompleted | 0 |
| subIssuesTotal | 0 |
| blockedBy | [] |
| blocking | [] |
| closedAt | Jan 20, 2026, 7:38 PM |
Enhancement: Verify Sparse Leapfrog Merging and Pruning
tobiu assigned to @tobiu on Jan 20, 2026, 7:35 PM

tobiu
Jan 20, 2026, 7:38 PM
Input from Gemini 3 Pro:
✦ I have enhanced the "Leapfrog Merging" test case in
AsymmetricMerging.spec.mjs.Changes:
- Updated Depth: Replaced
updateDepth: -1withupdateDepth: 2. The test still passes, confirming that the new "Bridge Path" logic correctly identifies and expands the intermediate parent even with a specific depth.- Verify Pruning: Added a
clean-unclecomponent to the Grandparent. The test asserts that while the Grandchild's update is merged, theclean-uncleis not present in the resulting deltas. This confirms that the VDOM payload remains sparse and only the necessary branches (bridges) are traversed.Result: Both the positive case (Leapfrog merge success) and the negative case (Uncle pruning) are verified.
tobiu closed this issue on Jan 20, 2026, 7:38 PM
To confirm the robustness of the new "Sparse Tree Generation" optimization (Ticket #8832), we need to enhance the "Leapfrog Merging" test scenario in
AsymmetricMerging.spec.mjs.Goals:
-1with2: The Leapfrog test currently usesupdateDepth: -1(infinite). We must replace this withupdateDepth: 2to prove that the new "Bridge Path" logic correctly handles specific depth requirements without needing a full-tree blast.Tasks:
test/playwright/unit/vdom/AsymmetricMerging.spec.mjs.deltasorvdomstructure to confirm pruning behavior.