FA-39669 / Tree accessibility / Member archive

Hierarchical sibling sort and stable identity: Sort replacement closure duplicates descendants or deletes unrelated roots · case 04

Sort replacement closure duplicates descendants or deletes unrelated roots produces the wrong hierarchical widget state in a regression fixture.

Member previewVariant 4 · 3 implementations · 6 checks per implementation

Case contract

Only direct children of the target parent are sorted by casefolded display label, with original order retained on ties; each child subtree moves as one block. Missing labels sort last in ascending order; descending reverses the complete comparison order. Focus, selection and expansion remain ID-based; sibling positions are recomputed from sorted roots.

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
ascending	`[["outside", "r", "a", "z", "zz", "zzz", "b", "zz", "zzz", "q"], {"a": 1, "b": 3, "z": 2}, "z", ["zzz"], ["r", "z"]]`	`[["outside", "r", "a", "z", "zz", "zzz", "b", "q"], {"a": 1, "b": 3, "z": 2}, "z", ["zzz"], ["r", "z"]]`	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.