{"abstract":"Ordinary controls precede positive tabindex controls.","category":"Keyboard accessibility","checks":9,"contract":"Visit visible enabled nonnegative tabindex controls; positive tabindex precedes zero; ties retain document order and navigation wraps.","evaluation_group":"xi-tab-stop","failed_approach":"Putting positive values last also violates ordering.","family":"xi-tab-stop-priority","id":"FA-7846","implementations":{"attempt":{"sha256":"6e87af80671cb20baaa4580d905d46b4a57295c326eaee73e77c6e3aa8364851","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(items, current, direction):\n    eligible = [i for i, item in enumerate(items) if item['visible'] and not item['disabled'] and item['tab'] >= 0]\n    eligible.sort(key=lambda i: (items[i]['tab'] > 0, items[i]['tab'] if items[i]['tab'] > 0 else 0, i))\n    if not eligible: return None\n    if current not in eligible: return eligible[0] if direction > 0 else eligible[-1]\n    return eligible[(eligible.index(current) + direction) % len(eligible)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('hidden', solve([dict(visible=False, disabled=False, tab=0),dict(visible=True,disabled=False,tab=0)], None, 1), 1)\ncheck('disabled', solve([dict(visible=True,disabled=True,tab=0),dict(visible=True,disabled=False,tab=0)], None, 1), 1)\ncheck('negative', solve([dict(visible=True,disabled=False,tab=-1),dict(visible=True,disabled=False,tab=0)], None, 1), 1)\ncheck('priority', solve([dict(visible=True,disabled=False,tab=0),dict(visible=True,disabled=False,tab=2)], None, 1), 1)\ncheck('reverse', solve([dict(visible=True,disabled=False,tab=0)]*3, 1, -1), 0)\ncheck('forward', solve([dict(visible=True,disabled=False,tab=0)]*3, 1, 1), 2)\ncheck('empty', solve([], None, 1), None)\ncheck('parameterized focus sequence', solve([dict(visible=True, disabled=False, tab=0)]*(N+2), N, 1), N+1)\nfor repetition in range(N):\n    check('repeat empty', solve([], None, 1), None)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"broken":{"sha256":"a4a2e1bdcc0dd84b7d50f4f162e91fef591fd918e6b422f78b12752cf798563e","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(items, current, direction):\n    eligible = [i for i, item in enumerate(items) if item['visible'] and not item['disabled'] and item['tab'] >= 0]\n    eligible.sort(key=lambda i: (False, items[i]['tab'] if items[i]['tab'] > 0 else 0, i))\n    if not eligible: return None\n    if current not in eligible: return eligible[0] if direction > 0 else eligible[-1]\n    return eligible[(eligible.index(current) + direction) % len(eligible)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('hidden', solve([dict(visible=False, disabled=False, tab=0),dict(visible=True,disabled=False,tab=0)], None, 1), 1)\ncheck('disabled', solve([dict(visible=True,disabled=True,tab=0),dict(visible=True,disabled=False,tab=0)], None, 1), 1)\ncheck('negative', solve([dict(visible=True,disabled=False,tab=-1),dict(visible=True,disabled=False,tab=0)], None, 1), 1)\ncheck('priority', solve([dict(visible=True,disabled=False,tab=0),dict(visible=True,disabled=False,tab=2)], None, 1), 1)\ncheck('reverse', solve([dict(visible=True,disabled=False,tab=0)]*3, 1, -1), 0)\ncheck('forward', solve([dict(visible=True,disabled=False,tab=0)]*3, 1, 1), 2)\ncheck('empty', solve([], None, 1), None)\ncheck('parameterized focus sequence', solve([dict(visible=True, disabled=False, tab=0)]*(N+2), N, 1), N+1)\nfor repetition in range(N):\n    check('repeat empty', solve([], None, 1), None)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"fixed":{"sha256":"b57c62a1fcaf2d8083d523782e366fd00a799e24974a856b307d0486e8c13a14","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(items, current, direction):\n    eligible = [i for i, item in enumerate(items) if item['visible'] and not item['disabled'] and item['tab'] >= 0]\n    eligible.sort(key=lambda i: (items[i]['tab'] == 0, items[i]['tab'] if items[i]['tab'] > 0 else 0, i))\n    if not eligible: return None\n    if current not in eligible: return eligible[0] if direction > 0 else eligible[-1]\n    return eligible[(eligible.index(current) + direction) % len(eligible)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('hidden', solve([dict(visible=False, disabled=False, tab=0),dict(visible=True,disabled=False,tab=0)], None, 1), 1)\ncheck('disabled', solve([dict(visible=True,disabled=True,tab=0),dict(visible=True,disabled=False,tab=0)], None, 1), 1)\ncheck('negative', solve([dict(visible=True,disabled=False,tab=-1),dict(visible=True,disabled=False,tab=0)], None, 1), 1)\ncheck('priority', solve([dict(visible=True,disabled=False,tab=0),dict(visible=True,disabled=False,tab=2)], None, 1), 1)\ncheck('reverse', solve([dict(visible=True,disabled=False,tab=0)]*3, 1, -1), 0)\ncheck('forward', solve([dict(visible=True,disabled=False,tab=0)]*3, 1, 1), 2)\ncheck('empty', solve([], None, 1), None)\ncheck('parameterized focus sequence', solve([dict(visible=True, disabled=False, tab=0)]*(N+2), N, 1), N+1)\nfor repetition in range(N):\n    check('repeat empty', solve([], None, 1), None)\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"}},"limitations":" This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.","method":"Deterministic executable model with adversarial boundary fixtures.","provenance":{"created_by":"Failure Map","dependencies":"Python standard library","family":"xi-tab-stop-priority","generated_at":"2026-09-29T14:38:15.831028+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A deterministic model of sequential keyboard focus; this isolates one interface invariant without requiring a browser.","repair":"Implement the priority operation as `items[i]['tab'] == 0`.","root_cause":"The priority operation uses `False` where the contract requires `items[i]['tab'] == 0`.","sha256":"e4c34e0d05c5c35a5586310bc670bb8d606095aa64aaf82e4745f1dac6a1688f","title":"Sequential keyboard focus: Ordinary controls precede positive tabindex controls · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":41.235,"exit_code":1,"observations":[{"actual":1,"check":"hidden","expected":1,"passed":true},{"actual":1,"check":"disabled","expected":1,"passed":true},{"actual":1,"check":"negative","expected":1,"passed":true},{"actual":0,"check":"priority","expected":1,"passed":false},{"actual":0,"check":"reverse","expected":0,"passed":true},{"actual":2,"check":"forward","expected":2,"passed":true},{"actual":null,"check":"empty","expected":null,"passed":true},{"actual":2,"check":"parameterized focus sequence","expected":2,"passed":true},{"actual":null,"check":"repeat empty","expected":null,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"hidden\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"disabled\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"negative\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"priority\", \"actual\": 0, \"expected\": 1, \"passed\": false}, {\"check\": \"reverse\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"forward\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"empty\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"parameterized focus sequence\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"repeat empty\", \"actual\": null, \"expected\": null, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.595,"exit_code":1,"observations":[{"actual":1,"check":"hidden","expected":1,"passed":true},{"actual":1,"check":"disabled","expected":1,"passed":true},{"actual":1,"check":"negative","expected":1,"passed":true},{"actual":0,"check":"priority","expected":1,"passed":false},{"actual":0,"check":"reverse","expected":0,"passed":true},{"actual":2,"check":"forward","expected":2,"passed":true},{"actual":null,"check":"empty","expected":null,"passed":true},{"actual":2,"check":"parameterized focus sequence","expected":2,"passed":true},{"actual":null,"check":"repeat empty","expected":null,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"hidden\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"disabled\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"negative\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"priority\", \"actual\": 0, \"expected\": 1, \"passed\": false}, {\"check\": \"reverse\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"forward\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"empty\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"parameterized focus sequence\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"repeat empty\", \"actual\": null, \"expected\": null, \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":38.474,"exit_code":0,"observations":[{"actual":1,"check":"hidden","expected":1,"passed":true},{"actual":1,"check":"disabled","expected":1,"passed":true},{"actual":1,"check":"negative","expected":1,"passed":true},{"actual":1,"check":"priority","expected":1,"passed":true},{"actual":0,"check":"reverse","expected":0,"passed":true},{"actual":2,"check":"forward","expected":2,"passed":true},{"actual":null,"check":"empty","expected":null,"passed":true},{"actual":2,"check":"parameterized focus sequence","expected":2,"passed":true},{"actual":null,"check":"repeat empty","expected":null,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"hidden\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"disabled\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"negative\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"priority\", \"actual\": 1, \"expected\": 1, \"passed\": true}, {\"check\": \"reverse\", \"actual\": 0, \"expected\": 0, \"passed\": true}, {\"check\": \"forward\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"empty\", \"actual\": null, \"expected\": null, \"passed\": true}, {\"check\": \"parameterized focus sequence\", \"actual\": 2, \"expected\": 2, \"passed\": true}, {\"check\": \"repeat empty\", \"actual\": null, \"expected\": null, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}