Skip to main content

PackingOptimizer

Struct PackingOptimizer 

Source
pub struct PackingOptimizer {
    pub config: OptimizerConfig,
    pub spheres: Vec<PackingSphere>,
    pub domain: [f64; 3],
    pub convergence: Vec<f64>,
    pub converged: bool,
}
Expand description

Force-based packing optimizer.

Uses a soft-sphere repulsive potential to relax overlapping spheres toward a mechanically stable configuration.

Fields§

§config: OptimizerConfig

Optimizer configuration.

§spheres: Vec<PackingSphere>

Spheres being optimized.

§domain: [f64; 3]

Domain bounds.

§convergence: Vec<f64>

Convergence history (max overlap at each iteration).

§converged: bool

Whether the optimizer has converged.

Implementations§

Source§

impl PackingOptimizer

Source

pub fn new( spheres: Vec<PackingSphere>, domain: [f64; 3], config: OptimizerConfig, ) -> Self

Create a new optimizer.

Source

pub fn step(&mut self) -> f64

Perform one optimization step.

Returns the maximum overlap after the step.

Source

pub fn run(&mut self)

Run the optimizer until convergence or max iterations.

Source

pub fn potential_energy(&self) -> f64

Compute the total potential energy of the packing.

Source

pub fn packing_fraction(&self) -> f64

Compute the packing fraction after optimization.

Source

pub fn max_overlap(&self) -> f64

Return the maximum overlap in the current configuration.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.