Struct qd::Double

#[repr(C)]
pub struct Double<T>(pub T, pub T);

Value representing the implicit sum of two floating point terms, such that the absolute value of the second term is less half a ULP of the first term.

Tuple Fields

0: T

1: T

Implementations

impl Double<f64>

pub const EPSILON: Self = _

2.0^{-100}

pub const MIN_POSITIVE: Self = _

2.0^{-970}: precision below this value begins to degrade.

pub const MANTISSA_DIGITS: u32 = 100u32

pub const ZERO: Self = _

pub const NAN: Self = _

pub const INFINITY: Self = _

pub const NEG_INFINITY: Self = _

pub const LN_2: Self = _

pub const FRAC_1_LN_2: Self = _

pub const LN_10: Self = _

pub const FRAC_1_LN_10: Self = _

pub fn abs(self) -> Self

pub fn recip(self) -> Self

pub fn sqrt(self) -> Self

pub fn exp(self) -> Self

pub fn powi(self, pow: i32) -> Self

pub fn powf(self, pow: impl Into<Self>) -> Self

pub fn ln(self) -> Self

pub fn log2(self) -> Self

pub fn log10(self) -> Self

Trait Implementations

impl Add for Double<f64>

type Output = Double<f64>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self::Output

Performs the + operation.

impl AddAssign for Double<f64>

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<T: Clone> Clone for Double<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl ComplexField for Double<f64>

type Real = Double<f64>

type Simd = Arch

type ScalarSimd = Arch

type PortableSimd = Arch

fn faer_sqrt(self) -> Self

Returns the square root of self.

fn faer_from_f64(value: f64) -> Self

Converts value from f64 to Self.
The conversion may be lossy when converting to a type with less precision.

fn faer_add(self, rhs: Self) -> Self

Returns self + rhs.

fn faer_sub(self, rhs: Self) -> Self

Returns self - rhs.

fn faer_mul(self, rhs: Self) -> Self

Returns self * rhs.

fn faer_neg(self) -> Self

Returns -self.

fn faer_inv(self) -> Self

Returns 1.0/self.

fn faer_conj(self) -> Self

Returns conjugate(self).

fn faer_scale_real(self, rhs: Self::Real) -> Self

Returns the input, scaled by rhs.

fn faer_scale_power_of_two(self, rhs: Self::Real) -> Self

Returns the input, scaled by rhs.

fn faer_score(self) -> Self::Real

Returns either the norm or squared norm of the number.

fn faer_abs(self) -> Self::Real

Returns the absolute value of self.

fn faer_abs2(self) -> Self::Real

Returns the squared absolute value of self.

fn faer_nan() -> Self

Returns a NaN value.

fn faer_from_real(real: Self::Real) -> Self

Returns a complex number whose real part is equal to real, and a zero imaginary part.

fn faer_real(self) -> Self::Real

Returns the real part.

fn faer_imag(self) -> Self::Real

Returns the imaginary part.

fn faer_zero() -> Self

Returns 0.0.

fn faer_one() -> Self

Returns 1.0.

fn faer_slice_as_simd<S: Simd>( slice: &[Self::Unit] ) -> (&[Self::SimdUnit<S>], &[Self::Unit])

fn faer_slice_as_simd_mut<S: Simd>( slice: &mut [Self::Unit] ) -> (&mut [Self::SimdUnit<S>], &mut [Self::Unit])

fn faer_partial_load_unit<S: Simd>( simd: S, slice: &[Self::Unit] ) -> Self::SimdUnit<S>

fn faer_partial_store_unit<S: Simd>( simd: S, slice: &mut [Self::Unit], values: Self::SimdUnit<S> )

fn faer_partial_load_last_unit<S: Simd>( simd: S, slice: &[Self::Unit] ) -> Self::SimdUnit<S>

fn faer_partial_store_last_unit<S: Simd>( simd: S, slice: &mut [Self::Unit], values: Self::SimdUnit<S> )

fn faer_simd_splat_unit<S: Simd>(simd: S, unit: Self::Unit) -> Self::SimdUnit<S>

fn faer_simd_neg<S: Simd>( simd: S, values: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_conj<S: Simd>( simd: S, values: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_add<S: Simd>( simd: S, lhs: SimdGroupFor<Self, S>, rhs: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_sub<S: Simd>( simd: S, lhs: SimdGroupFor<Self, S>, rhs: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_mul<S: Simd>( simd: S, lhs: SimdGroupFor<Self, S>, rhs: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_scale_real<S: Simd>( simd: S, lhs: SimdGroupFor<Self, S>, rhs: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_conj_mul<S: Simd>( simd: S, lhs: SimdGroupFor<Self, S>, rhs: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_mul_adde<S: Simd>( simd: S, lhs: SimdGroupFor<Self, S>, rhs: SimdGroupFor<Self, S>, acc: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_conj_mul_adde<S: Simd>( simd: S, lhs: SimdGroupFor<Self, S>, rhs: SimdGroupFor<Self, S>, acc: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_score<S: Simd>( simd: S, values: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self::Real, S>

fn faer_simd_abs2_adde<S: Simd>( simd: S, values: SimdGroupFor<Self, S>, acc: SimdGroupFor<Self::Real, S> ) -> SimdGroupFor<Self::Real, S>

fn faer_simd_abs2<S: Simd>( simd: S, values: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self::Real, S>

fn faer_simd_scalar_mul<S: Simd>(simd: S, lhs: Self, rhs: Self) -> Self

fn faer_simd_scalar_conj_mul<S: Simd>(simd: S, lhs: Self, rhs: Self) -> Self

fn faer_simd_scalar_mul_adde<S: Simd>( simd: S, lhs: Self, rhs: Self, acc: Self ) -> Self

fn faer_simd_scalar_conj_mul_adde<S: Simd>( simd: S, lhs: Self, rhs: Self, acc: Self ) -> Self

fn faer_slice_as_aligned_simd<S: Simd>( simd: S, slice: &[UnitFor<Self>], offset: Offset<SimdMaskFor<Self, S>> ) -> (Prefix<'_, UnitFor<Self>, S, SimdMaskFor<Self, S>>, &[SimdUnitFor<Self, S>], Suffix<'_, UnitFor<Self>, S, SimdMaskFor<Self, S>>)

fn faer_slice_as_aligned_simd_mut<S: Simd>( simd: S, slice: &mut [UnitFor<Self>], offset: Offset<SimdMaskFor<Self, S>> ) -> (PrefixMut<'_, UnitFor<Self>, S, SimdMaskFor<Self, S>>, &mut [SimdUnitFor<Self, S>], SuffixMut<'_, UnitFor<Self>, S, SimdMaskFor<Self, S>>)

fn faer_simd_rotate_left<S: Simd>( simd: S, values: SimdGroupFor<Self, S>, amount: usize ) -> SimdGroupFor<Self, S>

fn faer_align_offset<S: Simd>( simd: S, ptr: *const UnitFor<Self>, len: usize ) -> Offset<SimdMaskFor<Self, S>>

fn faer_is_nan(&self) -> bool

Returns true if self is a NaN value, or false otherwise.

fn faer_is_finite(&self) -> bool

Returns true if self is a NaN value, or false otherwise.

fn faer_partial_load<S>( simd: S, slice: <Self::Group as ForType>::FaerOf<&[Self::Unit]> ) -> <Self::Group as ForCopyType>::FaerOfCopy<Self::SimdUnit<S>>

where S: Simd,

fn faer_partial_store<S>( simd: S, slice: <Self::Group as ForType>::FaerOf<&mut [Self::Unit]>, values: <Self::Group as ForCopyType>::FaerOfCopy<Self::SimdUnit<S>> )

where S: Simd,

fn faer_partial_load_last<S>( simd: S, slice: <Self::Group as ForType>::FaerOf<&[Self::Unit]> ) -> <Self::Group as ForCopyType>::FaerOfCopy<Self::SimdUnit<S>>

where S: Simd,

fn faer_partial_store_last<S>( simd: S, slice: <Self::Group as ForType>::FaerOf<&mut [Self::Unit]>, values: <Self::Group as ForCopyType>::FaerOfCopy<Self::SimdUnit<S>> )

where S: Simd,

fn faer_simd_splat<S>( simd: S, value: Self ) -> <Self::Group as ForCopyType>::FaerOfCopy<Self::SimdUnit<S>>

where S: Simd,

fn faer_simd_reduce_add<S>( simd: S, values: <Self::Group as ForCopyType>::FaerOfCopy<Self::SimdUnit<S>> ) -> Self

where S: Simd,

impl Conjugate for Double<f64>

type Conj = Double<f64>

Must have the same layout as Self, and Conj::Unit must have the same layout as Unit.

type Canonical = Double<f64>

Must have the same layout as Self, and Canonical::Unit must have the same layout as Unit.

fn canonicalize(self) -> Self::Canonical

Performs the implicit conjugation operation on the given value, returning the canonical form.

impl<T: Debug> Debug for Double<T>

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

Formats the value using the given formatter.

impl Div for Double<f64>

type Output = Double<f64>

The resulting type after applying the / operator.

fn div(self, rhs: Self) -> Self::Output

Performs the / operation.

impl DivAssign for Double<f64>

fn div_assign(&mut self, rhs: Self)

Performs the /= operation.

impl Entity for Double<f64>

type Unit = f64

type Index = u64

type SimdUnit<S: Simd> = <S as Simd>::f64s

type SimdMask<S: Simd> = <S as Simd>::m64s

type SimdIndex<S: Simd> = <S as Simd>::u64s

type Group = DoubleGroup

type Iter<I: Iterator> = Double<I>

type PrefixUnit<'a, S: Simd> = Prefix<'a, f64, S, <S as Simd>::m64s>

type SuffixUnit<'a, S: Simd> = Suffix<'a, f64, S, <S as Simd>::m64s>

type PrefixMutUnit<'a, S: Simd> = PrefixMut<'a, f64, S, <S as Simd>::m64s>

type SuffixMutUnit<'a, S: Simd> = SuffixMut<'a, f64, S, <S as Simd>::m64s>

const N_COMPONENTS: usize = 2usize

const UNIT: GroupCopyFor<Self, ()> = _

fn faer_first<T>(group: GroupFor<Self, T>) -> T

fn faer_from_units(group: GroupFor<Self, Self::Unit>) -> Self

fn faer_into_units(self) -> GroupFor<Self, Self::Unit>

fn faer_as_ref<T>(group: &GroupFor<Self, T>) -> GroupFor<Self, &T>

fn faer_as_mut<T>(group: &mut GroupFor<Self, T>) -> GroupFor<Self, &mut T>

fn faer_as_ptr<T>(group: *mut GroupFor<Self, T>) -> GroupFor<Self, *mut T>

fn faer_map_impl<T, U>( group: GroupFor<Self, T>, f: &mut impl FnMut(T) -> U ) -> GroupFor<Self, U>

fn faer_zip<T, U>( first: GroupFor<Self, T>, second: GroupFor<Self, U> ) -> GroupFor<Self, (T, U)>

fn faer_unzip<T, U>( zipped: GroupFor<Self, (T, U)> ) -> (GroupFor<Self, T>, GroupFor<Self, U>)

fn faer_map_with_context<Ctx, T, U>( ctx: Ctx, group: GroupFor<Self, T>, f: &mut impl FnMut(Ctx, T) -> (Ctx, U) ) -> (Ctx, GroupFor<Self, U>)

fn faer_into_iter<I: IntoIterator>( iter: GroupFor<Self, I> ) -> Self::Iter<I::IntoIter>

fn faer_map<T, U>( group: <Self::Group as ForType>::FaerOf<T>, f: impl FnMut(T) -> U ) -> <Self::Group as ForType>::FaerOf<U>

fn faer_unzip2<T>( zipped: <Self::Group as ForType>::FaerOf<[T; 2]> ) -> [<Self::Group as ForType>::FaerOf<T>; 2]

fn faer_unzip4<T>( zipped: <Self::Group as ForType>::FaerOf<[T; 4]> ) -> [<Self::Group as ForType>::FaerOf<T>; 4]

fn faer_unzip8<T>( zipped: <Self::Group as ForType>::FaerOf<[T; 8]> ) -> [<Self::Group as ForType>::FaerOf<T>; 8]

fn faer_as_arrays<const N: usize, T>( group: <Self::Group as ForType>::FaerOf<&[T]> ) -> (<Self::Group as ForType>::FaerOf<&[[T; N]]>, <Self::Group as ForType>::FaerOf<&[T]>)

fn faer_as_arrays_mut<const N: usize, T>( group: <Self::Group as ForType>::FaerOf<&mut [T]> ) -> (<Self::Group as ForType>::FaerOf<&mut [[T; N]]>, <Self::Group as ForType>::FaerOf<&mut [T]>)

fn faer_deref<T>( group: <Self::Group as ForType>::FaerOf<&T> ) -> <Self::Group as ForType>::FaerOf<T>

where T: Copy,

fn faer_rb<'short, T>( value: <Self::Group as ForType>::FaerOf<&'short T> ) -> <Self::Group as ForType>::FaerOf<<T as Reborrow<'short>>::Target>

where T: Reborrow<'short>,

fn faer_rb_mut<'short, T>( value: <Self::Group as ForType>::FaerOf<&'short mut T> ) -> <Self::Group as ForType>::FaerOf<<T as ReborrowMut<'short>>::Target>

where T: ReborrowMut<'short>,

fn faer_into_const<T>( value: <Self::Group as ForType>::FaerOf<T> ) -> <Self::Group as ForType>::FaerOf<<T as IntoConst>::Target>

where T: IntoConst,

fn faer_copy<T>( x: &<Self::Group as ForType>::FaerOf<T> ) -> <Self::Group as ForType>::FaerOf<T>

where T: Copy,

impl From<f64> for Double<f64>

fn from(value: f64) -> Self

Converts to this type from the input type.

impl<I: Iterator> Iterator for Double<I>

type Item = Double<<I as Iterator>::Item>

The type of the elements being iterated over.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

fn next_chunk<const N: usize>( &mut self ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

where Self: Sized,

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

where Self: Sized,

Consumes the iterator, returning the last element.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places an item generated by separator between adjacent items of the original iterator.

fn map<B, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F)

where Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

fn skip(self, n: usize) -> Skip<Self>

where Self: Sized,

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Borrows an iterator, rather than consuming it.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R

where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn fold<B, F>(self, init: B, f: F) -> B

where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> R, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<F, R>( &mut self, f: F ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, F: FnMut(&Self::Item) -> R, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: 'a + Copy, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: 'a + Clone, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering>

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another.

fn eq_by<I, F>(self, other: I, eq: F) -> bool

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another.

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

🔬This is a nightly-only experimental API. (is_sorted)

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)

Checks if the elements of this iterator are sorted using the given key extraction function.

impl Mul<Double<f64>> for Pow2

type Output = Double<f64>

The resulting type after applying the * operator.

fn mul(self, rhs: Double<f64>) -> Self::Output

Performs the * operation.

impl Mul<Pow2> for Double<f64>

type Output = Double<f64>

The resulting type after applying the * operator.

fn mul(self, rhs: Pow2) -> Self::Output

Performs the * operation.

impl Mul for Double<f64>

type Output = Double<f64>

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation.

impl MulAssign for Double<f64>

fn mul_assign(&mut self, rhs: Self)

Performs the *= operation.

impl Neg for Double<f64>

type Output = Double<f64>

The resulting type after applying the - operator.

fn neg(self) -> Self::Output

Performs the unary - operation.

impl<T: Ord> Ord for Double<T>

fn cmp(&self, other: &Double<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq for Double<T>

fn eq(&self, other: &Double<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialOrd> PartialOrd for Double<T>

fn partial_cmp(&self, other: &Double<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl RealField for Double<f64>

fn faer_epsilon() -> Option<Self>

fn faer_zero_threshold() -> Option<Self>

fn faer_div(self, rhs: Self) -> Self

fn faer_usize_to_index(a: usize) -> Self::Index

fn faer_index_to_usize(a: Self::Index) -> usize

fn faer_max_index() -> Self::Index

fn faer_simd_less_than<S: Simd>( simd: S, a: SimdGroupFor<Self, S>, b: SimdGroupFor<Self, S> ) -> Self::SimdMask<S>

fn faer_simd_less_than_or_equal<S: Simd>( simd: S, a: SimdGroupFor<Self, S>, b: SimdGroupFor<Self, S> ) -> Self::SimdMask<S>

fn faer_simd_greater_than<S: Simd>( simd: S, a: SimdGroupFor<Self, S>, b: SimdGroupFor<Self, S> ) -> Self::SimdMask<S>

fn faer_simd_greater_than_or_equal<S: Simd>( simd: S, a: SimdGroupFor<Self, S>, b: SimdGroupFor<Self, S> ) -> Self::SimdMask<S>

fn faer_simd_select<S: Simd>( simd: S, mask: Self::SimdMask<S>, if_true: SimdGroupFor<Self, S>, if_false: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

fn faer_simd_index_select<S: Simd>( simd: S, mask: Self::SimdMask<S>, if_true: Self::SimdIndex<S>, if_false: Self::SimdIndex<S> ) -> Self::SimdIndex<S>

fn faer_simd_index_seq<S: Simd>(simd: S) -> Self::SimdIndex<S>

fn faer_simd_index_splat<S: Simd>( simd: S, value: Self::Index ) -> Self::SimdIndex<S>

fn faer_simd_index_add<S: Simd>( simd: S, a: Self::SimdIndex<S>, b: Self::SimdIndex<S> ) -> Self::SimdIndex<S>

fn faer_min_positive() -> Self

fn faer_min_positive_inv() -> Self

fn faer_min_positive_sqrt() -> Self

fn faer_min_positive_sqrt_inv() -> Self

fn faer_simd_index_rotate_left<S: Simd>( simd: S, values: SimdIndexFor<Self, S>, amount: usize ) -> SimdIndexFor<Self, S>

fn faer_simd_abs<S: Simd>( simd: S, values: SimdGroupFor<Self, S> ) -> SimdGroupFor<Self, S>

impl Sub for Double<f64>

type Output = Double<f64>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self::Output

Performs the - operation.

impl SubAssign for Double<f64>

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<T: Zeroable> Zeroable for Double<T>

fn zeroed() -> Self

Calls zeroed.

impl<T: Copy> Copy for Double<T>

impl<T: Eq> Eq for Double<T>

impl<T: Pod> Pod for Double<T>

impl<T> StructuralPartialEq for Double<T>