[sumnoon]

Problem

For a method such as LeetCode's Solution::towerOfHanoi, each recursion-tree node was labelled

Solution::towerOfHanoi(0x5ffdef, 1, "A", "C", "B")

The first "argument" is the hidden this pointer, which is a memory address. Full-size nodes also cut labels at 15 characters, so every node read Solution::towe… and none of the argument values were visible. The top bar showed Solution::tower… too.

Fix

• Labels leave out this. Nobody passes it, and its address changes every run.
• Labels drop the class or namespace qualifier: towerOfHanoi(2, "B", "C", "A"). Plain functions are unchanged. The Call stack keeps the full name.
• Full nodes widen to fit the longest label, from the old 15 characters up to 32. Compact nodes allow 32 characters too (was 24) and get a bit more padding, so ×2 no longer touches the label.
• The running-call name in the top bar and the "Inspecting …" chip use the short name. The full name is in the tooltip.

The "Repeated work" grouping now matches calls on their real arguments, without the this address.

Checks

• Tower of Hanoi (LeetCode harness, n = 3): nodes read towerOfHanoi(1, "B", "A", "C"), towerOfHanoi(0, "C", "A", "B") ×2, and so on. The sticky note says towerOfHanoi(0, "C", "A", "B") is running.
• Fibonacci example: unchanged. Short labels keep the old 168px minimum width.
• tsc, npm run build and the 13 Node tests pass.

docs/usage.md describes the labels.

🤖 Generated with Claude Code