FAILURE MAP
← Case archive

FA-8651 / Client navigation / Open access

Breadcrumb ancestor rendering: The current breadcrumb is exposed as a navigation link · case 01

The current breadcrumb is exposed as a navigation link.

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

ROOT CAUSE

The current link operation uses `True` where the contract requires `i != len(chain)-1`.

VERIFIED REPAIR

Implement the current link operation as `i != len(chain)-1`.

Unsuccessful approach: Disabling every link prevents ancestor navigation.

Case contract

Append current after ancestors; optionally hide a distinct root; collapse long paths preserving root and recent tail within budget; only ancestors are links. Budget is at least two.

Why this case matters

A deterministic model of breadcrumb ancestor rendering; this isolates one interface invariant without requiring a browser.

1 / The failure

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(ancestors, current, max_items, include_root):
    chain = list(ancestors) + [current]
    if not include_root and len(chain) > 1: chain = chain[1:]
    if len(chain) > max_items:
        chain = [chain[0], '…'] + chain[-(max_items-2):] if max_items > 2 else chain[-max_items:]
    return [(x, True) for i, x in enumerate(chain)]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('normal', solve(['root','parent'], 'current', 5, True), [('root', True), ('parent', True), ('current', False)])
check('only current', solve([], 'current', 5, False), [('current', False)])
check('hide root', solve(['root','parent'], 'current', 5, False), [('parent', True), ('current', False)])
check('collapsed', solve(['root','a','b','c'], 'current', 4, True), [('root', True), ('…', True), ('c', True), ('current', False)])
check('small budget', solve(['root','a','b'], 'current', 2, True), [('b', True), ('current', False)])
check('parameterized ancestor depth', solve(list(range(N)),N,N+2,True), [(i,i!=N) for i in range(N+1)])
for repetition in range(N):
    check('repeat small budget', solve(['root','a','b'], 'current', 2, True), [('b', True), ('current', False)])
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[['root', True], ['parent', True], ['current', True]][['root', True], ['parent', True], ['current', False]]Failed
only current[['current', True]][['current', False]]Failed
hide root[['parent', True], ['current', True]][['parent', True], ['current', False]]Failed
collapsed[['root', True], ['…', True], ['c', True], ['current', True]][['root', True], ['…', True], ['c', True], ['current', False]]Failed
small budget[['b', True], ['current', True]][['b', True], ['current', False]]Failed
parameterized ancestor depth[[0, True], [1, True]][[0, True], [1, False]]Failed
repeat small budget[['b', True], ['current', True]][['b', True], ['current', False]]Failed

SHA-256 / e663993e58f3bbd8e5733405a1d4e65742cf415b75bf0900c4aa5cd5f76888d0

2 / The unsuccessful fix

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(ancestors, current, max_items, include_root):
    chain = list(ancestors) + [current]
    if not include_root and len(chain) > 1: chain = chain[1:]
    if len(chain) > max_items:
        chain = [chain[0], '…'] + chain[-(max_items-2):] if max_items > 2 else chain[-max_items:]
    return [(x, False) for i, x in enumerate(chain)]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('normal', solve(['root','parent'], 'current', 5, True), [('root', True), ('parent', True), ('current', False)])
check('only current', solve([], 'current', 5, False), [('current', False)])
check('hide root', solve(['root','parent'], 'current', 5, False), [('parent', True), ('current', False)])
check('collapsed', solve(['root','a','b','c'], 'current', 4, True), [('root', True), ('…', True), ('c', True), ('current', False)])
check('small budget', solve(['root','a','b'], 'current', 2, True), [('b', True), ('current', False)])
check('parameterized ancestor depth', solve(list(range(N)),N,N+2,True), [(i,i!=N) for i in range(N+1)])
for repetition in range(N):
    check('repeat small budget', solve(['root','a','b'], 'current', 2, True), [('b', True), ('current', False)])
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[['root', False], ['parent', False], ['current', False]][['root', True], ['parent', True], ['current', False]]Failed
only current[['current', False]][['current', False]]Passed
hide root[['parent', False], ['current', False]][['parent', True], ['current', False]]Failed
collapsed[['root', False], ['…', False], ['c', False], ['current', False]][['root', True], ['…', True], ['c', True], ['current', False]]Failed
small budget[['b', False], ['current', False]][['b', True], ['current', False]]Failed
parameterized ancestor depth[[0, False], [1, False]][[0, True], [1, False]]Failed
repeat small budget[['b', False], ['current', False]][['b', True], ['current', False]]Failed

SHA-256 / f07bfff7b6a71523d38b77858b8d2d23edb41a15e1d2b502c0a063f5a737e6c3

3 / The verified repair

Exit 0
"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(ancestors, current, max_items, include_root):
    chain = list(ancestors) + [current]
    if not include_root and len(chain) > 1: chain = chain[1:]
    if len(chain) > max_items:
        chain = [chain[0], '…'] + chain[-(max_items-2):] if max_items > 2 else chain[-max_items:]
    return [(x, i != len(chain)-1) for i, x in enumerate(chain)]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('normal', solve(['root','parent'], 'current', 5, True), [('root', True), ('parent', True), ('current', False)])
check('only current', solve([], 'current', 5, False), [('current', False)])
check('hide root', solve(['root','parent'], 'current', 5, False), [('parent', True), ('current', False)])
check('collapsed', solve(['root','a','b','c'], 'current', 4, True), [('root', True), ('…', True), ('c', True), ('current', False)])
check('small budget', solve(['root','a','b'], 'current', 2, True), [('b', True), ('current', False)])
check('parameterized ancestor depth', solve(list(range(N)),N,N+2,True), [(i,i!=N) for i in range(N+1)])
for repetition in range(N):
    check('repeat small budget', solve(['root','a','b'], 'current', 2, True), [('b', True), ('current', False)])
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[['root', True], ['parent', True], ['current', False]][['root', True], ['parent', True], ['current', False]]Passed
only current[['current', False]][['current', False]]Passed
hide root[['parent', True], ['current', False]][['parent', True], ['current', False]]Passed
collapsed[['root', True], ['…', True], ['c', True], ['current', False]][['root', True], ['…', True], ['c', True], ['current', False]]Passed
small budget[['b', True], ['current', False]][['b', True], ['current', False]]Passed
parameterized ancestor depth[[0, True], [1, False]][[0, True], [1, False]]Passed
repeat small budget[['b', True], ['current', False]][['b', True], ['current', False]]Passed

SHA-256 / 79f38268100ff14c1a921590c22065845992721ca98b6bdd49a81bc14435034c

Verification & scope

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

Case digest / 3d86d80048b263f15437cc392decb0846511ab1a12d341bf4b57e40b24046499