pub struct Constraint {
pub width: DimensionValue,
pub height: DimensionValue,
}
Expand description
Represents layout constraints for a component node.
A Constraint
combines width and height dimension values to provide
complete layout specification for a component. It defines how a component
should size itself in both dimensions and provides methods for merging
constraints in a component hierarchy.
§Examples
// A button with fixed size
let button_constraint = Constraint::new(
DimensionValue::Fixed(Px(120)),
DimensionValue::Fixed(Px(40))
);
// A flexible container that fills width but wraps height
let container_constraint = Constraint::new(
DimensionValue::Fill { min: Some(Px(200)), max: None },
DimensionValue::Wrap { min: None, max: None }
);
// A text component with bounded wrapping
let text_constraint = Constraint::new(
DimensionValue::Wrap { min: Some(Px(100)), max: Some(Px(400)) },
DimensionValue::Wrap { min: None, max: None }
);
Fields§
§width: DimensionValue
The width dimension constraint
height: DimensionValue
The height dimension constraint
Implementations§
Source§impl Constraint
impl Constraint
Sourcepub const NONE: Self
pub const NONE: Self
A constraint that specifies no preference (Wrap { None, None } for both width and height).
This constant represents the most flexible constraint possible, where a component will size itself to its content without any bounds. It’s equivalent to the default constraint and is useful as a starting point for constraint calculations.
§Example
let flexible = Constraint::NONE;
assert_eq!(flexible.width, DimensionValue::Wrap { min: None, max: None });
assert_eq!(flexible.height, DimensionValue::Wrap { min: None, max: None });
Sourcepub fn new(width: DimensionValue, height: DimensionValue) -> Self
pub fn new(width: DimensionValue, height: DimensionValue) -> Self
Creates a new constraint with the specified width and height dimensions.
This is the primary constructor for creating constraint instances.
§Parameters
width
: The dimension value for the width constraintheight
: The dimension value for the height constraint
§Example
let constraint = Constraint::new(
DimensionValue::Fixed(Px(100)),
DimensionValue::Fill { min: Some(Px(50)), max: None }
);
Sourcepub fn merge(&self, parent_constraint: &Constraint) -> Self
pub fn merge(&self, parent_constraint: &Constraint) -> Self
Merges this constraint with a parent constraint to resolve layout conflicts.
This method implements the core constraint resolution algorithm used throughout Tessera’s layout system. When components are nested, their constraints must be merged to ensure consistent and predictable layout behavior.
§Merge Rules
The merging follows a priority system designed to respect component intentions while ensuring layout consistency:
§Fixed Constraints (Highest Priority)
- Fixed always wins: A fixed constraint cannot be overridden by its parent
- Fixed dimensions maintain their exact size regardless of available space
§Wrap Constraints (Content-Based)
- Preserves content sizing: Wrap constraints maintain their intrinsic sizing behavior
- When parent is Fixed: Child wraps within parent’s fixed bounds
- When parent is Wrap: Child combines min/max constraints with parent
- When parent is Fill: Child wraps within parent’s fill bounds
§Fill Constraints (Space-Filling)
- Adapts to available space: Fill constraints expand within parent bounds
- When parent is Fixed: Child fills parent’s fixed space (respecting own min/max)
- When parent is Wrap: Child fills available space within parent’s wrap bounds
- When parent is Fill: Child combines fill constraints with parent
§Parameters
parent_constraint
: The constraint from the parent component
§Returns
A new constraint that represents the resolved layout requirements
§Examples
// Fixed child in fixed parent - child wins
let parent = Constraint::new(
DimensionValue::Fixed(Px(200)),
DimensionValue::Fixed(Px(200))
);
let child = Constraint::new(
DimensionValue::Fixed(Px(100)),
DimensionValue::Fixed(Px(100))
);
let merged = child.merge(&parent);
assert_eq!(merged.width, DimensionValue::Fixed(Px(100)));
// Fill child in fixed parent - child fills parent's space
let child_fill = Constraint::new(
DimensionValue::Fill { min: Some(Px(50)), max: None },
DimensionValue::Fill { min: Some(Px(50)), max: None }
);
let merged_fill = child_fill.merge(&parent);
assert_eq!(merged_fill.width, DimensionValue::Fill {
min: Some(Px(50)),
max: Some(Px(200))
});
Trait Implementations§
Source§impl Clone for Constraint
impl Clone for Constraint
Source§fn clone(&self) -> Constraint
fn clone(&self) -> Constraint
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl Debug for Constraint
impl Debug for Constraint
Source§impl Hash for Constraint
impl Hash for Constraint
Source§impl PartialEq for Constraint
impl PartialEq for Constraint
impl Copy for Constraint
impl Eq for Constraint
impl StructuralPartialEq for Constraint
Auto Trait Implementations§
impl Freeze for Constraint
impl RefUnwindSafe for Constraint
impl Send for Constraint
impl Sync for Constraint
impl Unpin for Constraint
impl UnwindSafe for Constraint
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more