Safe Haskell	Safe-Inferred
Language	Haskell2010

Darcs.Patch.Permutations

Synopsis

removeFL :: (Eq2 p, Commute p) => p wX wY -> FL p wX wZ -> Maybe (FL p wY wZ)
removeRL :: (Eq2 p, Commute p) => p wY wZ -> RL p wX wZ -> Maybe (RL p wX wY)
removeCommon :: (Eq2 p, Commute p) => (FL p :\/: FL p) wX wY -> (FL p :\/: FL p) wX wY
commuteWhatWeCanFL :: Commute p => (p :> FL p) wX wY -> (FL p :> (p :> FL p)) wX wY
commuteWhatWeCanRL :: Commute p => (RL p :> p) wX wY -> (RL p :> (p :> RL p)) wX wY
genCommuteWhatWeCanRL :: Commute p => CommuteFn p q -> (RL p :> q) wX wY -> (RL p :> (q :> RL p)) wX wY
genCommuteWhatWeCanFL :: Commute q => CommuteFn p q -> (p :> FL q) wX wY -> (FL q :> (p :> FL q)) wX wY
partitionFL :: Commute p => (forall wU wV. p wU wV -> Bool) -> FL p wX wY -> (FL p :> (FL p :> FL p)) wX wY
partitionRL :: forall p wX wY. Commute p => (forall wU wV. p wU wV -> Bool) -> RL p wX wY -> (RL p :> RL p) wX wY
partitionFL' :: Commute p => (forall wU wV. p wU wV -> Bool) -> RL p wA wB -> RL p wB wC -> FL p wC wD -> (FL p :> (RL p :> RL p)) wA wD
partitionRL' :: forall p wX wY. Commute p => (forall wU wV. p wU wV -> Bool) -> RL p wX wY -> (FL p :> (FL p :> RL p)) wX wY
simpleHeadPermutationsFL :: Commute p => FL p wX wY -> [FL p wX wY]
headPermutationsRL :: Commute p => RL p wX wY -> [RL p wX wY]
headPermutationsFL :: Commute p => FL p wX wY -> [(p :> FL p) wX wY]
permutationsRL :: Commute p => RL p wX wY -> [RL p wX wY]
removeSubsequenceFL :: (Eq2 p, Commute p) => FL p wA wB -> FL p wA wC -> Maybe (FL p wB wC)
removeSubsequenceRL :: (Eq2 p, Commute p) => RL p wAb wAbc -> RL p wA wAbc -> Maybe (RL p wA wAb)
partitionConflictingFL :: forall p wX wY wZ. (Commute p, CleanMerge p) => FL p wX wY -> FL p wX wZ -> (FL p :> FL p) wX wY
(=\~/=) :: forall p wA wB wC. (Commute p, Eq2 p) => FL p wA wB -> FL p wA wC -> EqCheck wB wC
(=/~\=) :: forall p wA wB wC. (Commute p, Eq2 p) => RL p wA wC -> RL p wB wC -> EqCheck wA wB
nubFL :: (Commute p, Eq2 p) => [Sealed (FL p wX)] -> [Sealed (FL p wX)]

Documentation

removeFL :: (Eq2 p, Commute p) => p wX wY -> FL p wX wZ -> Maybe (FL p wY wZ) Source #

removeFL x xs removes x from xs if x can be commuted to its head. Otherwise it returns Nothing

removeRL :: (Eq2 p, Commute p) => p wY wZ -> RL p wX wZ -> Maybe (RL p wX wY) Source #

removeRL is like removeFL except with RL

removeCommon :: (Eq2 p, Commute p) => (FL p :\/: FL p) wX wY -> (FL p :\/: FL p) wX wY Source #

commuteWhatWeCanFL :: Commute p => (p :> FL p) wX wY -> (FL p :> (p :> FL p)) wX wY Source #

commuteWhatWeCanRL :: Commute p => (RL p :> p) wX wY -> (RL p :> (p :> RL p)) wX wY Source #

genCommuteWhatWeCanRL :: Commute p => CommuteFn p q -> (RL p :> q) wX wY -> (RL p :> (q :> RL p)) wX wY Source #

genCommuteWhatWeCanFL :: Commute q => CommuteFn p q -> (p :> FL q) wX wY -> (FL q :> (p :> FL q)) wX wY Source #

partitionFL Source #

Arguments

:: Commute p
=> (forall wU wV. p wU wV -> Bool)	predicate; if true we would like the patch in the "left" list
-> FL p wX wY	input `FL`
-> (FL p :> (FL p :> FL p)) wX wY	"left", "middle" and "right"

Split an FL according to a predicate, using commutation as necessary, into those that satisfy the predicate and can be commuted to the left, and those that do not satisfy it and can be commuted to the right. Whatever remains stays in the middle.

Note that the predicate p should be invariant under commutation: if commute(x:>y)==Just(y':>x') then p x == p x' && p y == p y'.

partitionRL Source #

Arguments

:: forall p wX wY. Commute p
=> (forall wU wV. p wU wV -> Bool)	predicate; if true we would like the patch in the "right" list
-> RL p wX wY	input `RL`
-> (RL p :> RL p) wX wY	"left" and "right" results

Split an RL according to a predicate, using commutation as necessary, into those that satisfy the predicate and can be commuted to the right, and those that don't, i.e. either do not satisfy the predicate or cannot be commuted to the right.

Note that the predicate p should be invariant under commutation: if commute(x:>y)==Just(y':>x') then p x == p x' && p y == p y'.

partitionFL' :: Commute p => (forall wU wV. p wU wV -> Bool) -> RL p wA wB -> RL p wB wC -> FL p wC wD -> (FL p :> (RL p :> RL p)) wA wD Source #

partitionRL' :: forall p wX wY. Commute p => (forall wU wV. p wU wV -> Bool) -> RL p wX wY -> (FL p :> (FL p :> RL p)) wX wY Source #

Split an RL according to a predicate, using commutation as necessary, into those that satisfy the predicate and can be commuted to the right, and those that do not satisfy it and can be commuted to the left. Whatever remains stays in the middle.

Note that the predicate p should be invariant under commutation: if commute(x:>y)==Just(y':>x') then p x == p x' && p y == p y'.

simpleHeadPermutationsFL :: Commute p => FL p wX wY -> [FL p wX wY] Source #

This is a minor variant of headPermutationsFL with each permutation is simply returned as a FL

headPermutationsRL :: Commute p => RL p wX wY -> [RL p wX wY] Source #

headPermutationsRL is like headPermutationsFL, except that we operate on an RL (in other words, we are pushing things to the end of a patch sequence instead of to the beginning).

headPermutationsFL :: Commute p => FL p wX wY -> [(p :> FL p) wX wY] Source #

headPermutationsFL p:>:ps returns all the permutations of the list in which one element of ps is commuted past p

Suppose we have a sequence of patches

 X h a y s-t-c k

Suppose furthermore that the patch c depends on t, which in turn depends on s. This function will return

X :> h a y s t c k
h :> X a y s t c k
a :> X h y s t c k
y :> X h a s t c k
s :> X h a y t c k
k :> X h a y s t c

permutationsRL :: Commute p => RL p wX wY -> [RL p wX wY] Source #

All permutations of an RL.

removeSubsequenceFL :: (Eq2 p, Commute p) => FL p wA wB -> FL p wA wC -> Maybe (FL p wB wC) Source #

removeSubsequenceFL ab abc returns Just c' where all the patches in ab have been commuted out of it, if possible. If this is not possible for any reason (the set of patches ab is not actually a subset of abc, or they can't be commuted out) we return Nothing.

removeSubsequenceRL :: (Eq2 p, Commute p) => RL p wAb wAbc -> RL p wA wAbc -> Maybe (RL p wA wAb) Source #

removeSubsequenceRL is like removeSubsequenceFL except that it works on RL

partitionConflictingFL :: forall p wX wY wZ. (Commute p, CleanMerge p) => FL p wX wY -> FL p wX wZ -> (FL p :> FL p) wX wY Source #

Partition a list into the patches that merge cleanly with the given patch and those that don't (including dependencies)

(=\~/=) :: forall p wA wB wC. (Commute p, Eq2 p) => FL p wA wB -> FL p wA wC -> EqCheck wB wC Source #

This commutes patches in the RHS to bring them into the same order as the LHS.

(=/~\=) :: forall p wA wB wC. (Commute p, Eq2 p) => RL p wA wC -> RL p wB wC -> EqCheck wA wB Source #

This commutes patches in the RHS to bring them into the same order as the LHS.

nubFL :: (Commute p, Eq2 p) => [Sealed (FL p wX)] -> [Sealed (FL p wX)] Source #

A variant of nub that is based on '=~/= i.e. ignores (internal) ordering.