Struct WidgetInlineInfo 

#[non_exhaustive]
pub struct WidgetInlineInfo {
    pub rows: Vec<Rect<Px, Px>>,
    pub first_segs: Vec<InlineSegmentInfo>,
    pub last_segs: Vec<InlineSegmentInfo>,
    pub inner_size: Size2D<Px, Px>,
    /* private fields */
}

Info about the inlined rows of the widget.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

rows: Vec<Rect<Px, Px>>

Last layout rows of the widget.

The rectangles are in the widget’s inner space, from top to bottom.

first_segs: Vec<InlineSegmentInfo>

Segments of the first row.

If this is empty the entire row width is a continuous segment, otherwise the row is segmented and the widget can be interleaved with sibling widgets due to Unicode bidirectional text sorting algorithm.

Note that the segment count may be less then WidgetInlineMeasure::first_segs as contiguous segments may be merged.

The segments are from left to right.

last_segs: Vec<InlineSegmentInfo>

Segments of the last row.

inner_size: Size2D<Px, Px>

Widget inner size when the rows where last updated.

Implementations

impl WidgetInlineInfo

pub fn set_first_segs(&mut self, segs: impl Iterator<Item = InlineSegmentInfo>)

Replace the first_segs with segs.

The segments are sorted when needed, but prefer inputs that are mostly sorted.

The segments are merged when there is no gap or there is a small one pixel overlap to the previous segment.

pub fn set_last_segs(&mut self, segs: impl Iterator<Item = InlineSegmentInfo>)

Replace the last_segs with segs.

The segments are sorted when needed, but prefer inputs that are mostly sorted.

The segments are merged when there is no gap or there is a small one pixel overlap to the previous segment.

pub fn union(&self) -> Rect<Px, Px>

Gets the union of all row rectangles.

pub fn negative_space(&self) -> Arc<Vec<Rect<Px, Px>>>

Gets or computes the negative space of the rows in the inner_size space, that is, all the areas that are not covered by any row and not covered by the first and last row segments.

This is computed on demand and cached.

pub fn invalidate_negative_space(&mut self)

Invalidates the negative_space cache.

pub fn clear(&mut self)

Return info to default state, but retain memory for reuse.

pub fn is_default(&self) -> bool

If all value are not different from initial.

This indicates the widget has not handled the inline config yet.

Trait Implementations

impl Clone for WidgetInlineInfo

fn clone(&self) -> WidgetInlineInfo

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WidgetInlineInfo

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

Formats the value using the given formatter.

impl Default for WidgetInlineInfo

fn default() -> WidgetInlineInfo

Returns the “default value” for a type.

impl PartialEq for WidgetInlineInfo

fn eq(&self, other: &WidgetInlineInfo) -> 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.