FAILURE MAP
← Case archive

FA-23096 / Autocomplete interactions / Open access

Autocomplete query activation policy: explicit browse still requires a nonempty typed query · case 01

The browse completion transition produces an incorrect observable state.

Verified by executionVariant 1 · 22 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

At activation-policy/browse, the implementation evaluates `d['browse'] and bool(d['draft'])` instead of preserving the specified completion transition.

THE FAILURE

At activation-policy/browse, the implementation evaluates `d['browse'] and bool(d['draft'])` instead of preserving the specified completion transition.

Unsuccessful approach: The attempted repair uses `not d['browse']`, which still violates a normal or boundary completion fixture.

Case contract

This stipulated picker searches only after minimum draft length unless explicit browse is requested. Empty-query browse uses recent suggestions, composition blocks query emission, and disabled/read-only interaction suppresses new requests. Draft erasure cancels pending search and clears query-bound 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 == 'threshold': return len(d['draft'])>=d['minimum']
    if event == 'browse': return d['browse'] and bool(d['draft'])
    if event == 'recent': return d['recent'] if not d['draft'] else []
    if event == 'deferred-browse': return {'defer_browse':d['browse'] and d['composing'],'query':None if d['composing'] else d['draft']}
    if event == 'disabled': return not d['disabled']
    if event == 'readonly': return not d['readonly']
    if event == 'erase-pending': return None
    if event == 'erase-results': return []
    if event == 'empty-query-mode': return 'recent' if not d['draft'] and d['browse'] else 'type-more' if len(d['draft'])<d['minimum'] else 'results'
    if event == 'browse-descriptor': return {'mode':'browse' if d['browse'] else 'query','text':d['draft']}
    return {'unchanged': True}
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
normal = {'draft':'p','minimum':2,'browse':False,'recent':['a'],'composing':True,'disabled':True,'readonly':True,'pending':'pe','rows':['p1'],'epoch':N}
boundary = {'draft':'','minimum':0,'browse':True,'recent':[],'composing':False,'disabled':False,'readonly':False,'pending':None,'rows':[],'epoch':N}
check('normal threshold', solve('threshold', normal), False)
check('boundary threshold', solve('threshold', boundary), True)
check('normal browse', solve('browse', normal), False)
check('boundary browse', solve('browse', boundary), True)
check('normal recent', solve('recent', normal), [])
check('boundary recent', solve('recent', boundary), [])
check('normal deferred-browse', solve('deferred-browse', normal), {'defer_browse':False,'query':None})
check('boundary deferred-browse', solve('deferred-browse', boundary), {'defer_browse':False,'query':''})
check('normal disabled', solve('disabled', normal), False)
check('boundary disabled', solve('disabled', boundary), True)
check('normal readonly', solve('readonly', normal), False)
check('boundary readonly', solve('readonly', boundary), True)
check('normal erase-pending', solve('erase-pending', normal), None)
check('boundary erase-pending', solve('erase-pending', boundary), None)
check('normal erase-results', solve('erase-results', normal), [])
check('boundary erase-results', solve('erase-results', boundary), [])
check('normal empty-query-mode', solve('empty-query-mode', normal), 'type-more')
check('boundary empty-query-mode', solve('empty-query-mode', boundary), 'recent')
check('normal browse-descriptor', solve('browse-descriptor', normal), {'mode':'query','text':'p'})
check('boundary browse-descriptor', solve('browse-descriptor', boundary), {'mode':'browse','text':''})
variant = dict(normal, **{'draft':'x'*N,'minimum':N})
check('variant query or selection payload', solve('threshold', variant), True)
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 fixtureActualExpectedOutcome
normal thresholdFalseFalsePassed
boundary thresholdTrueTruePassed
normal browseFalseFalsePassed
boundary browseFalseTrueFailed
normal recent[][]Passed
boundary recent[][]Passed
normal deferred-browse{'defer_browse': False, 'query': None}{'defer_browse': False, 'query': None}Passed
boundary deferred-browse{'defer_browse': False, 'query': ''}{'defer_browse': False, 'query': ''}Passed
normal disabledFalseFalsePassed
boundary disabledTrueTruePassed
normal readonlyFalseFalsePassed
boundary readonlyTrueTruePassed
normal erase-pendingNoneNonePassed
boundary erase-pendingNoneNonePassed
normal erase-results[][]Passed
boundary erase-results[][]Passed
normal empty-query-modetype-moretype-morePassed
boundary empty-query-moderecentrecentPassed
normal browse-descriptor{'mode': 'query', 'text': 'p'}{'mode': 'query', 'text': 'p'}Passed
boundary browse-descriptor{'mode': 'browse', 'text': ''}{'mode': 'browse', 'text': ''}Passed
variant query or selection payloadTrueTruePassed
unknown completion event{'unchanged': True}{'unchanged': True}Passed

SHA-256 / 8fae3bbb2e1721181bdd644be6d6c32c548661d3efad29fcf87bb5e091278539

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 == 'threshold': return len(d['draft'])>=d['minimum']
    if event == 'browse': return not d['browse']
    if event == 'recent': return d['recent'] if not d['draft'] else []
    if event == 'deferred-browse': return {'defer_browse':d['browse'] and d['composing'],'query':None if d['composing'] else d['draft']}
    if event == 'disabled': return not d['disabled']
    if event == 'readonly': return not d['readonly']
    if event == 'erase-pending': return None
    if event == 'erase-results': return []
    if event == 'empty-query-mode': return 'recent' if not d['draft'] and d['browse'] else 'type-more' if len(d['draft'])<d['minimum'] else 'results'
    if event == 'browse-descriptor': return {'mode':'browse' if d['browse'] else 'query','text':d['draft']}
    return {'unchanged': True}
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
normal = {'draft':'p','minimum':2,'browse':False,'recent':['a'],'composing':True,'disabled':True,'readonly':True,'pending':'pe','rows':['p1'],'epoch':N}
boundary = {'draft':'','minimum':0,'browse':True,'recent':[],'composing':False,'disabled':False,'readonly':False,'pending':None,'rows':[],'epoch':N}
check('normal threshold', solve('threshold', normal), False)
check('boundary threshold', solve('threshold', boundary), True)
check('normal browse', solve('browse', normal), False)
check('boundary browse', solve('browse', boundary), True)
check('normal recent', solve('recent', normal), [])
check('boundary recent', solve('recent', boundary), [])
check('normal deferred-browse', solve('deferred-browse', normal), {'defer_browse':False,'query':None})
check('boundary deferred-browse', solve('deferred-browse', boundary), {'defer_browse':False,'query':''})
check('normal disabled', solve('disabled', normal), False)
check('boundary disabled', solve('disabled', boundary), True)
check('normal readonly', solve('readonly', normal), False)
check('boundary readonly', solve('readonly', boundary), True)
check('normal erase-pending', solve('erase-pending', normal), None)
check('boundary erase-pending', solve('erase-pending', boundary), None)
check('normal erase-results', solve('erase-results', normal), [])
check('boundary erase-results', solve('erase-results', boundary), [])
check('normal empty-query-mode', solve('empty-query-mode', normal), 'type-more')
check('boundary empty-query-mode', solve('empty-query-mode', boundary), 'recent')
check('normal browse-descriptor', solve('browse-descriptor', normal), {'mode':'query','text':'p'})
check('boundary browse-descriptor', solve('browse-descriptor', boundary), {'mode':'browse','text':''})
variant = dict(normal, **{'draft':'x'*N,'minimum':N})
check('variant query or selection payload', solve('threshold', variant), True)
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 fixtureActualExpectedOutcome
normal thresholdFalseFalsePassed
boundary thresholdTrueTruePassed
normal browseTrueFalseFailed
boundary browseFalseTrueFailed
normal recent[][]Passed
boundary recent[][]Passed
normal deferred-browse{'defer_browse': False, 'query': None}{'defer_browse': False, 'query': None}Passed
boundary deferred-browse{'defer_browse': False, 'query': ''}{'defer_browse': False, 'query': ''}Passed
normal disabledFalseFalsePassed
boundary disabledTrueTruePassed
normal readonlyFalseFalsePassed
boundary readonlyTrueTruePassed
normal erase-pendingNoneNonePassed
boundary erase-pendingNoneNonePassed
normal erase-results[][]Passed
boundary erase-results[][]Passed
normal empty-query-modetype-moretype-morePassed
boundary empty-query-moderecentrecentPassed
normal browse-descriptor{'mode': 'query', 'text': 'p'}{'mode': 'query', 'text': 'p'}Passed
boundary browse-descriptor{'mode': 'browse', 'text': ''}{'mode': 'browse', 'text': ''}Passed
variant query or selection payloadTrueTruePassed
unknown completion event{'unchanged': True}{'unchanged': True}Passed

SHA-256 / dd0b785c0f66854c8d9a6c0f2cea9758f70dc852ff945f0a5344ef71ffbc8582

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:44.806238+00:00.

Case digest / aa69ea1073645303f22d8034dc0f3f7c1f7ad0429b719d07bbf8b069fc92b599