Struct webrender::prim_store::gradient::linear::LinearGradientKey

pub struct LinearGradientKey {
    pub common: PrimKeyCommonData,
    pub extend_mode: ExtendMode,
    pub start_point: PointKey,
    pub end_point: PointKey,
    pub stretch_size: SizeKey,
    pub tile_spacing: SizeKey,
    pub stops: Vec<GradientStopKey>,
    pub reverse_stops: bool,
    pub cached: bool,
    pub nine_patch: Option<Box<NinePatchDescriptor>>,
    pub edge_aa_mask: EdgeAaSegmentMask,
}

Identifying key for a linear gradient.

Fields

common: PrimKeyCommonData

extend_mode: ExtendMode

start_point: PointKey

end_point: PointKey

stretch_size: SizeKey

tile_spacing: SizeKey

stops: Vec<GradientStopKey>

reverse_stops: bool

cached: bool

nine_patch: Option<Box<NinePatchDescriptor>>

edge_aa_mask: EdgeAaSegmentMask

Implementations

impl LinearGradientKey

pub fn new(info: &LayoutPrimitiveInfo, linear_grad: LinearGradient) -> Self

Trait Implementations

impl Clone for LinearGradientKey

fn clone(&self) -> LinearGradientKey

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for LinearGradientKey

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

Formats the value using the given formatter.

impl From<LinearGradientKey> for LinearGradientTemplate

fn from(item: LinearGradientKey) -> Self

Converts to this type from the input type.

impl Hash for LinearGradientKey

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 InternDebug for LinearGradientKey

fn on_interned(&self, _uid: ItemUid)

impl MallocSizeOf for LinearGradientKey

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.

impl PartialEq for LinearGradientKey

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for LinearGradientKey

impl StructuralPartialEq for LinearGradientKey