FA-32486 / Menu interactions / Open access
Lazy menu rows appear after the pinned footer · case 01
Lazy menu rows appear after the pinned footer.
ROOT CAUSE
The lazy-pages model applies `p['rows']+p['page']` at its footer operation instead of the stipulated transformation.
VERIFIED REPAIR
Apply `p['rows'][:-1]+p['page']+[p['rows'][-1]]` at footer.
Unsuccessful approach: The attempted repair `p['page']+p['rows']` still violates the footer oracle.
Case contract
Lazy submenu pages retain provider order, unique IDs and opaque cursors; loading indicators disappear on final empty results.
Why this case matters
Cascading and context menus require coherent command and session state as content changes.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
import math
import unicodedata
N = 1
observations = []
def solve(action, p):
if action == 'append':
return p['old']+[x for x in p['page'] if x not in p['old']]
if action == 'cursor':
return p['next']
if action == 'done':
return p['next'] is None
if action == 'empty':
return [] if p['done'] and not p['items'] else p['items']
if action == 'retry':
return p['failed']
if action == 'footer':
return p['rows']+p['page']
return {'error': 'unsupported menu operation'}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('append contract', solve('append', {'old':[N],'page':[N,N+1]}), [N,N+1])
check('cursor contract', solve('cursor', {'next':'cursor'+str(N),'previous':'old','items':[1,2]}), 'cursor'+str(N))
check('done contract', solve('done', {'next':'next'+str(N),'items':[],'limit':20}), False)
check('empty contract', solve('empty', {'done':True,'items':[],'request':N}), [])
check('retry contract', solve('retry', {'failed':'failed'+str(N),'next':'next'}), 'failed'+str(N))
check('footer contract', solve('footer', {'rows':['existing','footer'],'page':['new'+str(N)]}), ['existing','new'+str(N),'footer'])
check('unknown operation', solve('unknown', {}), {'error': 'unsupported menu operation'})
check('retain earlier page', solve('append', {'old':[N-1,N], 'page':[N,N+1]}), [N-1,N,N+1])
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 |
|---|---|---|---|
| append contract | [1, 2] | [1, 2] | Passed |
| cursor contract | cursor1 | cursor1 | Passed |
| done contract | False | False | Passed |
| empty contract | [] | [] | Passed |
| retry contract | failed1 | failed1 | Passed |
| footer contract | ['existing', 'footer', 'new1'] | ['existing', 'new1', 'footer'] | Failed |
| unknown operation | {'error': 'unsupported menu operation'} | {'error': 'unsupported menu operation'} | Passed |
| retain earlier page | [0, 1, 2] | [0, 1, 2] | Passed |
SHA-256 / ff4da999eec52a9649cdf09937380c2c837fc031f0266ad83cd4ce6d5f391b09
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
import math
import unicodedata
N = 1
observations = []
def solve(action, p):
if action == 'append':
return p['old']+[x for x in p['page'] if x not in p['old']]
if action == 'cursor':
return p['next']
if action == 'done':
return p['next'] is None
if action == 'empty':
return [] if p['done'] and not p['items'] else p['items']
if action == 'retry':
return p['failed']
if action == 'footer':
return p['page']+p['rows']
return {'error': 'unsupported menu operation'}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('append contract', solve('append', {'old':[N],'page':[N,N+1]}), [N,N+1])
check('cursor contract', solve('cursor', {'next':'cursor'+str(N),'previous':'old','items':[1,2]}), 'cursor'+str(N))
check('done contract', solve('done', {'next':'next'+str(N),'items':[],'limit':20}), False)
check('empty contract', solve('empty', {'done':True,'items':[],'request':N}), [])
check('retry contract', solve('retry', {'failed':'failed'+str(N),'next':'next'}), 'failed'+str(N))
check('footer contract', solve('footer', {'rows':['existing','footer'],'page':['new'+str(N)]}), ['existing','new'+str(N),'footer'])
check('unknown operation', solve('unknown', {}), {'error': 'unsupported menu operation'})
check('retain earlier page', solve('append', {'old':[N-1,N], 'page':[N,N+1]}), [N-1,N,N+1])
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 |
|---|---|---|---|
| append contract | [1, 2] | [1, 2] | Passed |
| cursor contract | cursor1 | cursor1 | Passed |
| done contract | False | False | Passed |
| empty contract | [] | [] | Passed |
| retry contract | failed1 | failed1 | Passed |
| footer contract | ['new1', 'existing', 'footer'] | ['existing', 'new1', 'footer'] | Failed |
| unknown operation | {'error': 'unsupported menu operation'} | {'error': 'unsupported menu operation'} | Passed |
| retain earlier page | [0, 1, 2] | [0, 1, 2] | Passed |
SHA-256 / 69cde53a80dd4f4084c8417cbbde2ec51cb6b36ee8b2304d5c58d9eaf1b73096
3 / The verified repair
Exit 0"""Failure Map reference implementation. Python standard library only."""
import json
import math
import unicodedata
N = 1
observations = []
def solve(action, p):
if action == 'append':
return p['old']+[x for x in p['page'] if x not in p['old']]
if action == 'cursor':
return p['next']
if action == 'done':
return p['next'] is None
if action == 'empty':
return [] if p['done'] and not p['items'] else p['items']
if action == 'retry':
return p['failed']
if action == 'footer':
return p['rows'][:-1]+p['page']+[p['rows'][-1]]
return {'error': 'unsupported menu operation'}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('append contract', solve('append', {'old':[N],'page':[N,N+1]}), [N,N+1])
check('cursor contract', solve('cursor', {'next':'cursor'+str(N),'previous':'old','items':[1,2]}), 'cursor'+str(N))
check('done contract', solve('done', {'next':'next'+str(N),'items':[],'limit':20}), False)
check('empty contract', solve('empty', {'done':True,'items':[],'request':N}), [])
check('retry contract', solve('retry', {'failed':'failed'+str(N),'next':'next'}), 'failed'+str(N))
check('footer contract', solve('footer', {'rows':['existing','footer'],'page':['new'+str(N)]}), ['existing','new'+str(N),'footer'])
check('unknown operation', solve('unknown', {}), {'error': 'unsupported menu operation'})
check('retain earlier page', solve('append', {'old':[N-1,N], 'page':[N,N+1]}), [N-1,N,N+1])
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 |
|---|---|---|---|
| append contract | [1, 2] | [1, 2] | Passed |
| cursor contract | cursor1 | cursor1 | Passed |
| done contract | False | False | Passed |
| empty contract | [] | [] | Passed |
| retry contract | failed1 | failed1 | Passed |
| footer contract | ['existing', 'new1', 'footer'] | ['existing', 'new1', 'footer'] | Passed |
| unknown operation | {'error': 'unsupported menu operation'} | {'error': 'unsupported menu operation'} | Passed |
| retain earlier page | [0, 1, 2] | [0, 1, 2] | Passed |
SHA-256 / 5bfca9a8ddb800e3b119f9f1ba50be7331836d94de2996ce55181293459161f6
Verification & scope
Offline supplied-valid-payload model; excludes DOM, keyboard, focus, selection, announcements and browser 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:42:12.677943+00:00.
Case digest / 7fcb2409715c3b5fa7f71d08686decb8c6f91281541a73d0cd17544e067fd486