pub struct QPolynomialList {
pub ptr: uintptr_t,
pub should_free_on_drop: bool,
}Expand description
Wraps isl_qpolynomial_list.
Fields§
§ptr: uintptr_t§should_free_on_drop: boolImplementations§
Source§impl QPolynomialList
impl QPolynomialList
Sourcepub fn add(self, el: QPolynomial) -> Result<QPolynomialList, LibISLError>
pub fn add(self, el: QPolynomial) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_add.
Sourcepub fn alloc(ctx: &Context, n: i32) -> Result<QPolynomialList, LibISLError>
pub fn alloc(ctx: &Context, n: i32) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_alloc.
Sourcepub fn clear(self) -> Result<QPolynomialList, LibISLError>
pub fn clear(self) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_clear.
Sourcepub fn concat(
self,
list2: QPolynomialList,
) -> Result<QPolynomialList, LibISLError>
pub fn concat( self, list2: QPolynomialList, ) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_concat.
Sourcepub fn copy(&self) -> Result<QPolynomialList, LibISLError>
pub fn copy(&self) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_copy.
Sourcepub fn drop(self, first: u32, n: u32) -> Result<QPolynomialList, LibISLError>
pub fn drop(self, first: u32, n: u32) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_drop.
Sourcepub fn dump(&self) -> Result<(), LibISLError>
pub fn dump(&self) -> Result<(), LibISLError>
Wraps isl_qpolynomial_list_dump.
Sourcepub fn free(self) -> Result<QPolynomialList, LibISLError>
pub fn free(self) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_free.
Sourcepub fn from_qpolynomial(el: QPolynomial) -> Result<QPolynomialList, LibISLError>
pub fn from_qpolynomial(el: QPolynomial) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_from_qpolynomial.
Sourcepub fn get_at(&self, index: i32) -> Result<QPolynomial, LibISLError>
pub fn get_at(&self, index: i32) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_list_get_at.
Sourcepub fn get_qpolynomial(&self, index: i32) -> Result<QPolynomial, LibISLError>
pub fn get_qpolynomial(&self, index: i32) -> Result<QPolynomial, LibISLError>
Wraps isl_qpolynomial_list_get_qpolynomial.
Sourcepub fn insert(
self,
pos: u32,
el: QPolynomial,
) -> Result<QPolynomialList, LibISLError>
pub fn insert( self, pos: u32, el: QPolynomial, ) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_insert.
Sourcepub fn n_qpolynomial(&self) -> Result<i32, LibISLError>
pub fn n_qpolynomial(&self) -> Result<i32, LibISLError>
Wraps isl_qpolynomial_list_n_qpolynomial.
Sourcepub fn reverse(self) -> Result<QPolynomialList, LibISLError>
pub fn reverse(self) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_reverse.
Sourcepub fn set_at(
self,
index: i32,
el: QPolynomial,
) -> Result<QPolynomialList, LibISLError>
pub fn set_at( self, index: i32, el: QPolynomial, ) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_set_at.
Sourcepub fn set_qpolynomial(
self,
index: i32,
el: QPolynomial,
) -> Result<QPolynomialList, LibISLError>
pub fn set_qpolynomial( self, index: i32, el: QPolynomial, ) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_set_qpolynomial.
Sourcepub fn size(&self) -> Result<i32, LibISLError>
pub fn size(&self) -> Result<i32, LibISLError>
Wraps isl_qpolynomial_list_size.
Sourcepub fn swap(self, pos1: u32, pos2: u32) -> Result<QPolynomialList, LibISLError>
pub fn swap(self, pos1: u32, pos2: u32) -> Result<QPolynomialList, LibISLError>
Wraps isl_qpolynomial_list_swap.
Sourcepub fn to_str(&self) -> Result<&str, LibISLError>
pub fn to_str(&self) -> Result<&str, LibISLError>
Wraps isl_qpolynomial_list_to_str.
Sourcepub fn do_not_free_on_drop(&mut self)
pub fn do_not_free_on_drop(&mut self)
Does not call isl_qpolynomial_list_free() on being dropped. (For internal use only.)