pub struct SaNestingProblem { /* private fields */ }Expand description
SA problem definition for 2D nesting.
Implementations§
Source§impl SaNestingProblem
impl SaNestingProblem
Sourcepub fn new(
geometries: Vec<Geometry2D>,
boundary: Boundary2D,
config: Config,
cancelled: Arc<AtomicBool>,
) -> Self
pub fn new( geometries: Vec<Geometry2D>, boundary: Boundary2D, config: Config, cancelled: Arc<AtomicBool>, ) -> Self
Creates a new SA nesting problem.
Sourcepub fn num_instances(&self) -> usize
pub fn num_instances(&self) -> usize
Returns the total number of instances.
Trait Implementations§
Source§impl SaProblem for SaNestingProblem
impl SaProblem for SaNestingProblem
Source§type Solution = PermutationSolution
type Solution = PermutationSolution
The solution type for this problem.
Source§fn initial_solution<R: Rng>(&self, rng: &mut R) -> Self::Solution
fn initial_solution<R: Rng>(&self, rng: &mut R) -> Self::Solution
Creates an initial solution.
Source§fn neighbor<R: Rng>(
&self,
solution: &Self::Solution,
operator: NeighborhoodOperator,
rng: &mut R,
) -> Self::Solution
fn neighbor<R: Rng>( &self, solution: &Self::Solution, operator: NeighborhoodOperator, rng: &mut R, ) -> Self::Solution
Generates a neighbor solution using the specified operator.
Source§fn available_operators(&self) -> Vec<NeighborhoodOperator>
fn available_operators(&self) -> Vec<NeighborhoodOperator>
Returns available neighborhood operators for this problem.
Auto Trait Implementations§
impl Freeze for SaNestingProblem
impl RefUnwindSafe for SaNestingProblem
impl Send for SaNestingProblem
impl Sync for SaNestingProblem
impl Unpin for SaNestingProblem
impl UnwindSafe for SaNestingProblem
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> 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.