Struct pleco::core::bitboard::BitBoard [−][src]
pub struct BitBoard(pub u64);
A BitBoard
is simply a 64 bit long integer where each
bit maps to a specific square. Used for mapping occupancy, where '1' represents
a piece being at that index's square, and a '0' represents a lack of a piece.
Methods
impl BitBoard
[src]
impl BitBoard
pub const FILE_A: BitBoard
FILE_A: BitBoard = BitBoard(FILE_A)
BitBoard of File A.
pub const FILE_B: BitBoard
FILE_B: BitBoard = BitBoard(FILE_B)
BitBoard of File B.
pub const FILE_C: BitBoard
FILE_C: BitBoard = BitBoard(FILE_C)
BitBoard of File C.
pub const FILE_D: BitBoard
FILE_D: BitBoard = BitBoard(FILE_D)
BitBoard of File D.
pub const FILE_E: BitBoard
FILE_E: BitBoard = BitBoard(FILE_E)
BitBoard of File E.
pub const FILE_F: BitBoard
FILE_F: BitBoard = BitBoard(FILE_F)
BitBoard of File F.
pub const FILE_G: BitBoard
FILE_G: BitBoard = BitBoard(FILE_G)
BitBoard of File G.
pub const FILE_H: BitBoard
FILE_H: BitBoard = BitBoard(FILE_H)
BitBoard of File H.
pub const RANK_1: BitBoard
RANK_1: BitBoard = BitBoard(RANK_1)
BitBoard of Rank 1.
pub const RANK_2: BitBoard
RANK_2: BitBoard = BitBoard(RANK_2)
BitBoard of Rank 2.
pub const RANK_3: BitBoard
RANK_3: BitBoard = BitBoard(RANK_3)
BitBoard of Rank 3.
pub const RANK_4: BitBoard
RANK_4: BitBoard = BitBoard(RANK_4)
BitBoard of Rank 4.
pub const RANK_5: BitBoard
RANK_5: BitBoard = BitBoard(RANK_5)
BitBoard of Rank 5.
pub const RANK_6: BitBoard
RANK_6: BitBoard = BitBoard(RANK_6)
BitBoard of Rank 6.
pub const RANK_7: BitBoard
RANK_7: BitBoard = BitBoard(RANK_7)
BitBoard of Rank 7.
pub const RANK_8: BitBoard
RANK_8: BitBoard = BitBoard(RANK_8)
BitBoard of Rank 8.
pub const DARK_SQUARES: BitBoard
DARK_SQUARES: BitBoard = BitBoard(DARK_SQUARES)
BitBoard of all dark squares.
pub const LIGHT_SQUARES: BitBoard
LIGHT_SQUARES: BitBoard = BitBoard(LIGHT_SQUARES)
BitBoard of all light squares.
pub const ALL: BitBoard
ALL: BitBoard = BitBoard(!0)
BitBoard of all light squares.
pub fn to_sq(self) -> SQ
[src]
pub fn to_sq(self) -> SQ
Converts a BitBoard
to a square.
Safety
The BitBoard
must have exactly one bit inside of it, or else
this will return the square of the least significant bit.
pub fn count_bits(self) -> u8
[src]
pub fn count_bits(self) -> u8
Returns the number of bits in a BitBoard
pub fn bit_scan_forward(self) -> SQ
[src]
pub fn bit_scan_forward(self) -> SQ
pub fn bit_scan_forward_u8(self) -> u8
[src]
pub fn bit_scan_forward_u8(self) -> u8
pub fn more_than_one(self) -> bool
[src]
pub fn more_than_one(self) -> bool
Returns if there are more than 1 bits inside.
pub fn is_empty(self) -> bool
[src]
pub fn is_empty(self) -> bool
Determines if the BitBoard
is empty (contains no bits).
pub fn is_not_empty(self) -> bool
[src]
pub fn is_not_empty(self) -> bool
Determines if the BitBoard
is not empty (contains one or more bits).
ⓘImportant traits for BitBoardpub fn lsb(self) -> BitBoard
[src]
pub fn lsb(self) -> BitBoard
Returns the least significant bit as a BitBoard.
ⓘImportant traits for BitBoardpub fn msb(self) -> BitBoard
[src]
pub fn msb(self) -> BitBoard
Returns the most significant bit
pub fn lsb_u64(self) -> u64
[src]
pub fn lsb_u64(self) -> u64
Returns the least significant bit as a u64.
pub fn pop_lsb(&mut self) -> SQ
[src]
pub fn pop_lsb(&mut self) -> SQ
Returns the index (as a square) of the least significant bit and removes
that bit from the BitBoard
.
pub fn pop_some_lsb(&mut self) -> Option<SQ>
[src]
pub fn pop_some_lsb(&mut self) -> Option<SQ>
Returns the least significant bit of a BitBoard
, if it has any.
pub fn pop_lsb_and_bit(&mut self) -> (SQ, BitBoard)
[src]
pub fn pop_lsb_and_bit(&mut self) -> (SQ, BitBoard)
Returns the index (as a square) and bit of the least significant bit and removes
that bit from the BitBoard
.
pub fn pop_some_lsb_and_bit(&mut self) -> Option<(SQ, BitBoard)>
[src]
pub fn pop_some_lsb_and_bit(&mut self) -> Option<(SQ, BitBoard)>
pub fn frontmost_sq(self, player: Player) -> SQ
[src]
pub fn frontmost_sq(self, player: Player) -> SQ
Returns the front-most square of a player on the current BitBoard
.
Safety
panics if the BitBoard
is empty.
pub fn backmost_sq(self, player: Player) -> SQ
[src]
pub fn backmost_sq(self, player: Player) -> SQ
Returns the back-most square of a player on the current BitBoard
.
Safety
panics if the BitBoard
is empty.
pub fn clone_all_occ(bbs: &[[BitBoard; 8]; 2]) -> [[BitBoard; 8]; 2]
[src]
pub fn clone_all_occ(bbs: &[[BitBoard; 8]; 2]) -> [[BitBoard; 8]; 2]
Returns a clone of a [[BitBoard; 6]; 2]
. Used to duplicate occupancy BitBoard
s of each
piece for each player.
pub fn clone_occ_bbs(bbs: &[BitBoard; 2]) -> [BitBoard; 2]
[src]
pub fn clone_occ_bbs(bbs: &[BitBoard; 2]) -> [BitBoard; 2]
Returns a clone of a [BitBoard; 2]
. Used to duplicate occupancy BitBoard
s of each player.
Trait Implementations
impl Copy for BitBoard
[src]
impl Copy for BitBoard
impl Clone for BitBoard
[src]
impl Clone for BitBoard
ⓘImportant traits for BitBoardfn clone(&self) -> BitBoard
[src]
fn clone(&self) -> BitBoard
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
impl Default for BitBoard
[src]
impl Default for BitBoard
ⓘImportant traits for BitBoardfn default() -> BitBoard
[src]
fn default() -> BitBoard
Returns the "default value" for a type. Read more
impl Hash for BitBoard
[src]
impl Hash for BitBoard
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl PartialEq for BitBoard
[src]
impl PartialEq for BitBoard
fn eq(&self, other: &BitBoard) -> bool
[src]
fn eq(&self, other: &BitBoard) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &BitBoard) -> bool
[src]
fn ne(&self, other: &BitBoard) -> bool
This method tests for !=
.
impl Eq for BitBoard
[src]
impl Eq for BitBoard
impl Debug for BitBoard
[src]
impl Debug for BitBoard
fn fmt(&self, f: &mut Formatter) -> Result
[src]
fn fmt(&self, f: &mut Formatter) -> Result
Formats the value using the given formatter. Read more
impl From<u64> for BitBoard
[src]
impl From<u64> for BitBoard
impl From<BitBoard> for u64
[src]
impl From<BitBoard> for u64
impl Rem for BitBoard
[src]
impl Rem for BitBoard
type Output = BitBoard
The resulting type after applying the %
operator.
ⓘImportant traits for BitBoardfn rem(self, rhs: BitBoard) -> BitBoard
[src]
fn rem(self, rhs: BitBoard) -> BitBoard
Performs the %
operation.
impl RemAssign for BitBoard
[src]
impl RemAssign for BitBoard
fn rem_assign(&mut self, rhs: BitBoard)
[src]
fn rem_assign(&mut self, rhs: BitBoard)
Performs the %=
operation.
impl Rem<u64> for BitBoard
[src]
impl Rem<u64> for BitBoard
type Output = BitBoard
The resulting type after applying the %
operator.
ⓘImportant traits for BitBoardfn rem(self, rhs: u64) -> BitBoard
[src]
fn rem(self, rhs: u64) -> BitBoard
Performs the %
operation.
impl RemAssign<u64> for BitBoard
[src]
impl RemAssign<u64> for BitBoard
fn rem_assign(&mut self, rhs: u64)
[src]
fn rem_assign(&mut self, rhs: u64)
Performs the %=
operation.
impl BitOr for BitBoard
[src]
impl BitOr for BitBoard
type Output = BitBoard
The resulting type after applying the |
operator.
ⓘImportant traits for BitBoardfn bitor(self, rhs: BitBoard) -> BitBoard
[src]
fn bitor(self, rhs: BitBoard) -> BitBoard
Performs the |
operation.
impl BitOrAssign for BitBoard
[src]
impl BitOrAssign for BitBoard
fn bitor_assign(&mut self, rhs: BitBoard)
[src]
fn bitor_assign(&mut self, rhs: BitBoard)
Performs the |=
operation.
impl BitOr<u64> for BitBoard
[src]
impl BitOr<u64> for BitBoard
type Output = BitBoard
The resulting type after applying the |
operator.
ⓘImportant traits for BitBoardfn bitor(self, rhs: u64) -> BitBoard
[src]
fn bitor(self, rhs: u64) -> BitBoard
Performs the |
operation.
impl BitOrAssign<u64> for BitBoard
[src]
impl BitOrAssign<u64> for BitBoard
fn bitor_assign(&mut self, rhs: u64)
[src]
fn bitor_assign(&mut self, rhs: u64)
Performs the |=
operation.
impl BitAnd for BitBoard
[src]
impl BitAnd for BitBoard
type Output = BitBoard
The resulting type after applying the &
operator.
ⓘImportant traits for BitBoardfn bitand(self, rhs: BitBoard) -> BitBoard
[src]
fn bitand(self, rhs: BitBoard) -> BitBoard
Performs the &
operation.
impl BitAndAssign for BitBoard
[src]
impl BitAndAssign for BitBoard
fn bitand_assign(&mut self, rhs: BitBoard)
[src]
fn bitand_assign(&mut self, rhs: BitBoard)
Performs the &=
operation.
impl BitAnd<u64> for BitBoard
[src]
impl BitAnd<u64> for BitBoard
type Output = BitBoard
The resulting type after applying the &
operator.
ⓘImportant traits for BitBoardfn bitand(self, rhs: u64) -> BitBoard
[src]
fn bitand(self, rhs: u64) -> BitBoard
Performs the &
operation.
impl BitAndAssign<u64> for BitBoard
[src]
impl BitAndAssign<u64> for BitBoard
fn bitand_assign(&mut self, rhs: u64)
[src]
fn bitand_assign(&mut self, rhs: u64)
Performs the &=
operation.
impl BitXor for BitBoard
[src]
impl BitXor for BitBoard
type Output = BitBoard
The resulting type after applying the ^
operator.
ⓘImportant traits for BitBoardfn bitxor(self, rhs: BitBoard) -> BitBoard
[src]
fn bitxor(self, rhs: BitBoard) -> BitBoard
Performs the ^
operation.
impl BitXorAssign for BitBoard
[src]
impl BitXorAssign for BitBoard
fn bitxor_assign(&mut self, rhs: BitBoard)
[src]
fn bitxor_assign(&mut self, rhs: BitBoard)
Performs the ^=
operation.
impl BitXor<u64> for BitBoard
[src]
impl BitXor<u64> for BitBoard
type Output = BitBoard
The resulting type after applying the ^
operator.
ⓘImportant traits for BitBoardfn bitxor(self, rhs: u64) -> BitBoard
[src]
fn bitxor(self, rhs: u64) -> BitBoard
Performs the ^
operation.
impl BitXorAssign<u64> for BitBoard
[src]
impl BitXorAssign<u64> for BitBoard
fn bitxor_assign(&mut self, rhs: u64)
[src]
fn bitxor_assign(&mut self, rhs: u64)
Performs the ^=
operation.
impl Add for BitBoard
[src]
impl Add for BitBoard
type Output = BitBoard
The resulting type after applying the +
operator.
ⓘImportant traits for BitBoardfn add(self, rhs: BitBoard) -> BitBoard
[src]
fn add(self, rhs: BitBoard) -> BitBoard
Performs the +
operation.
impl AddAssign for BitBoard
[src]
impl AddAssign for BitBoard
fn add_assign(&mut self, rhs: BitBoard)
[src]
fn add_assign(&mut self, rhs: BitBoard)
Performs the +=
operation.
impl Add<u64> for BitBoard
[src]
impl Add<u64> for BitBoard
type Output = BitBoard
The resulting type after applying the +
operator.
ⓘImportant traits for BitBoardfn add(self, rhs: u64) -> BitBoard
[src]
fn add(self, rhs: u64) -> BitBoard
Performs the +
operation.
impl AddAssign<u64> for BitBoard
[src]
impl AddAssign<u64> for BitBoard
fn add_assign(&mut self, rhs: u64)
[src]
fn add_assign(&mut self, rhs: u64)
Performs the +=
operation.
impl Div for BitBoard
[src]
impl Div for BitBoard
type Output = BitBoard
The resulting type after applying the /
operator.
ⓘImportant traits for BitBoardfn div(self, rhs: BitBoard) -> BitBoard
[src]
fn div(self, rhs: BitBoard) -> BitBoard
Performs the /
operation.
impl DivAssign for BitBoard
[src]
impl DivAssign for BitBoard
fn div_assign(&mut self, rhs: BitBoard)
[src]
fn div_assign(&mut self, rhs: BitBoard)
Performs the /=
operation.
impl Div<u64> for BitBoard
[src]
impl Div<u64> for BitBoard
type Output = BitBoard
The resulting type after applying the /
operator.
ⓘImportant traits for BitBoardfn div(self, rhs: u64) -> BitBoard
[src]
fn div(self, rhs: u64) -> BitBoard
Performs the /
operation.
impl DivAssign<u64> for BitBoard
[src]
impl DivAssign<u64> for BitBoard
fn div_assign(&mut self, rhs: u64)
[src]
fn div_assign(&mut self, rhs: u64)
Performs the /=
operation.
impl Mul for BitBoard
[src]
impl Mul for BitBoard
type Output = BitBoard
The resulting type after applying the *
operator.
ⓘImportant traits for BitBoardfn mul(self, rhs: BitBoard) -> BitBoard
[src]
fn mul(self, rhs: BitBoard) -> BitBoard
Performs the *
operation.
impl MulAssign for BitBoard
[src]
impl MulAssign for BitBoard
fn mul_assign(&mut self, rhs: BitBoard)
[src]
fn mul_assign(&mut self, rhs: BitBoard)
Performs the *=
operation.
impl Mul<u64> for BitBoard
[src]
impl Mul<u64> for BitBoard
type Output = BitBoard
The resulting type after applying the *
operator.
ⓘImportant traits for BitBoardfn mul(self, rhs: u64) -> BitBoard
[src]
fn mul(self, rhs: u64) -> BitBoard
Performs the *
operation.
impl MulAssign<u64> for BitBoard
[src]
impl MulAssign<u64> for BitBoard
fn mul_assign(&mut self, rhs: u64)
[src]
fn mul_assign(&mut self, rhs: u64)
Performs the *=
operation.
impl Sub for BitBoard
[src]
impl Sub for BitBoard
type Output = BitBoard
The resulting type after applying the -
operator.
ⓘImportant traits for BitBoardfn sub(self, rhs: BitBoard) -> BitBoard
[src]
fn sub(self, rhs: BitBoard) -> BitBoard
Performs the -
operation.
impl SubAssign for BitBoard
[src]
impl SubAssign for BitBoard
fn sub_assign(&mut self, rhs: BitBoard)
[src]
fn sub_assign(&mut self, rhs: BitBoard)
Performs the -=
operation.
impl Sub<u64> for BitBoard
[src]
impl Sub<u64> for BitBoard
type Output = BitBoard
The resulting type after applying the -
operator.
ⓘImportant traits for BitBoardfn sub(self, rhs: u64) -> BitBoard
[src]
fn sub(self, rhs: u64) -> BitBoard
Performs the -
operation.
impl SubAssign<u64> for BitBoard
[src]
impl SubAssign<u64> for BitBoard
fn sub_assign(&mut self, rhs: u64)
[src]
fn sub_assign(&mut self, rhs: u64)
Performs the -=
operation.
impl Shl<usize> for BitBoard
[src]
impl Shl<usize> for BitBoard
type Output = BitBoard
The resulting type after applying the <<
operator.
ⓘImportant traits for BitBoardfn shl(self, rhs: usize) -> BitBoard
[src]
fn shl(self, rhs: usize) -> BitBoard
Performs the <<
operation.
impl ShlAssign<usize> for BitBoard
[src]
impl ShlAssign<usize> for BitBoard
fn shl_assign(&mut self, rhs: usize)
[src]
fn shl_assign(&mut self, rhs: usize)
Performs the <<=
operation.
impl Shr<usize> for BitBoard
[src]
impl Shr<usize> for BitBoard
type Output = BitBoard
The resulting type after applying the >>
operator.
ⓘImportant traits for BitBoardfn shr(self, rhs: usize) -> BitBoard
[src]
fn shr(self, rhs: usize) -> BitBoard
Performs the >>
operation.
impl ShrAssign<usize> for BitBoard
[src]
impl ShrAssign<usize> for BitBoard
fn shr_assign(&mut self, rhs: usize)
[src]
fn shr_assign(&mut self, rhs: usize)
Performs the >>=
operation.
impl Not for BitBoard
[src]
impl Not for BitBoard
type Output = BitBoard
The resulting type after applying the !
operator.
ⓘImportant traits for BitBoardfn not(self) -> BitBoard
[src]
fn not(self) -> BitBoard
Performs the unary !
operation.
impl Shl<SQ> for BitBoard
[src]
impl Shl<SQ> for BitBoard
type Output = BitBoard
The resulting type after applying the <<
operator.
ⓘImportant traits for BitBoardfn shl(self, rhs: SQ) -> BitBoard
[src]
fn shl(self, rhs: SQ) -> BitBoard
Performs the <<
operation.
impl Iterator for BitBoard
[src]
impl Iterator for BitBoard
type Item = SQ
The type of the elements being iterated over.
fn next(&mut self) -> Option<Self::Item>
[src]
fn next(&mut self) -> Option<Self::Item>
Advances the iterator and returns the next value. Read more
fn size_hint(&self) -> (usize, Option<usize>)
1.0.0[src]
fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator. Read more
fn count(self) -> usize
1.0.0[src]
fn count(self) -> usize
Consumes the iterator, counting the number of iterations and returning it. Read more
fn last(self) -> Option<Self::Item>
1.0.0[src]
fn last(self) -> Option<Self::Item>
Consumes the iterator, returning the last element. Read more
fn nth(&mut self, n: usize) -> Option<Self::Item>
1.0.0[src]
fn nth(&mut self, n: usize) -> Option<Self::Item>
Returns the n
th element of the iterator. Read more
ⓘImportant traits for StepBy<I>fn step_by(self, step: usize) -> StepBy<Self>
[src]
fn step_by(self, step: usize) -> StepBy<Self>
🔬 This is a nightly-only experimental API. (iterator_step_by
)
unstable replacement of Range::step_by
Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
ⓘImportant traits for Chain<A, B>fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
1.0.0[src]
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
ⓘImportant traits for Zip<A, B>fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0[src]
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
'Zips up' two iterators into a single iterator of pairs. Read more
ⓘImportant traits for Map<I, F>fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0[src]
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
1.21.0[src]
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
ⓘImportant traits for Filter<I, P>fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
ⓘImportant traits for FilterMap<I, F>fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
1.0.0[src]
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
Creates an iterator that both filters and maps. Read more
ⓘImportant traits for Enumerate<I>fn enumerate(self) -> Enumerate<Self>
1.0.0[src]
fn enumerate(self) -> Enumerate<Self>
Creates an iterator which gives the current iteration count as well as the next value. Read more
ⓘImportant traits for Peekable<I>fn peekable(self) -> Peekable<Self>
1.0.0[src]
fn peekable(self) -> Peekable<Self>
Creates an iterator which can use peek
to look at the next element of the iterator without consuming it. Read more
ⓘImportant traits for SkipWhile<I, P>fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
Creates an iterator that [skip
]s elements based on a predicate. Read more
ⓘImportant traits for TakeWhile<I, P>fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
Creates an iterator that yields elements based on a predicate. Read more
ⓘImportant traits for Skip<I>fn skip(self, n: usize) -> Skip<Self>
1.0.0[src]
fn skip(self, n: usize) -> Skip<Self>
Creates an iterator that skips the first n
elements. Read more
ⓘImportant traits for Take<I>fn take(self, n: usize) -> Take<Self>
1.0.0[src]
fn take(self, n: usize) -> Take<Self>
Creates an iterator that yields its first n
elements. Read more
ⓘImportant traits for Scan<I, St, F>fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0[src]
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
An iterator adaptor similar to [fold
] that holds internal state and produces a new iterator. Read more
ⓘImportant traits for FlatMap<I, U, F>fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0[src]
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
Creates an iterator that works like map, but flattens nested structure. Read more
ⓘImportant traits for Flatten<I>fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
[src]
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
iterator_flatten
)Creates an iterator that flattens nested structure. Read more
ⓘImportant traits for Fuse<I>fn fuse(self) -> Fuse<Self>
1.0.0[src]
fn fuse(self) -> Fuse<Self>
Creates an iterator which ends after the first [None
]. Read more
ⓘImportant traits for Inspect<I, F>fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
1.0.0[src]
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
Do something with each element of an iterator, passing the value on. Read more
ⓘImportant traits for &'a mut Rfn by_ref(&mut self) -> &mut Self
1.0.0[src]
fn by_ref(&mut self) -> &mut Self
Borrows an iterator, rather than consuming it. Read more
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
1.0.0[src]
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
Transforms an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
1.0.0[src]
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
Consumes an iterator, creating two collections from it. Read more
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
1.27.0[src]
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
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
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
1.27.0[src]
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
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
F: FnMut(B, Self::Item) -> B,
1.0.0[src]
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
An iterator method that applies a function, producing a single, final value. Read more
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
Tests if every element of the iterator matches a predicate. Read more
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
Tests if any element of the iterator matches a predicate. Read more
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
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
F: FnMut(Self::Item) -> Option<B>,
[src]
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>,
🔬 This is a nightly-only experimental API. (iterator_find_map
)
unstable new API
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
P: FnMut(Self::Item) -> bool,
1.0.0[src]
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Searches for an element in an iterator, returning its index. Read more
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
1.0.0[src]
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
Searches for an element in an iterator from the right, returning its index. Read more
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
Returns the maximum element of an iterator. Read more
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
Returns the minimum element of an iterator. Read more
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
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
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
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
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
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
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
ⓘImportant traits for Rev<I>fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
Reverses an iterator's direction. Read more
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
1.0.0[src]
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
Converts an iterator of pairs into a pair of containers. Read more
ⓘImportant traits for Cloned<I>fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0[src]
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
Creates an iterator which [clone
]s all of its elements. Read more
ⓘImportant traits for Cycle<I>fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
fn cycle(self) -> Cycle<Self> where
Self: Clone,
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0[src]
fn product<P>(self) -> P where
P: Product<Self::Item>,
Iterates over the entire iterator, multiplying all the elements Read more
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
1.5.0[src]
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are equal to those of another. Read more
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are unequal to those of another. Read more
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically less than those of another. Read more
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
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
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than those of another. Read more
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than or equal to those of another. Read more
impl Display for BitBoard
[src]
impl Display for BitBoard