Struct rsvg::gradient::LinearGradient
source · pub struct LinearGradient {
common: Common,
x1: Option<Length<Horizontal>>,
y1: Option<Length<Vertical>>,
x2: Option<Length<Horizontal>>,
y2: Option<Length<Vertical>>,
}
Expand description
Node for the <linearGradient>
element
Fields§
§common: Common
§x1: Option<Length<Horizontal>>
§y1: Option<Length<Vertical>>
§x2: Option<Length<Horizontal>>
§y2: Option<Length<Vertical>>
Implementations§
source§impl LinearGradient
impl LinearGradient
fn get_unresolved_variant(&self) -> UnresolvedVariant
source§impl LinearGradient
impl LinearGradient
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 LinearGradient
impl Default for LinearGradient
source§fn default() -> LinearGradient
fn default() -> LinearGradient
Returns the “default value” for a type. Read more
source§impl ElementTrait for LinearGradient
impl ElementTrait for LinearGradient
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<BoundingBox, InternalRenderingError>
fn draw( &self, _node: &Node<NodeData>, _acquired_nodes: &mut AcquiredNodes<'_>, _cascaded: &CascadedValues<'_>, _viewport: &Viewport, draw_ctx: &mut DrawingCtx, _clipping: bool, ) -> Result<BoundingBox, 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>, InternalRenderingError>
fn layout( &self, _node: &Node<NodeData>, _acquired_nodes: &mut AcquiredNodes<'_>, _cascaded: &CascadedValues<'_>, _viewport: &Viewport, _draw_ctx: &mut DrawingCtx, _clipping: bool, ) -> Result<Option<Layer>, InternalRenderingError>
Create a layout object for the current element. Read more
Auto Trait Implementations§
impl Freeze for LinearGradient
impl RefUnwindSafe for LinearGradient
impl Send for LinearGradient
impl Sync for LinearGradient
impl Unpin for LinearGradient
impl UnwindSafe for LinearGradient
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.