Enum ComputedLeaf 

#[repr(u8)]
pub enum ComputedLeaf {
    Length(Length),
    Percentage(Percentage),
    Number(Number),
    Angle(Angle),
    Time(Time),
    Resolution(Resolution),
}

The computed leaf of a calc() expression.

Variants

Length(Length)

Percentage(Percentage)

Number(Number)

Angle(Angle)

Time(Time)

Resolution(Resolution)

Implementations

impl ComputedLeaf

pub(super) fn is_zero_length(&self) -> bool

Trait Implementations

impl CalcNodeLeaf for ComputedLeaf

fn unit(&self) -> CalcUnits

Returns the unit of the leaf.

fn unitless_value(&self) -> Option<f32>

Returns the unitless value of this leaf if one is available.

fn new_number(value: f32) -> Self

Create a new leaf with a number value.

fn as_number(&self) -> Option<f32>

Returns a float value if the leaf is a number.

fn as_angle_radians(&self) -> Option<f32>

Returns the angle value in radians if this leaf is an angle.

fn new_angle_from_radians(radians: f32) -> Self

Creates a new angle leaf from a value in radians.

fn compare( &self, other: &Self, basis: PositivePercentageBasis, ) -> Option<Ordering>

Do a partial comparison of these values.

fn try_sum_in_place(&mut self, other: &Self) -> Result<(), ()>

Tries to merge one leaf into another using the sum, that is, perform x + y.

fn try_product_in_place(&mut self, other: &mut Self) -> bool

Try to merge the right leaf into the left by using a multiplication. Return true if the merge was successful, otherwise false.

fn try_op<O>(&self, other: &Self, op: O) -> Result<Self, ()>

where O: Fn(f32, f32) -> f32,

Tries a generic arithmetic operation.

fn map(&mut self, op: impl FnMut(f32) -> f32) -> Result<(), ()>

Map the value of this node with the given operation.

fn simplify(&mut self)

Canonicalizes the expression if necessary.

fn sort_key(&self) -> SortKey

Returns the sort key for simplification.

fn is_same_unit_as(&self, other: &Self) -> bool

Return true if the units of both leaves are equal. (NOTE: Does not take the values into account)

fn gt(&self, other: &Self, basis_positive: PositivePercentageBasis) -> bool

Return whether a leaf is greater than another.

fn lt(&self, other: &Self, basis_positive: PositivePercentageBasis) -> bool

Return whether a leaf is less than another.

fn lte(&self, other: &Self, basis_positive: PositivePercentageBasis) -> bool

Return whether a leaf is smaller or equal than another.

fn as_number_or_angle_radians(&self) -> Option<f32>

Returns a number or angle radians if the leaf is a number or angle.

fn is_negative(&self) -> Result<bool, ()>

Whether this value is known-negative.

fn is_infinite(&self) -> Result<bool, ()>

Whether this value is infinite.

fn is_zero(&self) -> Result<bool, ()>

Whether this value is zero.

fn is_nan(&self) -> Result<bool, ()>

Whether this value is NaN.

fn sign_from(leaf: &impl CalcNodeLeaf) -> Result<Self, ()>

Create a new leaf containing the sign() result of the given leaf.

impl Clone for ComputedLeaf

fn clone(&self) -> ComputedLeaf

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ComputedLeaf

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ComputedLeaf

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl MallocSizeOf for ComputedLeaf

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.

impl PartialEq for ComputedLeaf

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

impl Serialize for ComputedLeaf

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl ToAnimatedZero for ComputedLeaf

fn to_animated_zero(&self) -> Result<Self, ()>

Returns a value that, when added with an underlying value, will produce the underlying value. This is used for SMIL animation’s “by-animation” where SMIL first interpolates from the zero value to the ‘by’ value, and then adds the result to the underlying value.

impl ToCss for ComputedLeaf

fn to_css<W>(&self, dest: &mut CssWriter<'_, W>) -> Result

where W: Write,

Serialize self in CSS syntax, writing to dest.

fn to_css_string(&self) -> String

Serialize self in CSS syntax and return a string.

fn to_css_cssstring(&self) -> String

Serialize self in CSS syntax and return a CssString.

impl ToResolvedValue for ComputedLeaf

where Length: ToResolvedValue<ResolvedValue = Length>, Percentage: ToResolvedValue<ResolvedValue = Percentage>, Number: ToResolvedValue<ResolvedValue = Number>, Angle: ToResolvedValue<ResolvedValue = Angle>, Time: ToResolvedValue<ResolvedValue = Time>, Resolution: ToResolvedValue<ResolvedValue = Resolution>,

type ResolvedValue = ComputedLeaf

The resolved value type we’re going to be converted to.

fn from_resolved_value(from: Self::ResolvedValue) -> Self

Convert a resolved value to resolved value form.

fn to_resolved_value(self, context: &Context<'_>) -> Self::ResolvedValue

Convert a resolved value to a resolved value.

impl ToTyped for ComputedLeaf

where Length: ToTyped, Percentage: ToTyped, Number: ToTyped, Angle: ToTyped, Time: ToTyped, Resolution: ToTyped,

fn to_typed(&self, dest: &mut ThinVec<TypedValue>) -> Result<(), ()>

Attempt to convert self into one or more TypedValue items.

fn to_typed_value(&self) -> Option<TypedValue>

Attempt to convert self into a TypedValue.

fn to_numeric_value(&self) -> Option<NumericValue>

Attempt to convert self into a NumericValue.

fn to_typed_value_list(&self) -> Option<TypedValueList>

Attempt to convert self into a TypedValueList.

impl StructuralPartialEq for ComputedLeaf