Given a map of the form [A -> B] -> C, return the map B -> C. */

Eliminate the specified n dimensions starting at first from the * constraints, without removing the dimensions from the space. * If the set is ratio

Create a relation with the given set as domain. * The range of the created relation is a zero-dimensional * flat anonymous space. */

Return the number of basic maps in the (current) representation of "map". */

We normalize in place, but if anything goes wrong we need * to return NULL, so we need to make sure we don't change the * meaning of any possible ot

Remove the constraints in "context" from "map". * If any of the disjuncts in the result turns out to be the universe, * then return this universe.

Compute the positive powers of "map", or an overapproximation. * The result maps the exponent to a nested copy of the corresponding power. * If the

Compute the preimage of the domain of "map" under the function * represented by "ma". * In other words, plug in "ma" in the domain of "map". * The

Compute the preimage of "map" under the function represented by "pma". * In other words, plug in "pma" in the domain or range of "map". * The result

Compute the preimage of the range of "map" under the function * represented by "ma". * In other words, plug in "ma" in the range of "map". * The re

Given a map (A -> B) -> (C -> D), return the corresponding map * (A -> C) -> (B -> D). */

Compute inv(left)*right */

Return the rank of "mat", or -1 in case of error. */

Compute the pullback of "ma1" by the function represented by "ma2". * In other words, plug in "ma2" in "ma1". */

Construct and return a multi piecewise affine expression * that is equal to the given multi affine expression. */

Finish a YAML sequence and pop it from the state stack. * * In flow style, print the closing bracket. * * In block style, check if we are still in

Start a YAML sequence and push a new state to reflect that we * are about to print the first element in a sequence. * * In flow style, print the op

Check whether pwaff is a piecewise constant. */

Return a set containing those elements in the domain * of pwaff where it is zero. */

Return the number of variables of the given type in the domain of "qp". */

Combine "fold1" and "fold2" into a single reduction, eliminating * those elements of one reduction that are already covered by the other * reduction

For each 0 <= i < "n", replace variable "first" + i of type "type" * in "qp" by subs[i]. */

Construct and return a polynomial that consists of the terms * in "poly" that have sign "sign". The integer divisions, if * any, are assumed to be

Return the schedule of the band in isolation. */

Is the given scheduling dimension coincident within the band and * with respect to the coincidence constraints? */

Return the number of scheduling dimensions in the band. */

Return the domain of "sc". */

Traverse the node of "sched" in depth first postorder, * allowing the user to modify the visited node. * The traversal continues from the node retur

Move the "node" pointer to the ancestor of the given generation * of the node it currently points to, where generation 0 is the node * itself and ge

Return a pointer to the root of a schedule tree with as single * node a domain node with the given domain. */

Return a copy to the child at position "pos" of "node". */

Return the schedule of the band tree root in isolation. */

Return the contraction of the expansion tree root. */

Create a new tree of the given type (isl_schedule_node_sequence or * isl_schedule_node_set) with the given children. */

Create a new filter schedule tree with the given filter and no children. */

Construct a tree with a sequence root node and as children * "tree1" and "tree2". * If the root of one (or both) of the input trees is itself a sequ

Return a list of basic sets, the union of which is equal to "set". */

Free the resources taken by an isl_int. */

Initialize an isl_int. The implicit value is 0 in small representation. */

Can we apply isl_space_curry to "space"? * That is, does it have a nested relation in its domain? */

Does the tuple have a name? */

Given a dimension specification "dim" of a set, create a dimension * specification for the lift of the set. In particular, the result * is of the f

Given a space of the form A -> [B -> C], return the space A -> B. */

Read an isl_schedule from "s". */

Read an isl_val from "s". * * The following token sequences are recognized * * "infty" -> infty * "-" "infty" -> -infty * "NaN" -> NaN * n "/

Add an equality that is known to be valid for the given tableau. * * This function assumes that at least one more row and at least * one more eleme

Add a constraint to the tableau and allocate a row for it. * Return the index into the constraint array "con". * * This function assumes that at le

Given a tableau representing a set, find and return * an integer point in the set, if there is any. * * We perform a depth first search * for an i

Return the type of "tok". */

Remove the elements of "uset" from the range of "umap". */

Are "uset1" and "uset2" disjoint? */

Compute the preimage of "uset" under the function represented by "upma". * In other words, plug in "upma" in the range of "uset". * The result conta

Is "v1" less than or equal to "v2"? */

Return a reference to an isl_val representing one. */