struct UnresolvedGradient {
units: Option<GradientUnits>,
transform: Option<TransformAttribute>,
spread: Option<SpreadMethod>,
stops: Option<Vec<ColorStop>>,
variant: UnresolvedVariant,
}Expand description
Main structure used during gradient resolution. For unresolved
gradients, we store all fields as Option<T> - if None, it means
that the field is not specified; if Some(T), it means that the
field was specified.
Fields§
§units: Option<GradientUnits>§transform: Option<TransformAttribute>§spread: Option<SpreadMethod>§stops: Option<Vec<ColorStop>>§variant: UnresolvedVariantImplementations§
Source§impl UnresolvedGradient
impl UnresolvedGradient
fn into_resolved(self) -> ResolvedGradient
Sourcefn add_color_stop(&mut self, offset: UnitInterval, color: Color)
fn add_color_stop(&mut self, offset: UnitInterval, color: Color)
Helper for add_color_stops_from_node()
Sourcefn add_color_stops_from_node(
&mut self,
node: &Node<NodeData>,
opacity: UnitInterval,
)
fn add_color_stops_from_node( &mut self, node: &Node<NodeData>, opacity: UnitInterval, )
Looks for <stop> children inside a linearGradient or radialGradient node,
and adds their info to the UnresolvedGradient &self.
fn is_resolved(&self) -> bool
fn resolve_from_fallback( &self, fallback: &UnresolvedGradient, ) -> UnresolvedGradient
fn resolve_from_defaults(&self) -> UnresolvedGradient
Auto Trait Implementations§
impl Freeze for UnresolvedGradient
impl RefUnwindSafe for UnresolvedGradient
impl Send for UnresolvedGradient
impl Sync for UnresolvedGradient
impl Unpin for UnresolvedGradient
impl UnwindSafe for UnresolvedGradient
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.