Struct Pitch 

pub struct Pitch {
    pub width_bytes: usize,
    pub height: usize,
    pub stride_bytes: usize,
}

The 2D geometry of a copy to or from a pitched allocation: how wide each row is, how many rows there are, and the stride between their starts.

of answers None for an allocation that needs no 2D copy at all. A row stride equal to the row width means no padding, so the whole buffer is one contiguous span and the plain linear copy is both correct and faster — drivers also refuse the 2D form for very tall transfers, an embedding table’s 128k rows say, which the linear path handles.

This is the read side of what PitchedMemoryLayoutPolicy produces, and it is the same arithmetic whichever driver performs the copy.

Fields

width_bytes: usize

The bytes in one row, which is what both sides of the copy transfer.

height: usize

How many rows the copy moves.

stride_bytes: usize

The bytes between the starts of two rows on the pitched side.

Implementations

impl Pitch

pub fn of(shape: &[usize], strides: &[usize], elem_size: usize) -> Option<Self>

The pitch of an allocation with this layout, or None when its rows are contiguous.

The caller has already validated the strides as pitched row-major; this only asks whether there is padding to step over.

Trait Implementations

impl Clone for Pitch

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Pitch

impl Debug for Pitch

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

Formats the value using the given formatter.

impl Eq for Pitch

impl PartialEq for Pitch

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Pitch