Trait prcn_lib::prelude::__std_iter::Product

pub trait Product<A = Self> {
    fn product<I>(iter: I) -> Self
    where
        I: Iterator<Item = A>;
}

Trait to represent types that can be created by multiplying elements of an iterator.

This trait is used to implement the product method on iterators. Types which implement the trait can be generated by the product method. Like FromIterator this trait should rarely be called directly and instead interacted with through Iterator::product.

Required methods

fn product<I>(iter: I) -> Self where
    I: Iterator<Item = A>, 

Method which takes an iterator and generates Self from the elements by multiplying the items.

Loading content...

Implementations on Foreign Types

impl<'a> Product<&'a i16> for i16

fn product<I>(iter: I) -> i16 where
    I: Iterator<Item = &'a i16>, 

impl<'a> Product<&'a Wrapping<u32>> for Wrapping<u32>

fn product<I>(iter: I) -> Wrapping<u32> where
    I: Iterator<Item = &'a Wrapping<u32>>, 

impl<'a> Product<&'a i32> for i32

fn product<I>(iter: I) -> i32 where
    I: Iterator<Item = &'a i32>, 

impl Product<u128> for u128

fn product<I>(iter: I) -> u128 where
    I: Iterator<Item = u128>, 

impl<T, U> Product<Option<U>> for Option<T> where
    T: Product<U>, 

fn product<I>(iter: I) -> Option<T> where
    I: Iterator<Item = Option<U>>, 

Takes each element in the Iterator: if it is a None, no further elements are taken, and the None is returned. Should no None occur, the product of all elements is returned.

impl<'a> Product<&'a u8> for u8

fn product<I>(iter: I) -> u8 where
    I: Iterator<Item = &'a u8>, 

impl Product<i8> for i8

fn product<I>(iter: I) -> i8 where
    I: Iterator<Item = i8>, 

impl<'a> Product<&'a i8> for i8

fn product<I>(iter: I) -> i8 where
    I: Iterator<Item = &'a i8>, 

impl Product<i32> for i32

fn product<I>(iter: I) -> i32 where
    I: Iterator<Item = i32>, 

impl Product<isize> for isize

fn product<I>(iter: I) -> isize where
    I: Iterator<Item = isize>, 

impl Product<i16> for i16

fn product<I>(iter: I) -> i16 where
    I: Iterator<Item = i16>, 

impl Product<i128> for i128

fn product<I>(iter: I) -> i128 where
    I: Iterator<Item = i128>, 

impl Product<Wrapping<i8>> for Wrapping<i8>

fn product<I>(iter: I) -> Wrapping<i8> where
    I: Iterator<Item = Wrapping<i8>>, 

impl Product<i64> for i64

fn product<I>(iter: I) -> i64 where
    I: Iterator<Item = i64>, 

impl<'a> Product<&'a Wrapping<i8>> for Wrapping<i8>

fn product<I>(iter: I) -> Wrapping<i8> where
    I: Iterator<Item = &'a Wrapping<i8>>, 

impl Product<f32> for f32

fn product<I>(iter: I) -> f32 where
    I: Iterator<Item = f32>, 

impl Product<Wrapping<isize>> for Wrapping<isize>

fn product<I>(iter: I) -> Wrapping<isize> where
    I: Iterator<Item = Wrapping<isize>>, 

impl<'a> Product<&'a Wrapping<i128>> for Wrapping<i128>

fn product<I>(iter: I) -> Wrapping<i128> where
    I: Iterator<Item = &'a Wrapping<i128>>, 

impl<'a> Product<&'a u64> for u64

fn product<I>(iter: I) -> u64 where
    I: Iterator<Item = &'a u64>, 

impl Product<usize> for usize

fn product<I>(iter: I) -> usize where
    I: Iterator<Item = usize>, 

impl Product<Wrapping<i32>> for Wrapping<i32>

fn product<I>(iter: I) -> Wrapping<i32> where
    I: Iterator<Item = Wrapping<i32>>, 

impl<'a> Product<&'a Wrapping<u128>> for Wrapping<u128>

fn product<I>(iter: I) -> Wrapping<u128> where
    I: Iterator<Item = &'a Wrapping<u128>>, 

impl<'a> Product<&'a isize> for isize

fn product<I>(iter: I) -> isize where
    I: Iterator<Item = &'a isize>, 

impl<T, U, E> Product<Result<U, E>> for Result<T, E> where
    T: Product<U>, 

fn product<I>(iter: I) -> Result<T, E> where
    I: Iterator<Item = Result<U, E>>, 

Takes each element in the Iterator: if it is an Err, no further elements are taken, and the Err is returned. Should no Err occur, the product of all elements is returned.

impl<'a> Product<&'a Wrapping<i32>> for Wrapping<i32>

fn product<I>(iter: I) -> Wrapping<i32> where
    I: Iterator<Item = &'a Wrapping<i32>>, 

impl<'a> Product<&'a u32> for u32

fn product<I>(iter: I) -> u32 where
    I: Iterator<Item = &'a u32>, 

impl Product<u32> for u32

fn product<I>(iter: I) -> u32 where
    I: Iterator<Item = u32>, 

impl<'a> Product<&'a i128> for i128

fn product<I>(iter: I) -> i128 where
    I: Iterator<Item = &'a i128>, 

impl<'a> Product<&'a Wrapping<u64>> for Wrapping<u64>

fn product<I>(iter: I) -> Wrapping<u64> where
    I: Iterator<Item = &'a Wrapping<u64>>, 

impl<'a> Product<&'a Wrapping<i64>> for Wrapping<i64>

fn product<I>(iter: I) -> Wrapping<i64> where
    I: Iterator<Item = &'a Wrapping<i64>>, 

impl<'a> Product<&'a Wrapping<usize>> for Wrapping<usize>

fn product<I>(iter: I) -> Wrapping<usize> where
    I: Iterator<Item = &'a Wrapping<usize>>, 

impl Product<f64> for f64

fn product<I>(iter: I) -> f64 where
    I: Iterator<Item = f64>, 

impl<'a> Product<&'a Wrapping<isize>> for Wrapping<isize>

fn product<I>(iter: I) -> Wrapping<isize> where
    I: Iterator<Item = &'a Wrapping<isize>>, 

impl<'a> Product<&'a Wrapping<u8>> for Wrapping<u8>

fn product<I>(iter: I) -> Wrapping<u8> where
    I: Iterator<Item = &'a Wrapping<u8>>, 

impl<'a> Product<&'a usize> for usize

fn product<I>(iter: I) -> usize where
    I: Iterator<Item = &'a usize>, 

impl Product<Wrapping<u16>> for Wrapping<u16>

fn product<I>(iter: I) -> Wrapping<u16> where
    I: Iterator<Item = Wrapping<u16>>, 

impl Product<Wrapping<u32>> for Wrapping<u32>

fn product<I>(iter: I) -> Wrapping<u32> where
    I: Iterator<Item = Wrapping<u32>>, 

impl Product<Wrapping<i16>> for Wrapping<i16>

fn product<I>(iter: I) -> Wrapping<i16> where
    I: Iterator<Item = Wrapping<i16>>, 

impl<'a> Product<&'a Wrapping<i16>> for Wrapping<i16>

fn product<I>(iter: I) -> Wrapping<i16> where
    I: Iterator<Item = &'a Wrapping<i16>>, 

impl Product<Wrapping<i128>> for Wrapping<i128>

fn product<I>(iter: I) -> Wrapping<i128> where
    I: Iterator<Item = Wrapping<i128>>, 

impl<'a> Product<&'a u128> for u128

fn product<I>(iter: I) -> u128 where
    I: Iterator<Item = &'a u128>, 

impl<'a> Product<&'a i64> for i64

fn product<I>(iter: I) -> i64 where
    I: Iterator<Item = &'a i64>, 

impl Product<Wrapping<i64>> for Wrapping<i64>

fn product<I>(iter: I) -> Wrapping<i64> where
    I: Iterator<Item = Wrapping<i64>>, 

impl Product<u16> for u16

fn product<I>(iter: I) -> u16 where
    I: Iterator<Item = u16>, 

impl<'a> Product<&'a f32> for f32

fn product<I>(iter: I) -> f32 where
    I: Iterator<Item = &'a f32>, 

impl Product<Wrapping<u64>> for Wrapping<u64>

fn product<I>(iter: I) -> Wrapping<u64> where
    I: Iterator<Item = Wrapping<u64>>, 

impl Product<Wrapping<usize>> for Wrapping<usize>

fn product<I>(iter: I) -> Wrapping<usize> where
    I: Iterator<Item = Wrapping<usize>>, 

impl<'a> Product<&'a f64> for f64

fn product<I>(iter: I) -> f64 where
    I: Iterator<Item = &'a f64>, 

impl Product<u64> for u64

fn product<I>(iter: I) -> u64 where
    I: Iterator<Item = u64>, 

impl Product<Wrapping<u8>> for Wrapping<u8>

fn product<I>(iter: I) -> Wrapping<u8> where
    I: Iterator<Item = Wrapping<u8>>, 

impl<'a> Product<&'a u16> for u16

fn product<I>(iter: I) -> u16 where
    I: Iterator<Item = &'a u16>, 

impl Product<u8> for u8

fn product<I>(iter: I) -> u8 where
    I: Iterator<Item = u8>, 

impl<'a> Product<&'a Wrapping<u16>> for Wrapping<u16>

fn product<I>(iter: I) -> Wrapping<u16> where
    I: Iterator<Item = &'a Wrapping<u16>>, 

impl Product<Wrapping<u128>> for Wrapping<u128>

fn product<I>(iter: I) -> Wrapping<u128> where
    I: Iterator<Item = Wrapping<u128>>, 

impl<T> Product<Complex<T>> for Complex<T> where
    T: Clone + Num, 

fn product<I>(iter: I) -> Complex<T> where
    I: Iterator<Item = Complex<T>>, 

impl<'a, T> Product<&'a Complex<T>> for Complex<T> where
    T: 'a + Clone + Num, 

fn product<I>(iter: I) -> Complex<T> where
    I: Iterator<Item = &'a Complex<T>>, 

impl<T> Product<Ratio<T>> for Ratio<T> where
    T: Clone + Integer, 

fn product<I>(iter: I) -> Ratio<T> where
    I: Iterator<Item = Ratio<T>>, 

impl<'a, T> Product<&'a Ratio<T>> for Ratio<T> where
    T: Clone + Integer, 

fn product<I>(iter: I) -> Ratio<T> where
    I: Iterator<Item = &'a Ratio<T>>, 

impl<'a, N, D> Product<&'a Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>> for Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer> where
    D: DimName,
    N: Scalar + Zero + One + ClosedMul<N> + ClosedAdd<N>,
    DefaultAllocator: Allocator<N, D, D>, 

fn product<I>(
    iter: I
) -> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer> where
    I: Iterator<Item = &'a Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>>, 

impl<N, D> Product<Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>> for Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer> where
    D: DimName,
    N: Scalar + Zero + One + ClosedMul<N> + ClosedAdd<N>,
    DefaultAllocator: Allocator<N, D, D>, 

fn product<I>(
    iter: I
) -> Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer> where
    I: Iterator<Item = Matrix<N, D, D, <DefaultAllocator as Allocator<N, D, D>>::Buffer>>, 

Loading content...

Implementors

impl<T> Product<T> for BigInt where
    BigInt: Mul<T>,
    <BigInt as Mul<T>>::Output == BigInt, 

fn product<I>(iter: I) -> BigInt where
    I: Iterator<Item = T>, 

impl<T> Product<T> for BigUint where
    BigUint: Mul<T>,
    <BigUint as Mul<T>>::Output == BigUint, 

fn product<I>(iter: I) -> BigUint where
    I: Iterator<Item = T>, 

Loading content...