MORX–6: Re-Re-Re-Rearrangements

The font for this test case is the same as in MORX-4. When rendering the test string OOOABCDEFGOOO3141, the following should happen:

Upon processing the three initial O glyphs, the finite-state automaton performs no special actions beyond consuming the input symbols.
Upon processing the A glyph, the rendering engine remembers the position of the current glyph as start and end of the marked glyph sequence. Afterwards, the marked glyph sequence is A.
Upon processing the B, C, D, E, F, and G glyphs, the rendering engine sets the current position as end of the marked glyph sequence. After processing G, the marked glyph sequence is ABCDEFG.
When processing the three following O glyphs, the finite-state automaton again performs no special actions, apart from consuming the input symbols.
When processing the 3 glyph, the finite-state automaton executes Rearrangement action 3. This action exchanges the first and last glyph of the marked sequence. Afterwards, the marked glyph sequence is GBCDEFA.
When processing the 1 glyph, the finite-state automaton executes Rearrangement action 1. This action moves the first glyph of the marked sequence (G) to the end. Afterwards, the marked sequence is BCDEFAG.
When processing the 4 glyph, the finite-state automaton executes Rearrangement action 4. This action moves the first two marked glyphs (BC) to the end. Afterwards, the marked sequence is DEFAGBC.
When processing the 1 glyph, the finite-state automaton executes Rearrangement action 1. This action moves the first glyph of the marked sequence (D) to the end. Afterwards, the marked sequence is EFAGBCD.

If your implementation supports Apple Advanced Typography, the text should get rearranged as expected. If the resulting string is ordered as ABCDEFG, your implementation does not implement AAT at all. If the result is ordered as GBCDEFA, your implementation incorrectly clears the marked glyph sequence after executing actions.

Expected
Observed
Conformance