FA-80477 / Bidirectional text layout / Member archive

Visual reordering by levels: reversal loop bound · case 02

Runs at the lowest odd level stay in logical order.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

Input resolved levels of one line. From the highest level down to the lowest odd level on the line, reverse every maximal visual run of characters at that level or higher. Return logical indices in visual order (identity when no odd level).

Why this case matters

Mixed right-to-left and left-to-right text must resolve levels and visual order exactly, or words, numbers and carets land in the wrong place.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
regression: reversal loop bound	`[0, 1, 2, 3, 4, 5]`	`[5, 4, 3, 2, 1, 0]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.