Struct webrender::prim_store::gradient::linear::LinearGradient

pub struct LinearGradient {
    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 nine_patch: Option<Box<NinePatchDescriptor>>,
    pub cached: bool,
    pub edge_aa_mask: EdgeAaSegmentMask,
}

Fields

extend_mode: ExtendMode

start_point: PointKey

end_point: PointKey

stretch_size: SizeKey

tile_spacing: SizeKey

stops: Vec<GradientStopKey>

reverse_stops: bool

nine_patch: Option<Box<NinePatchDescriptor>>

cached: bool

edge_aa_mask: EdgeAaSegmentMask

Trait Implementations

impl Debug for LinearGradient

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

Formats the value using the given formatter.

impl Internable for LinearGradient

type Key = LinearGradientKey

type StoreData = LinearGradientTemplate

type InternData = ()

const PROFILE_COUNTER: usize = 93usize

impl InternablePrimitive for LinearGradient

fn into_key(self, info: &LayoutPrimitiveInfo) -> LinearGradientKey

Build a new key from self with info.

fn make_instance_kind( key: LinearGradientKey, data_handle: Handle<LinearGradient>, _prim_store: &mut PrimitiveStore, ) -> PrimitiveInstanceKind

impl IsVisible for LinearGradient

fn is_visible(&self) -> bool

impl MallocSizeOf for LinearGradient

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 Serialize for LinearGradient

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

where __S: Serializer,

Serialize this value into the given Serde serializer.