Struct Packed

pub struct Packed<T: Element> {
    pub size: usize,
    pub variant: Variant,
    pub values: Vec<T>,
}

A packed matrix.

Fields

size: usize

The number of rows or columns.

variant: Variant

The format variant.

values: Vec<T>

The values of the lower triangle when variant = Lower or upper triangle when variant = Upper stored by columns.

Implementations

impl<T: Element> Packed<T>

pub fn new<S: Size>(size: S, variant: Variant) -> Self

Create a zero matrix.

Trait Implementations

impl<T: Clone + Element> Clone for Packed<T>

fn clone(&self) -> Packed<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Element> Debug for Packed<T>

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

Formats the value using the given formatter.

impl<'l, T: Element> From<&'l Packed<T>> for Conventional<T>

fn from(matrix: &'l Packed<T>) -> Self

Converts to this type from the input type.

impl<T: Element> From<Packed<T>> for Conventional<T>

fn from(matrix: Packed<T>) -> Self

Converts to this type from the input type.

impl<T: Element> Matrix for Packed<T>

type Element = T

The element type.

fn nonzeros(&self) -> usize

Count nonzero elements.

fn zero<S: Size>(size: S) -> Self

Create a zero matrix.

impl<T: PartialEq + Element> PartialEq for Packed<T>

fn eq(&self, other: &Packed<T>) -> 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<T: Element> Size for Packed<T>

fn rows(&self) -> usize

Return the number of rows.

fn columns(&self) -> usize

Return the number of columns.

fn dimensions(&self) -> (usize, usize)

Return the number of rows and columns.

impl<T: Element> Transpose for Packed<T>

fn transpose(&self) -> Self

Perform the transpose.

impl<T: Element> StructuralPartialEq for Packed<T>