FA-33441 / Menu interactions / Open access
Sequential anchor insertion reverses contributed menu rows · case 01
Sequential anchor insertion reverses contributed menu rows.
ROOT CAUSE
The contribution-anchors model applies `p['rows'][:p['at']]+list(reversed(p['batch']))+p['rows'][p['at']:]` at its batch-order operation instead of the stipulated transformation.
VERIFIED REPAIR
Apply `p['rows'][:p['at']]+p['batch']+p['rows'][p['at']:]` at batch-order.
Unsuccessful approach: The attempted repair `p['batch']+p['rows']` still violates the batch-order oracle.
Case contract
Menu contribution placement uses named before/after anchors and stable fallback slots; the before anchor owns precedence when both are supplied.
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 == 'before':
return p['rows'][:p['rows'].index(p['anchor'])]+[p['id']]+p['rows'][p['rows'].index(p['anchor']):]
if action == 'fallback-slot':
return p['slots'].get(p['requested'],p['slots']['default'])
if action == 'anchor-owner':
return (p['provider'],p['local'])
if action == 'before-precedence':
return p['before'] if p['before'] is not None else p['after']
if action == 'batch-order':
return p['rows'][:p['at']]+list(reversed(p['batch']))+p['rows'][p['at']:]
if action == 'self-anchor':
return p['id']!=p['anchor']
return {'error': 'unsupported menu operation'}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('before contract', solve('before', {'rows':['a','b'],'anchor':'b','id':N}), ['a',N,'b'])
check('fallback-slot contract', solve('fallback-slot', {'requested':'missing','slots':{'default':N+4,'start':0}}), N+4)
check('anchor-owner contract', solve('anchor-owner', {'provider':'p'+str(N),'local':'tools'}), ('p'+str(N),'tools'))
check('before-precedence contract', solve('before-precedence', {'before':N,'after':N+1}), N)
check('batch-order contract', solve('batch-order', {'rows':['a','b'],'at':1,'batch':[N,N+1]}), ['a',N,N+1,'b'])
check('self-anchor contract', solve('self-anchor', {'id':N,'anchor':N,'registered':[N]}), False)
check('unknown operation', solve('unknown', {}), {'error': 'unsupported menu operation'})
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 |
|---|---|---|---|
| before contract | ['a', 1, 'b'] | ['a', 1, 'b'] | Passed |
| fallback-slot contract | 5 | 5 | Passed |
| anchor-owner contract | ['p1', 'tools'] | ['p1', 'tools'] | Passed |
| before-precedence contract | 1 | 1 | Passed |
| batch-order contract | ['a', 2, 1, 'b'] | ['a', 1, 2, 'b'] | Failed |
| self-anchor contract | False | False | Passed |
| unknown operation | {'error': 'unsupported menu operation'} | {'error': 'unsupported menu operation'} | Passed |
SHA-256 / 20aca6739d789ae0ed2cc3a97f2c3733d5e5e858befe08e37bfa9bbf660be2ea
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 == 'before':
return p['rows'][:p['rows'].index(p['anchor'])]+[p['id']]+p['rows'][p['rows'].index(p['anchor']):]
if action == 'fallback-slot':
return p['slots'].get(p['requested'],p['slots']['default'])
if action == 'anchor-owner':
return (p['provider'],p['local'])
if action == 'before-precedence':
return p['before'] if p['before'] is not None else p['after']
if action == 'batch-order':
return p['batch']+p['rows']
if action == 'self-anchor':
return p['id']!=p['anchor']
return {'error': 'unsupported menu operation'}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('before contract', solve('before', {'rows':['a','b'],'anchor':'b','id':N}), ['a',N,'b'])
check('fallback-slot contract', solve('fallback-slot', {'requested':'missing','slots':{'default':N+4,'start':0}}), N+4)
check('anchor-owner contract', solve('anchor-owner', {'provider':'p'+str(N),'local':'tools'}), ('p'+str(N),'tools'))
check('before-precedence contract', solve('before-precedence', {'before':N,'after':N+1}), N)
check('batch-order contract', solve('batch-order', {'rows':['a','b'],'at':1,'batch':[N,N+1]}), ['a',N,N+1,'b'])
check('self-anchor contract', solve('self-anchor', {'id':N,'anchor':N,'registered':[N]}), False)
check('unknown operation', solve('unknown', {}), {'error': 'unsupported menu operation'})
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 |
|---|---|---|---|
| before contract | ['a', 1, 'b'] | ['a', 1, 'b'] | Passed |
| fallback-slot contract | 5 | 5 | Passed |
| anchor-owner contract | ['p1', 'tools'] | ['p1', 'tools'] | Passed |
| before-precedence contract | 1 | 1 | Passed |
| batch-order contract | [1, 2, 'a', 'b'] | ['a', 1, 2, 'b'] | Failed |
| self-anchor contract | False | False | Passed |
| unknown operation | {'error': 'unsupported menu operation'} | {'error': 'unsupported menu operation'} | Passed |
SHA-256 / 5b0e07fe8167128ca731498f817bc0128dc2d2f50dd4849851f36c2df29662c5
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 == 'before':
return p['rows'][:p['rows'].index(p['anchor'])]+[p['id']]+p['rows'][p['rows'].index(p['anchor']):]
if action == 'fallback-slot':
return p['slots'].get(p['requested'],p['slots']['default'])
if action == 'anchor-owner':
return (p['provider'],p['local'])
if action == 'before-precedence':
return p['before'] if p['before'] is not None else p['after']
if action == 'batch-order':
return p['rows'][:p['at']]+p['batch']+p['rows'][p['at']:]
if action == 'self-anchor':
return p['id']!=p['anchor']
return {'error': 'unsupported menu operation'}
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('before contract', solve('before', {'rows':['a','b'],'anchor':'b','id':N}), ['a',N,'b'])
check('fallback-slot contract', solve('fallback-slot', {'requested':'missing','slots':{'default':N+4,'start':0}}), N+4)
check('anchor-owner contract', solve('anchor-owner', {'provider':'p'+str(N),'local':'tools'}), ('p'+str(N),'tools'))
check('before-precedence contract', solve('before-precedence', {'before':N,'after':N+1}), N)
check('batch-order contract', solve('batch-order', {'rows':['a','b'],'at':1,'batch':[N,N+1]}), ['a',N,N+1,'b'])
check('self-anchor contract', solve('self-anchor', {'id':N,'anchor':N,'registered':[N]}), False)
check('unknown operation', solve('unknown', {}), {'error': 'unsupported menu operation'})
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 |
|---|---|---|---|
| before contract | ['a', 1, 'b'] | ['a', 1, 'b'] | Passed |
| fallback-slot contract | 5 | 5 | Passed |
| anchor-owner contract | ['p1', 'tools'] | ['p1', 'tools'] | Passed |
| before-precedence contract | 1 | 1 | Passed |
| batch-order contract | ['a', 1, 2, 'b'] | ['a', 1, 2, 'b'] | Passed |
| self-anchor contract | False | False | Passed |
| unknown operation | {'error': 'unsupported menu operation'} | {'error': 'unsupported menu operation'} | Passed |
SHA-256 / 0614ffda1ef68fe8a39545107f5555f7a85446f2168eab25c02a22e423d50f89
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:22.396975+00:00.
Case digest / b95008ff14dab15bc1da7b30755f03950a190361b5270d527e9ccec7bb92fb44