Struct PingPongKey 

pub struct PingPongKey {
    pub size: [u32; 2],
    pub levels: u32,
}

Keys a ping-pong scratch chain. levels is 1 for the separable Gaussian (no downsampling); the field exists so the dual-Kawase path keys its mip depth without a new type.

Fields

size: [u32; 2]

The level-0 (full) size of the chain, in physical pixels.

levels: u32

The mip depth: 1 for the Gaussian, N for an N-level dual-Kawase pyramid.

Trait Implementations

impl Clone for PingPongKey

fn clone(&self) -> PingPongKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PingPongKey

impl Debug for PingPongKey

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

Formats the value using the given formatter.

impl Eq for PingPongKey

impl Hash for PingPongKey

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 PartialEq for PingPongKey

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