[−][src]Struct pleco::core::bitboard::BitBoard
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]
pub const FILE_A: BitBoard
[src]
BitBoard of File A.
pub const FILE_B: BitBoard
[src]
BitBoard of File B.
pub const FILE_C: BitBoard
[src]
BitBoard of File C.
pub const FILE_D: BitBoard
[src]
BitBoard of File D.
pub const FILE_E: BitBoard
[src]
BitBoard of File E.
pub const FILE_F: BitBoard
[src]
BitBoard of File F.
pub const FILE_G: BitBoard
[src]
BitBoard of File G.
pub const FILE_H: BitBoard
[src]
BitBoard of File H.
pub const RANK_1: BitBoard
[src]
BitBoard of Rank 1.
pub const RANK_2: BitBoard
[src]
BitBoard of Rank 2.
pub const RANK_3: BitBoard
[src]
BitBoard of Rank 3.
pub const RANK_4: BitBoard
[src]
BitBoard of Rank 4.
pub const RANK_5: BitBoard
[src]
BitBoard of Rank 5.
pub const RANK_6: BitBoard
[src]
BitBoard of Rank 6.
pub const RANK_7: BitBoard
[src]
BitBoard of Rank 7.
pub const RANK_8: BitBoard
[src]
BitBoard of Rank 8.
pub const DARK_SQUARES: BitBoard
[src]
BitBoard of all dark squares.
pub const LIGHT_SQUARES: BitBoard
[src]
BitBoard of all light squares.
pub const ALL: BitBoard
[src]
BitBoard of all light squares.
pub fn to_sq(self) -> SQ
[src]
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]
Returns the number of bits in a BitBoard
pub fn bit_scan_forward(self) -> SQ
[src]
pub fn bit_scan_forward_u8(self) -> u8
[src]
pub fn more_than_one(self) -> bool
[src]
Returns if there are more than 1 bits inside.
pub fn is_empty(self) -> bool
[src]
Determines if the BitBoard
is empty (contains no bits).
pub fn is_not_empty(self) -> bool
[src]
Determines if the BitBoard
is not empty (contains one or more bits).
ⓘImportant traits for BitBoardpub fn lsb(self) -> BitBoard
[src]
Returns the least significant bit as a BitBoard.
ⓘImportant traits for BitBoardpub fn msb(self) -> BitBoard
[src]
Returns the most significant bit
pub fn lsb_u64(self) -> u64
[src]
Returns the least significant bit as a u64.
pub fn pop_lsb(&mut self) -> SQ
[src]
Returns the index (as a square) of the least significant bit and removes
that bit from the BitBoard
.
Safety
Panics if the BitBoard
is empty. See BitBoard::pop_some_lsb
for a
non-panicking version of the method.
pub fn pop_some_lsb(&mut self) -> Option<SQ>
[src]
Returns the least significant bit of a BitBoard
, if it has any. If there is a bit to
return, it removes that bit from itself.
pub fn pop_lsb_and_bit(&mut self) -> (SQ, BitBoard)
[src]
Returns the index (as a square) and bit of the least significant bit and removes
that bit from the BitBoard
.
Safety
Panics if the BitBoard
is empty. See BitBoard::pop_some_lsb_and_bit
for a
non-panicking version of the method.
pub fn pop_some_lsb_and_bit(&mut self) -> Option<(SQ, BitBoard)>
[src]
Returns the index (as a square) and bit of the least significant bit and removes
that bit from the BitBoard
. If there are no bits left (the board is empty), returns
None
.
pub fn frontmost_sq(self, player: Player) -> SQ
[src]
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]
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]
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]
Returns a clone of a [BitBoard; 2]
. Used to duplicate occupancy BitBoard
s of each player.
Trait Implementations
impl Eq for BitBoard
[src]
impl Copy for BitBoard
[src]
impl Clone for BitBoard
[src]
ⓘImportant traits for BitBoardfn clone(&self) -> BitBoard
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl PartialEq<BitBoard> for BitBoard
[src]
impl Iterator for BitBoard
[src]
type Item = SQ
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
U: IntoIterator<Item = Self::Item>,
1.0.0[src]
U: IntoIterator<Item = Self::Item>,
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
U: IntoIterator,
1.0.0[src]
U: IntoIterator,
'Zips up' two iterators into a single iterator of pairs. Read more
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0[src]
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]
F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
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
F: FnMut(Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(Self::Item) -> Option<B>,
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
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator that [skip
]s elements based on a predicate. Read more
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
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
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0[src]
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
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0[src]
F: FnMut(Self::Item) -> U,
U: IntoIterator,
Creates an iterator that works like map, but flattens nested structure. Read more
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
1.29.0[src]
Self::Item: IntoIterator,
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
F: FnMut(&Self::Item),
1.0.0[src]
F: FnMut(&Self::Item),
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
#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
1.0.0[src]
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]
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]
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]
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]
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]
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]
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]
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>,
1.30.0[src]
F: FnMut(Self::Item) -> Option<B>,
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]
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]
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]
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]
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]
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]
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]
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]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
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]
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
fn copied<'a, T>(self) -> Copied<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
[src]
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
iter_copied
)Creates an iterator which copies all of its elements. Read more
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
Creates an iterator which [clone
]s all of its elements. Read more
fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
Self: Clone,
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
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]
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]
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]
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]
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]
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]
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]
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]
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]
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
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
[src]
Self::Item: PartialOrd<Self::Item>,
🔬 This is a nightly-only experimental API. (is_sorted
)
new API
Checks if the elements of this iterator are sorted. Read more
fn is_sorted_by<F>(self, compare: F) -> bool where
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
[src]
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
🔬 This is a nightly-only experimental API. (is_sorted
)
new API
Checks if the elements of this iterator are sorted using the given comparator function. Read more
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(&Self::Item) -> K,
K: PartialOrd<K>,
[src]
F: FnMut(&Self::Item) -> K,
K: PartialOrd<K>,
🔬 This is a nightly-only experimental API. (is_sorted
)
new API
Checks if the elements of this iterator are sorted using the given key extraction function. Read more
impl From<u64> for BitBoard
[src]
impl From<BitBoard> for u64
[src]
impl Default for BitBoard
[src]
impl Hash for BitBoard
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl Display for BitBoard
[src]
impl Debug for BitBoard
[src]
impl Add<BitBoard> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the +
operator.
ⓘImportant traits for BitBoardfn add(self, rhs: BitBoard) -> BitBoard
[src]
impl Add<u64> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the +
operator.
ⓘImportant traits for BitBoardfn add(self, rhs: u64) -> BitBoard
[src]
impl Sub<BitBoard> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the -
operator.
ⓘImportant traits for BitBoardfn sub(self, rhs: BitBoard) -> BitBoard
[src]
impl Sub<u64> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the -
operator.
ⓘImportant traits for BitBoardfn sub(self, rhs: u64) -> BitBoard
[src]
impl Mul<BitBoard> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the *
operator.
ⓘImportant traits for BitBoardfn mul(self, rhs: BitBoard) -> BitBoard
[src]
impl Mul<u64> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the *
operator.
ⓘImportant traits for BitBoardfn mul(self, rhs: u64) -> BitBoard
[src]
impl Div<BitBoard> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the /
operator.
ⓘImportant traits for BitBoardfn div(self, rhs: BitBoard) -> BitBoard
[src]
impl Div<u64> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the /
operator.
ⓘImportant traits for BitBoardfn div(self, rhs: u64) -> BitBoard
[src]
impl Rem<BitBoard> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the %
operator.
ⓘImportant traits for BitBoardfn rem(self, rhs: BitBoard) -> BitBoard
[src]
impl Rem<u64> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the %
operator.
ⓘImportant traits for BitBoardfn rem(self, rhs: u64) -> BitBoard
[src]
impl AddAssign<BitBoard> for BitBoard
[src]
fn add_assign(&mut self, rhs: BitBoard)
[src]
impl AddAssign<u64> for BitBoard
[src]
fn add_assign(&mut self, rhs: u64)
[src]
impl SubAssign<BitBoard> for BitBoard
[src]
fn sub_assign(&mut self, rhs: BitBoard)
[src]
impl SubAssign<u64> for BitBoard
[src]
fn sub_assign(&mut self, rhs: u64)
[src]
impl MulAssign<BitBoard> for BitBoard
[src]
fn mul_assign(&mut self, rhs: BitBoard)
[src]
impl MulAssign<u64> for BitBoard
[src]
fn mul_assign(&mut self, rhs: u64)
[src]
impl DivAssign<BitBoard> for BitBoard
[src]
fn div_assign(&mut self, rhs: BitBoard)
[src]
impl DivAssign<u64> for BitBoard
[src]
fn div_assign(&mut self, rhs: u64)
[src]
impl RemAssign<BitBoard> for BitBoard
[src]
fn rem_assign(&mut self, rhs: BitBoard)
[src]
impl RemAssign<u64> for BitBoard
[src]
fn rem_assign(&mut self, rhs: u64)
[src]
impl Not for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the !
operator.
ⓘImportant traits for BitBoardfn not(self) -> BitBoard
[src]
impl BitAnd<BitBoard> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the &
operator.
ⓘImportant traits for BitBoardfn bitand(self, rhs: BitBoard) -> BitBoard
[src]
impl BitAnd<u64> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the &
operator.
ⓘImportant traits for BitBoardfn bitand(self, rhs: u64) -> BitBoard
[src]
impl BitOr<BitBoard> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the |
operator.
ⓘImportant traits for BitBoardfn bitor(self, rhs: BitBoard) -> BitBoard
[src]
impl BitOr<u64> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the |
operator.
ⓘImportant traits for BitBoardfn bitor(self, rhs: u64) -> BitBoard
[src]
impl BitXor<BitBoard> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the ^
operator.
ⓘImportant traits for BitBoardfn bitxor(self, rhs: BitBoard) -> BitBoard
[src]
impl BitXor<u64> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the ^
operator.
ⓘImportant traits for BitBoardfn bitxor(self, rhs: u64) -> BitBoard
[src]
impl Shl<usize> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the <<
operator.
ⓘImportant traits for BitBoardfn shl(self, rhs: usize) -> BitBoard
[src]
impl Shl<SQ> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the <<
operator.
ⓘImportant traits for BitBoardfn shl(self, rhs: SQ) -> BitBoard
[src]
impl Shr<usize> for BitBoard
[src]
type Output = BitBoard
The resulting type after applying the >>
operator.
ⓘImportant traits for BitBoardfn shr(self, rhs: usize) -> BitBoard
[src]
impl BitAndAssign<BitBoard> for BitBoard
[src]
fn bitand_assign(&mut self, rhs: BitBoard)
[src]
impl BitAndAssign<u64> for BitBoard
[src]
fn bitand_assign(&mut self, rhs: u64)
[src]
impl BitOrAssign<BitBoard> for BitBoard
[src]
fn bitor_assign(&mut self, rhs: BitBoard)
[src]
impl BitOrAssign<u64> for BitBoard
[src]
fn bitor_assign(&mut self, rhs: u64)
[src]
impl BitXorAssign<BitBoard> for BitBoard
[src]
fn bitxor_assign(&mut self, rhs: BitBoard)
[src]
impl BitXorAssign<u64> for BitBoard
[src]
fn bitxor_assign(&mut self, rhs: u64)
[src]
impl ShlAssign<usize> for BitBoard
[src]
fn shl_assign(&mut self, rhs: usize)
[src]
impl ShrAssign<usize> for BitBoard
[src]
fn shr_assign(&mut self, rhs: usize)
[src]
Auto Trait Implementations
Blanket Implementations
impl<I> IntoIterator for I where
I: Iterator,
[src]
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]
T: Display + ?Sized,
impl<T, U> Into for T where
U: From<T>,
[src]
U: From<T>,
impl<T> From for T
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
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]
T: ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<I> IteratorRandom for I where
I: Iterator,
[src]
I: Iterator,
fn choose<R>(self, rng: &mut R) -> Option<Self::Item> where
R: Rng + ?Sized,
[src]
R: Rng + ?Sized,
Choose one element at random from the iterator. If you have a slice, it's significantly faster to call the [choose
] or [choose_mut
] functions using the slice instead. Read more
fn choose_multiple_fill<R>(self, rng: &mut R, buf: &mut [Self::Item]) -> usize where
R: Rng + ?Sized,
[src]
R: Rng + ?Sized,
Collects amount
values at random from the iterator into a supplied buffer. Read more
fn choose_multiple<R>(self, rng: &mut R, amount: usize) -> Vec<Self::Item> where
R: Rng + ?Sized,
[src]
R: Rng + ?Sized,
Collects amount
values at random from the iterator into a vector. Read more
impl<T> ParallelBridge for T where
T: Send + Iterator,
<T as Iterator>::Item: Send,
[src]
T: Send + Iterator,
<T as Iterator>::Item: Send,