improvement(tree): Maintain column/row ID -> node cache for faster lookup

[Josmithr]

This was identified as a key bottleneck in some consumer scenarios. Caching the ID -> node mapping saves an O(n) lookup for each operation.

[github-actions]

Hi! Thank you for opening this PR. Want me to review it?

Based on the diff (270 lines, 2 files), I've queued these reviewers:

• Correctness — logic errors, race conditions, lifecycle issues
• Security — vulnerabilities, secret exposure, injection
• API Compatibility — breaking changes, release tags, type design
• Performance — algorithmic regressions, memory leaks
• Testing — coverage gaps, hollow tests

How this works

• Adjust the reviewer set by ticking/unticking boxes above. Reviewer toggles alone don't trigger anything.

• Tick Start review below to dispatch the review fleet.

• After review finishes, tick Start review again to request another run — it auto-resets after each dispatch.

• This comment updates as new commits land; your reviewer selections are preserved.

• Start review

[Copilot]

Pull request overview

This PR optimizes TableSchema row/column lookups by replacing repeated linear scans with lazily built ID→node caches inside the table implementation. It fits into the tree table API as a performance improvement for getCell, setCell, and other APIs that resolve rows/columns by string ID.

Changes:

• Add lazy row and column ID lookup caches to TableSchema.Table.
• Invalidate those caches from nodeChanged listeners on the row/column arrays.
• Route #tryGetRow and #tryGetColumn string-ID lookups through the caches instead of Array.find.