pub struct QPolynomial {
pub ptr: uintptr_t,
pub should_free_on_drop: bool,
}Expand description
Wraps isl_qpolynomial.
Fields§
§ptr: uintptr_t§should_free_on_drop: boolImplementations§
Source§impl QPolynomial
impl QPolynomial
Sourcepub fn add(self, qp2: QPolynomial) -> Result<QPolynomial, LibISLError>
pub fn add(self, qp2: QPolynomial) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_add.
Sourcepub fn add_dims(
self,
type_: DimType,
n: u32,
) -> Result<QPolynomial, LibISLError>
pub fn add_dims( self, type_: DimType, n: u32, ) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_add_dims.
Sourcepub fn align_params(self, model: Space) -> Result<QPolynomial, LibISLError>
pub fn align_params(self, model: Space) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_align_params.
Sourcepub fn as_aff(self) -> Result<Aff, LibISLError>
pub fn as_aff(self) -> Result<Aff, LibISLError>
Wraps isl_qpolynomial_as_aff.
Sourcepub fn copy(&self) -> Result<QPolynomial, LibISLError>
pub fn copy(&self) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_copy.
Sourcepub fn domain_reverse(self) -> Result<QPolynomial, LibISLError>
pub fn domain_reverse(self) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_domain_reverse.
Sourcepub fn drop_dims(
self,
type_: DimType,
first: u32,
n: u32,
) -> Result<QPolynomial, LibISLError>
pub fn drop_dims( self, type_: DimType, first: u32, n: u32, ) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_drop_dims.
Sourcepub fn dump(&self) -> Result<(), LibISLError>
pub fn dump(&self) -> Result<(), LibISLError>
Wraps isl_qpolynomial_dump.
Sourcepub fn free(self) -> Result<QPolynomial, LibISLError>
pub fn free(self) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_free.
Sourcepub fn from_aff(aff: Aff) -> Result<QPolynomial, LibISLError>
pub fn from_aff(aff: Aff) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_from_aff.
Sourcepub fn from_constraint(
c: Constraint,
type_: DimType,
pos: u32,
) -> Result<QPolynomial, LibISLError>
pub fn from_constraint( c: Constraint, type_: DimType, pos: u32, ) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_from_constraint.
Sourcepub fn from_term(term: Term) -> Result<QPolynomial, LibISLError>
pub fn from_term(term: Term) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_from_term.
Sourcepub fn get_constant_val(&self) -> Result<Val, LibISLError>
pub fn get_constant_val(&self) -> Result<Val, LibISLError>
Wraps isl_qpolynomial_get_constant_val.
Sourcepub fn get_domain_space(&self) -> Result<Space, LibISLError>
pub fn get_domain_space(&self) -> Result<Space, LibISLError>
Wraps isl_qpolynomial_get_domain_space.
Sourcepub fn get_space(&self) -> Result<Space, LibISLError>
pub fn get_space(&self) -> Result<Space, LibISLError>
Wraps isl_qpolynomial_get_space.
Sourcepub fn gist(self, context: Set) -> Result<QPolynomial, LibISLError>
pub fn gist(self, context: Set) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_gist.
Sourcepub fn gist_params(self, context: Set) -> Result<QPolynomial, LibISLError>
pub fn gist_params(self, context: Set) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_gist_params.
Sourcepub fn homogenize(self) -> Result<QPolynomial, LibISLError>
pub fn homogenize(self) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_homogenize.
Sourcepub fn infty_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
pub fn infty_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_infty_on_domain.
Sourcepub fn insert_dims(
self,
type_: DimType,
first: u32,
n: u32,
) -> Result<QPolynomial, LibISLError>
pub fn insert_dims( self, type_: DimType, first: u32, n: u32, ) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_insert_dims.
Sourcepub fn involves_dims(
&self,
type_: DimType,
first: u32,
n: u32,
) -> Result<bool, LibISLError>
pub fn involves_dims( &self, type_: DimType, first: u32, n: u32, ) -> Result<bool, LibISLError>
Wraps isl_qpolynomial_involves_dims.
Sourcepub fn is_infty(&self) -> Result<bool, LibISLError>
pub fn is_infty(&self) -> Result<bool, LibISLError>
Wraps isl_qpolynomial_is_infty.
Sourcepub fn is_nan(&self) -> Result<bool, LibISLError>
pub fn is_nan(&self) -> Result<bool, LibISLError>
Wraps isl_qpolynomial_is_nan.
Sourcepub fn is_neginfty(&self) -> Result<bool, LibISLError>
pub fn is_neginfty(&self) -> Result<bool, LibISLError>
Wraps isl_qpolynomial_is_neginfty.
Sourcepub fn is_zero(&self) -> Result<bool, LibISLError>
pub fn is_zero(&self) -> Result<bool, LibISLError>
Wraps isl_qpolynomial_is_zero.
Sourcepub fn isa_aff(&self) -> Result<bool, LibISLError>
pub fn isa_aff(&self) -> Result<bool, LibISLError>
Wraps isl_qpolynomial_isa_aff.
Sourcepub fn move_dims(
self,
dst_type: DimType,
dst_pos: u32,
src_type: DimType,
src_pos: u32,
n: u32,
) -> Result<QPolynomial, LibISLError>
pub fn move_dims( self, dst_type: DimType, dst_pos: u32, src_type: DimType, src_pos: u32, n: u32, ) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_move_dims.
Sourcepub fn mul(self, qp2: QPolynomial) -> Result<QPolynomial, LibISLError>
pub fn mul(self, qp2: QPolynomial) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_mul.
Sourcepub fn nan_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
pub fn nan_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_nan_on_domain.
Sourcepub fn neg(self) -> Result<QPolynomial, LibISLError>
pub fn neg(self) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_neg.
Sourcepub fn neginfty_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
pub fn neginfty_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_neginfty_on_domain.
Sourcepub fn one_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
pub fn one_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_one_on_domain.
Sourcepub fn plain_is_equal(&self, qp2: &QPolynomial) -> Result<bool, LibISLError>
pub fn plain_is_equal(&self, qp2: &QPolynomial) -> Result<bool, LibISLError>
Wraps isl_qpolynomial_plain_is_equal.
Sourcepub fn pow(self, power: u32) -> Result<QPolynomial, LibISLError>
pub fn pow(self, power: u32) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_pow.
Sourcepub fn project_domain_on_params(self) -> Result<QPolynomial, LibISLError>
pub fn project_domain_on_params(self) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_project_domain_on_params.
Sourcepub fn scale_down_val(self, v: Val) -> Result<QPolynomial, LibISLError>
pub fn scale_down_val(self, v: Val) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_scale_down_val.
Sourcepub fn scale_val(self, v: Val) -> Result<QPolynomial, LibISLError>
pub fn scale_val(self, v: Val) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_scale_val.
Sourcepub fn set_dim_name(
self,
type_: DimType,
pos: u32,
s: &str,
) -> Result<QPolynomial, LibISLError>
pub fn set_dim_name( self, type_: DimType, pos: u32, s: &str, ) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_set_dim_name.
Sourcepub fn sgn(&self) -> Result<i32, LibISLError>
pub fn sgn(&self) -> Result<i32, LibISLError>
Wraps isl_qpolynomial_sgn.
Sourcepub fn sub(self, qp2: QPolynomial) -> Result<QPolynomial, LibISLError>
pub fn sub(self, qp2: QPolynomial) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_sub.
Sourcepub fn to_list(self) -> Result<QPolynomialList, LibISLError>
pub fn to_list(self) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_to_list.
Sourcepub fn val_on_domain(space: Space, val: Val) -> Result<QPolynomial, LibISLError>
pub fn val_on_domain(space: Space, val: Val) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_val_on_domain.
Sourcepub fn var_on_domain(
domain: Space,
type_: DimType,
pos: u32,
) -> Result<QPolynomial, LibISLError>
pub fn var_on_domain( domain: Space, type_: DimType, pos: u32, ) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_var_on_domain.
Sourcepub fn zero_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
pub fn zero_on_domain(domain: Space) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_zero_on_domain.
Sourcepub fn do_not_free_on_drop(&mut self)
pub fn do_not_free_on_drop(&mut self)
Does not call isl_qpolynomial_free() on being dropped. (For internal use only.)