isl_tab_detect_implicit_equalities: also detect manifest equalities

It's not clear why manifestly zero rows were ignored before.

isl_tab: optionally only mark strictly redundant rows

generalize isl_pw_qpolynomial_bound to isl_pw_qpolynomial_fold_bound

extract out generic part of isl_pw_qpolynomial_bound_range

isl_pw_qpolynomial_bound_range: also set exactness in special cases

add isl_basic_set_factorizer

export isl_pw_qpolynomial_fold_drop_dims

export isl_qpolynomial_is_zero

add isl_qpolynomial_coeff

add isl_qpolynomial_from_affine

export isl_qpolynomial_add_dims

add isl_qpolynomial_homogenize

add isl_qpolynomial_degree

add isl_qpolynomial_insert_dims

add isl_qpolynomial_dim

isl_ctx: add two

isl_tab_detect_implicit_equalities: return integer instead of struct isl_tab *

add isl_tab_sign_of_max

Make sure it's not called on zero or redundant constraints, though.
A zero constraint, in particular a dead column, could mistakenly be
considered to be manifestly unbounded.  Redundant constraints could
end up getting pivoted, which would destroy the invariant.
The internal code would never call sign_of_max on such constraints,
but external users may not be aware of this restriction.

isl_tab_select_facet: return int instead of isl_tab *

add isl_basic_set_full_compression

privately export isl_pw_qpolynomial_morph

add isl_qpolynomial_fold_foreach_qpolynomial

add isl_pw_qpolynomial_fold_foreach_lifted_piece

export isl_pw_qpolynomial_fold_is_zero

privately export isl_morph_alloc and isl_morph_identity

add isl_qpolynomial_fold_get_type

export isl_pw_qpolynomial_get_ctx

add isl_ctx_peek_options

isl_range.c: fix typo in comment

export isl_set_is_bounded

isl_bound: plug memory leak

fix isl_qpolynomial_fold_dup

isl_pw_qpolynomial_bound_range: fix removal of dims after compression

add bound_test.sh to distribution

doc: document gist operations

doc: document isl_constraint_is_equality

add isl_map_is_single_valued

isl_basic_map_foreach_constraint: make sure input has been finalized

Each constraint gets a copy of the input and a line from the constraint
matrix of the input.  If the input wouldn't be finalized, then the copy
would create a duplicate and then the line wouldn't match the basic map.
This is problematic for especially isl_constraint_is_equality.

isl_basic_map_copy: mark duplicated copy as finalized

If an unfinalized copy is needed, the caller will perform an
isl_basic_map_cow on the copy.

isl_basic_set_lift: finalize result

isl_basic_map_move_dims: always finalize result

isl_basic_map_from_constraint: finalize result

isl_access_info_compute_flow: handle may accesses

isl_access_info_compute_flow: handle multi-valued sink access relations

In particular, if any given sink iteration accesses more than one
data element, then we compute dependences for each of these data elements.
Before, we would only compute a dependence for the data elements
that was accessed last before the sink.

remove some unused variables

fix some icc warnings

rename isl_pw_qpolynomial_move and add isl_pw_qpolynomial_fold_move_dims

isl_ctx: keep track of user options

improved argument parsing

isl_options_parse: print help message

add isl_bound test application

add isl_pw_qpolynomial_bound_range

add isl_pw_qpolynomial_fold_morph

add rudimentary isl_morph

add isl_seq_set

isl_equalities.c: fix typo in comment

add isl_mat_insert_rows

add isl_mat_normalize

add isl_mat_diagonal

isl_mat_lin_to_aff: fix error handling

isl_qpolynomial_opt_on_domain: handle empty input

isl_name_alloc: fix error handling

add isl_dim_offset

isl_equalities.c: fix typos in comments

add isl_pw_qpolynomial_fold_covers

add isl_qpolynomial_le_cst

privately export isl_set_is_bounded

add isl_set_count_upto

add isl_set_scan

add isl_stream_read_pw_qpolynomial

add isl_qpolynomial_from_term

add isl_qpolynomial_from_constraint

add isl_basic_set_foreach_bound_pair

add isl_qpolynomial_as_polynomial_on_domain

add isl_qpolynomial_substitute

add isl_basic_set_dims_get_sign

isl_ctx: add zero

add isl_qpolynomial_neginfty

add isl_basic_set_drop

isl_qpolynomial_fold_opt_on_domain: fix typo

isl_pw_*_eval: fix handling of empty input

add isl_basic_set_move_dims

export isl_qpolynomial_sub

add isl_qpolynomial_get_dim

isl_map_transitive_closure: coalesce input before checking closedness of input

add map_lex_*_first

isl_map_lex_le: use one basic set less in result

isl_stream: accept lexicographic operators

isl_map_transitive_closure: check if input is closed already

add isl_printer_flush

isl_map_read: parse parametric Omega input

isl_map_read: fix typo

isl_convex_hull.c: is_bound: any inequality is a bound on an empty set

isl_convex_hull.c: add_bounds: propagate errors from add_bound

document isl_map_reverse

isl_stream_next_token: terminate string tokens

isl_map_transitive_closure: treat equality as pair of ineq for mixed constraints

isl_map_transitive_closure, omega-like: only use ?-closure if result is exact

isl_map_transitive_closure: use simple hull in omega-like implementation

isl_map_transitive_closure: try and compute closure incrementally