StaticIntervalOrder

Struct StaticIntervalOrder 

Source
pub struct StaticIntervalOrder {
    single_var_order: HashMap<Variable, Vec<Interval>>,
    multi_var_order: HashMap<WeightedSum<Variable>, Vec<Interval>>,
    equal_boundaries: HashMap<IntervalBoundary, IntervalBoundary>,
}
Expand description

Static order on intervals implementing IntervalOrder for variables and sums of variables

Fields§

§single_var_order: HashMap<Variable, Vec<Interval>>

Order on intervals for each variable

§multi_var_order: HashMap<WeightedSum<Variable>, Vec<Interval>>

Order on intervals multi-variable guards

§equal_boundaries: HashMap<IntervalBoundary, IntervalBoundary>

Interval boundaries that are considered equal

Implementations§

Source§

impl StaticIntervalOrder

Source

pub fn single_var_order(&self) -> &HashMap<Variable, Vec<Interval>>

returns the underlying single_var_order

Trait Implementations§

Source§

impl Clone for StaticIntervalOrder

Source§

fn clone(&self) -> StaticIntervalOrder

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for StaticIntervalOrder

Source§

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

Formats the value using the given formatter. Read more
Source§

impl DefinesStaticIntervalOrder<Variable> for StaticIntervalOrder

Source§

fn check_interval_replaced_by_eq( &self, ib: IntervalBoundary, ) -> IntervalBoundary

This function checks whether the interval needs to be replaced by another one because it is considered equal to another boundary in the order.

This function must be called when converting thresholds in the order.

Source§

fn get_intervals<'a>( &'a self, var: &Variable, ) -> Result<&'a Vec<Interval>, IntervalOrderError<Variable>>

Source§

fn get_interval_index( &self, var: &Variable, i: &Interval, ) -> Result<usize, IntervalOrderError<Variable>>

Source§

fn get_interval_by_index<'a>( &'a self, var: &Variable, idx: usize, ) -> Result<&'a Interval, IntervalOrderError<Variable>>

Source§

impl DefinesStaticIntervalOrder<WeightedSum<Variable>> for StaticIntervalOrder

Source§

fn get_intervals<'a>( &'a self, var: &WeightedSum<Variable>, ) -> Result<&'a Vec<Interval>, IntervalOrderError<WeightedSum<Variable>>>

Source§

fn get_interval_index( &self, var: &WeightedSum<Variable>, i: &Interval, ) -> Result<usize, IntervalOrderError<WeightedSum<Variable>>>

Source§

fn get_interval_by_index<'a>( &'a self, var: &WeightedSum<Variable>, idx: usize, ) -> Result<&'a Interval, IntervalOrderError<WeightedSum<Variable>>>

Source§

fn check_interval_replaced_by_eq( &self, ib: IntervalBoundary, ) -> IntervalBoundary

Check whether the interval order replaces the interval boundary Read more
Source§

impl Display for StaticIntervalOrder

Source§

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

Formats the value using the given formatter. Read more
Source§

impl IntervalOrder for StaticIntervalOrder

Source§

fn order_to_boolean_expr<T: Atomic>(&self) -> Vec<BooleanExpression<T>>

Convert the order to a boolean expression Read more
Source§

impl PartialEq for StaticIntervalOrder

Source§

fn eq(&self, other: &StaticIntervalOrder) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl StructuralPartialEq for StaticIntervalOrder

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> IntervalOrderFor<T> for U

Source§

fn get_number_of_intervals( &self, var: &T, ) -> Result<usize, IntervalOrderError<T>>

Get the number of intervals associated with t
Source§

fn lt( &self, var: &T, i1: &Interval, i2: &Interval, ) -> Result<bool, IntervalOrderError<T>>

Check if in the interval order for t the intervals are ordered i1 < i2 Read more
Source§

fn gt( &self, var: &T, i1: &Interval, i2: &Interval, ) -> Result<bool, IntervalOrderError<T>>

Check if in the interval order for t it holds that i1 > i2 Read more
Source§

fn get_next_interval<'a>( &'a self, var: &T, i: &Interval, ) -> Result<Option<&'a Interval>, IntervalOrderError<T>>

Get the next interval appearing after i in the order for t Read more
Source§

fn get_previous_interval<'a>( &'a self, var: &T, i: &Interval, ) -> Result<Option<&'a Interval>, IntervalOrderError<T>>

Get the previous interval of i for variable var Read more
Source§

fn compute_enabled_intervals_of_threshold( &self, t: &T, thr: &ThresholdConstraint, ) -> Result<Vec<Interval>, IntervalOrderError<T>>

Get the intervals of t where thr is enabled
Source§

fn get_zero_interval(&self, t: &T) -> Result<&Interval, IntervalOrderError<T>>

Get the zero interval of t
Source§

fn get_all_intervals_of_t( &self, t: &T, ) -> Result<&Vec<Interval>, IntervalOrderError<T>>

Get all intervals associated with t Read more
Source§

fn check_interval_replaced(&self, ib: IntervalBoundary) -> IntervalBoundary

Check whether the interval order replaces the interval boundary Read more
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> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T> ToString for T
where T: Display + ?Sized,

Source§

fn to_string(&self) -> String

Converts the given value to a String. Read more
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.