[][src]Struct num_integer::IterBinomial

pub struct IterBinomial<T> { /* fields omitted */ }

An iterator over binomial coefficients.

Implementations

impl<T> IterBinomial<T> where
    T: Integer
[src]

pub fn new(n: T) -> IterBinomial<T>

Notable traits for IterBinomial<T>

impl<T> Iterator for IterBinomial<T> where
    T: Integer + Clone
type Item = T;
[src]

For a given n, iterate over all binomial coefficients binomial(n, k), for k=0...n.

Note that this might overflow, depending on T. For the primitive integer types, the following n are the largest ones for which there will be no overflow:

typen
u810
i89
u1618
i1617
u3234
i3233
u6467
i6466

For larger n, T should be a bigint type.

Trait Implementations

impl<T> Iterator for IterBinomial<T> where
    T: Integer + Clone
[src]

type Item = T

The type of the elements being iterated over.

Auto Trait Implementations

impl<T> RefUnwindSafe for IterBinomial<T> where
    T: RefUnwindSafe

impl<T> Send for IterBinomial<T> where
    T: Send

impl<T> Sync for IterBinomial<T> where
    T: Sync

impl<T> Unpin for IterBinomial<T> where
    T: Unpin

impl<T> UnwindSafe for IterBinomial<T> where
    T: UnwindSafe

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<I> IntoIterator for I where
    I: Iterator
[src]

type Item = <I as Iterator>::Item

The type of the elements being iterated over.

type IntoIter = I

Which kind of iterator are we turning this into?

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.