pub struct MetropolisAlgorithm { /* private fields */ }Expand description
Metropolis-Hastings algorithm implementation for CDT.
This implementation works with both the legacy Tds-based approach and the new trait-based geometry backends.
Implementations§
Source§impl MetropolisAlgorithm
impl MetropolisAlgorithm
Sourcepub fn new(config: MetropolisConfig, action_config: ActionConfig) -> Self
pub fn new(config: MetropolisConfig, action_config: ActionConfig) -> Self
Creates a new Metropolis algorithm instance.
Sourcepub fn run(
&mut self,
triangulation: CdtTriangulation2D,
) -> SimulationResultsBackend
pub fn run( &mut self, triangulation: CdtTriangulation2D, ) -> SimulationResultsBackend
Run the Monte Carlo simulation.
This runs the Metropolis-Hastings algorithm on the given triangulation.
Auto Trait Implementations§
impl Freeze for MetropolisAlgorithm
impl !RefUnwindSafe for MetropolisAlgorithm
impl !Send for MetropolisAlgorithm
impl !Sync for MetropolisAlgorithm
impl Unpin for MetropolisAlgorithm
impl UnsafeUnpin for MetropolisAlgorithm
impl !UnwindSafe for MetropolisAlgorithm
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