Reference: Expression-Like Objects

Quasi-affine expression

class namedisl.Aff(_obj: IslObjectT_co, space: Space, _isl_names_ok: bool = False)

static zero_on_domain(space: Space) → Aff

as_pw_aff() → PwAff

with_coefficient(name: str, value: int) → Aff

denominator() → Val

var_affs

Returns a lazily-evaluated mapping from dimension names (or zero) to Affs.

Note

Lazy evaluation means you do not pay for the creation of unused dimensions.

is_constant() → bool

gist(set: Set) → Self

gist_params(set: Set) → Self

__mod__(other: Val | int) → Self

floor() → Self

ceil() → Self

eval(point: Point)

eval_with_dict(value_dict: Mapping[str, int | Val])

__neg__()

__add__(other: Self | int) → Self

__radd__(other: int) → Self

__sub__(other: Self | int) → Self

__rsub__(other: int) → Self

__mul__(other: Self | int) → Self

__rmul__(other: int) → Self

__truediv__(other: Self | int | Val) → Self

__bool__()

is_zero() → bool

plain_is_zero() → bool

equals(other: object) → bool

num_divs

get_div(index: int) → Aff

get_div_coefficient(index: int) → Val

constant

space: Space

active_dim_types: ClassVar[frozenset[DimType]] = frozenset({DimType.param, DimType.in_})

add_dims(dt: DimType, names_to_add: Collection[str], /) → Self

move_dims(names: Collection[str], dest_dt: DimType) → Self

rename_dims(renaming: Iterable[tuple[str, str]]) → Self

as_isl() → IslObjectT_co

involves_dims(names: Collection[str]) → bool

True if self involves any of the given dimensions.

__hash__() → int

Return hash(self).

__eq__(other: object) → bool

This is intended to be cheap and strict, suitable mainly for hashing. Some subclasses (e.g. namedisl.Set) may provide a different, ‘mathematically exact’ notion of equality as a different method that is more expensive to check for.

__str__() → str

Return str(self).

__repr__() → str

Return repr(self).

namedisl.make_aff(src: str, ctx: Context | None = None) → Aff

namedisl.make_aff(src: Aff) → Aff

namedisl.affs_from_domain_space(space: Space) → Mapping[str | Literal[0], Aff]

Constraint

class namedisl.Constraint(_obj: IslObjectT_co, space: Space, _isl_names_ok: bool = False)

static equality_from_aff(aff: Aff) → Constraint

static inequality_from_aff(aff: Aff) → Constraint

is_equality

as_aff() → Aff

as_basic_set()

as_basic_map()

num_divs

get_div(index: int) → Aff

get_div_coefficient(index: int) → Val

constant

space: Space

active_dim_types: ClassVar[frozenset[DimType]] = frozenset({DimType.param, DimType.in_, DimType.out})

add_dims(dt: DimType, names_to_add: Collection[str], /) → Self

move_dims(names: Collection[str], dest_dt: DimType) → Self

rename_dims(renaming: Iterable[tuple[str, str]]) → Self

as_isl() → IslObjectT_co

involves_dims(names: Collection[str]) → bool

True if self involves any of the given dimensions.

__hash__() → int

Return hash(self).

__eq__(other: object) → bool

This is intended to be cheap and strict, suitable mainly for hashing. Some subclasses (e.g. namedisl.Set) may provide a different, ‘mathematically exact’ notion of equality as a different method that is more expensive to check for.

__str__() → str

Return str(self).

__repr__() → str

Return repr(self).

namedisl.make_constraint(obj: Constraint) → Constraint

Piecewise quasi-affine expression

class namedisl.PwAff(_obj: IslObjectT_co, space: Space, _isl_names_ok: bool = False)

static from_piece_and_aff(piece: Set, aff: Aff) → PwAff

zero_like_me() → PwAff

var_pw_affs

Returns a lazily-evaluated mapping from dimension names (or zero) to PwAffs.

Note

Lazy evaluation means you do not pay for the creation of unused dimensions.

where(op: Literal['<', '<=', '==', '!=', '>=', '>'], rhs: int | PwAff) → Set

pieces = <function PwAff.pieces>

coalesce() → Self

eq_set(rhs: int | PwAff) → Set

ne_set(rhs: int | PwAff) → Set

ge_set(rhs: int | PwAff) → Set

le_set(rhs: int | PwAff) → Set

gt_set(rhs: int | PwAff) → Set

lt_set(rhs: int | PwAff) → Set

max(other: PwAff) → PwAff

min(other: PwAff) → PwAff

aggregate_domain() → Set

union_max(other: PwAff) → Self

union_min(other: PwAff) → Self

union_add(other: PwAff) → Self

as_pw_qpoly() → PwQPolynomial

is_constant() → bool

gist(set: Set) → Self

gist_params(set: Set) → Self

__mod__(other: Val | int) → Self

floor() → Self

ceil() → Self

eval(point: Point)

eval_with_dict(value_dict: Mapping[str, int | Val])

__neg__()

__add__(other: Self | int) → Self

__radd__(other: int) → Self

__sub__(other: Self | int) → Self

__rsub__(other: int) → Self

__mul__(other: Self | int) → Self

__rmul__(other: int) → Self

__truediv__(other: Self | int | Val) → Self

__bool__()

is_zero() → bool

plain_is_zero() → bool

equals(other: object) → bool

space: Space

active_dim_types: ClassVar[frozenset[DimType]] = frozenset({DimType.param, DimType.in_})

add_dims(dt: DimType, names_to_add: Collection[str], /) → Self

move_dims(names: Collection[str], dest_dt: DimType) → Self

rename_dims(renaming: Iterable[tuple[str, str]]) → Self

as_isl() → IslObjectT_co

involves_dims(names: Collection[str]) → bool

True if self involves any of the given dimensions.

__hash__() → int

Return hash(self).

__eq__(other: object) → bool

This is intended to be cheap and strict, suitable mainly for hashing. Some subclasses (e.g. namedisl.Set) may provide a different, ‘mathematically exact’ notion of equality as a different method that is more expensive to check for.

__str__() → str

Return str(self).

__repr__() → str

Return repr(self).

namedisl.make_pw_aff(src: str, ctx: Context | None = None) → PwAff

namedisl.make_pw_aff(src: PwAff) → PwAff

Create a PwAff from isl syntax or an islpy.PwAff.

namedisl.pw_affs_from_domain_space(space: Space) → Mapping[str | Literal[0], PwAff]

This creates a lazily-evaluated mapping, i.e. you do not pay for the creation of unused dimensions.

Quasipolynomial term

class namedisl.Term(_obj: Term, space: Space)

space: Space

coefficient

get_exp(name: str) → int

num_divs

get_div(index: int) → Aff

get_div_exp(index: int) → int

Quasipolynomial

class namedisl.QPolynomial(_obj: IslObjectT_co, space: Space, _isl_names_ok: bool = False)

terms() → Sequence[Term]

__pow__(other: int) → Self

eval(point: Point)

eval_with_dict(value_dict: Mapping[str, int | Val])

__neg__()

__add__(other: Self | int) → Self

__radd__(other: int) → Self

__sub__(other: Self | int) → Self

__rsub__(other: int) → Self

__mul__(other: Self | int) → Self

__rmul__(other: int) → Self

__truediv__(other: Val | int) → Self

__bool__()

is_zero() → bool

plain_is_zero() → bool

equals(other: object) → bool

space: Space

active_dim_types: ClassVar[frozenset[DimType]] = frozenset({DimType.param, DimType.in_})

add_dims(dt: DimType, names_to_add: Collection[str], /) → Self

move_dims(names: Collection[str], dest_dt: DimType) → Self

rename_dims(renaming: Iterable[tuple[str, str]]) → Self

as_isl() → IslObjectT_co

involves_dims(names: Collection[str]) → bool

True if self involves any of the given dimensions.

__hash__() → int

Return hash(self).

__eq__(other: object) → bool

This is intended to be cheap and strict, suitable mainly for hashing. Some subclasses (e.g. namedisl.Set) may provide a different, ‘mathematically exact’ notion of equality as a different method that is more expensive to check for.

__str__() → str

Return str(self).

__repr__() → str

Return repr(self).

namedisl.make_qpolynomial(src: str, ctx: Context | None = None) → QPolynomial

namedisl.make_qpolynomial(src: QPolynomial) → QPolynomial

Create a QPolynomial from isl syntax or an isl qpolynomial.

Piecewise quasipolynomial

class namedisl.PwQPolynomial(_obj: IslObjectT_co, space: Space, _isl_names_ok: bool = False)

classmethod zero_on_domain(space: Space)

static from_piece_and_qpolynomial(piece: Set, qpoly: QPolynomial) → PwQPolynomial

pieces() → list[tuple[Set, QPolynomial]]

coalesce() → Self

add_disjoint(other: Self) → Self

__pow__(other: int) → Self

eval(point: Point)

eval_with_dict(value_dict: Mapping[str, int | Val])

__neg__()

__add__(other: Self | int) → Self

__radd__(other: int) → Self

__sub__(other: Self | int) → Self

__rsub__(other: int) → Self

__mul__(other: Self | int) → Self

__rmul__(other: int) → Self

__truediv__(other: Val | int) → Self

__bool__()

is_zero() → bool

plain_is_zero() → bool

equals(other: object) → bool

space: Space

active_dim_types: ClassVar[frozenset[DimType]] = frozenset({DimType.param, DimType.in_})

add_dims(dt: DimType, names_to_add: Collection[str], /) → Self

move_dims(names: Collection[str], dest_dt: DimType) → Self

rename_dims(renaming: Iterable[tuple[str, str]]) → Self

as_isl() → IslObjectT_co

involves_dims(names: Collection[str]) → bool

True if self involves any of the given dimensions.

__hash__() → int

Return hash(self).

__eq__(other: object) → bool

This is intended to be cheap and strict, suitable mainly for hashing. Some subclasses (e.g. namedisl.Set) may provide a different, ‘mathematically exact’ notion of equality as a different method that is more expensive to check for.

__str__() → str

Return str(self).

__repr__() → str

Return repr(self).

namedisl.make_pw_qpolynomial(src: str, ctx: Context | None = None) → PwQPolynomial

namedisl.make_pw_qpolynomial(src: PwQPolynomial) → PwQPolynomial

Create a PwQPolynomial from isl syntax or an isl object.

Vector-valued quasi-affine expression

class namedisl.MultiAff(_obj: IslObjectT_co, space: Space, _isl_names_ok: bool = False)

__getitem__(name: str) → Aff

__neg__()

__add__(other: Self | int) → Self

__radd__(other: int) → Self

__sub__(other: Self | int) → Self

__rsub__(other: int) → Self

__mul__(other: Self | int) → Self

__rmul__(other: int) → Self

__truediv__(other: Val | int) → Self

__bool__()

is_zero() → bool

plain_is_zero() → bool

equals(other: object) → bool

space: Space

active_dim_types: ClassVar[frozenset[DimType]] = frozenset({DimType.param, DimType.in_, DimType.out})

add_dims(dt: DimType, names_to_add: Collection[str], /) → Self

move_dims(names: Collection[str], dest_dt: DimType) → Self

rename_dims(renaming: Iterable[tuple[str, str]]) → Self

as_isl() → IslObjectT_co

involves_dims(names: Collection[str]) → bool

True if self involves any of the given dimensions.

__hash__() → int

Return hash(self).

__eq__(other: object) → bool

This is intended to be cheap and strict, suitable mainly for hashing. Some subclasses (e.g. namedisl.Set) may provide a different, ‘mathematically exact’ notion of equality as a different method that is more expensive to check for.

__str__() → str

Return str(self).

__repr__() → str

Return repr(self).

namedisl.make_multi_aff(src: str, ctx: Context | None = None) → MultiAff

namedisl.make_multi_aff(src: MultiAff) → MultiAff

Create a MultiAff from isl syntax or an islpy.MultiAff.

Piecewise vector-valued quasi-affine expression

class namedisl.PwMultiAff(_obj: IslObjectT_co, space: Space, _isl_names_ok: bool = False)

__getitem__(name: str) → PwAff

as_multi_aff() → MultiAff

__neg__()

__add__(other: Self | int) → Self

__radd__(other: int) → Self

__sub__(other: Self | int) → Self

__rsub__(other: int) → Self

__mul__(other: Self | int) → Self

__rmul__(other: int) → Self

__truediv__(other: Val | int) → Self

__bool__()

is_zero() → bool

plain_is_zero() → bool

equals(other: object) → bool

space: Space

active_dim_types: ClassVar[frozenset[DimType]] = frozenset({DimType.param, DimType.in_, DimType.out})

add_dims(dt: DimType, names_to_add: Collection[str], /) → Self

move_dims(names: Collection[str], dest_dt: DimType) → Self

rename_dims(renaming: Iterable[tuple[str, str]]) → Self

as_isl() → IslObjectT_co

involves_dims(names: Collection[str]) → bool

True if self involves any of the given dimensions.

__hash__() → int

Return hash(self).

__eq__(other: object) → bool

This is intended to be cheap and strict, suitable mainly for hashing. Some subclasses (e.g. namedisl.Set) may provide a different, ‘mathematically exact’ notion of equality as a different method that is more expensive to check for.

__str__() → str

Return str(self).

__repr__() → str

Return repr(self).

namedisl.make_pw_multi_aff(src: str, ctx: Context | None = None) → PwMultiAff

namedisl.make_pw_multi_aff(src: PwMultiAff) → PwMultiAff