Struct LayoutPriority 

pub struct LayoutPriority(/* private fields */);

How strongly a view holds on to space when its container runs short.

A stack takes space from its lowest-priority children first, and only starts on the next band up once every child below sits at the minimum it reports. Ties share the shortfall. Defaults to 0, so raising one child’s priority is enough to protect it.

Implementations

impl LayoutPriority

pub const fn new(priority: i32) -> LayoutPriority

Wraps a raw priority.

pub const fn get(self) -> i32

The raw priority.

Trait Implementations

impl Clone for LayoutPriority

fn clone(&self) -> LayoutPriority

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for LayoutPriority

impl Debug for LayoutPriority

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

Formats the value using the given formatter.

impl Default for LayoutPriority

fn default() -> LayoutPriority

Returns the “default value” for a type.

impl Eq for LayoutPriority

impl MetadataKey for LayoutPriority

impl PartialEq for LayoutPriority

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for LayoutPriority