Skip to main content

LinearSession

Struct LinearSession 

Source
pub struct LinearSession { /* private fields */ }
Expand description

An incremental solve session for repeated solves of one linear problem whose constants change (see the module documentation).

Implementations§

Source§

impl LinearSession

Source

pub fn new( problem: &Problem, moving: &[usize], opts: SolveOptions, ) -> Option<Self>

Build a session for problem. moving are indices into problem.rules of the rules whose constants change from solve to solve (drag targets); their rows must be equalities. Returns None when the problem has a nonlinear component, an unsupported rule, a non-finite value, or required rules that already contradict each other — a full solve handles those.

Source

pub fn is_broken(&self) -> bool

Whether the session can no longer be used (a constraint could not be re-added); build a new one.

Source

pub fn resolve(&mut self, problem: &Problem) -> Option<Solution>

Solve problem, which must have the structure of the problem the session was built from (same variables, fixed flags, rules and targets; constants, coefficients and reference values may differ). Returns an accepted, independently verified solution, or None when a full solve is needed.

Trait Implementations§

Source§

impl Debug for LinearSession

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

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
§

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

§

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

Checks if self is actually part of its subset T (and can be converted to it).
§

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

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.