Enum style::properties::longhands::font_stretch::computed_value::T []

pub enum T {
    normal,
    ultra_condensed,
    extra_condensed,
    condensed,
    semi_condensed,
    semi_expanded,
    expanded,
    extra_expanded,
    ultra_expanded,
}

Variants

Methods

impl T

Parse this property from a CSS input stream.

Parse this property from an already-tokenized identifier.

Trait Implementations

impl Clone for T

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

impl Copy for T

impl Debug for T

Formats the value using the given formatter.

impl Eq for T

impl Hash for T

Feeds this value into the given [Hasher]. Read more

Feeds a slice of this type into the given [Hasher]. Read more

impl PartialEq for T

This method tests for self and other values to be equal, and is used by ==. Read more

This method tests for !=.

impl HeapSizeOf for T

Measure the size of any heap-allocated structures that hang off this value, but not the space taken up by the value itself (i.e. what size_of:: measures, more or less); that space is handled by the implementation of HeapSizeOf for Box below. Read more

impl ToCss for T

Serialize self in CSS syntax, writing to dest.

Serialize self in CSS syntax and return a string. Read more

impl Parse for T
[src]

Parse a value of this type. Read more

impl Animatable for FontStretch
[src]

https://drafts.csswg.org/css-fonts/#font-stretch-prop

Performs a weighted sum of this value and |other|. This is used for interpolation and addition of animation values. Read more

Compute distance between a value and another for a given property.

[Interpolates][interpolation] a value with another for a given property. Read more

Returns the [sum][animation-addition] of this value and |other|. Read more

[Accumulates][animation-accumulation] this value onto itself (|count| - 1) times then accumulates |other| onto the result. If |count| is zero, the result will be |other|. Read more

In order to compute the Euclidean distance of a list or property value with multiple components, we need to compute squared distance for each element, so the vector can sum it and then get its squared root as the distance. Read more