FAILURE MAP
← Case archive

FA-47951 / Delimited text / Open access

Unnamed columns receive zero-based fallback names · case 01

A structured table violates the declared record or column contract.

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

ROOT CAUSE

Fallback labels expose internal indexes rather than physical one-based positions.

VERIFIED REPAIR

Preserve the named invariant at the faulty decision: 'column' + str(i+1)

Unsuccessful approach: Using total width gives all empty positions the same base label.

Case contract

Assign unique output names to repeated raw column names. First occurrence keeps its name; later duplicates append _2, _3, etc, skipping names already present anywhere in the raw header and names already assigned. Empty raw names use column<one-based-position> before collision handling. Preserve order.

Why this case matters

Delimited interchange needs explicit framing, schema and field semantics at ingestion and emission boundaries.

1 / The failure

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json
def _vary(value):
    if value == '@END': return 3 + 4*N
    if isinstance(value, str): return value.replace('@', 'cell' * N)
    if isinstance(value, list): return [_vary(x) for x in value]
    if isinstance(value, dict): return {_vary(k): _vary(v) for k,v in value.items()}
    return value
N = 1
observations = []
def solve(data):
    raw = data.split(',')
    base = [name if name else 'column' + str(i) for i,name in enumerate(raw)]
    reserved, used, out = set(base), set(), []
    for name in base:
        candidate = name
        suffix = 2
        while candidate in used:
            candidate = name + '_' + str(suffix)
            suffix += 1
            while candidate in reserved:
                candidate = name + '_' + str(suffix)
                suffix += 1
        out.append(candidate)
        used.add(candidate)
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('duplicates', solve(_vary('@,@,@')), _vary(['@', '@_2', '@_3']))
check('reserved', solve(_vary('a,a,a_2')), _vary(['a', 'a_3', 'a_2']))
check('multiple reserves', solve(_vary('a,a,a_2,a_3')), _vary(['a', 'a_4', 'a_2', 'a_3']))
check('blanks', solve(_vary(',x,')), _vary(['column1', 'x', 'column3']))
check('ordinary', solve(_vary('a,b')), _vary(['a', 'b']))
check('nested base', solve(_vary('a,a,a_2,a_2')), _vary(['a', 'a_3', 'a_2', 'a_2_2']))
check('empty', solve(_vary('')), _vary(['column1']))
check('reserved generated', solve(_vary('column2,,column2')), _vary(['column2', 'column2_2', 'column2_3']))
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
duplicates['cell', 'cell_2', 'cell_3']['cell', 'cell_2', 'cell_3']Passed
reserved['a', 'a_3', 'a_2']['a', 'a_3', 'a_2']Passed
multiple reserves['a', 'a_4', 'a_2', 'a_3']['a', 'a_4', 'a_2', 'a_3']Passed
blanks['column0', 'x', 'column2']['column1', 'x', 'column3']Failed
ordinary['a', 'b']['a', 'b']Passed
nested base['a', 'a_3', 'a_2', 'a_2_2']['a', 'a_3', 'a_2', 'a_2_2']Passed
empty['column0']['column1']Failed
reserved generated['column2', 'column1', 'column2_2']['column2', 'column2_2', 'column2_3']Failed

SHA-256 / 7838436ae119af83b7c7528b4ca5ec214d0d5797356d05aa9bac822604e3314f

2 / The unsuccessful fix

Exit 1
"""Failure Map reference implementation. Python standard library only."""
import json
def _vary(value):
    if value == '@END': return 3 + 4*N
    if isinstance(value, str): return value.replace('@', 'cell' * N)
    if isinstance(value, list): return [_vary(x) for x in value]
    if isinstance(value, dict): return {_vary(k): _vary(v) for k,v in value.items()}
    return value
N = 1
observations = []
def solve(data):
    raw = data.split(',')
    base = [name if name else 'column' + str(len(raw)) for i,name in enumerate(raw)]
    reserved, used, out = set(base), set(), []
    for name in base:
        candidate = name
        suffix = 2
        while candidate in used:
            candidate = name + '_' + str(suffix)
            suffix += 1
            while candidate in reserved:
                candidate = name + '_' + str(suffix)
                suffix += 1
        out.append(candidate)
        used.add(candidate)
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('duplicates', solve(_vary('@,@,@')), _vary(['@', '@_2', '@_3']))
check('reserved', solve(_vary('a,a,a_2')), _vary(['a', 'a_3', 'a_2']))
check('multiple reserves', solve(_vary('a,a,a_2,a_3')), _vary(['a', 'a_4', 'a_2', 'a_3']))
check('blanks', solve(_vary(',x,')), _vary(['column1', 'x', 'column3']))
check('ordinary', solve(_vary('a,b')), _vary(['a', 'b']))
check('nested base', solve(_vary('a,a,a_2,a_2')), _vary(['a', 'a_3', 'a_2', 'a_2_2']))
check('empty', solve(_vary('')), _vary(['column1']))
check('reserved generated', solve(_vary('column2,,column2')), _vary(['column2', 'column2_2', 'column2_3']))
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
duplicates['cell', 'cell_2', 'cell_3']['cell', 'cell_2', 'cell_3']Passed
reserved['a', 'a_3', 'a_2']['a', 'a_3', 'a_2']Passed
multiple reserves['a', 'a_4', 'a_2', 'a_3']['a', 'a_4', 'a_2', 'a_3']Passed
blanks['column3', 'x', 'column3_2']['column1', 'x', 'column3']Failed
ordinary['a', 'b']['a', 'b']Passed
nested base['a', 'a_3', 'a_2', 'a_2_2']['a', 'a_3', 'a_2', 'a_2_2']Passed
empty['column1']['column1']Passed
reserved generated['column2', 'column3', 'column2_2']['column2', 'column2_2', 'column2_3']Failed

SHA-256 / 75ea31fe5c28f9e135c5df4acfa4784c3a0bf5d43dbaf61d3cd348a05e13a44e

3 / The verified repair

Exit 0
"""Failure Map reference implementation. Python standard library only."""
import json
def _vary(value):
    if value == '@END': return 3 + 4*N
    if isinstance(value, str): return value.replace('@', 'cell' * N)
    if isinstance(value, list): return [_vary(x) for x in value]
    if isinstance(value, dict): return {_vary(k): _vary(v) for k,v in value.items()}
    return value
N = 1
observations = []
def solve(data):
    raw = data.split(',')
    base = [name if name else 'column' + str(i+1) for i,name in enumerate(raw)]
    reserved, used, out = set(base), set(), []
    for name in base:
        candidate = name
        suffix = 2
        while candidate in used:
            candidate = name + '_' + str(suffix)
            suffix += 1
            while candidate in reserved:
                candidate = name + '_' + str(suffix)
                suffix += 1
        out.append(candidate)
        used.add(candidate)
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('duplicates', solve(_vary('@,@,@')), _vary(['@', '@_2', '@_3']))
check('reserved', solve(_vary('a,a,a_2')), _vary(['a', 'a_3', 'a_2']))
check('multiple reserves', solve(_vary('a,a,a_2,a_3')), _vary(['a', 'a_4', 'a_2', 'a_3']))
check('blanks', solve(_vary(',x,')), _vary(['column1', 'x', 'column3']))
check('ordinary', solve(_vary('a,b')), _vary(['a', 'b']))
check('nested base', solve(_vary('a,a,a_2,a_2')), _vary(['a', 'a_3', 'a_2', 'a_2_2']))
check('empty', solve(_vary('')), _vary(['column1']))
check('reserved generated', solve(_vary('column2,,column2')), _vary(['column2', 'column2_2', 'column2_3']))
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
duplicates['cell', 'cell_2', 'cell_3']['cell', 'cell_2', 'cell_3']Passed
reserved['a', 'a_3', 'a_2']['a', 'a_3', 'a_2']Passed
multiple reserves['a', 'a_4', 'a_2', 'a_3']['a', 'a_4', 'a_2', 'a_3']Passed
blanks['column1', 'x', 'column3']['column1', 'x', 'column3']Passed
ordinary['a', 'b']['a', 'b']Passed
nested base['a', 'a_3', 'a_2', 'a_2_2']['a', 'a_3', 'a_2', 'a_2_2']Passed
empty['column1']['column1']Passed
reserved generated['column2', 'column2_2', 'column2_3']['column2', 'column2_2', 'column2_3']Passed

SHA-256 / fb4f4c33c5e2de48d6932ee009ec47fcbfbb0b5994c9917f6343315548438bfe

Verification & scope

Deterministic bounded in-memory model. No claim of complete CSV or external format 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:44:46.356861+00:00.

Case digest / e32f8e807692a9d257d72490a40e1c10111ea03eba5952662c8cba953aacf0d3