pub enum BitGeneratorKind {
MT19937,
PCG64,
PCG64DXSM,
Philox,
SFC64,
}Expand description
Which of numpy’s bit generator algorithms BitGenerator::new should create.
Variants§
MT19937
Mersenne Twister (MT19937)
PCG64
Permuted congruential generator (64-bit, PCG-64)
PCG64DXSM
Permuted congruential generator (64-bit, PCG-64 DXSM
Philox
Philox counter-based RNG
SFC64
SFC64 Small Fast Chaotic PRNG
Implementations§
Source§impl BitGeneratorKind
impl BitGeneratorKind
Sourcepub fn iter() -> Copied<Iter<'static, BitGeneratorKind>>
pub fn iter() -> Copied<Iter<'static, BitGeneratorKind>>
Returns an iterator over the values of BitGeneratorKind.
Trait Implementations§
Source§impl Clone for BitGeneratorKind
impl Clone for BitGeneratorKind
Source§fn clone(&self) -> BitGeneratorKind
fn clone(&self) -> BitGeneratorKind
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for BitGeneratorKind
Source§impl Debug for BitGeneratorKind
impl Debug for BitGeneratorKind
Source§impl Default for BitGeneratorKind
impl Default for BitGeneratorKind
Source§fn default() -> BitGeneratorKind
fn default() -> BitGeneratorKind
Returns the “default value” for a type. Read more
impl Eq for BitGeneratorKind
Source§impl From<BitGeneratorKind> for &'static str
impl From<BitGeneratorKind> for &'static str
Source§fn from(value: BitGeneratorKind) -> &'static str
fn from(value: BitGeneratorKind) -> &'static str
Converts to this type from the input type.
Source§impl Hash for BitGeneratorKind
impl Hash for BitGeneratorKind
Source§impl PartialEq for BitGeneratorKind
impl PartialEq for BitGeneratorKind
Source§fn eq(&self, other: &BitGeneratorKind) -> bool
fn eq(&self, other: &BitGeneratorKind) -> bool
Tests for
self and other values to be equal, and is used by ==.impl StructuralPartialEq for BitGeneratorKind
Auto Trait Implementations§
impl Freeze for BitGeneratorKind
impl RefUnwindSafe for BitGeneratorKind
impl Send for BitGeneratorKind
impl Sync for BitGeneratorKind
impl Unpin for BitGeneratorKind
impl UnsafeUnpin for BitGeneratorKind
impl UnwindSafe for BitGeneratorKind
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.