Struct flag_algebra::Ineq
source · pub struct Ineq<N, F: Flag> { /* private fields */ }Expand description
A set of bounds on elements of a flag algebra.
This correpond to a set of inequalities constructed in a similar way.
Implementations§
source§impl<N, F> Ineq<N, F>where
N: Clone + Num,
F: Flag,
impl<N, F> Ineq<N, F>where N: Clone + Num, F: Flag,
source§impl<N, F> Ineq<N, F>where
N: Num + Clone + Send + Sync + Default + FromPrimitive + AddAssign + Sum + MulAcc,
F: Flag,
impl<N, F> Ineq<N, F>where N: Num + Clone + Send + Sync + Default + FromPrimitive + AddAssign + Sum + MulAcc, F: Flag,
sourcepub fn multiply_by_all(self, outbasis: Basis<F>) -> Selfwhere
N: Neg<Output = N>,
pub fn multiply_by_all(self, outbasis: Basis<F>) -> Selfwhere N: Neg<Output = N>,
If self is “f ≥ x”, return the set of inequalities “f*g ≥ x.g”,
where g is chosen such that f*g is a vector of outbasis.
sourcepub fn multiply_and_unlabel(self, outbasis: Basis<F>) -> Selfwhere
N: Neg<Output = N>,
pub fn multiply_and_unlabel(self, outbasis: Basis<F>) -> Selfwhere N: Neg<Output = N>,
If self is “f ≥ x”, return the set of inequalities “〚f*g〛 ≥ x.〚g〛”,
where g is chosen such that 〚f*g〛 is a vector of outbasis.
Trait Implementations§
Auto Trait Implementations§
impl<N, F> !RefUnwindSafe for Ineq<N, F>
impl<N, F> !Send for Ineq<N, F>
impl<N, F> !Sync for Ineq<N, F>
impl<N, F> Unpin for Ineq<N, F>where F: Unpin, N: Unpin,
impl<N, F> !UnwindSafe for Ineq<N, F>
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
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.