@@ -4990,7 +4990,6 @@ run_propagator(ptzdiv(X,Y,Z), MState) -->
|
||||
run_propagator(pmod(X,Y,Z), MState) -->
|
||||
( Y == 0 -> { false }
|
||||
; Y == Z -> { false }
|
||||
% ; nonvar(Y), Z == X -> true
|
||||
; X == Y -> kill(MState), queue_goal(Z = 0)
|
||||
; true
|
||||
),
|
||||
@@ -5020,8 +5019,6 @@ run_propagator(pmod(X,Y,Z), MState) -->
|
||||
% queue_goal(X #=< XMax)
|
||||
; true
|
||||
)
|
||||
% kill(MState),
|
||||
% queue_goal(X #= Z + Y * _) % Add a variable to be efficient.
|
||||
; nonvar(Z), nonvar(X) ->
|
||||
( Z > 0 ->
|
||||
( X < 0 -> true
|
||||
@@ -5156,7 +5153,7 @@ run_propagator(pmodz(X,Y,Z), MState) -->
|
||||
domain_remove_smaller_than(ZD3, ZMin, ZD5) },
|
||||
fd_put(Z, ZD5, ZPs)
|
||||
% queue_goal(Z in ZMin..0)
|
||||
; { fd_get(Y, _, n(YL), n(YU), _) } ->
|
||||
; { fd_get(Y, _, n(YL), n(YU), _), YL < 0, YU > 0 } ->
|
||||
ZMin is YL + 1,
|
||||
ZMax is YU - 1,
|
||||
{ fd_get(Z, ZD1, ZPs),
|
||||
@@ -5181,21 +5178,23 @@ run_propagator(pmodz(X,Y,Z), MState) -->
|
||||
)
|
||||
).
|
||||
|
||||
run_propagator(pmody(X,Y,Z), MState) -->
|
||||
run_propagator(pmody(_X,Y,Z), _MState) -->
|
||||
( nonvar(Y) -> true % Nothing to do.
|
||||
% ; nonvar(X) -> true
|
||||
; nonvar(Z) ->
|
||||
( Z > 0 -> % queue_goal(Y #> Z)
|
||||
( Z > 0 ->
|
||||
{ fd_get(Y, YD, YPs),
|
||||
YMin is Z + 1,
|
||||
domain_remove_smaller_than(YD, YMin, YD1) },
|
||||
fd_put(Y, YD1, YPs)
|
||||
; Z < 0 -> % queue_goal(Y #< Z)
|
||||
% queue_goal(Y #> Z)
|
||||
; Z < 0 ->
|
||||
{ fd_get(Y, YD, YPs),
|
||||
YMax is Z - 1,
|
||||
domain_remove_greater_than(YD, YMax, YD1) },
|
||||
fd_put(Y, YD1, YPs)
|
||||
; Z =:= 0 -> kill(MState), queue_goal(X / Y #= _)
|
||||
% queue_goal(Y #< Z)
|
||||
; Z =:= 0 % Multiple solutions so do nothing special.
|
||||
)
|
||||
; ( { fd_get(Z, _, n(ZL), _, _), ZL > 0 } ->
|
||||
{ fd_get(Y, YD, YPs),
|
||||
|
||||
Reference in New Issue
Block a user