For each pair of basic sets in the set, check if the union of the two * can be represented by a single basic set. * If so, replace the pair by the s

Set ptr to a number in small representation. */

Is the space that of a parameter domain? */

Given a row number "row" and a column number "col", pivot the tableau * such that the associated variables are interchanged. * The given row in the

Free "access" and return NULL. */

Allocate an isl_val object with indeterminate value. */

Return the opposite of "v". */

* Return true if \p e is identical to this expression. */

Get the number of an in isl_int in big representation. Result is undefined if * val is not stored in that format. */

Does "v" represent +infinity? */

Print the list of parameters in "space", followed by an arrow, to "p", * if there are any parameters. */

Compute the gist of "multi" with respect to the domain constraints * of "context". */

Given a map A -> B, return the set (A -> B). */

Return an isl_val that is equal to "val" and that has only * a single reference. */

Does "v" represent -infinity? */

Is there any (half of an) equality constraint in the description * of the basic map represented by "info" that * has position "status" with respect

Check that there are "n" dimensions of type "type" starting at "first" * in "bmap". */

Given matrix M, compute * * M U = H * M = H Q * * with U and Q unimodular matrices and H a matrix in column echelon form * such that on each

Calculate the product of two matrices. * * This function is optimized for operand matrices that contain many zeros and * skips multiplications wher

Return an isl_schedule_band that is equal to "band" and that has only * a single reference. */

Compute the intersection of the two union_sets. * As a special case, if exactly one of the two union_sets * is a parameter domain, then intersect th

* Transform the loop level into its corresponding dynamic schedule * dimension. * * In the example below, the dynamic dimension that corresponds *

Return a newly allocated isl_map with given space and flags and * room for "n" basic maps. * Make sure that all cached information is cleared. */

Read a character from the stream, skipping pairs of '\\' and '\n'. * Set s->start_line and s->start_col to the line and column * of the returned cha

Is there any inequality constraint in the description * of the basic map represented by "info" that * has position "status" with respect to the othe

Does "bmap" have an explicit representation for all local variables? */

Turn the n dimensions of type type, starting at first * into existentially quantified variables. */

Compute the transitive closure of "map", or an overapproximation. * If the result is exact, then *exact is set to 1. * Simply use map_power to comp

Given a set (A -> B), return the map A -> B. * Error out if "set" is not of the form (A -> B). */

Return whether the argument is stored in small representation. */

then include mpi.h