Skip to main content

LinearArrangement

Enum LinearArrangement 

Source
pub enum LinearArrangement {
    Start,
    End,
    Center,
    SpaceBetween,
    SpaceAround,
    SpaceEvenly,
    SpacedBy(f32),
}
Expand description

Arrangement strategy matching Jetpack Compose’s linear arrangements.

Variants§

§

Start

Place children consecutively starting from the leading edge.

§

End

Place children so the last child touches the trailing edge.

§

Center

Place children so they are centered as a block.

§

SpaceBetween

Distribute the remaining space evenly between children.

§

SpaceAround

Distribute the remaining space before, after, and between children.

§

SpaceEvenly

Distribute the remaining space before the first child, between children, and after the last child.

§

SpacedBy(f32)

Insert a fixed amount of space between children.

Implementations§

Source§

impl LinearArrangement

Source

pub fn spaced_by(spacing: f32) -> LinearArrangement

Creates an arrangement that inserts a fixed spacing between children.

Trait Implementations§

Source§

impl Arrangement for LinearArrangement

Source§

fn arrange(&self, total_size: f32, sizes: &[f32], out_positions: &mut [f32])

Computes the position for each child given the available space and their sizes.
Source§

impl Clone for LinearArrangement

Source§

fn clone(&self) -> LinearArrangement

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for LinearArrangement

Source§

impl Debug for LinearArrangement

Source§

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

Formats the value using the given formatter. Read more
Source§

impl PartialEq for LinearArrangement

Source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

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

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

impl StructuralPartialEq for LinearArrangement

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.