FA-22411 / Autocomplete interactions / Open access
Unavailable suggestion presentation: unavailable committed value is silently cleared · case 01
The selected completion transition produces an incorrect observable state.
ROOT CAUSE
At unavailable-options/selected, the implementation evaluates `None if d['value'] in d['disabled'] else d['value']` instead of preserving the specified completion transition.
THE FAILURE
At unavailable-options/selected, the implementation evaluates `None if d['value'] in d['disabled'] else d['value']` instead of preserving the specified completion transition.
Unsuccessful approach: The attempted repair uses `d['active']`, which still violates a normal or boundary completion fixture.
Case contract
Unavailable options remain visible with reasons but cannot be committed or auto-selected. Availability is attached to identity, not display text. A committed unavailable value remains represented for correction. Disabled-only responses are distinct from empty results.
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 == 'visible': return d['ids']
if event == 'eligible': return [x for x in d['ids'] if x not in d['disabled']]
if event == 'commit': return d['active'] if d['active'] in d['ids'] and d['active'] not in d['disabled'] else None
if event == 'reason': return d['reason'].get(d['active'])
if event == 'selected': return None if d['value'] in d['disabled'] else d['value']
if event == 'row-flags': return [x in d['disabled'] for x in d['ids']]
if event == 'first-enabled': return next((x for x in d['ids'] if x not in d['disabled']),None)
if event == 'status': return 'empty' if not d['ids'] else 'available' if any(x not in d['disabled'] for x in d['ids']) else 'unavailable'
if event == 'validation': return d['value'] is None or d['value'] not in d['disabled']
if event == 'revalidate': return {'active':None if d['active'] in d['disabled'] else d['active'],'epoch':d['epoch']}
return {'unchanged': True}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
normal = {'ids':['a','b','c'],'disabled':['a','c'],'labels':['Same','Same','See'],'active':'a','value':'c','reason':{'a':'retired','c':'restricted'},'epoch':N}
boundary = {'ids':[],'disabled':[],'labels':[],'active':None,'value':None,'reason':{},'epoch':N}
check('normal visible', solve('visible', normal), ['a','b','c'])
check('boundary visible', solve('visible', boundary), [])
check('normal eligible', solve('eligible', normal), ['b'])
check('boundary eligible', solve('eligible', boundary), [])
check('normal commit', solve('commit', normal), None)
check('boundary commit', solve('commit', boundary), None)
check('normal reason', solve('reason', normal), 'retired')
check('boundary reason', solve('reason', boundary), None)
check('normal selected', solve('selected', normal), 'c')
check('boundary selected', solve('selected', boundary), None)
check('normal row-flags', solve('row-flags', normal), [True,False,True])
check('boundary row-flags', solve('row-flags', boundary), [])
check('normal first-enabled', solve('first-enabled', normal), 'b')
check('boundary first-enabled', solve('first-enabled', boundary), None)
check('normal status', solve('status', normal), 'available')
check('boundary status', solve('status', boundary), 'empty')
check('normal validation', solve('validation', normal), False)
check('boundary validation', solve('validation', boundary), True)
check('normal revalidate', solve('revalidate', normal), {'active':None,'epoch':N})
check('boundary revalidate', solve('revalidate', boundary), {'active':None,'epoch':N})
variant = dict(normal, **{'value':'id'+str(N)})
check('variant query or selection payload', solve('selected', variant), 'id'+str(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 visible | ['a', 'b', 'c'] | ['a', 'b', 'c'] | Passed |
| boundary visible | [] | [] | Passed |
| normal eligible | ['b'] | ['b'] | Passed |
| boundary eligible | [] | [] | Passed |
| normal commit | None | None | Passed |
| boundary commit | None | None | Passed |
| normal reason | retired | retired | Passed |
| boundary reason | None | None | Passed |
| normal selected | None | c | Failed |
| boundary selected | None | None | Passed |
| normal row-flags | [True, False, True] | [True, False, True] | Passed |
| boundary row-flags | [] | [] | Passed |
| normal first-enabled | b | b | Passed |
| boundary first-enabled | None | None | Passed |
| normal status | available | available | Passed |
| boundary status | empty | empty | Passed |
| normal validation | False | False | Passed |
| boundary validation | True | True | Passed |
| normal revalidate | {'active': None, 'epoch': 1} | {'active': None, 'epoch': 1} | Passed |
| boundary revalidate | {'active': None, 'epoch': 1} | {'active': None, 'epoch': 1} | Passed |
| variant query or selection payload | id1 | id1 | Passed |
| unknown completion event | {'unchanged': True} | {'unchanged': True} | Passed |
SHA-256 / e31e594d2c5c3f92704d1252207c7d311e8cfbd55ccb4d6b964dff6d280e50dd
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 == 'visible': return d['ids']
if event == 'eligible': return [x for x in d['ids'] if x not in d['disabled']]
if event == 'commit': return d['active'] if d['active'] in d['ids'] and d['active'] not in d['disabled'] else None
if event == 'reason': return d['reason'].get(d['active'])
if event == 'selected': return d['active']
if event == 'row-flags': return [x in d['disabled'] for x in d['ids']]
if event == 'first-enabled': return next((x for x in d['ids'] if x not in d['disabled']),None)
if event == 'status': return 'empty' if not d['ids'] else 'available' if any(x not in d['disabled'] for x in d['ids']) else 'unavailable'
if event == 'validation': return d['value'] is None or d['value'] not in d['disabled']
if event == 'revalidate': return {'active':None if d['active'] in d['disabled'] else d['active'],'epoch':d['epoch']}
return {'unchanged': True}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
normal = {'ids':['a','b','c'],'disabled':['a','c'],'labels':['Same','Same','See'],'active':'a','value':'c','reason':{'a':'retired','c':'restricted'},'epoch':N}
boundary = {'ids':[],'disabled':[],'labels':[],'active':None,'value':None,'reason':{},'epoch':N}
check('normal visible', solve('visible', normal), ['a','b','c'])
check('boundary visible', solve('visible', boundary), [])
check('normal eligible', solve('eligible', normal), ['b'])
check('boundary eligible', solve('eligible', boundary), [])
check('normal commit', solve('commit', normal), None)
check('boundary commit', solve('commit', boundary), None)
check('normal reason', solve('reason', normal), 'retired')
check('boundary reason', solve('reason', boundary), None)
check('normal selected', solve('selected', normal), 'c')
check('boundary selected', solve('selected', boundary), None)
check('normal row-flags', solve('row-flags', normal), [True,False,True])
check('boundary row-flags', solve('row-flags', boundary), [])
check('normal first-enabled', solve('first-enabled', normal), 'b')
check('boundary first-enabled', solve('first-enabled', boundary), None)
check('normal status', solve('status', normal), 'available')
check('boundary status', solve('status', boundary), 'empty')
check('normal validation', solve('validation', normal), False)
check('boundary validation', solve('validation', boundary), True)
check('normal revalidate', solve('revalidate', normal), {'active':None,'epoch':N})
check('boundary revalidate', solve('revalidate', boundary), {'active':None,'epoch':N})
variant = dict(normal, **{'value':'id'+str(N)})
check('variant query or selection payload', solve('selected', variant), 'id'+str(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 visible | ['a', 'b', 'c'] | ['a', 'b', 'c'] | Passed |
| boundary visible | [] | [] | Passed |
| normal eligible | ['b'] | ['b'] | Passed |
| boundary eligible | [] | [] | Passed |
| normal commit | None | None | Passed |
| boundary commit | None | None | Passed |
| normal reason | retired | retired | Passed |
| boundary reason | None | None | Passed |
| normal selected | a | c | Failed |
| boundary selected | None | None | Passed |
| normal row-flags | [True, False, True] | [True, False, True] | Passed |
| boundary row-flags | [] | [] | Passed |
| normal first-enabled | b | b | Passed |
| boundary first-enabled | None | None | Passed |
| normal status | available | available | Passed |
| boundary status | empty | empty | Passed |
| normal validation | False | False | Passed |
| boundary validation | True | True | Passed |
| normal revalidate | {'active': None, 'epoch': 1} | {'active': None, 'epoch': 1} | Passed |
| boundary revalidate | {'active': None, 'epoch': 1} | {'active': None, 'epoch': 1} | Passed |
| variant query or selection payload | a | id1 | Failed |
| unknown completion event | {'unchanged': True} | {'unchanged': True} | Passed |
SHA-256 / e13847871edab7024ffe9450215b1425600d238d4885955543ede6bdd049e9a6
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:38.338314+00:00.
Case digest / 68021e0f4c34c04c9a2e8e0698b96d4abdce2d8d7f6e5c9246dc0d2dd9b63574