fn min(self) -> Min<Self>
    where
        Self::Item: Ord,
    {
        Min::new(self)
    }
/// Computes the minimum of all the items in the iterator. If the
/// iterator is empty, `None` is returned; otherwise, `Some(min)`
/// is returned.
///
/// Note that the order in which the items will be reduced is not
/// specified, so if the `Ord` impl is not truly associative, then
/// the results are not deterministic.
///
/// Basically equivalent to `self.reduce_with(|a, b| cmp::min(a, b))`.
///
/// # Examples
///
/// ```
/// use asparit::*;
///
/// let a = [45, 74, 32];
///
/// assert_eq!(a.par_iter().min().exec(), Some(&32));
///
/// let b: [i32; 0] = [];
///
/// assert_eq!(b.par_iter().min().exec(), None);
/// ```
Computes the minimum of all the items in the iterator. If the
iterator is empty, `None` is returned; otherwise, `Some(min)`
is returned.

Note that the order in which the items will be reduced is not
specified, so if the `Ord` impl is not truly associative, then
the results are not deterministic.


Computes the minimum of all the items in the iterator . If the iterator is empty ` None ` is returned ; otherwise ` Some ( min ) ` is returned . Note that the order in which the items will be reduced is not specified so if the ` Ord ` impl is not truly associative then the results are not deterministic .
fn min(self) -> Min<Self>
    where
        Self::Item: Ord,
    {
        Min::new(self)
    }
fn min ( self ) -> Min < Self > where Self :: Item : Ord , { Min :: new ( self ) }
Computes the minimum of all the items in the iterator.
Computes the minimum of all the items in the iterator .
self
self
examples
None