Enum style::values::specified::calc::Leaf

#[repr(u8)]
pub enum Leaf {
    Length(NoCalcLength),
    Angle(Angle),
    Time(Time),
    Resolution(Resolution),
    ColorComponent(ChannelKeyword),
    Percentage(CSSFloat),
    Number(CSSFloat),
}

A leaf node inside a Calc expression’s AST.

Variants

Length(NoCalcLength)

<length>

Angle(Angle)

<angle>

Time(Time)

<time>

Resolution(Resolution)

<resolution>

ColorComponent(ChannelKeyword)

A component of a color.

Percentage(CSSFloat)

<percentage>

Number(CSSFloat)

<number>

Implementations

impl Leaf

fn as_length(&self) -> Option<&NoCalcLength>

Trait Implementations

impl CalcNodeLeaf for Leaf

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

Tries to merge one sum to another, that is, perform x + y.

Only handles leaf nodes, it’s the caller’s responsibility to simplify them before calling this if needed.

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 compare( &self, other: &Self, basis: PositivePercentageBasis, ) -> Option<Ordering>

Do a partial comparison of these values.

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

Returns a float value if the leaf is a number.

fn sort_key(&self) -> SortKey

Returns the sort key for simplification.

fn simplify(&mut self)

Canonicalizes the expression if necessary.

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 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 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 Leaf

fn clone(&self) -> Leaf

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Leaf

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

Formats the value using the given formatter.

impl MallocSizeOf for Leaf

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 Leaf

fn eq(&self, other: &Leaf) -> 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 ToCss for Leaf

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.

impl ToShmem for Leaf

fn to_shmem(&self, builder: &mut SharedMemoryBuilder) -> Result<Self>

Clones this value into a form suitable for writing into a SharedMemoryBuilder.

impl StructuralPartialEq for Leaf