FA-38617 / Tree accessibility / Member archive

Subtree deletion state cleanup: Previous sibling recovery chooses farthest sibling · case 02

Previous sibling recovery chooses farthest sibling produces the wrong hierarchical widget state in a regression fixture.

Member previewVariant 2 · 3 implementations · 6 checks per implementation

Case contract

Remove a supplied subtree closure atomically. Focus inside the deleted subtree recovers to surviving next sibling, previous sibling, then parent, then first root. Preserve unrelated state; clear only removed anchor, edits, expansion, selection and pending loads.

Why this case matters

Offline executable model of a hierarchical accessibility interaction; inputs are bounded and valid as stipulated. No browser, assistive technology, or normative ARIA conformance is claimed.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
previous recovery	`[["r", "a", "x", "z", "q0", "q1"], ["a"], ["r"], {"a": 1}, "a", null, null]`	`[["r", "a", "x", "z", "q0", "q1"], ["a"], ["r"], {"a": 1}, "x", null, null]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.