fn max_by_key<O, K>(self, operation: O) -> MaxByKey<Self, O>
    where
        O: Fn(&Self::Item) -> K + Clone + Send + 'a,
        K: Ord + Send,
    {
        MaxByKey::new(self, operation)
    }
/// Computes the item that yields the maximum value for the given
/// function. If the iterator is empty, `None` is returned;
/// otherwise, `Some(item)` 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.
///
/// # Examples
///
/// ```
/// use asparit::*;
///
/// let a = [-3_i32, 34, 2, 5, -10, -3, -23];
///
/// assert_eq!(a.par_iter().max_by_key(|x| x.abs()).exec(), Some(&34));
/// ```
Computes the item that yields the maximum value for the given
function. If the iterator is empty, `None` is returned;
otherwise, `Some(item)` 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 item that yields the maximum value for the given function . If the iterator is empty ` None ` is returned ; otherwise ` Some ( item ) ` 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 max_by_key<O, K>(self, operation: O) -> MaxByKey<Self, O>
    where
        O: Fn(&Self::Item) -> K + Clone + Send + 'a,
        K: Ord + Send,
    {
        MaxByKey::new(self, operation)
    }
fn max_by_key < O , K > ( self , operation : O ) -> MaxByKey < Self , O > where O : Fn ( & Self :: Item ) -> K + Clone + Send + ' a , K : Ord + Send , { MaxByKey :: new ( self , operation ) }
Computes the item that yields the maximum value for the given
function.
Computes the item that yields the maximum value for the given function .
self
operation
O
self
operation
O
examples
None