| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Darcs.Repository.Match
Synopsis
- getPristineUpToMatch :: (RepoPatch p, ApplyState p ~ Tree) => Repository rt p wU wR -> PatchSetMatch -> IO (Tree IO)
- getOnePatchset :: RepoPatch p => Repository rt p wU wR -> PatchSetMatch -> IO (SealedPatchSet p Origin)
Documentation
getPristineUpToMatch :: (RepoPatch p, ApplyState p ~ Tree) => Repository rt p wU wR -> PatchSetMatch -> IO (Tree IO) Source #
Return the pristine tree up to the given PatchSetMatch.
In the typical case where the match is closer to the end of the repo than
its beginning, this is (a lot) more efficient than applying the result of
getOnePatchset to an empty tree.
getOnePatchset :: RepoPatch p => Repository rt p wU wR -> PatchSetMatch -> IO (SealedPatchSet p Origin) Source #
Return the patches up to the given PatchSetMatch.