Enum RadialExtent 

pub enum RadialExtent {
    ClosestCorner(Ident),
    ClosestSide(Ident),
    FarthestCorner(Ident),
    FarthestSide(Ident),
}

https://drafts.csswg.org/css-images-3/#typedef-radial-extent

<radial-extent> = closest-corner | closest-side | farthest-corner | farthest-side

Variants

ClosestCorner(Ident)

ClosestSide(Ident)

FarthestCorner(Ident)

FarthestSide(Ident)

Trait Implementations

impl Clone for RadialExtent

fn clone(&self) -> RadialExtent

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RadialExtent

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

Formats the value using the given formatter.

impl Hash for RadialExtent

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for RadialExtent

fn cmp(&self, other: &RadialExtent) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'a> Parse<'a> for RadialExtent

fn parse<I>(p: &mut Parser<'a, I>) -> Result<Self>

where I: Iterator<Item = Cursor> + Clone,

fn try_parse<I>(p: &mut Parser<'a, I>) -> Result<Self, Diagnostic>

where I: Iterator<Item = Cursor> + Clone,

impl PartialEq for RadialExtent

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

fn partial_cmp(&self, other: &RadialExtent) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a> Peek<'a> for RadialExtent

fn peek<I>(p: &Parser<'a, I>, c: Cursor) -> bool

where I: Iterator<Item = Cursor> + Clone,

const PEEK_KINDSET: KindSet = KindSet::ANY

impl ToCursors for RadialExtent

fn to_cursors(&self, s: &mut impl CursorSink)

impl ToSpan for RadialExtent

fn to_span(&self) -> Span

impl Copy for RadialExtent

impl Eq for RadialExtent

impl StructuralPartialEq for RadialExtent