Struct nalgebra::Mat1

pub struct Mat1<N> {
    pub m11: N,
}

Square matrix of dimension 1.

Fields

m11

Methods

impl<N> Mat1<N>

fn new(m11: N) -> Mat1<N>

impl<N> Mat1<N>

fn as_array(&self) -> &[[N; 1]; 1]

View this matrix as a column-major array of arrays.

fn as_array_mut<'a>(&'a mut self) -> &'a mut [[N; 1]; 1]

View this matrix as a column-major mutable array of arrays.

fn from_array_ref(array: &[[N; 1]; 1]) -> &Mat1<N>

View a column-major array of array as a vector.

fn from_array_mut(array: &mut [[N; 1]; 1]) -> &mut Mat1<N>

View a column-major array of array as a mutable vector.

impl<N: Copy> Mat1<N>

unsafe fn at_fast(&self, (i, j): (usize, usize)) -> N

unsafe fn set_fast(&mut self, (i, j): (usize, usize), val: N)

Trait Implementations

impl<N: Zero + One> Eye for Mat1<N>

fn new_identity(dim: usize) -> Mat1<N>

impl<N: Copy> Repeat<N> for Mat1<N>

fn repeat(val: N) -> Mat1<N>

impl<Nin: Copy, Nout: Copy + Cast<Nin>> Cast<Mat1<Nin>> for Mat1<Nout>

fn from(v: Mat1<Nin>) -> Mat1<Nout>

impl<N: Add<N, Output=N>> Add<Mat1<N>> for Mat1<N>

type Output = Mat1<N>

fn add(self, right: Mat1<N>) -> Mat1<N>

impl<N: Sub<N, Output=N>> Sub<Mat1<N>> for Mat1<N>

type Output = Mat1<N>

fn sub(self, right: Mat1<N>) -> Mat1<N>

impl<N: Copy + Add<N, Output=N>> Add<N> for Mat1<N>

type Output = Mat1<N>

fn add(self, right: N) -> Mat1<N>

impl<N: Copy + Sub<N, Output=N>> Sub<N> for Mat1<N>

type Output = Mat1<N>

fn sub(self, right: N) -> Mat1<N>

impl<N: Copy + Mul<N, Output=N>> Mul<N> for Mat1<N>

type Output = Mat1<N>

fn mul(self, right: N) -> Mat1<N>

impl<N: Copy + Div<N, Output=N>> Div<N> for Mat1<N>

type Output = Mat1<N>

fn div(self, right: N) -> Mat1<N>

impl<N: Absolute<N>> Absolute<Mat1<N>> for Mat1<N>

fn abs(m: &Mat1<N>) -> Mat1<N>

impl<N: Zero> Zero for Mat1<N>

fn zero() -> Mat1<N>

fn is_zero(&self) -> bool

impl<N: Copy + BaseNum> One for Mat1<N>

fn one() -> Mat1<N>

impl<N> Iterable<N> for Mat1<N>

fn iter<'l>(&'l self) -> Iter<'l, N>

impl<N> IterableMut<N> for Mat1<N>

fn iter_mut<'l>(&'l mut self) -> IterMut<'l, N>

impl<N> Dim for Mat1<N>

fn dim(_: Option<Mat1<N>>) -> usize

impl<N> Shape<(usize, usize)> for Mat1<N>

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

impl<N: Copy> Indexable<(usize, usize), N> for Mat1<N>

fn swap(&mut self, (i1, j1): (usize, usize), (i2, j2): (usize, usize))

unsafe fn unsafe_at(&self, (i, j): (usize, usize)) -> N

unsafe fn unsafe_set(&mut self, (i, j): (usize, usize), val: N)

impl<N> Index<(usize, usize)> for Mat1<N>

type Output = N

fn index(&self, (i, j): (usize, usize)) -> &N

impl<N> IndexMut<(usize, usize)> for Mat1<N>

fn index_mut(&mut self, (i, j): (usize, usize)) -> &mut N

impl<N: Copy + BaseNum> Mul<Mat1<N>> for Mat1<N>

type Output = Mat1<N>

fn mul(self, right: Mat1<N>) -> Mat1<N>

impl<N: Copy + BaseNum> Mul<Vec1<N>> for Mat1<N>

type Output = Vec1<N>

fn mul(self, right: Vec1<N>) -> Vec1<N>

impl<N: Copy + BaseNum> Mul<Pnt1<N>> for Mat1<N>

type Output = Pnt1<N>

fn mul(self, right: Pnt1<N>) -> Pnt1<N>

impl<N: Copy> Transpose for Mat1<N>

fn transpose(&self) -> Mat1<N>

fn transpose_mut(&mut self)

impl<N: ApproxEq<N>> ApproxEq<N> for Mat1<N>

fn approx_epsilon(_: Option<Mat1<N>>) -> N

fn approx_ulps(_: Option<Mat1<N>>) -> u32

fn approx_eq_eps(&self, other: &Mat1<N>, epsilon: &N) -> bool

fn approx_eq_ulps(&self, other: &Mat1<N>, ulps: u32) -> bool

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

impl<N: Copy + Zero> Row<Vec1<N>> for Mat1<N>

fn nrows(&self) -> usize

fn set_row(&mut self, row: usize, v: Vec1<N>)

fn row(&self, row: usize) -> Vec1<N>

impl<N: Copy + Zero> Col<Vec1<N>> for Mat1<N>

fn ncols(&self) -> usize

fn set_col(&mut self, col: usize, v: Vec1<N>)

fn col(&self, col: usize) -> Vec1<N>

impl<N: Clone + Copy + Zero> ColSlice<DVec1<N>> for Mat1<N>

fn col_slice(&self, cid: usize, rstart: usize, rend: usize) -> DVec1<N>

impl<N: Clone + Copy + Zero> RowSlice<DVec1<N>> for Mat1<N>

fn row_slice(&self, rid: usize, cstart: usize, cend: usize) -> DVec1<N>

impl<N: Copy + Zero> Diag<Vec1<N>> for Mat1<N>

fn from_diag(diag: &Vec1<N>) -> Mat1<N>

fn diag(&self) -> Vec1<N>

impl<N: Copy + Zero> DiagMut<Vec1<N>> for Mat1<N>

fn set_diag(&mut self, diag: &Vec1<N>)

impl<N: BaseNum + Copy> ToHomogeneous<Mat2<N>> for Mat1<N>

fn to_homogeneous(&self) -> Mat2<N>

impl<N: BaseNum + Copy> FromHomogeneous<Mat2<N>> for Mat1<N>

fn from(m: &Mat2<N>) -> Mat1<N>

impl<N> EigenQR<N, Vec1<N>> for Mat1<N> where N: BaseFloat + ApproxEq<N> + Clone

fn eigen_qr(&self, eps: &N, niter: usize) -> (Mat1<N>, Vec1<N>)

impl<N: Rand> Rand for Mat1<N>

fn rand<R: Rng>(rng: &mut R) -> Mat1<N>

Derived Implementations

impl<N: Copy> Copy for Mat1<N>

impl<N: Debug> Debug for Mat1<N>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

impl<N: Hash> Hash for Mat1<N>

fn hash<__H: Hasher>(&self, __arg_0: &mut __H)

fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher

impl<N: Clone> Clone for Mat1<N>

fn clone(&self) -> Mat1<N>

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

impl<N: Decodable> Decodable for Mat1<N>

fn decode<__D: Decoder>(__arg_0: &mut __D) -> Result<Mat1<N>, __D::Error>

impl<N: Encodable> Encodable for Mat1<N>

fn encode<__S: Encoder>(&self, __arg_0: &mut __S) -> Result<(), __S::Error>

impl<N: PartialEq> PartialEq for Mat1<N>

fn eq(&self, __arg_0: &Mat1<N>) -> bool

fn ne(&self, __arg_0: &Mat1<N>) -> bool

impl<N: Eq> Eq for Mat1<N>