pub enum RunOrder {
AlreadyVisual,
Logical(TextDirection),
}Expand description
How break_into_lines should treat the order of the runs it is given.
The two layout paths differ here and getting it wrong reverses text twice. The single-line path runs the bidi algorithm itself and shapes in display order, so its runs must be left alone; the block path hands over logical-order runs tagged with embedding levels and needs each line reordered once the breaks are known.
Variants§
AlreadyVisual
Runs already arrive in visual order — do not reorder them.
Logical(TextDirection)
Runs are in logical order; reorder each line per UAX #9 rule L2,
and resolve Start/End alignment against this base direction.
Trait Implementations§
impl Copy for RunOrder
impl Eq for RunOrder
impl StructuralPartialEq for RunOrder
Auto Trait Implementations§
impl Freeze for RunOrder
impl RefUnwindSafe for RunOrder
impl Send for RunOrder
impl Sync for RunOrder
impl Unpin for RunOrder
impl UnsafeUnpin for RunOrder
impl UnwindSafe for RunOrder
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.