FA-54696 / Accessibility interaction semantics / Open access
Out-of-range text offsets resolve to the final visual line · case 01
Out-of-range text offsets resolve to the final visual line.
ROOT CAUSE
The past end query decision in the visual line query adapter violates its declared contract.
VERIFIED REPAIR
Apply the exact contract at the past end query decision: if offset < 0 or offset > len(text): return None
Unsuccessful approach: The local repair substitutes if offset < 0: return None offset = min(offset,len(text)) but still mishandles the regression fixtures.
Case contract
Input [text,lines,offset,affinity] lines ordered nonoverlapping [start,end,hard_break] in codepoint coordinates. Each line covers half-open text range; an offset on shared line boundary selects next line for forward affinity, previous for backward. Final document-end offset selects final line. Empty text with one empty line is valid. Return [index,start,end,text_segment,hard_break], or None for offsets outside text or gaps. Newline characters are included only if line bounds include them. No text wrapping is performed.
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):
text,lines,offset,affinity = data
offset = min(len(text),offset)
if offset < 0: return None
matches = []
for i,(start,end,hard) in enumerate(lines):
inside = start <= offset < end
boundary = offset == end and (affinity == 'backward' or offset == len(text))
empty = start == end == offset and len(text) == 0
if inside or boundary or empty: matches.append(i)
if not matches: return None
index = matches[0] if affinity == 'backward' else matches[-1]
start,end,hard = lines[index]
return [index,start,end,text[start:end],hard]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('contract fixture 1', solve(['A'*N+'BC',[[0,N,False],[N,N+2,True]],N,'forward'],), [1,N,N+2,'BC',True])
check('contract fixture 2', solve(['A'*N+'BC',[[0,N,False],[N,N+2,True]],N,'backward'],), [0,0,N,'A'*N,False])
check('contract fixture 3', solve(['abc',[[0,3,False]],3,'forward'],), [0,0,3,'abc',False])
check('contract fixture 4', solve(['a\nb',[[0,2,True],[2,3,False]],1,'forward'],), [0,0,2,'a\n',True])
check('contract fixture 5', solve(['abc',[[0,1,False],[2,3,False]],1,'forward'],), None)
check('contract fixture 6', solve(['abc',[[0,3,False]],-1,'backward'],), None)
check('contract fixture 7', solve(['abc',[[0,3,False]],4,'backward'],), None)
check('contract fixture 8', solve(['',[[0,0,False]],0,'forward'],), [0,0,0,'',False])
check('contract fixture 9', solve(['abc',[],0,'forward'],), None)
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 | [1, 1, 3, 'BC', True] | [1, 1, 3, 'BC', True] | Passed |
| contract fixture 2 | [0, 0, 1, 'A', False] | [0, 0, 1, 'A', False] | Passed |
| contract fixture 3 | [0, 0, 3, 'abc', False] | [0, 0, 3, 'abc', False] | Passed |
| contract fixture 4 | [0, 0, 2, 'a\n', True] | [0, 0, 2, 'a\n', True] | Passed |
| contract fixture 5 | None | None | Passed |
| contract fixture 6 | None | None | Passed |
| contract fixture 7 | [0, 0, 3, 'abc', False] | None | Failed |
| contract fixture 8 | [0, 0, 0, '', False] | [0, 0, 0, '', False] | Passed |
| contract fixture 9 | None | None | Passed |
SHA-256 / fdf1f7598c7d59edc235a3c1135d77586bec21c88d455c448236a917c59c4a0b
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(data):
text,lines,offset,affinity = data
if offset < 0: return None
offset = min(offset,len(text))
matches = []
for i,(start,end,hard) in enumerate(lines):
inside = start <= offset < end
boundary = offset == end and (affinity == 'backward' or offset == len(text))
empty = start == end == offset and len(text) == 0
if inside or boundary or empty: matches.append(i)
if not matches: return None
index = matches[0] if affinity == 'backward' else matches[-1]
start,end,hard = lines[index]
return [index,start,end,text[start:end],hard]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('contract fixture 1', solve(['A'*N+'BC',[[0,N,False],[N,N+2,True]],N,'forward'],), [1,N,N+2,'BC',True])
check('contract fixture 2', solve(['A'*N+'BC',[[0,N,False],[N,N+2,True]],N,'backward'],), [0,0,N,'A'*N,False])
check('contract fixture 3', solve(['abc',[[0,3,False]],3,'forward'],), [0,0,3,'abc',False])
check('contract fixture 4', solve(['a\nb',[[0,2,True],[2,3,False]],1,'forward'],), [0,0,2,'a\n',True])
check('contract fixture 5', solve(['abc',[[0,1,False],[2,3,False]],1,'forward'],), None)
check('contract fixture 6', solve(['abc',[[0,3,False]],-1,'backward'],), None)
check('contract fixture 7', solve(['abc',[[0,3,False]],4,'backward'],), None)
check('contract fixture 8', solve(['',[[0,0,False]],0,'forward'],), [0,0,0,'',False])
check('contract fixture 9', solve(['abc',[],0,'forward'],), None)
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 | [1, 1, 3, 'BC', True] | [1, 1, 3, 'BC', True] | Passed |
| contract fixture 2 | [0, 0, 1, 'A', False] | [0, 0, 1, 'A', False] | Passed |
| contract fixture 3 | [0, 0, 3, 'abc', False] | [0, 0, 3, 'abc', False] | Passed |
| contract fixture 4 | [0, 0, 2, 'a\n', True] | [0, 0, 2, 'a\n', True] | Passed |
| contract fixture 5 | None | None | Passed |
| contract fixture 6 | None | None | Passed |
| contract fixture 7 | [0, 0, 3, 'abc', False] | None | Failed |
| contract fixture 8 | [0, 0, 0, '', False] | [0, 0, 0, '', False] | Passed |
| contract fixture 9 | None | None | Passed |
SHA-256 / 5b755dc031086ecae6420ccdc1135fc5068fd402b607b0897fb538a62f75ef61
3 / The verified repair
Exit 0"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(data):
text,lines,offset,affinity = data
if offset < 0 or offset > len(text): return None
matches = []
for i,(start,end,hard) in enumerate(lines):
inside = start <= offset < end
boundary = offset == end and (affinity == 'backward' or offset == len(text))
empty = start == end == offset and len(text) == 0
if inside or boundary or empty: matches.append(i)
if not matches: return None
index = matches[0] if affinity == 'backward' else matches[-1]
start,end,hard = lines[index]
return [index,start,end,text[start:end],hard]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('contract fixture 1', solve(['A'*N+'BC',[[0,N,False],[N,N+2,True]],N,'forward'],), [1,N,N+2,'BC',True])
check('contract fixture 2', solve(['A'*N+'BC',[[0,N,False],[N,N+2,True]],N,'backward'],), [0,0,N,'A'*N,False])
check('contract fixture 3', solve(['abc',[[0,3,False]],3,'forward'],), [0,0,3,'abc',False])
check('contract fixture 4', solve(['a\nb',[[0,2,True],[2,3,False]],1,'forward'],), [0,0,2,'a\n',True])
check('contract fixture 5', solve(['abc',[[0,1,False],[2,3,False]],1,'forward'],), None)
check('contract fixture 6', solve(['abc',[[0,3,False]],-1,'backward'],), None)
check('contract fixture 7', solve(['abc',[[0,3,False]],4,'backward'],), None)
check('contract fixture 8', solve(['',[[0,0,False]],0,'forward'],), [0,0,0,'',False])
check('contract fixture 9', solve(['abc',[],0,'forward'],), None)
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 | [1, 1, 3, 'BC', True] | [1, 1, 3, 'BC', True] | Passed |
| contract fixture 2 | [0, 0, 1, 'A', False] | [0, 0, 1, 'A', False] | Passed |
| contract fixture 3 | [0, 0, 3, 'abc', False] | [0, 0, 3, 'abc', False] | Passed |
| contract fixture 4 | [0, 0, 2, 'a\n', True] | [0, 0, 2, 'a\n', True] | Passed |
| contract fixture 5 | None | None | Passed |
| contract fixture 6 | None | None | Passed |
| contract fixture 7 | None | None | Passed |
| contract fixture 8 | [0, 0, 0, '', False] | [0, 0, 0, '', False] | Passed |
| contract fixture 9 | None | None | Passed |
SHA-256 / 5bd3511058a4540f596756549d23920ba4477c6cd763bc2e38b206815f8b18a1
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:50.818838+00:00.
Case digest / 900d25d19461f916d6f1e9b64439544071a7592d600fb9f74b085c49ef24f677