Lines Matching refs:In
941 In the above example the constraints are simply built-in predicates.
1256 {\bf NOTE:} In the {\bf fd.pl} library the suspension lists
1263 In this way, user-defined constraints can rely on the fact that
1475 In this section we present some FD programs that show various
1569 In this case we use the available primitive in the fd library. Whenever
1712 In this way, no special constraints are needed and
1761 In this type of problems the goal is to pack a certain amount of
1908 In most programs, however, it is not necessary to
2009 {\bf contained_in(Color, Component, In)} states that
2010 if Color is different from In, there can be no such component
2014 contained_in(Col, Comp, In) :-
2017 (Col \== In ->
2022 contained_in(Col, Comp, In) :-
2026 Col = In
2028 suspend(contained_in(Col, Comp, In), 2, [Comp->min, Col->inst])
2033 {\bf not_contained_in(Color, Component, In)} states that if the bin is of the given
2037 not_contained_in(Col, Comp, In) :-
2040 (Col == In ->
2045 not_contained_in(Col, Comp, In) :-
2049 Col #\= In
2051 suspend(not_contained_in(Col, Comp, In), 2, [Comp->min, Col->any])
2144 {\bf at_most(N, In, Colour, Components)} states that if Colour
2145 is equal to In, then there can be at most N Components
2147 cannot be In.
2151 at_most(N, In, Col, Comp) :-
2152 Col #= In #=> Comp #<= N.
2159 at_most(N, In, Col, Comp) :-
2162 (In = Col ->
2167 at_most(N, In, Col, Comp) :-
2171 Col #\= In
2173 suspend(at_most(N, In, Col, Comp), 2, [In->inst, Comp->min])