pub struct FaerVec<T: FaerScalar> { /* private fields */ }Trait Implementations§
Source§impl<T: Scalar + FaerScalar> Add<&FaerVec<T>> for FaerVecRef<'_, T>
impl<T: Scalar + FaerScalar> Add<&FaerVec<T>> for FaerVecRef<'_, T>
Source§impl<T: Scalar + FaerScalar> Add<&FaerVecRef<'_, T>> for &FaerVec<T>
impl<T: Scalar + FaerScalar> Add<&FaerVecRef<'_, T>> for &FaerVec<T>
Source§impl<T: Scalar + FaerScalar> Add<&FaerVecRef<'_, T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> Add<&FaerVecRef<'_, T>> for FaerVec<T>
Source§impl<T: Scalar + FaerScalar> Add<FaerVec<T>> for FaerVecRef<'_, T>
impl<T: Scalar + FaerScalar> Add<FaerVec<T>> for FaerVecRef<'_, T>
Source§impl<T: Scalar + FaerScalar> Add<FaerVecRef<'_, T>> for &FaerVec<T>
impl<T: Scalar + FaerScalar> Add<FaerVecRef<'_, T>> for &FaerVec<T>
Source§impl<T: Scalar + FaerScalar> Add<FaerVecRef<'_, T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> Add<FaerVecRef<'_, T>> for FaerVec<T>
Source§impl<T: Scalar + FaerScalar> AddAssign<&FaerVec<T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> AddAssign<&FaerVec<T>> for FaerVec<T>
Source§fn add_assign(&mut self, rhs: &FaerVec<T>)
fn add_assign(&mut self, rhs: &FaerVec<T>)
Performs the
+= operation. Read moreSource§impl<T: Scalar + FaerScalar> AddAssign<&FaerVec<T>> for FaerVecMut<'_, T>
impl<T: Scalar + FaerScalar> AddAssign<&FaerVec<T>> for FaerVecMut<'_, T>
Source§fn add_assign(&mut self, rhs: &FaerVec<T>)
fn add_assign(&mut self, rhs: &FaerVec<T>)
Performs the
+= operation. Read moreSource§impl<T: Scalar + FaerScalar> AddAssign<&FaerVecRef<'_, T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> AddAssign<&FaerVecRef<'_, T>> for FaerVec<T>
Source§fn add_assign(&mut self, rhs: &FaerVecRef<'_, T>)
fn add_assign(&mut self, rhs: &FaerVecRef<'_, T>)
Performs the
+= operation. Read moreSource§impl<T: Scalar + FaerScalar> AddAssign<FaerVec<T>> for FaerVecMut<'_, T>
impl<T: Scalar + FaerScalar> AddAssign<FaerVec<T>> for FaerVecMut<'_, T>
Source§fn add_assign(&mut self, rhs: FaerVec<T>)
fn add_assign(&mut self, rhs: FaerVec<T>)
Performs the
+= operation. Read moreSource§impl<T: Scalar + FaerScalar> AddAssign<FaerVecRef<'_, T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> AddAssign<FaerVecRef<'_, T>> for FaerVec<T>
Source§fn add_assign(&mut self, rhs: FaerVecRef<'_, T>)
fn add_assign(&mut self, rhs: FaerVecRef<'_, T>)
Performs the
+= operation. Read moreSource§impl<T: Scalar + FaerScalar> AddAssign for FaerVec<T>
impl<T: Scalar + FaerScalar> AddAssign for FaerVec<T>
Source§fn add_assign(&mut self, rhs: FaerVec<T>)
fn add_assign(&mut self, rhs: FaerVec<T>)
Performs the
+= operation. Read moreSource§impl<T: FaerScalar> DefaultDenseMatrix for FaerVec<T>
impl<T: FaerScalar> DefaultDenseMatrix for FaerVec<T>
Source§impl<'a, T: FaerScalar> MulAssign<Scale<T>> for FaerVec<T>
impl<'a, T: FaerScalar> MulAssign<Scale<T>> for FaerVec<T>
Source§fn mul_assign(&mut self, rhs: Scale<T>)
fn mul_assign(&mut self, rhs: Scale<T>)
Performs the
*= operation. Read moreSource§impl<T: Scalar + FaerScalar> Sub<&FaerVec<T>> for FaerVecRef<'_, T>
impl<T: Scalar + FaerScalar> Sub<&FaerVec<T>> for FaerVecRef<'_, T>
Source§impl<T: Scalar + FaerScalar> Sub<&FaerVecRef<'_, T>> for &FaerVec<T>
impl<T: Scalar + FaerScalar> Sub<&FaerVecRef<'_, T>> for &FaerVec<T>
Source§impl<T: Scalar + FaerScalar> Sub<&FaerVecRef<'_, T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> Sub<&FaerVecRef<'_, T>> for FaerVec<T>
Source§impl<T: Scalar + FaerScalar> Sub<FaerVec<T>> for FaerVecRef<'_, T>
impl<T: Scalar + FaerScalar> Sub<FaerVec<T>> for FaerVecRef<'_, T>
Source§impl<T: Scalar + FaerScalar> Sub<FaerVecRef<'_, T>> for &FaerVec<T>
impl<T: Scalar + FaerScalar> Sub<FaerVecRef<'_, T>> for &FaerVec<T>
Source§impl<T: Scalar + FaerScalar> Sub<FaerVecRef<'_, T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> Sub<FaerVecRef<'_, T>> for FaerVec<T>
Source§impl<T: Scalar + FaerScalar> SubAssign<&FaerVec<T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> SubAssign<&FaerVec<T>> for FaerVec<T>
Source§fn sub_assign(&mut self, rhs: &FaerVec<T>)
fn sub_assign(&mut self, rhs: &FaerVec<T>)
Performs the
-= operation. Read moreSource§impl<T: Scalar + FaerScalar> SubAssign<&FaerVec<T>> for FaerVecMut<'_, T>
impl<T: Scalar + FaerScalar> SubAssign<&FaerVec<T>> for FaerVecMut<'_, T>
Source§fn sub_assign(&mut self, rhs: &FaerVec<T>)
fn sub_assign(&mut self, rhs: &FaerVec<T>)
Performs the
-= operation. Read moreSource§impl<T: Scalar + FaerScalar> SubAssign<&FaerVecRef<'_, T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> SubAssign<&FaerVecRef<'_, T>> for FaerVec<T>
Source§fn sub_assign(&mut self, rhs: &FaerVecRef<'_, T>)
fn sub_assign(&mut self, rhs: &FaerVecRef<'_, T>)
Performs the
-= operation. Read moreSource§impl<T: Scalar + FaerScalar> SubAssign<FaerVec<T>> for FaerVecMut<'_, T>
impl<T: Scalar + FaerScalar> SubAssign<FaerVec<T>> for FaerVecMut<'_, T>
Source§fn sub_assign(&mut self, rhs: FaerVec<T>)
fn sub_assign(&mut self, rhs: FaerVec<T>)
Performs the
-= operation. Read moreSource§impl<T: Scalar + FaerScalar> SubAssign<FaerVecRef<'_, T>> for FaerVec<T>
impl<T: Scalar + FaerScalar> SubAssign<FaerVecRef<'_, T>> for FaerVec<T>
Source§fn sub_assign(&mut self, rhs: FaerVecRef<'_, T>)
fn sub_assign(&mut self, rhs: FaerVecRef<'_, T>)
Performs the
-= operation. Read moreSource§impl<T: Scalar + FaerScalar> SubAssign for FaerVec<T>
impl<T: Scalar + FaerScalar> SubAssign for FaerVec<T>
Source§fn sub_assign(&mut self, rhs: FaerVec<T>)
fn sub_assign(&mut self, rhs: FaerVec<T>)
Performs the
-= operation. Read moreSource§impl<T: FaerScalar> Vector for FaerVec<T>
impl<T: FaerScalar> Vector for FaerVec<T>
type View<'a> = FaerVecRef<'a, T>
type ViewMut<'a> = FaerVecMut<'a, T>
type Index = FaerVecIndex
Source§fn context(&self) -> &Self::C
fn context(&self) -> &Self::C
Get the context associated with this vector (for device placement, threading, etc.).
Source§fn inner_mut(&mut self) -> &mut Self::Inner
fn inner_mut(&mut self) -> &mut Self::Inner
Get a mutable reference to the inner representation of the vector.
Source§fn set_index(&mut self, index: IndexType, value: Self::T)
fn set_index(&mut self, index: IndexType, value: Self::T)
Set the value at the specified index to
value.Source§fn squared_norm(&self, y: &Self, atol: &Self, rtol: Self::T) -> Self::T
fn squared_norm(&self, y: &Self, atol: &Self, rtol: Self::T) -> Self::T
Compute the squared weighted norm for error control: $\sum_i (x_i / (|y_i| \cdot \text{rtol} + \text{atol}_i))^2$ Read more
Source§fn as_view_mut(&mut self) -> Self::ViewMut<'_>
fn as_view_mut(&mut self) -> Self::ViewMut<'_>
Create a mutable view of this vector.
Source§fn copy_from_view(&mut self, other: &Self::View<'_>)
fn copy_from_view(&mut self, other: &Self::View<'_>)
Copy all values from a vector view into this vector.
Source§fn from_element(nstates: usize, value: Self::T, ctx: Self::C) -> Self
fn from_element(nstates: usize, value: Self::T, ctx: Self::C) -> Self
Create a vector of length
nstates with all elements initialized to value.Source§fn from_slice(slice: &[Self::T], ctx: Self::C) -> Self
fn from_slice(slice: &[Self::T], ctx: Self::C) -> Self
Create a vector from a slice.
Source§fn clone_as_vec(&self) -> Vec<Self::T>
fn clone_as_vec(&self) -> Vec<Self::T>
Clone this vector as a Rust
Vec.Source§fn zeros(nstates: usize, ctx: Self::C) -> Self
fn zeros(nstates: usize, ctx: Self::C) -> Self
Create a vector of length
nstates with all elements set to zero.Source§fn axpy(&mut self, alpha: Self::T, x: &Self, beta: Self::T)
fn axpy(&mut self, alpha: Self::T, x: &Self, beta: Self::T)
Compute the AXPY operation: self = alpha * x + beta * self
Source§fn axpy_v(&mut self, alpha: Self::T, x: &Self::View<'_>, beta: Self::T)
fn axpy_v(&mut self, alpha: Self::T, x: &Self::View<'_>, beta: Self::T)
Compute the AXPY operation with a vector view: self = alpha * x + beta * self
Source§fn component_mul_assign(&mut self, other: &Self)
fn component_mul_assign(&mut self, other: &Self)
Element-wise multiplication: self_i *= other_i
Source§fn component_div_assign(&mut self, other: &Self)
fn component_div_assign(&mut self, other: &Self)
Element-wise division: self_i /= other_i
Source§fn root_finding(&self, g1: &Self) -> (bool, Self::T, i32)
fn root_finding(&self, g1: &Self) -> (bool, Self::T, i32)
Detect roots (zero crossings) between this vector (as g0) and another vector (g1). Read more
Source§fn assign_at_indices(&mut self, indices: &Self::Index, value: Self::T)
fn assign_at_indices(&mut self, indices: &Self::Index, value: Self::T)
Assign
value to all elements at the specified indices.Source§fn copy_from_indices(&mut self, other: &Self, indices: &Self::Index)
fn copy_from_indices(&mut self, other: &Self, indices: &Self::Index)
Copy values from
other at the specified indices: self[indices[i]] = other[indices[i]]Source§fn gather(&mut self, other: &Self, indices: &Self::Index)
fn gather(&mut self, other: &Self, indices: &Self::Index)
Gather values from
other at indices: self[i] = other[indices[i]]Source§fn scatter(&self, indices: &Self::Index, other: &mut Self)
fn scatter(&self, indices: &Self::Index, other: &mut Self)
Scatter values to
other at indices: other[indices[i]] = self[i]Source§fn assert_eq_st(&self, other: &Self, tol: Self::T)
fn assert_eq_st(&self, other: &Self, tol: Self::T)
Assert that this vector equals
other within a scalar tolerance tol.Source§fn assert_eq_norm(
&self,
other: &Self,
atol: &Self,
rtol: Self::T,
factor: Self::T,
)
fn assert_eq_norm( &self, other: &Self, atol: &Self, rtol: Self::T, factor: Self::T, )
Assert that this vector equals
other using a weighted norm (same as used by ODE solvers). Read moreSource§fn assert_eq(&self, other: &Self, tol: &Self)
fn assert_eq(&self, other: &Self, tol: &Self)
Assert that this vector equals
other using a vector of per-element tolerances.fn assert_eq_vec(s: Vec<Self::T>, other: Vec<Self::T>, tol: Vec<Self::T>)
Source§impl<T: Scalar + FaerScalar> VectorCommon for FaerVec<T>
impl<T: Scalar + FaerScalar> VectorCommon for FaerVec<T>
Source§impl<T: FaerScalar> VectorHost for FaerVec<T>
impl<T: FaerScalar> VectorHost for FaerVec<T>
impl<T: FaerScalar> StructuralPartialEq for FaerVec<T>
Auto Trait Implementations§
impl<T> Freeze for FaerVec<T>
impl<T> RefUnwindSafe for FaerVec<T>where
T: RefUnwindSafe,
impl<T> Send for FaerVec<T>
impl<T> Sync for FaerVec<T>
impl<T> Unpin for FaerVec<T>where
T: Unpin,
impl<T> UnsafeUnpin for FaerVec<T>
impl<T> UnwindSafe for FaerVec<T>where
T: RefUnwindSafe + UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.