FA-54171 / Accessibility interaction semantics / Open access
Nameless annotation markers enter text attribute ranges · case 01
Nameless annotation markers enter text attribute ranges.
ROOT CAUSE
The detail presence decision in the annotation ranges adapter violates its declared contract.
THE FAILURE
The detail presence decision in the annotation ranges adapter violates its declared contract.
Unsuccessful approach: The local repair substitutes resolved or detail is None but still mishandles the regression fixtures.
Case contract
Input [length,annotations,types] annotations [id,start,end,kind,detail,resolved]. Admit allowed types and unresolved annotations with nonempty detail. Clamp half-open ranges, discard empty or reversed. Preserve overlapping annotations; dedupe same ID by first eligible record. Output sorted by start,end,ID. Return [id,start,end,kind,detail]. Spelling, grammar, comment are the only recognized kinds even if types requests unknown types.
Why this case matters
Offline accessibility bridge model with explicit policy; useful for testing semantic API adapters independently of browser implementations.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(data):
length,annotations,types = data
seen = set()
result = []
for ident,start,end,kind,detail,resolved in annotations:
if kind not in {'spelling','grammar','comment'} or kind not in types: continue
if resolved: continue
start,end = max(0,start),min(length,end)
if start >= end or ident in seen: continue
seen.add(ident)
result.append([ident,start,end,kind,detail])
return sorted(result,key=lambda row:(row[1],row[2],row[0]))
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('contract fixture 1', solve([N+5,[['b',N,N+3,'comment','B',False],['a',N,N+2,'spelling','A',False],['c',N,N+2,'grammar','C',False]],['comment','spelling','grammar']],), [['a',N,N+2,'spelling','A'],['c',N,N+2,'grammar','C'],['b',N,N+3,'comment','B']])
check('contract fixture 2', solve([4,[['a',-2,2,'comment','A',False],['b',2,8,'comment','B',False]],['comment']],), [['a',0,2,'comment','A'],['b',2,4,'comment','B']])
check('contract fixture 3', solve([4,[['a',0,2,'comment','A',True],['b',0,2,'spelling','B',False],['c',0,2,'unknown','C',False],['d',0,2,'comment','',False]],['comment','unknown']],), [])
check('contract fixture 4', solve([4,[['a',0,0,'comment','zero',False],['b',3,1,'comment','reverse',False]],['comment']],), [])
check('contract fixture 5', solve([4,[['a',2,3,'comment','first',False],['a',0,1,'comment','later',False]],['comment']],), [['a',2,3,'comment','first']])
check('contract fixture 6', solve([4,[['a',0,2,'comment','resolved',True],['a',1,3,'comment','live',False]],['comment']],), [['a',1,3,'comment','live']])
check('contract fixture 7', solve([0,[],[]],), [])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| contract fixture 1 | [['a', 1, 3, 'spelling', 'A'], ['c', 1, 3, 'grammar', 'C'], ['b', 1, 4, 'comment', 'B']] | [['a', 1, 3, 'spelling', 'A'], ['c', 1, 3, 'grammar', 'C'], ['b', 1, 4, 'comment', 'B']] | Passed |
| contract fixture 2 | [['a', 0, 2, 'comment', 'A'], ['b', 2, 4, 'comment', 'B']] | [['a', 0, 2, 'comment', 'A'], ['b', 2, 4, 'comment', 'B']] | Passed |
| contract fixture 3 | [['d', 0, 2, 'comment', '']] | [] | Failed |
| contract fixture 4 | [] | [] | Passed |
| contract fixture 5 | [['a', 2, 3, 'comment', 'first']] | [['a', 2, 3, 'comment', 'first']] | Passed |
| contract fixture 6 | [['a', 1, 3, 'comment', 'live']] | [['a', 1, 3, 'comment', 'live']] | Passed |
| contract fixture 7 | [] | [] | Passed |
SHA-256 / 165bc450f25190e721af1afa2ed8ccd619a3215d52dcc980e16b3389eb3fee9c
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(data):
length,annotations,types = data
seen = set()
result = []
for ident,start,end,kind,detail,resolved in annotations:
if kind not in {'spelling','grammar','comment'} or kind not in types: continue
if resolved or detail is None: continue
start,end = max(0,start),min(length,end)
if start >= end or ident in seen: continue
seen.add(ident)
result.append([ident,start,end,kind,detail])
return sorted(result,key=lambda row:(row[1],row[2],row[0]))
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('contract fixture 1', solve([N+5,[['b',N,N+3,'comment','B',False],['a',N,N+2,'spelling','A',False],['c',N,N+2,'grammar','C',False]],['comment','spelling','grammar']],), [['a',N,N+2,'spelling','A'],['c',N,N+2,'grammar','C'],['b',N,N+3,'comment','B']])
check('contract fixture 2', solve([4,[['a',-2,2,'comment','A',False],['b',2,8,'comment','B',False]],['comment']],), [['a',0,2,'comment','A'],['b',2,4,'comment','B']])
check('contract fixture 3', solve([4,[['a',0,2,'comment','A',True],['b',0,2,'spelling','B',False],['c',0,2,'unknown','C',False],['d',0,2,'comment','',False]],['comment','unknown']],), [])
check('contract fixture 4', solve([4,[['a',0,0,'comment','zero',False],['b',3,1,'comment','reverse',False]],['comment']],), [])
check('contract fixture 5', solve([4,[['a',2,3,'comment','first',False],['a',0,1,'comment','later',False]],['comment']],), [['a',2,3,'comment','first']])
check('contract fixture 6', solve([4,[['a',0,2,'comment','resolved',True],['a',1,3,'comment','live',False]],['comment']],), [['a',1,3,'comment','live']])
check('contract fixture 7', solve([0,[],[]],), [])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| contract fixture 1 | [['a', 1, 3, 'spelling', 'A'], ['c', 1, 3, 'grammar', 'C'], ['b', 1, 4, 'comment', 'B']] | [['a', 1, 3, 'spelling', 'A'], ['c', 1, 3, 'grammar', 'C'], ['b', 1, 4, 'comment', 'B']] | Passed |
| contract fixture 2 | [['a', 0, 2, 'comment', 'A'], ['b', 2, 4, 'comment', 'B']] | [['a', 0, 2, 'comment', 'A'], ['b', 2, 4, 'comment', 'B']] | Passed |
| contract fixture 3 | [['d', 0, 2, 'comment', '']] | [] | Failed |
| contract fixture 4 | [] | [] | Passed |
| contract fixture 5 | [['a', 2, 3, 'comment', 'first']] | [['a', 2, 3, 'comment', 'first']] | Passed |
| contract fixture 6 | [['a', 1, 3, 'comment', 'live']] | [['a', 1, 3, 'comment', 'live']] | Passed |
| contract fixture 7 | [] | [] | Passed |
SHA-256 / a4bef38cae672e2133efa06b265151ace14520a5d41c35ef4cdc2dd4fbd66da9
HELD IN THE MEMBER ARCHIVE
The verified repair and its recorded checks are member-only.
This mechanism has 7 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.
Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.
Member access is invitation-based. Sign in with your invited account to inspect the repair.
Sign in to the archive ↗Verification & scope
Stipulated finite adapter contract, not a claim of platform accessibility or ARIA conformance. 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.
Observations recorded using Python 3.12.14 at 2026-09-29T14:45:45.976741+00:00.
Case digest / 3a26a90dfe6e96115373505e9e2e7a475449d84af7a5da3ff2c44e1dddab17e5