Struct kas_core::layout::RowSetter

pub struct RowSetter<D, T: RowTemp, S: RowStorage> { /* private fields */ }

A RulesSetter for rows (and, without loss of generality, for columns).

This is parameterised over:

• D: Directional — whether this represents a row or a column
• T: RowTemp — temporary storage type
• S: RowStorage — persistent storage type

Implementations

impl<D: Directional, T: RowTemp, S: RowStorage> RowSetter<D, T, S>

pub fn new(rect: Rect, (direction, len): (D, usize), storage: &mut S) -> Self

Construct

Argument order is consistent with other RulesSetters.

• rect: the Rect within which to position children
• (direction, len): direction and number of items
• storage: access to the solver’s storage

pub fn new_unsolved( rect: Rect, (direction, len): (D, usize), storage: &mut S ) -> Self

Construct without solving

In this case, it is assumed that the storage was already solved by a previous RowSetter. The user should optionally call solve_range on any ranges needing updating and finally call update_offsets before using this RowSetter to calculate child positions.

pub fn update_offsets(&mut self, storage: &mut S)

pub fn solve_range(&mut self, storage: &mut S, range: Range<usize>, width: i32)

Trait Implementations

impl<D: Directional, T: RowTemp, S: RowStorage> RulesSetter for RowSetter<D, T, S>

type Storage = S

Type of storage

type ChildInfo = usize

Type required by RulesSolver::for_child (see implementation documentation)

fn child_rect( &mut self, storage: &mut Self::Storage, index: Self::ChildInfo ) -> Rect

Called once for each child. The order is unimportant.

fn maximal_rect_of( &mut self, storage: &mut Self::Storage, index: Self::ChildInfo ) -> Rect

Calculates the maximal rect of a given child