Searched refs:cuts (Results 1 - 3 of 3) sorted by relevance
| /haiku-buildtools/isl/ |
| H A D | isl_coalesce.c | 850 /* Set the is_redundant property of the "n" constraints in "cuts",
864 int *cuts, int n, int k, int v)
871 tab->con[n_eq + cuts[l]].is_redundant = v;
900 int *cuts, int n, struct isl_tab **tabs,
934 if (isl_tab_select_facet(tabs[i], map->p[i]->n_eq + cuts[k]) < 0)
938 set_is_redundant(tabs[i], map->p[i]->n_eq, cuts, n, k, 1);
940 isl_seq_neg(bound->el, map->p[i]->ineq[cuts[k]], 1 + total);
945 set_is_redundant(tabs[i], map->p[i]->n_eq, cuts, n, k, 0);
954 isl_seq_cpy(bound->el, map->p[i]->ineq[cuts[k]], 1 + total);
1053 int *cuts local
863 set_is_redundant(struct isl_tab *tab, unsigned n_eq, int *cuts, int n, int k, int v) argument
899 wrap_in_facets(struct isl_map *map, int i, int j, int *cuts, int n, struct isl_tab **tabs, int *eq_i, int *ineq_i, int *eq_j, int *ineq_j) argument
[all...] |
| /haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
| H A D | bounds.go | 204 // Right shift cuts the effective number of bits in the index,
238 // Division cuts the range like right shift does.
|
| /haiku-buildtools/isl/doc/ |
| H A D | implementation.tex | 176 method combined with Gomory cuts and describe some extensions
308 during the construction of Gomory cuts.
369 of the actual dual simplex method with Gomory cuts.
373 Experience with the original {\tt PipLib} has shown that Gomory cuts
551 cuts algorithm to determine the feasibility of a context.
615 keep the Gomory cuts, but the current implementation backtracks
616 to before the point where Gomory cuts are added before adding
618 Keeping the Gomory cuts has the advantage that the sample value
623 the previously added cuts may be redundant, possibly resulting
624 in an accumulation of a large number of cuts
[all...] |
Completed in 87 milliseconds