Enum LineBreakAlgorithm 

pub enum LineBreakAlgorithm {
    Greedy,
    Optimal,
    Fixed(u8),
}

Which algorithm to use when breaking caption text into lines.

Variants

Greedy

Break at the last space before max_width.

Optimal

Dynamic-programming algorithm that minimises raggedness (Knuth-Plass inspired): cost(line) = (max_width - used_width)^2.

Fixed(u8)

Every line is exactly u8 characters wide (hard wrap, no splitting of words).

Trait Implementations

impl Clone for LineBreakAlgorithm

fn clone(&self) -> LineBreakAlgorithm

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LineBreakAlgorithm

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for LineBreakAlgorithm

fn eq(&self, other: &LineBreakAlgorithm) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for LineBreakAlgorithm