pub struct RadialGradient {
common: Common,
cx: Option<Length<Horizontal>>,
cy: Option<Length<Vertical>>,
r: Option<Length<Both>>,
fx: Option<Length<Horizontal>>,
fy: Option<Length<Vertical>>,
fr: Option<Length<Both>>,
}Expand description
Node for the <radialGradient> element
Fields§
§common: Common§cx: Option<Length<Horizontal>>§cy: Option<Length<Vertical>>§r: Option<Length<Both>>§fx: Option<Length<Horizontal>>§fy: Option<Length<Vertical>>§fr: Option<Length<Both>>Implementations§
Source§impl RadialGradient
impl RadialGradient
fn get_unresolved_variant(&self) -> UnresolvedVariant
Source§impl RadialGradient
impl RadialGradient
fn get_unresolved( &self, node: &Node<NodeData>, opacity: UnitInterval, ) -> Unresolved
pub fn resolve( &self, node: &Node<NodeData>, acquired_nodes: &mut AcquiredNodes<'_>, opacity: UnitInterval, ) -> Result<ResolvedGradient, AcquireError>
Trait Implementations§
Source§impl Default for RadialGradient
impl Default for RadialGradient
Source§fn default() -> RadialGradient
fn default() -> RadialGradient
Returns the “default value” for a type. Read more
Source§impl ElementTrait for RadialGradient
impl ElementTrait for RadialGradient
Source§fn set_attributes(&mut self, attrs: &Attributes, session: &Session)
fn set_attributes(&mut self, attrs: &Attributes, session: &Session)
Sets per-element attributes. Read more
Source§fn draw(
&self,
_node: &Node<NodeData>,
_acquired_nodes: &mut AcquiredNodes<'_>,
_cascaded: &CascadedValues<'_>,
viewport: &Viewport,
_draw_ctx: &mut DrawingCtx,
_clipping: bool,
) -> Result<Box<BoundingBox>, Box<InternalRenderingError>>
fn draw( &self, _node: &Node<NodeData>, _acquired_nodes: &mut AcquiredNodes<'_>, _cascaded: &CascadedValues<'_>, viewport: &Viewport, _draw_ctx: &mut DrawingCtx, _clipping: bool, ) -> Result<Box<BoundingBox>, Box<InternalRenderingError>>
Draw an element. Read more
Source§fn layout(
&self,
_node: &Node<NodeData>,
_acquired_nodes: &mut AcquiredNodes<'_>,
_cascaded: &CascadedValues<'_>,
_viewport: &Viewport,
_draw_ctx: &mut DrawingCtx,
_clipping: bool,
) -> Result<Option<Layer>, Box<InternalRenderingError>>
fn layout( &self, _node: &Node<NodeData>, _acquired_nodes: &mut AcquiredNodes<'_>, _cascaded: &CascadedValues<'_>, _viewport: &Viewport, _draw_ctx: &mut DrawingCtx, _clipping: bool, ) -> Result<Option<Layer>, Box<InternalRenderingError>>
Create a layout object for the current element. Read more
Auto Trait Implementations§
impl Freeze for RadialGradient
impl RefUnwindSafe for RadialGradient
impl Send for RadialGradient
impl Sync for RadialGradient
impl Unpin for RadialGradient
impl UnwindSafe for RadialGradient
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.