Struct LinearGradientFunction 

pub struct LinearGradientFunction<'a> {
    pub name: Function,
    pub params: LinearGradientFunctionParams<'a>,
    pub close: RightParen,
}

https://drafts.csswg.org/css-images-3/#funcdef-linear-gradient

<linear-gradient()> = linear-gradient( [ <linear-gradient-syntax> ] )
<linear-gradient-syntax> = [ <angle> | <zero> | to <side-or-corner> ]? , <color-stop-list>
<side-or-corner> = [left | right] || [top | bottom]

Fields

name: Function

params: LinearGradientFunctionParams<'a>

close: RightParen

Trait Implementations

impl<'a> Clone for LinearGradientFunction<'a>

fn clone(&self) -> LinearGradientFunction<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for LinearGradientFunction<'a>

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

Formats the value using the given formatter.

impl<'a> Hash for LinearGradientFunction<'a>

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<'a> Ord for LinearGradientFunction<'a>

fn cmp(&self, other: &LinearGradientFunction<'a>) -> 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 LinearGradientFunction<'a>

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<'a> PartialEq for LinearGradientFunction<'a>

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

fn partial_cmp(&self, other: &LinearGradientFunction<'a>) -> 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 LinearGradientFunction<'a>

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

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

const PEEK_KINDSET: KindSet = KindSet::ANY

impl<'a> ToCursors for LinearGradientFunction<'a>

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

impl<'a> ToSpan for LinearGradientFunction<'a>

fn to_span(&self) -> Span

impl<'a> Eq for LinearGradientFunction<'a>

impl<'a> StructuralPartialEq for LinearGradientFunction<'a>