darcs-2.12.5: a distributed, interactive, smart revision control system

Safe Haskell | None
Language | Haskell2010

Darcs.Patch.V2.Non

Synopsis

- data Non p wX where
  - Non :: FL p wX wY -> PrimOf p wY wZ -> Non p wX
- class Nonable p where
- unNon :: FromPrim p => Non p wX -> Sealed (FL p wX)
- showNon :: (ShowPatchBasic p, PatchListFormat p, PrimPatchBase p) => Non p wX -> Doc
- showNons :: (ShowPatchBasic p, PatchListFormat p, PrimPatchBase p) => [Non p wX] -> Doc
- readNon :: (ReadPatch p, PatchListFormat p, PrimPatchBase p, ParserM m) => m (Non p wX)
- readNons :: (ReadPatch p, PatchListFormat p, PrimPatchBase p, ParserM m) => m [Non p wX]
- commutePrimsOrAddToCtx :: (WL l, Patchy p, ToFromPrim p) => l (PrimOf p) wX wY -> Non p wY -> Non p wX
- commuteOrAddToCtx :: (Patchy p, ToFromPrim p) => p wX wY -> Non p wY -> Non p wX
- commuteOrRemFromCtx :: (Patchy p, MyEq p, ToFromPrim p) => p wX wY -> Non p wX -> Maybe (Non p wY)
- commuteOrAddToCtxRL :: (Patchy p, ToFromPrim p) => RL p wX wY -> Non p wY -> Non p wX
- commuteOrRemFromCtxFL :: (Patchy p, MyEq p, ToFromPrim p) => FL p wX wY -> Non p wX -> Maybe (Non p wY)
- remNons :: (Nonable p, Effect p, Patchy p, MyEq p, ToFromPrim p, PrimPatchBase p, MyEq (PrimOf p)) => [Non p wX] -> Non p wX -> Non p wX
- (*>) :: (Patchy p, ToFromPrim p) => Non p wX -> p wX wY -> Maybe (Non p wY)
- (>*) :: (Patchy p, ToFromPrim p) => p wX wY -> Non p wY -> Maybe (Non p wX)
- (*>>) :: (WL l, Patchy p, ToFromPrim p, PrimPatchBase p) => Non p wX -> l (PrimOf p) wX wY -> Maybe (Non p wY)
- (>>*) :: (WL l, Patchy p, ToFromPrim p) => l (PrimOf p) wX wY -> Non p wY -> Maybe (Non p wX)

# Documentation

data Non p wX where #

A `Non` stores a context with a `Prim` patch. It is a patch whose effect isn't visible - a Non-affecting patch.

Constructors

Non :: FL p wX wY -> PrimOf p wY wZ -> Non p wX |

Instances

(Show2 p, Show2 (PrimOf p)) => Show1 (Non p) # |
Methods showDict1 :: ShowDict (Non p wX) #
(Commute p, MyEq p, MyEq (PrimOf p)) => Eq (Non p wX) # | Nons are equal if their context patches are equal, and they have an equal prim patch.
Methods (==) :: Non p wX -> Non p wX -> Bool # (/=) :: Non p wX -> Non p wX -> Bool #
(Show2 p, Show2 (PrimOf p)) => Show (Non p wX) # |
Methods showsPrec :: Int -> Non p wX -> ShowS # show :: Non p wX -> String # showList :: [Non p wX] -> ShowS #

class Nonable p where #

Nonable represents the class of patches that can be turned into a Non.

Minimal complete definition

non

Methods

non :: p wX wY -> Non p wX #

Instances

PrimPatch prim => Nonable (RepoPatchV2 prim) # |
Methods non :: RepoPatchV2 prim wX wY -> Non (RepoPatchV2 prim) wX #

unNon :: FromPrim p => Non p wX -> Sealed (FL p wX) #

unNon converts a Non into a FL of its context followed by the primitive patch.

showNon :: (ShowPatchBasic p, PatchListFormat p, PrimPatchBase p) => Non p wX -> Doc #

showNon creates a Doc representing a Non.

showNons :: (ShowPatchBasic p, PatchListFormat p, PrimPatchBase p) => [Non p wX] -> Doc #

showNons creates a Doc representing a list of Nons.

readNon :: (ReadPatch p, PatchListFormat p, PrimPatchBase p, ParserM m) => m (Non p wX) #

readNon is a parser that attempts to read a single Non.

readNons :: (ReadPatch p, PatchListFormat p, PrimPatchBase p, ParserM m) => m [Non p wX] #

readNons is a parser that attempts to read a list of Nons.

commutePrimsOrAddToCtx :: (WL l, Patchy p, ToFromPrim p) => l (PrimOf p) wX wY -> Non p wY -> Non p wX #

commutePrimsOrAddToCtx takes a WL of prims and attempts to commute them past a Non.

commuteOrAddToCtx :: (Patchy p, ToFromPrim p) => p wX wY -> Non p wY -> Non p wX #

`commuteOrAddToCtx` `x cy` tries to commute `x` past `cy` and always returns some variant `cy'`. If commutation suceeds, the variant is just straightforwardly the commuted version. If commutation fails, the variant consists of `x` prepended to the context of `cy`.

commuteOrRemFromCtx :: (Patchy p, MyEq p, ToFromPrim p) => p wX wY -> Non p wX -> Maybe (Non p wY) #

commuteOrRemFromCtx attempts to remove a given patch from a Non. If the patch was not in the Non, then the commute will succeed and the modified Non will be returned. If the commute fails then the patch is either in the Non context, or the Non patch itself; we attempt to remove the patch from the context and then return the non with the updated context.

TODO: understand if there is any case where p is equal to the prim patch of the Non, in which case, we return the original Non, is that right?

commuteOrAddToCtxRL :: (Patchy p, ToFromPrim p) => RL p wX wY -> Non p wY -> Non p wX #

`commuteOrAddToCtxRL` `xs cy` commutes as many patches of `xs` past `cy` as possible, adding any that don't commute to the context of cy. Suppose we have

    x1 x2 x3 [c1 c2 y]

and that in our example `x1` fails to commute past `c1`, this function would commute down to

    x1 [c1'' c2'' y''] x2' x3'

and return `[x1 c1'' c2'' y'']`

commuteOrRemFromCtxFL :: (Patchy p, MyEq p, ToFromPrim p) => FL p wX wY -> Non p wX -> Maybe (Non p wY) #

commuteOrRemFromCtxFL attempts to remove a FL of patches from a Non, returning Nothing if any of the individual removes fail.

remNons :: (Nonable p, Effect p, Patchy p, MyEq p, ToFromPrim p, PrimPatchBase p, MyEq (PrimOf p)) => [Non p wX] -> Non p wX -> Non p wX #

(*>) :: (Patchy p, ToFromPrim p) => Non p wX -> p wX wY -> Maybe (Non p wY) #

(*>) attemts to modify a Non by commuting it past a given patch.

(>*) :: (Patchy p, ToFromPrim p) => p wX wY -> Non p wY -> Maybe (Non p wX) #

(>*) attempts to modify a Non, by commuting a given patch past it.

(*>>) :: (WL l, Patchy p, ToFromPrim p, PrimPatchBase p) => Non p wX -> l (PrimOf p) wX wY -> Maybe (Non p wY) #

(*>>) attempts to modify a Non by commuting it past a given WL of patches.

(>>*) :: (WL l, Patchy p, ToFromPrim p) => l (PrimOf p) wX wY -> Non p wY -> Maybe (Non p wX) #

(>>*) attempts to modify a Non by commuting a given WL of patches past it.