Type Definition nalgebra::base::Vector

pub type Vector<N, D, S> = Matrix<N, D, U1, S>;

A matrix with one column and D rows.

Implementations

impl<N: Scalar + PartialOrd + Signed, D: Dim, S: Storage<N, D>> Vector<N, D, S>

pub fn imax(&self) -> usize

Computes the index of the vector component with the largest value.

pub fn iamax(&self) -> usize

Computes the index of the vector component with the largest absolute value.

pub fn imin(&self) -> usize

Computes the index of the vector component with the smallest value.

pub fn iamin(&self) -> usize

Computes the index of the vector component with the smallest absolute value.

impl<N, D: Dim, S> Vector<N, D, S>where
    N: Scalar + Zero + ClosedAdd + ClosedMul,
    S: StorageMut<N, D>,

pub fn axpy<D2: Dim, SB>(&mut self, a: N, x: &Vector<N, D2, SB>, b: N)where
    SB: Storage<N, D2>,
    ShapeConstraint: DimEq<D, D2>,

Computes self = a * x + b * self.

If be is zero, self is never read from.

pub fn gemv<R2: Dim, C2: Dim, D3: Dim, SB, SC>(
    &mut self,
    alpha: N,
    a: &Matrix<N, R2, C2, SB>,
    x: &Vector<N, D3, SC>,
    beta: N
)where
    N: One,
    SB: Storage<N, R2, C2>,
    SC: Storage<N, D3>,
    ShapeConstraint: DimEq<D, R2> + AreMultipliable<R2, C2, D3, U1>,

Computes self = alpha * a * x + beta * self, where a is a matrix, x a vector, and alpha, beta two scalars.

If beta is zero, self is never read.

pub fn gemv_symm<D2: Dim, D3: Dim, SB, SC>(
    &mut self,
    alpha: N,
    a: &SquareMatrix<N, D2, SB>,
    x: &Vector<N, D3, SC>,
    beta: N
)where
    N: One,
    SB: Storage<N, D2, D2>,
    SC: Storage<N, D3>,
    ShapeConstraint: DimEq<D, D2> + AreMultipliable<D2, D2, D3, U1>,

Computes self = alpha * a * x + beta * self, where a is a symmetric matrix, x a vector, and alpha, beta two scalars.

If beta is zero, self is never read. If self is read, only its lower-triangular part (including the diagonal) is actually read.

pub fn gemv_tr<R2: Dim, C2: Dim, D3: Dim, SB, SC>(
    &mut self,
    alpha: N,
    a: &Matrix<N, R2, C2, SB>,
    x: &Vector<N, D3, SC>,
    beta: N
)where
    N: One,
    SB: Storage<N, R2, C2>,
    SC: Storage<N, D3>,
    ShapeConstraint: DimEq<D, C2> + AreMultipliable<C2, R2, D3, U1>,

Computes self = alpha * a.transpose() * x + beta * self, where a is a matrix, x a vector, and alpha, beta two scalars.

If beta is zero, self is never read.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xx(&self) -> Vector2<N>where
    D::Value: Cmp<U0, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xy(&self) -> Vector2<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xz(&self) -> Vector2<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yx(&self) -> Vector2<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yy(&self) -> Vector2<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yz(&self) -> Vector2<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zx(&self) -> Vector2<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zy(&self) -> Vector2<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zz(&self) -> Vector2<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xxx(&self) -> Vector3<N>where
    D::Value: Cmp<U0, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xxy(&self) -> Vector3<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xxz(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xyx(&self) -> Vector3<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xyy(&self) -> Vector3<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xyz(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xzx(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xzy(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn xzz(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yxx(&self) -> Vector3<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yxy(&self) -> Vector3<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yxz(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yyx(&self) -> Vector3<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yyy(&self) -> Vector3<N>where
    D::Value: Cmp<U1, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yyz(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yzx(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yzy(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn yzz(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zxx(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zxy(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zxz(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zyx(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zyy(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zyz(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zzx(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zzy(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: DimName, S: Storage<N, D>> Vector<N, D, S>

pub fn zzz(&self) -> Vector3<N>where
    D::Value: Cmp<U2, Output = Greater>,

Builds a new vector from components of self.

impl<N: Scalar, D: Dim, S: Storage<N, D>> Vector<N, D, S>

pub unsafe fn vget_unchecked(&self, i: usize) -> &N

Gets a reference to the i-th element of this column vector without bound checking.

impl<N: Scalar, D: Dim, S: StorageMut<N, D>> Vector<N, D, S>

pub unsafe fn vget_unchecked_mut(&mut self, i: usize) -> &mut N

Gets a mutable reference to the i-th element of this column vector without bound checking.

impl<N: Scalar + Zero, D: DimAdd<U1>, S: Storage<N, D>> Vector<N, D, S>

pub fn to_homogeneous(&self) -> VectorN<N, DimSum<D, U1>>where
    DefaultAllocator: Allocator<N, DimSum<D, U1>>,

Computes the coordinates in projective space of this vector, i.e., appends a 0 to its coordinates.

pub fn from_homogeneous<SB>(
    v: Vector<N, DimSum<D, U1>, SB>
) -> Option<VectorN<N, D>>where
    SB: Storage<N, DimSum<D, U1>>,
    DefaultAllocator: Allocator<N, D>,

Constructs a vector from coordinates in projective space, i.e., removes a 0 at the end of self. Returns None if this last component is not zero.

impl<N: Real, S: Storage<N, U3>> Vector<N, U3, S>where
    DefaultAllocator: Allocator<N, U3>,

pub fn cross_matrix(&self) -> MatrixN<N, U3>

Computes the matrix M such that for all vector v we have M * v == self.cross(&v).