Struct nalgebra::linalg::UDU [−][src]
pub struct UDU<T: RealField, D: Dim> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>, { pub u: OMatrix<T, D, D>, pub d: OVector<T, D>, }
Expand description
UDU factorization.
Fields
u: OMatrix<T, D, D>
The upper triangular matrix resulting from the factorization
d: OVector<T, D>
The diagonal matrix resulting from the factorization
Implementations
impl<T: RealField, D: Dim> UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]
impl<T: RealField, D: Dim> UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]Trait Implementations
impl<T: Clone + RealField, D: Clone + Dim> Clone for UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]
impl<T: Clone + RealField, D: Clone + Dim> Clone for UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]impl<T: Debug + RealField, D: Debug + Dim> Debug for UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]
impl<T: Debug + RealField, D: Debug + Dim> Debug for UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
[src]impl<T: RealField, D: Dim> Copy for UDU<T, D> where
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
OVector<T, D>: Copy,
OMatrix<T, D, D>: Copy,
[src]
DefaultAllocator: Allocator<T, D> + Allocator<T, D, D>,
OVector<T, D>: Copy,
OMatrix<T, D, D>: Copy,
Auto Trait Implementations
impl<T, D> !RefUnwindSafe for UDU<T, D>
impl<T, D> !Send for UDU<T, D>
impl<T, D> !Sync for UDU<T, D>
impl<T, D> !Unpin for UDU<T, D>
impl<T, D> !UnwindSafe for UDU<T, D>
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn to_subset(&self) -> Option<SS>
[src]The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
[src]
pub fn is_in_subset(&self) -> bool
[src]Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
[src]
pub fn from_subset(element: &SS) -> SP
[src]The inclusion map: converts self
to the equivalent element of its superset.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,