FA-23256 / Autocomplete interactions / Open access
Unresolved autocomplete draft on blur: blur reversion discards active IME composition text · case 01
The composition completion transition produces an incorrect observable state.
ROOT CAUSE
At blur-resolution/composition, the implementation evaluates `True` instead of preserving the specified completion transition.
THE FAILURE
At blur-resolution/composition, the implementation evaluates `True` instead of preserving the specified completion transition.
Unsuccessful approach: The attempted repair uses `False`, which still violates a normal or boundary completion fixture.
Case contract
This strict-selection picker reverts an unresolved draft to the committed label after blur unless a suggestion pointer acceptance or IME composition is in progress. Exact unique candidate confirmation is an explicit separate transition. Blur never chooses a highlighted candidate merely because it exists.
Why this case matters
Autocomplete couples draft text, suggestion identity and asynchronous presentation; this bounded lifecycle model isolates one observable interaction defect.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(event, d):
if event == 'revert': return d['label']
if event == 'value': return d['value']
if event == 'pointer': return not d['pointer_pending']
if event == 'composition': return True
if event == 'exact': return d['exact_ids'][0] if len(d['exact_ids'])==1 else None
if event == 'touched': return True
if event == 'pending': return None
if event == 'free-text-rejection': return {'resolved':d['value'] is not None,'free_text':None}
if event == 'unresolved-validation': return {'invalid_draft':d['draft']!=d['label'],'candidate':None}
if event == 'changed': return False
return {'unchanged': True}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
normal = {'draft':'peach','value':'p1','label':'Pear','active':'p2','pointer_pending':True,'composing':True,'exact_ids':['p3','p4'],'query_epoch':N,'pending':'peach','touched':False}
boundary = {'draft':'','value':None,'label':'','active':None,'pointer_pending':False,'composing':False,'exact_ids':[''],'query_epoch':N,'pending':None,'touched':True}
check('normal revert', solve('revert', normal), 'Pear')
check('boundary revert', solve('revert', boundary), '')
check('normal value', solve('value', normal), 'p1')
check('boundary value', solve('value', boundary), None)
check('normal pointer', solve('pointer', normal), False)
check('boundary pointer', solve('pointer', boundary), True)
check('normal composition', solve('composition', normal), False)
check('boundary composition', solve('composition', boundary), True)
check('normal exact', solve('exact', normal), None)
check('boundary exact', solve('exact', boundary), '')
check('normal touched', solve('touched', normal), True)
check('boundary touched', solve('touched', boundary), True)
check('normal pending', solve('pending', normal), None)
check('boundary pending', solve('pending', boundary), None)
check('normal free-text-rejection', solve('free-text-rejection', normal), {'resolved':True,'free_text':None})
check('boundary free-text-rejection', solve('free-text-rejection', boundary), {'resolved':False,'free_text':None})
check('normal unresolved-validation', solve('unresolved-validation', normal), {'invalid_draft':True,'candidate':None})
check('boundary unresolved-validation', solve('unresolved-validation', boundary), {'invalid_draft':False,'candidate':None})
check('normal changed', solve('changed', normal), False)
check('boundary changed', solve('changed', boundary), False)
variant = dict(normal, **{'label':'L'*N})
check('variant query or selection payload', solve('revert', variant), 'L'*N)
check('unknown completion event', solve('unrecognized', normal), {'unchanged': True})
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 |
|---|---|---|---|
| normal revert | Pear | Pear | Passed |
| boundary revert | | | Passed |
| normal value | p1 | p1 | Passed |
| boundary value | None | None | Passed |
| normal pointer | False | False | Passed |
| boundary pointer | True | True | Passed |
| normal composition | True | False | Failed |
| boundary composition | True | True | Passed |
| normal exact | None | None | Passed |
| boundary exact | | | Passed |
| normal touched | True | True | Passed |
| boundary touched | True | True | Passed |
| normal pending | None | None | Passed |
| boundary pending | None | None | Passed |
| normal free-text-rejection | {'free_text': None, 'resolved': True} | {'free_text': None, 'resolved': True} | Passed |
| boundary free-text-rejection | {'free_text': None, 'resolved': False} | {'free_text': None, 'resolved': False} | Passed |
| normal unresolved-validation | {'candidate': None, 'invalid_draft': True} | {'candidate': None, 'invalid_draft': True} | Passed |
| boundary unresolved-validation | {'candidate': None, 'invalid_draft': False} | {'candidate': None, 'invalid_draft': False} | Passed |
| normal changed | False | False | Passed |
| boundary changed | False | False | Passed |
| variant query or selection payload | L | L | Passed |
| unknown completion event | {'unchanged': True} | {'unchanged': True} | Passed |
SHA-256 / b3704f12d6fc55ea2630cd24b6b2fac4e8dffc7cead1abd3438063387a07c131
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(event, d):
if event == 'revert': return d['label']
if event == 'value': return d['value']
if event == 'pointer': return not d['pointer_pending']
if event == 'composition': return False
if event == 'exact': return d['exact_ids'][0] if len(d['exact_ids'])==1 else None
if event == 'touched': return True
if event == 'pending': return None
if event == 'free-text-rejection': return {'resolved':d['value'] is not None,'free_text':None}
if event == 'unresolved-validation': return {'invalid_draft':d['draft']!=d['label'],'candidate':None}
if event == 'changed': return False
return {'unchanged': True}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
normal = {'draft':'peach','value':'p1','label':'Pear','active':'p2','pointer_pending':True,'composing':True,'exact_ids':['p3','p4'],'query_epoch':N,'pending':'peach','touched':False}
boundary = {'draft':'','value':None,'label':'','active':None,'pointer_pending':False,'composing':False,'exact_ids':[''],'query_epoch':N,'pending':None,'touched':True}
check('normal revert', solve('revert', normal), 'Pear')
check('boundary revert', solve('revert', boundary), '')
check('normal value', solve('value', normal), 'p1')
check('boundary value', solve('value', boundary), None)
check('normal pointer', solve('pointer', normal), False)
check('boundary pointer', solve('pointer', boundary), True)
check('normal composition', solve('composition', normal), False)
check('boundary composition', solve('composition', boundary), True)
check('normal exact', solve('exact', normal), None)
check('boundary exact', solve('exact', boundary), '')
check('normal touched', solve('touched', normal), True)
check('boundary touched', solve('touched', boundary), True)
check('normal pending', solve('pending', normal), None)
check('boundary pending', solve('pending', boundary), None)
check('normal free-text-rejection', solve('free-text-rejection', normal), {'resolved':True,'free_text':None})
check('boundary free-text-rejection', solve('free-text-rejection', boundary), {'resolved':False,'free_text':None})
check('normal unresolved-validation', solve('unresolved-validation', normal), {'invalid_draft':True,'candidate':None})
check('boundary unresolved-validation', solve('unresolved-validation', boundary), {'invalid_draft':False,'candidate':None})
check('normal changed', solve('changed', normal), False)
check('boundary changed', solve('changed', boundary), False)
variant = dict(normal, **{'label':'L'*N})
check('variant query or selection payload', solve('revert', variant), 'L'*N)
check('unknown completion event', solve('unrecognized', normal), {'unchanged': True})
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 |
|---|---|---|---|
| normal revert | Pear | Pear | Passed |
| boundary revert | | | Passed |
| normal value | p1 | p1 | Passed |
| boundary value | None | None | Passed |
| normal pointer | False | False | Passed |
| boundary pointer | True | True | Passed |
| normal composition | False | False | Passed |
| boundary composition | False | True | Failed |
| normal exact | None | None | Passed |
| boundary exact | | | Passed |
| normal touched | True | True | Passed |
| boundary touched | True | True | Passed |
| normal pending | None | None | Passed |
| boundary pending | None | None | Passed |
| normal free-text-rejection | {'free_text': None, 'resolved': True} | {'free_text': None, 'resolved': True} | Passed |
| boundary free-text-rejection | {'free_text': None, 'resolved': False} | {'free_text': None, 'resolved': False} | Passed |
| normal unresolved-validation | {'candidate': None, 'invalid_draft': True} | {'candidate': None, 'invalid_draft': True} | Passed |
| boundary unresolved-validation | {'candidate': None, 'invalid_draft': False} | {'candidate': None, 'invalid_draft': False} | Passed |
| normal changed | False | False | Passed |
| boundary changed | False | False | Passed |
| variant query or selection payload | L | L | Passed |
| unknown completion event | {'unchanged': True} | {'unchanged': True} | Passed |
SHA-256 / 5c742d523cfa90d7e39b779e7e42e05867a1c4536ffb9ca04a0b98dfe0efdd46
HELD IN THE MEMBER ARCHIVE
The verified repair and its recorded checks are member-only.
This mechanism has 22 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 deterministic widget transition model; inputs are validated snapshots. It does not model browser event dispatch, network transport, or linguistic standards. 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:40:46.183136+00:00.
Case digest / 2f8b4f3e8fdcb8cc5a7087daa70c40fe7d3a44b466afaa77c32c34fb9a9035fb