Adam Megacz wrote:
is there ever a case where a patch cannot be
commuted past a pair of other patches,
but the combination of the pair
does commute? In other words, is there a case where
A B C <-/-> B' A' C <-/-> B' C' A''
(where one of the two <-/->'s fails) yet
A (B C) <--> (B C)' A'
(where <--> indicates a successful commute)
Let x, y, and z be changes such that x and y do
not commute, but x and z do commute. Let -y
be the inverse of y. Let
A = {x}
B = {y}
C = {-y, z}
Is this the case you are looking for?
Regards,
Yitz
_______________________________________________
darcs-users mailing list
[email protected]
http://lists.osuosl.org/mailman/listinfo/darcs-users
