/barrelfish-master/usr/eclipseclp/icparc_solvers/rxspencer/ |
H A D | regexec.c | 21 /* macros for manipulating states, small version */ 22 #define states unsigned macro 49 #undef states macro 69 /* macros for manipulating states, large version */ 70 #define states char * macro
|
H A D | engine.c | 42 states st; /* current states */ 43 states fresh; /* states for a fresh start */ 44 states tmp; /* temporary */ 45 states empty; /* empty set of states */ 632 register states st = m->st; 633 register states fresh = m->fresh; 634 register states tm [all...] |
/barrelfish-master/lib/libc/regex/ |
H A D | regexec.c | 97 /* macros for manipulating states, small version */ 98 #define states long macro 99 #define states1 states /* for later use in regexec() decision */ 128 #undef states macro 150 /* macros for manipulating states, large version */ 151 #define states char * macro 181 /* multibyte character & large states version */
|
H A D | engine.c | 91 states st; /* current states */ 92 states fresh; /* states for a fresh start */ 93 states tmp; /* temporary */ 94 states empty; /* empty set of states */ 109 static states step(struct re_guts *g, sopno start, sopno stop, states bef, wint_t ch, states af [all...] |
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/net/mlx4/ |
H A D | qp.c | 585 enum mlx4_qp_state states[] = { MLX4_QP_STATE_RST, MLX4_QP_STATE_INIT, local 588 for (i = 0; i < ARRAY_SIZE(states) - 1; i++) { 590 context->flags |= cpu_to_be32(states[i + 1] << 28); 591 err = mlx4_qp_modify(dev, mtt, states[i], states[i + 1], context, 0, 0, 595 "%d with error: %d\n", states[i + 1], err); 599 *qp_state = states[i + 1];
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | umsparallel.tex | 194 Workers in a parallel {\eclipse} session can be in one of two states: 303 %\item Execution saved states: This feature will not be supported for the 304 %\index{saved states} 306 %resources will be available on restarting the system. Program saved states, 319 %\item Execution saved states
|
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/ |
H A D | debugger.tex | 38 states, ie states where a prolog goal can be inserted. To get a more 42 have call states (except at the choicepoints on inline disjunctions).
|
/barrelfish-master/usr/eclipseclp/documents/megalog/ |
H A D | backwards-sec.tex | 86 However, there is the capability to generate and load saved states.
|
H A D | multiuser-sec.tex | 297 During a transaction a permanent relation has two states.
|
/barrelfish-master/usr/eclipseclp/documents/libman/ |
H A D | eplexdiff.tex | 114 applies to {\it all} the eplex instances/solver states. If set_var_bounds/3
|
H A D | extfd.tex | 617 states that at least {\it Min} and at most {\it Max} out of them 1903 {\bf contained_in(Color, Component, In)} states that 1927 {\bf not_contained_in(Color, Component, In)} states that if the bin is of the given 2038 {\bf at_most(N, In, Colour, Components)} states that if Colour
|
H A D | extconjunto.tex | 134 relation between {\em states}. The transformation performs interval 481 labeled. This constraint states that two sets have at most one element
|
H A D | eplex.tex | 1045 \item row-wise solution states like dual and slack values include only the 1067 This library allows multiple solver states to be maintained in the same 1070 solver states may share variables in the constraints or objective
|
H A D | obsman.tex | 722 states that at least {\it Min} and at most {\it Max} out of them 2009 {\bf contained_in(Color, Component, In)} states that 2033 {\bf not_contained_in(Color, Component, In)} states that if the bin is of the given 2144 {\bf at_most(N, In, Colour, Components)} states that if Colour
|
H A D | repair.tex | 197 constraint is considered to be violated depends on the states of
|
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | modelling.tex | 46 and states that we intend to solve a problem by
|
H A D | icintro.tex | 752 that states in a list of integers that the element at 1002 The capacity constraint states the following:
|
H A D | prolog.tex | 537 ancestor rule above states that if X is a parent of Y, then this 539 another way X can be an ancestor of Y states that if some other
|
H A D | constimpl.tex | 341 and the goal p, the resolvent goes through the following states
|
H A D | fdintro.tex | 510 The capacity constraint states:
|
/barrelfish-master/usr/eclipseclp/icparc_solvers/ |
H A D | repair.pl | 629 % when using the tentative values of its variables. It can be in three states: 635 % A constraint can make many transitions between these states:
|
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | toplevel.pl | 84 % The Eclipse engine can be thought of as being in one of 3 states
|
H A D | fd.pl | 806 desc:html(" This constraint states that both constraint expressions C1 and C2 must 941 desc:html(" This constraints states that the two linear terms are not equal. It is 1000 desc:html(" This constraints states that the two linear terms are not equal. It is 1539 the constraint states that its Index'th element is equal to Value, i.e. 1578 desc:html(" This constraints states that the two linear terms are equal. It is 1644 desc:html(" This constraint states that the constraint expressions C1 and C2 1725 desc:html(" This constraint states that the linear term X is greater than the linear 1791 desc:html(" This constraint states that the linear term X is greater than or equal 1857 desc:html(" This constraint states that the constraint expression C1 implies the 1997 desc:html(" This is an evaluation constraint. It states tha [all...] |
H A D | elipsys.pl | 625 Sepia : use either saved states or Prolog term files
|
H A D | megalog.pl | 462 Sepia : use either saved states or Prolog term files
|