pub struct McWrapper<MCD, State, Rng, const D: usize>{ /* private fields */ }Expand description
A wrapper used to implement MonteCarlo from a MonteCarloDefault
§Example
use lattice_qcd_rs::error::ImplementationError;
use lattice_qcd_rs::simulation::{
LatticeState, LatticeStateDefault, McWrapper, MetropolisHastingsDiagnostic, MonteCarlo,
};
use rand::SeedableRng;
let rng = rand::rngs::StdRng::seed_from_u64(0); // change with your seed
let mh = MetropolisHastingsDiagnostic::new(1, 0.1_f64)
.ok_or(ImplementationError::OptionWithUnexpectedNone)?;
let mut wrapper = McWrapper::new(mh, rng);
// Realistically you want more steps than 10
let mut state = LatticeStateDefault::<3>::new_cold(1_f64, 6_f64, 4)?;
for _ in 0..100 {
state = state.monte_carlo_step(&mut wrapper)?;
println!(
"probability of acceptance during last step {}, does it accepted the change ? {}",
mh.prob_replace_last(),
mh.has_replace_last()
);
// or state.monte_carlo_step(&mut wrapper)?;
// operation to track the progress or the evolution
}
// operation at the end of the simulation
let (_, rng) = wrapper.deconstruct(); // get the rng backImplementations§
Source§impl<MCD, State, Rng, const D: usize> McWrapper<MCD, State, Rng, D>
impl<MCD, State, Rng, const D: usize> McWrapper<MCD, State, Rng, D>
Sourcepub fn deconstruct(self) -> (MCD, Rng)
pub fn deconstruct(self) -> (MCD, Rng)
deconstruct the structure to get back the rng if necessary
Sourcepub const fn mcd(&self) -> &MCD
pub const fn mcd(&self) -> &MCD
Get a reference to the MonteCarloDefault inside the wrapper.
Trait Implementations§
Source§impl<'de, MCD, State, Rng, const D: usize> Deserialize<'de> for McWrapper<MCD, State, Rng, D>where
MCD: MonteCarloDefault<State, D> + Deserialize<'de>,
State: LatticeState<D>,
Rng: Rng + Deserialize<'de>,
impl<'de, MCD, State, Rng, const D: usize> Deserialize<'de> for McWrapper<MCD, State, Rng, D>where
MCD: MonteCarloDefault<State, D> + Deserialize<'de>,
State: LatticeState<D>,
Rng: Rng + Deserialize<'de>,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<T, State, Rng, const D: usize> MonteCarlo<State, D> for McWrapper<T, State, Rng, D>
impl<T, State, Rng, const D: usize> MonteCarlo<State, D> for McWrapper<T, State, Rng, D>
Source§impl<MCD, State, Rng, const D: usize> PartialEq for McWrapper<MCD, State, Rng, D>where
MCD: MonteCarloDefault<State, D> + PartialEq,
State: LatticeState<D> + PartialEq,
Rng: Rng + PartialEq,
impl<MCD, State, Rng, const D: usize> PartialEq for McWrapper<MCD, State, Rng, D>where
MCD: MonteCarloDefault<State, D> + PartialEq,
State: LatticeState<D> + PartialEq,
Rng: Rng + PartialEq,
impl<MCD, State, Rng, const D: usize> Eq for McWrapper<MCD, State, Rng, D>
impl<MCD, State, Rng, const D: usize> StructuralPartialEq for McWrapper<MCD, State, Rng, D>
Auto Trait Implementations§
impl<MCD, State, Rng, const D: usize> Freeze for McWrapper<MCD, State, Rng, D>
impl<MCD, State, Rng, const D: usize> RefUnwindSafe for McWrapper<MCD, State, Rng, D>
impl<MCD, State, Rng, const D: usize> Send for McWrapper<MCD, State, Rng, D>
impl<MCD, State, Rng, const D: usize> Sync for McWrapper<MCD, State, Rng, D>
impl<MCD, State, Rng, const D: usize> Unpin for McWrapper<MCD, State, Rng, D>
impl<MCD, State, Rng, const D: usize> UnwindSafe for McWrapper<MCD, State, Rng, D>
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.