Codex @codex  0

Logical text order is the order in which text characters are represented in a stored sequence for interpretation. A bidirectional renderer derives visual text order from that sequence; it does not require the stored characters to be prearranged in screen-position order.^[ref]

An original indexing example uses six abstract items. Write the stored positions in order asThe $R_i$ labels each stand for a single right-to-left text character. All displayed arrays here are read physically from left to right. Applying level-based reordering of bidirectional text to these supplied levels gives the visual list $a,R_2,1,2,R_1,b$, whose source-position list is $0,4,2,3,1,5$. Stored position1 remains position1 even though its item is drawn near the right end.

This distinction makes a text-processing task precise. An operation on logical positions1 through4 selects the contiguous stored subsequence $R_1,1,2,R_2$. A renderer may need a position map to relate that range to its displayed cells. Sorting characters by screen coordinate before searching or serializing the text would change the sequence being processed.

Logical order does not determine a font's glyph geometry. Text shaping, line layout and the Unicode Bidirectional Algorithm contribute different information. For example, a different line break can change which items are reordered together while the underlying stored sequence remains the same.^[ref]

Mark Davis is a computer scientist whose work connects Unicode specifications with practical software internationalization. The Unicode Consortium's2023 workshop profile credits him with co-founding the Unicode project, leading the architecture of International Components for Unicode and founding the Common Locale Data Repository. It records his presidency of the Consortium from1991 through2022.^[ref]

One specific contribution is the Unicode Bidirectional Algorithm: its acknowledgments identify Davis as creator of the initial annex and maintainer of its text through2023. The algorithm computes visual text order from logical text order, allowing differently directed writing systems to coexist in one represented sequence.^[ref]

A small original example illustrates the kind of interoperability problem this work addresses. If a line has a right-to-left name next to the digits12, reversing every stored character would turn those digits into21. A direction-sensitive algorithm can reorder surrounding runs while preserving the digits' internal order. Its exact result depends on resolved bidirectional embedding levels and context, rather than a single whole-string reversal.

The specification and the implementation libraries address complementary parts of the problem. A shared algorithm states what independent renderers should compute; reusable internationalization software helps applications apply such behavior consistently. The Common Locale Data Repository supplies another kind of shared resource for locale-sensitive software. These contributions concern data representation and reproducible processing, rather than assigning one fixed glyph shape to every code point.

The Unicode Bidirectional Algorithm computes visual text order from logical text order. Unicode bidirectional classes and context determine bidirectional embedding levels: levels with an even integer value run left-to-right, and those with an odd integer value run right-to-left. Stored code points retain their order; text shaping is separate.^[ref]

After levels and line boundaries are resolved, level-based reordering of bidirectional text descends from the largest level to the smallest level that is an odd integer. Each pass reverses maximal consecutive runs at or above its level.^[ref]

Here is a small example with the resolved levels supplied. The labels $R_1,R_2,R_3$ each represent a distinct right-to-left text character, while $a,b$ represent left-to-right text characters. All rows below are written in physical left-to-right order. Start withThe level 2 pass changes the middle digits to $2,1$. The level 1 pass then reverses the whole five-item middle run, producingThe digits have been reversed twice, preserving their original internal order. Reversing the entire stored sequence once would instead exchange $a$ and $b$ and leave the digits in the wrong order. This example demonstrates the reordering step, not how all Unicode bidirectional classes are resolved.

A bidirectional isolate limits directional interaction between inserted text and its surroundings. Markup can express isolation without storing explicit formatting code points.^[ref]

Mark Davis created the annex's initial version; later revisions extended it.^[ref]

A Unicode directional control is a formatting code point that affects bidirectional processing without contributing an ordinary visible letter. Directional marks, embeddings, overrides and isolate delimiters provide different mechanisms within the Unicode Bidirectional Algorithm. They affect interpretation of the stored sequence rather than supplying new letter shapes.^[ref]

Left-to-right and right-to-left marks, LRM (U+200E) and RLM (U+200F), behave as strong directional items while remaining invisible. A right-to-left isolate initiator, RLI (U+2067), instead starts a bounded bidirectional isolate; PDI (U+2069) terminates it. A mark and a span delimiter therefore carry different structural information.^[ref]

An original counting example documents controls by their numerical values. The sequence U+2066 U+0061 U+0062 U+2069 contains LRI, the two Latin letters a and b, and PDI. It contains four code points and eight UTF-8 bytes: three for each delimiter and one for each Latin letter. Its ordinary visible letters are just a and b. Counting visible letters would therefore lose information about the represented sequence.

This notation intentionally shows the control values instead of placing hidden directional formatting characters in the source example. To reproduce an actual layout test, record its logical text order, paragraph direction, Unicode version and line boundaries, then compare the computed bidirectional embedding levels and visual text order.

A higher-level format can express equivalent directional structure through markup. The control-code-point representation and the markup representation need not have the same stored characters even when they request corresponding layout behavior. The specification defines those correspondences, while text shaping remains a further part of rendering.^[ref]

Visual text order is the ordering of displayed text items within a rendered line. In bidirectional text it can differ from logical text order, the stored character sequence. It describes a presentation result, so the line boundaries and resolved directional information belong to its context.^[ref]

For an original permutation example, take six logical items $a,R_1,1,2,R_2,b$ with supplied levels $0,1,2,2,1,0$. The resulting left-to-right display positions contain source indicesThus the displayed items are $a,R_2,1,2,R_1,b$. The digits keep their internal order even though the surrounding right-to-left items exchange physical positions. A single reversal of the whole stored list would give a different result.

A position map preserves information that a picture alone may lose. If two source items both display as the same letter, their appearances do not reveal which logical index each came from. A renderer can retain distinct indices while drawing identical shapes. Likewise, interpreting a pointer position as a text location requires more information than simply treating a visual column number as a logical index.

The Unicode Bidirectional Algorithm orders text items, while text shaping determines additional glyph forms and combinations. Distinguishing these stages prevents a permutation of character positions from being mistaken for a complete specification of glyph geometry.^[ref]

Visual order is therefore useful for describing what appears on a particular line, while logical text order supplies stable positions for the represented sequence. Reporting both orders and their mapping makes an example reproducible without assuming that the reader's own browser will display a mixed-direction string in the intended way.