Safe Haskell | None |
---|---|
Language | Haskell2010 |
- data (a1 :> a2) wX wY = forall wZ . (a1 wX wZ) :> (a2 wZ wY)
- data (a1 :< a2) wX wY = forall wZ . (a1 wZ wY) :< (a2 wX wZ)
- data FL a wX wZ where
- data RL a wX wZ where
- data (a1 :\/: a2) wX wY = forall wZ . (a1 wZ wX) :\/: (a2 wZ wY)
- data (a3 :/\: a4) wX wY = forall wZ . (a3 wX wZ) :/\: (a4 wY wZ)
- data (a1 :||: a2) wX wY = (a1 wX wY) :||: (a2 wX wY)
- data Fork common left right wA wX wY = forall wU . Fork (common wA wU) (left wU wX) (right wU wY)
- lengthFL :: FL a wX wZ -> Int
- mapFL :: (forall wW wZ. a wW wZ -> b) -> FL a wX wY -> [b]
- mapFL_FL :: (forall wW wY. a wW wY -> b wW wY) -> FL a wX wZ -> FL b wX wZ
- spanFL :: (forall wW wY. a wW wY -> Bool) -> FL a wX wZ -> (FL a :> FL a) wX wZ
- foldlFL :: (forall wW wY. a -> b wW wY -> a) -> a -> FL b wX wZ -> a
- allFL :: (forall wX wY. a wX wY -> Bool) -> FL a wW wZ -> Bool
- anyFL :: (forall wX wY. a wX wY -> Bool) -> FL a wW wZ -> Bool
- filterFL :: (forall wX wY. a wX wY -> Bool) -> FL a wW wZ -> [Sealed2 a]
- splitAtFL :: Int -> FL a wX wZ -> (FL a :> FL a) wX wZ
- splitAtRL :: Int -> RL a wX wZ -> (RL a :< RL a) wX wZ
- bunchFL :: Int -> FL a wX wY -> FL (FL a) wX wY
- foldlRL :: (forall wW wY. a -> b wW wY -> a) -> a -> RL b wX wZ -> a
- lengthRL :: RL a wX wZ -> Int
- isShorterThanRL :: RL a wX wY -> Int -> Bool
- mapRL :: (forall wW wZ. a wW wZ -> b) -> RL a wX wY -> [b]
- mapRL_RL :: (forall wW wY. a wW wY -> b wW wY) -> RL a wX wZ -> RL b wX wZ
- zipWithFL :: (forall wX wY. a -> p wX wY -> q wX wY) -> [a] -> FL p wW wZ -> FL q wW wZ
- filterOutFLFL :: (forall wX wY. p wX wY -> EqCheck wX wY) -> FL p wW wZ -> FL p wW wZ
- filterOutRLRL :: (forall wX wY. p wX wY -> EqCheck wX wY) -> RL p wW wZ -> RL p wW wZ
- filterRL :: (forall wX wY. p wX wY -> Bool) -> RL p wA wB -> [Sealed2 p]
- reverseFL :: FL a wX wZ -> RL a wX wZ
- reverseRL :: RL a wX wZ -> FL a wX wZ
- (+>+) :: FL a wX wY -> FL a wY wZ -> FL a wX wZ
- (+<+) :: RL a wY wZ -> RL a wX wY -> RL a wX wZ
- nullFL :: FL a wX wZ -> Bool
- concatFL :: FL (FL a) wX wZ -> FL a wX wZ
- concatRL :: RL (RL a) wX wZ -> RL a wX wZ
- consRLSealed :: a wY wZ -> FlippedSeal (RL a) wY -> FlippedSeal (RL a) wZ
- nullRL :: RL a wX wZ -> Bool
- toFL :: [FreeLeft a] -> Sealed (FL a wX)
- dropWhileFL :: (forall wX wY. a wX wY -> Bool) -> FL a wR wV -> FlippedSeal (FL a) wV
- dropWhileRL :: (forall wX wY. a wX wY -> Bool) -> RL a wR wV -> Sealed (RL a wR)
- spanFL_M :: forall a m wX wZ. Monad m => (forall wW wY. a wW wY -> m Bool) -> FL a wX wZ -> m ((FL a :> FL a) wX wZ)
- mapFL_FL_M :: Monad m => (forall wW wY. a wW wY -> m (b wW wY)) -> FL a wX wZ -> m (FL b wX wZ)
- eqFL :: MyEq a => FL a wX wY -> FL a wX wZ -> EqCheck wY wZ
- eqFLRev :: MyEq a => FL a wX wZ -> FL a wY wZ -> EqCheck wX wY
- eqFLUnsafe :: MyEq a => FL a wX wY -> FL a wZ wW -> Bool
Directed Types
Darcs patches have a notion of transforming between contexts. This naturally leads us to container types that are "directed" and transform from one context to another.
For example, the swap of names of files x and y could be represented with the following sequence of patches:
Move x z:>
Move y x:>
Move z y
or using forward lists, like
Move x z:>:
Move y x:>:
Move z y:>:
NilFl
data (a1 :> a2) wX wY infixr 1 Source
Directed Forward Pairs
forall wZ . (a1 wX wZ) :> (a2 wZ wY) infixr 1 |
data (a1 :< a2) wX wY infix 1 Source
Directed Reverse Pairs
forall wZ . (a1 wZ wY) :< (a2 wX wZ) infix 1 |
Forward lists
Show2 a => Show2 (FL a) | |
(MyEq p, Commute p) => MyEq (FL p) | |
PatchInspect p => PatchInspect (FL p) | |
PatchDebug p => PatchDebug (FL p) | |
(ReadPatch p, PatchListFormat p) => ReadPatch (FL p) | |
Invert p => Invert (FL p) | |
Commute p => Commute (FL p) | |
Merge p => Merge (FL p) | |
Apply p => Apply (FL p) | |
RepairToFL p => Repair (FL p) | |
Check p => Check (FL p) | |
(Apply p, IsHunk p, PatchListFormat p, ShowPatch p) => ShowPatch (FL p) | |
(PatchListFormat p, ShowPatchBasic p) => ShowPatchBasic (FL p) | |
(IsHunk p, PatchListFormat p, Patchy p) => Patchy (FL p) | |
FromPrim p => FromPrims (FL p) | |
FromPrim p => FromPrim (FL p) | |
PrimPatchBase p => PrimPatchBase (FL p) | |
Effect p => Effect (FL p) | |
CommuteNoConflicts p => CommuteNoConflicts (FL p) | |
(CommuteNoConflicts p, Conflict p) => Conflict (FL p) | |
Show2 a => Show1 (FL a wX) | |
Show2 a => Show (FL a wX wZ) | |
type ApplyState (FL p) = ApplyState p | |
type PrimOf (FL p) = PrimOf p |
Reverse lists
Show2 a => Show2 (RL a) | |
(MyEq p, Commute p) => MyEq (RL p) | |
PatchInspect p => PatchInspect (RL p) | |
PatchDebug p => PatchDebug (RL p) | |
(ReadPatch p, PatchListFormat p) => ReadPatch (RL p) | |
Invert p => Invert (RL p) | |
Commute p => Commute (RL p) | |
Merge p => Merge (RL p) | |
Apply p => Apply (RL p) | |
Check p => Check (RL p) | |
(Apply p, IsHunk p, PatchListFormat p, ShowPatch p) => ShowPatch (RL p) | |
(PatchListFormat p, ShowPatchBasic p) => ShowPatchBasic (RL p) | |
(IsHunk p, PatchListFormat p, Patchy p) => Patchy (RL p) | |
FromPrim p => FromPrims (RL p) | |
PrimPatchBase p => PrimPatchBase (RL p) | |
Effect p => Effect (RL p) | |
CommuteNoConflicts p => CommuteNoConflicts (RL p) | |
(CommuteNoConflicts p, Conflict p) => Conflict (RL p) | |
Show2 a => Show1 (RL a wX) | |
Show2 a => Show (RL a wX wZ) | |
type ApplyState (RL p) = ApplyState p | |
type PrimOf (RL p) = PrimOf p |
Merge Types
When we have two patches which commute and share the same pre-context we can
merge the patches. Whenever patches, or sequences of patches, share a
pre-context we say they are Forking Pairs (:\/:
). The same way, when
patches or sequences of patches, share a post-context we say they are
Joining Pairs (:/\:
).
The following diagram shows the symmetry of merge types:
wZ:/\:
a3 / \ a4 / \ wX wY \ / a1 \ / a2:\/:
wZ
data (a1 :\/: a2) wX wY infix 1 Source
Forking Pairs (Implicit starting context)
forall wZ . (a1 wZ wX) :\/: (a2 wZ wY) infix 1 |
data Fork common left right wA wX wY Source
Forking Pair (Explicit starting context)
wX wY \ / \ / \ / wU | | | wA
forall wU . Fork (common wA wU) (left wU wX) (right wU wY) |
Functions
isShorterThanRL :: RL a wX wY -> Int -> Bool Source
filterOutFLFL :: (forall wX wY. p wX wY -> EqCheck wX wY) -> FL p wW wZ -> FL p wW wZ Source
filterOutFLFL p xs
deletes any x
in xs
for which p x == IsEq
(indicating that x
has no effect as far as we are concerned, and can be
safely removed from the chain)
filterOutRLRL :: (forall wX wY. p wX wY -> EqCheck wX wY) -> RL p wW wZ -> RL p wW wZ Source
consRLSealed :: a wY wZ -> FlippedSeal (RL a) wY -> FlippedSeal (RL a) wZ Source
dropWhileFL :: (forall wX wY. a wX wY -> Bool) -> FL a wR wV -> FlippedSeal (FL a) wV Source
spanFL_M :: forall a m wX wZ. Monad m => (forall wW wY. a wW wY -> m Bool) -> FL a wX wZ -> m ((FL a :> FL a) wX wZ) Source
mapFL_FL_M :: Monad m => (forall wW wY. a wW wY -> m (b wW wY)) -> FL a wX wZ -> m (FL b wX wZ) Source