Devin AI 9dac04e32e Cache per-entry augmentations in B-tree nodes to reduce heap object churn ... When path-copying a B-tree node, unchanged entries (same tuple identity) now reuse their previously computed augmentation instead of re-calling extractAugmentation. For transduced tables backed by ConcatTreeList, this avoids creating duplicate rope-leaf heap objects that the serializer would otherwise treat as cache misses. Measured on a 1024-row / 4-team schema: transducedByTeam heap object cache misses per mutation: 37 -> 7 Total system-wide: ~49 -> 19 Co-Authored-By: Konstantin Wohlwend <n2d4xc@gmail.com>		2026-07-06 06:37:43 +00:00
..
backend	chore: update package versions	2026-07-06 05:53:33 +00:00
bulldozer-js	Cache per-entry augmentations in B-tree nodes to reduce heap object churn	2026-07-06 06:37:43 +00:00
dashboard	chore: update package versions	2026-07-06 05:53:33 +00:00
dev-launchpad	chore: update package versions	2026-07-06 05:53:33 +00:00
e2e	chore: update package versions	2026-07-06 05:53:33 +00:00
hosted-components	chore: update package versions	2026-07-06 05:53:33 +00:00
internal-tool	chore: update package versions	2026-07-06 05:53:33 +00:00
mcp	chore: update package versions	2026-07-06 05:53:33 +00:00
mock-oauth-server	chore: update package versions	2026-07-06 05:53:33 +00:00
oauth-mock-server	In-source unit tests (#429)	2025-02-14 11:47:52 -08:00
skills	chore: update package versions	2026-07-06 05:53:33 +00:00