[−][src]Struct shogi::bitboard::Bitboard
Represents a board state in which each square takes two possible values, filled or empty.
Bitboard
implements PEXT Bitboard which relies on BMI2 instruction set.
For environments which do not support BMI2, it will use software fallback methods. Thanks to bitintr crate.
Examples
use shogi::Bitboard; use shogi::square::consts::*; let mut bb = Bitboard::empty(); bb ^= SQ_1A; bb |= SQ_9I; assert_eq!(2, bb.count()); assert_eq!(1, bb.filter(|sq| sq.file() == 0).count());
Methods
impl Bitboard
[src]
impl Bitboard
ⓘImportant traits for Bitboard
pub fn empty() -> Bitboard | [src] |
Returns an empty instance of Bitboard
.
pub fn is_any(&self) -> bool | [src] |
Checks if any of its squares is filled.
pub fn is_empty(&self) -> bool | [src] |
Checks if all of its squares are empty.
pub fn clear_at(&mut self, sq: Square) | [src] |
Sets the given square as empty.
pub fn count(&self) -> u32 | [src] |
Returns the number of squares filled.
pub fn pop(&mut self) -> Square | [src] |
Sets the first filled square as empty and returns that square.
This method expects the bitboard not being empty.
Trait Implementations
impl Clone for Bitboard
[src]
impl Clone for Bitboard
ⓘImportant traits for Bitboard
fn clone(&self) -> Bitboard | [src] |
fn clone_from(&mut self, source: &Self) | 1.0.0 [src] |
Performs copy-assignment from source
. Read more
impl Default for Bitboard
[src]
impl Default for Bitboard
impl Iterator for Bitboard
[src]
impl Iterator for Bitboard
type Item = Square
The type of the elements being iterated over.
fn next(&mut self) -> Option<Self::Item> | [src] |
fn size_hint(&self) -> (usize, Option<usize>) | 1.0.0 [src] |
Returns the bounds on the remaining length of the iterator. Read more
fn count(self) -> usize | 1.0.0 [src] |
Consumes the iterator, counting the number of iterations and returning it. Read more
fn last(self) -> Option<Self::Item> | 1.0.0 [src] |
Consumes the iterator, returning the last element. Read more
fn nth(&mut self, n: usize) -> Option<Self::Item> | 1.0.0 [src] |
Returns the n
th element of the iterator. Read more
fn step_by(self, step: usize) -> StepBy<Self> | 1.28.0 [src] |
Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where | 1.0.0 [src] |
Takes two iterators and creates a new iterator over both in sequence. Read more
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where | 1.0.0 [src] |
'Zips up' two iterators into a single iterator of pairs. Read more
fn map<B, F>(self, f: F) -> Map<Self, F> where | 1.0.0 [src] |
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn for_each<F>(self, f: F) where | 1.21.0 [src] |
Calls a closure on each element of an iterator. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where | 1.0.0 [src] |
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where | 1.0.0 [src] |
Creates an iterator that both filters and maps. Read more
fn enumerate(self) -> Enumerate<Self> | 1.0.0 [src] |
Creates an iterator which gives the current iteration count as well as the next value. Read more
fn peekable(self) -> Peekable<Self> | 1.0.0 [src] |
Creates an iterator which can use peek
to look at the next element of the iterator without consuming it. Read more
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where | 1.0.0 [src] |
Creates an iterator that [skip
]s elements based on a predicate. Read more
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where | 1.0.0 [src] |
Creates an iterator that yields elements based on a predicate. Read more
fn skip(self, n: usize) -> Skip<Self> | 1.0.0 [src] |
Creates an iterator that skips the first n
elements. Read more
fn take(self, n: usize) -> Take<Self> | 1.0.0 [src] |
Creates an iterator that yields its first n
elements. Read more
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where | 1.0.0 [src] |
An iterator adaptor similar to [fold
] that holds internal state and produces a new iterator. Read more
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where | 1.0.0 [src] |
Creates an iterator that works like map, but flattens nested structure. Read more
fn flatten(self) -> Flatten<Self> where | 1.29.0 [src] |
Creates an iterator that flattens nested structure. Read more
fn fuse(self) -> Fuse<Self> | 1.0.0 [src] |
Creates an iterator which ends after the first [None
]. Read more
fn inspect<F>(self, f: F) -> Inspect<Self, F> where | 1.0.0 [src] |
Do something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self | 1.0.0 [src] |
Borrows an iterator, rather than consuming it. Read more
| 1.0.0 [src] |
Transforms an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where | 1.0.0 [src] |
Consumes an iterator, creating two collections from it. Read more
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where | 1.27.0 [src] |
An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more
fn try_for_each<F, R>(&mut self, f: F) -> R where | 1.27.0 [src] |
An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more
fn fold<B, F>(self, init: B, f: F) -> B where | 1.0.0 [src] |
An iterator method that applies a function, producing a single, final value. Read more
fn all<F>(&mut self, f: F) -> bool where | 1.0.0 [src] |
Tests if every element of the iterator matches a predicate. Read more
fn any<F>(&mut self, f: F) -> bool where | 1.0.0 [src] |
Tests if any element of the iterator matches a predicate. Read more
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where | 1.0.0 [src] |
Searches for an element of an iterator that satisfies a predicate. Read more
fn find_map<B, F>(&mut self, f: F) -> Option<B> where | 1.30.0 [src] |
Applies function to the elements of iterator and returns the first non-none result. Read more
fn position<P>(&mut self, predicate: P) -> Option<usize> where | 1.0.0 [src] |
Searches for an element in an iterator, returning its index. Read more
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where | 1.0.0 [src] |
Searches for an element in an iterator from the right, returning its index. Read more
fn max(self) -> Option<Self::Item> where | 1.0.0 [src] |
Returns the maximum element of an iterator. Read more
fn min(self) -> Option<Self::Item> where | 1.0.0 [src] |
Returns the minimum element of an iterator. Read more
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where | 1.6.0 [src] |
Returns the element that gives the maximum value from the specified function. Read more
fn max_by<F>(self, compare: F) -> Option<Self::Item> where | 1.15.0 [src] |
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where | 1.6.0 [src] |
Returns the element that gives the minimum value from the specified function. Read more
fn min_by<F>(self, compare: F) -> Option<Self::Item> where | 1.15.0 [src] |
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
fn rev(self) -> Rev<Self> where | 1.0.0 [src] |
Reverses an iterator's direction. Read more
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where | 1.0.0 [src] |
Converts an iterator of pairs into a pair of containers. Read more
fn copied<'a, T>(self) -> Copied<Self> where | [src] |
iter_copied
)Creates an iterator which copies all of its elements. Read more
fn cloned<'a, T>(self) -> Cloned<Self> where | 1.0.0 [src] |
Creates an iterator which [clone
]s all of its elements. Read more
fn cycle(self) -> Cycle<Self> where | 1.0.0 [src] |
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where | 1.11.0 [src] |
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where | 1.11.0 [src] |
Iterates over the entire iterator, multiplying all the elements Read more
fn cmp<I>(self, other: I) -> Ordering where | 1.5.0 [src] |
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where | 1.5.0 [src] |
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn eq<I>(self, other: I) -> bool where | 1.5.0 [src] |
Determines if the elements of this Iterator
are equal to those of another. Read more
fn ne<I>(self, other: I) -> bool where | 1.5.0 [src] |
Determines if the elements of this Iterator
are unequal to those of another. Read more
fn lt<I>(self, other: I) -> bool where | 1.5.0 [src] |
Determines if the elements of this Iterator
are lexicographically less than those of another. Read more
fn le<I>(self, other: I) -> bool where | 1.5.0 [src] |
Determines if the elements of this Iterator
are lexicographically less or equal to those of another. Read more
fn gt<I>(self, other: I) -> bool where | 1.5.0 [src] |
Determines if the elements of this Iterator
are lexicographically greater than those of another. Read more
fn ge<I>(self, other: I) -> bool where | 1.5.0 [src] |
Determines if the elements of this Iterator
are lexicographically greater than or equal to those of another. Read more
impl Copy for Bitboard
[src]
impl Copy for Bitboard
impl Display for Bitboard
[src]
impl Display for Bitboard
impl Debug for Bitboard
[src]
impl Debug for Bitboard
impl<'a> Not for &'a Bitboard
[src]
impl<'a> Not for &'a Bitboard
type Output = Bitboard
The resulting type after applying the !
operator.
ⓘImportant traits for Bitboard
fn not(self) -> Bitboard | [src] |
impl<'a, 'b> BitAnd<&'a Bitboard> for &'b Bitboard
[src]
impl<'a, 'b> BitAnd<&'a Bitboard> for &'b Bitboard
type Output = Bitboard
The resulting type after applying the &
operator.
ⓘImportant traits for Bitboard
fn bitand(self, rhs: &'a Bitboard) -> Bitboard | [src] |
impl<'a> BitAnd<Square> for &'a Bitboard
[src]
impl<'a> BitAnd<Square> for &'a Bitboard
type Output = Bitboard
The resulting type after applying the &
operator.
ⓘImportant traits for Bitboard
fn bitand(self, rhs: Square) -> Bitboard | [src] |
impl<'a, 'b> BitOr<&'a Bitboard> for &'b Bitboard
[src]
impl<'a, 'b> BitOr<&'a Bitboard> for &'b Bitboard
type Output = Bitboard
The resulting type after applying the |
operator.
ⓘImportant traits for Bitboard
fn bitor(self, rhs: &'a Bitboard) -> Bitboard | [src] |
impl<'a> BitOr<Square> for &'a Bitboard
[src]
impl<'a> BitOr<Square> for &'a Bitboard
type Output = Bitboard
The resulting type after applying the |
operator.
ⓘImportant traits for Bitboard
fn bitor(self, rhs: Square) -> Bitboard | [src] |
impl<'a, 'b> BitXor<&'a Bitboard> for &'b Bitboard
[src]
impl<'a, 'b> BitXor<&'a Bitboard> for &'b Bitboard
type Output = Bitboard
The resulting type after applying the ^
operator.
ⓘImportant traits for Bitboard
fn bitxor(self, rhs: &'a Bitboard) -> Bitboard | [src] |
impl<'a> BitXor<Square> for &'a Bitboard
[src]
impl<'a> BitXor<Square> for &'a Bitboard
type Output = Bitboard
The resulting type after applying the ^
operator.
ⓘImportant traits for Bitboard
fn bitxor(self, rhs: Square) -> Bitboard | [src] |
impl<'a> BitAndAssign<&'a Bitboard> for Bitboard
[src]
impl<'a> BitAndAssign<&'a Bitboard> for Bitboard
fn bitand_assign(&mut self, rhs: &'a Bitboard) | [src] |
impl<'a> BitAndAssign<Square> for Bitboard
[src]
impl<'a> BitAndAssign<Square> for Bitboard
fn bitand_assign(&mut self, rhs: Square) | [src] |
impl<'a> BitOrAssign<&'a Bitboard> for Bitboard
[src]
impl<'a> BitOrAssign<&'a Bitboard> for Bitboard
fn bitor_assign(&mut self, rhs: &'a Bitboard) | [src] |
impl<'a> BitOrAssign<Square> for Bitboard
[src]
impl<'a> BitOrAssign<Square> for Bitboard
fn bitor_assign(&mut self, rhs: Square) | [src] |
impl<'a> BitXorAssign<&'a Bitboard> for Bitboard
[src]
impl<'a> BitXorAssign<&'a Bitboard> for Bitboard
fn bitxor_assign(&mut self, rhs: &'a Bitboard) | [src] |
impl<'a> BitXorAssign<Square> for Bitboard
[src]
impl<'a> BitXorAssign<Square> for Bitboard
fn bitxor_assign(&mut self, rhs: Square) | [src] |
Auto Trait Implementations
Blanket Implementations
impl<T, U> Into for T where
U: From<T>,
[src]
impl<T, U> Into for T where
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
impl<T> From for T
[src]
impl<T> From for T
impl<I> IntoIterator for I where
I: Iterator,
[src]
impl<I> IntoIterator for I where
I: Iterator,
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?
fn into_iter(self) -> I | [src] |
impl<T> ToString for T where
T: Display + ?Sized,
[src]
impl<T> ToString for T where
T: Display + ?Sized,
impl<T, U> TryFrom for T where
T: From<U>,
[src]
impl<T, U> TryFrom for T where
T: From<U>,
type Error = !
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error> | [src] |
impl<T> Borrow for T where
T: ?Sized,
[src]
impl<T> Borrow for T where
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
impl<T> Any for T where
T: 'static + ?Sized,
fn get_type_id(&self) -> TypeId | [src] |
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
try_from
)The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error> | [src] |
impl<T> BorrowMut for T where
T: ?Sized,
[src]
impl<T> BorrowMut for T where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T | [src] |
impl<T> Itertools for T where
T: Iterator + ?Sized,
[src]
impl<T> Itertools for T where
T: Iterator + ?Sized,
fn interleave<J>( | [src] |
Alternate elements from two iterators until both have run out. Read more
fn interleave_shortest<J>( | [src] |
Alternate elements from two iterators until at least one of them has run out. Read more
fn intersperse(self, element: Self::Item) -> Intersperse<Self> where | [src] |
An iterator adaptor to insert a particular value between each element of the adapted iterator. Read more
fn zip_longest<J>( | [src] |
Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of two optional elements. Read more
fn zip_eq<J>(self, other: J) -> ZipEq<Self, <J as IntoIterator>::IntoIter> where | [src] |
Create an iterator which iterates over both this and the specified iterator simultaneously, yielding pairs of elements. Read more
fn batching<B, F>(self, f: F) -> Batching<Self, F> where | [src] |
A “meta iterator adaptor”. Its closure receives a reference to the iterator and may pick off as many elements as it likes, to produce the next iterator element. Read more
fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F> where | [src] |
Return an iterable that can group iterator elements. Consecutive elements that map to the same key (“runs”), are assigned to the same group. Read more
fn chunks(self, size: usize) -> IntoChunks<Self> | [src] |
Return an iterable that can chunk the iterator. Read more
fn tuple_windows<T>(self) -> TupleWindows<Self, T> where | [src] |
Return an iterator over all contiguous windows producing tuples of a specific size (up to 4). Read more
fn tuples<T>(self) -> Tuples<Self, T> where | [src] |
Return an iterator that groups the items in tuples of a specific size (up to 4). Read more
fn tee(self) -> (Tee<Self>, Tee<Self>) where | [src] |
Split into an iterator pair that both yield all elements from the original iterator. Read more
fn step(self, n: usize) -> Step<Self> | [src] |
Use std .step_by() instead
Return an iterator adaptor that steps n
elements in the base iterator for each iteration. Read more
fn map_into<R>(self) -> MapInto<Self, R> where | [src] |
Convert each item of the iterator using the Into
trait. Read more
fn map_results<F, T, U, E>(self, f: F) -> MapResults<Self, F> where | [src] |
Return an iterator adaptor that applies the provided closure to every Result::Ok
value. Result::Err
values are unchanged. Read more
fn merge<J>(self, other: J) -> Merge<Self, <J as IntoIterator>::IntoIter> where | [src] |
Return an iterator adaptor that merges the two base iterators in ascending order. If both base iterators are sorted (ascending), the result is sorted. Read more
fn merge_by<J, F>( | [src] |
Return an iterator adaptor that merges the two base iterators in order. This is much like .merge()
but allows for a custom ordering. Read more
fn merge_join_by<J, F>( | [src] |
Create an iterator that merges items from both this and the specified iterator in ascending order. Read more
fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter> where | [src] |
Return an iterator adaptor that flattens an iterator of iterators by merging them in ascending order. Read more
fn kmerge_by<F>( | [src] |
Return an iterator adaptor that flattens an iterator of iterators by merging them according to the given closure. Read more
fn cartesian_product<J>( | [src] |
Return an iterator adaptor that iterates over the cartesian product of the element sets of two iterators self
and J
. Read more
fn multi_cartesian_product( | [src] |
Return an iterator adaptor that iterates over the cartesian product of all subiterators returned by meta-iterator self
. Read more
fn coalesce<F>(self, f: F) -> Coalesce<Self, F> where | [src] |
Return an iterator adaptor that uses the passed-in closure to optionally merge together consecutive elements. Read more
fn dedup(self) -> Dedup<Self> where | [src] |
Remove duplicates from sections of consecutive identical elements. If the iterator is sorted, all elements will be unique. Read more
fn unique(self) -> Unique<Self> where | [src] |
Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Duplicates are detected using hash and equality. Read more
fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F> where | [src] |
Return an iterator adaptor that filters out elements that have already been produced once during the iteration. Read more
fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<Self, F> where | [src] |
Return an iterator adaptor that borrows from this iterator and takes items while the closure accept
returns true
. Read more
fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<Self, F> where | [src] |
Return an iterator adaptor that borrows from a Clone
-able iterator to only pick off elements while the predicate accept
returns true
. Read more
fn while_some<A>(self) -> WhileSome<Self> where | [src] |
Return an iterator adaptor that filters Option<A>
iterator elements and produces A
. Stops on the first None
encountered. Read more
fn tuple_combinations<T>(self) -> TupleCombinations<Self, T> where | [src] |
Return an iterator adaptor that iterates over the combinations of the elements from an iterator. Read more
fn combinations(self, n: usize) -> Combinations<Self> where | [src] |
Return an iterator adaptor that iterates over the n
-length combinations of the elements from an iterator. Read more
fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F> where | [src] |
Return an iterator adaptor that pads the sequence to a minimum length of min
by filling missing elements using a closure f
. Read more
fn with_position(self) -> WithPosition<Self> | [src] |
Return an iterator adaptor that wraps each element in a Position
to ease special-case handling of the first or last elements. Read more
fn positions<P>(self, predicate: P) -> Positions<Self, P> where | [src] |
Return an iterator adaptor that yields the indices of all elements satisfying a predicate, counted from the start of the iterator. Read more
fn update<F>(self, updater: F) -> Update<Self, F> where | [src] |
Return an iterator adaptor that applies a mutating function to each element before yielding it. Read more
fn next_tuple<T>(&mut self) -> Option<T> where | [src] |
Advances the iterator and returns the next items grouped in a tuple of a specific size (up to 4). Read more
fn collect_tuple<T>(self) -> Option<T> where | [src] |
Collects all items from the iterator into a tuple of a specific size (up to 4). Read more
fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)> where | [src] |
Find the position and value of the first element satisfying a predicate. Read more
fn all_equal(&mut self) -> bool where | [src] |
Check whether all elements compare equal. Read more
fn dropping(self, n: usize) -> Self | [src] |
Consume the first n
elements from the iterator eagerly, and return the same iterator again. Read more
fn dropping_back(self, n: usize) -> Self where | [src] |
Consume the last n
elements from the iterator eagerly, and return the same iterator again. Read more
fn foreach<F>(self, f: F) where | [src] |
Use .for_each() instead
Run the closure f
eagerly on each element of the iterator. Read more
fn concat(self) -> Self::Item where | [src] |
Combine all an iterator's elements into one element by using Extend
. Read more
fn collect_vec(self) -> Vec<Self::Item> | [src] |
.collect_vec()
is simply a type specialization of .collect()
, for convenience. Read more
fn set_from<'a, A, J>(&mut self, from: J) -> usize where | [src] |
Assign to each reference in self
from the from
iterator, stopping at the shortest of the two iterators. Read more
fn join(&mut self, sep: &str) -> String where | [src] |
Combine all iterator elements into one String, seperated by sep
. Read more
fn format(self, sep: &str) -> Format<Self> | [src] |
Format all iterator elements, separated by sep
. Read more
fn format_with<F>(self, sep: &str, format: F) -> FormatWith<Self, F> where | [src] |
Format all iterator elements, separated by sep
. Read more
fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E> where | [src] |
Fold Result
values from an iterator. Read more
fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B> where | [src] |
Fold Option
values from an iterator. Read more
fn fold1<F>(self, f: F) -> Option<Self::Item> where | [src] |
Accumulator of the elements in the iterator. Read more
fn tree_fold1<F>(self, f: F) -> Option<Self::Item> where | [src] |
Accumulate the elements in the iterator in a tree-like manner. Read more
fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B> where | [src] |
Use .try_fold() instead
An iterator method that applies a function, producing a single, final value. Read more
fn sorted(self) -> IntoIter<Self::Item> where | [src] |
Sort all iterator elements into a new iterator in ascending order. Read more
fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item> where | [src] |
Sort all iterator elements into a new iterator in ascending order. Read more
fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item> where | [src] |
Sort all iterator elements into a new iterator in ascending order. Read more
fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B) where | [src] |
Collect all iterator elements into one of two partitions. Unlike Iterator::partition
, each partition may have a distinct type. Read more
fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>, RandomState> where | [src] |
Return a HashMap
of keys mapped to Vec
s of values. Keys and values are taken from (Key, Value)
tuple pairs yielded by the input iterator. Read more
fn minmax(self) -> MinMaxResult<Self::Item> where | [src] |
Return the minimum and maximum elements in the iterator. Read more
fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item> where | [src] |
Return the minimum and maximum element of an iterator, as determined by the specified function. Read more
fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item> where | [src] |
Return the minimum and maximum element of an iterator, as determined by the specified comparison function. Read more