| hg-reviewers |
Follow good-practice for defining the stack revset.
| Lint Skipped |
| Unit Tests Skipped |
| Path | Packages | |||
|---|---|---|---|---|
| M | mercurial/revset.py (16 lines) |
| Status | Author | Revision | |
|---|---|---|---|
| Closed | lothiraldan | ||
| Closed | lothiraldan | ||
| Abandoned | lothiraldan | ||
| Abandoned | lothiraldan | ||
| Abandoned | lothiraldan | ||
| Abandoned | lothiraldan | ||
| Closed | lothiraldan | ||
| Closed | lothiraldan | ||
| Closed | lothiraldan | ||
| Closed | lothiraldan | ||
| Closed | lothiraldan |
| pathutil, | pathutil, | ||||
| phases, | phases, | ||||
| pycompat, | pycompat, | ||||
| registrar, | registrar, | ||||
| repoview, | repoview, | ||||
| revsetlang, | revsetlang, | ||||
| scmutil, | scmutil, | ||||
| smartset, | smartset, | ||||
| stack, | stack as stackmod, | ||||
| util, | util, | ||||
| ) | ) | ||||
| from .utils import ( | from .utils import ( | ||||
| dateutil, | dateutil, | ||||
| stringutil, | stringutil, | ||||
| ) | ) | ||||
| # helpers for processing parsed tree | # helpers for processing parsed tree | ||||
| def secret(repo, subset, x): | def secret(repo, subset, x): | ||||
| """Changeset in secret phase.""" | """Changeset in secret phase.""" | ||||
| # i18n: "secret" is a keyword | # i18n: "secret" is a keyword | ||||
| getargs(x, 0, 0, _("secret takes no arguments")) | getargs(x, 0, 0, _("secret takes no arguments")) | ||||
| target = phases.secret | target = phases.secret | ||||
| return _phase(repo, subset, target) | return _phase(repo, subset, target) | ||||
| @predicate('stack([revs])', safe=True) | @predicate('stack([revs])', safe=True) | ||||
| def _stack(repo, subset, x): | def stack(repo, subset, x): | ||||
| # experimental revset for the stack of changesets or working directory | """Experimental revset for the stack of changesets or working directory | ||||
| # parent | parent. (EXPERIMENTAL) | ||||
| """ | |||||
| if x is None: | if x is None: | ||||
| stacks = stack.getstack(repo, x) | stacks = stackmod.getstack(repo, x) | ||||
| else: | else: | ||||
| stacks = smartset.baseset([]) | stacks = smartset.baseset([]) | ||||
| for revision in getset(repo, fullreposet(repo), x): | for revision in getset(repo, fullreposet(repo), x): | ||||
| currentstack = stack.getstack(repo, revision) | currentstack = stackmod.getstack(repo, revision) | ||||
| stacks = stacks + currentstack | stacks = stacks + currentstack | ||||
| # Force to use the order of the stacks instead of the subset one | return subset & stacks | ||||
| return stacks & subset | |||||
| def parentspec(repo, subset, x, n, order): | def parentspec(repo, subset, x, n, order): | ||||
| """``set^0`` | """``set^0`` | ||||
| The set. | The set. | ||||
| ``set^1`` (or ``set^``), ``set^2`` | ``set^1`` (or ``set^``), ``set^2`` | ||||
| First or second parent, respectively, of all changesets in set. | First or second parent, respectively, of all changesets in set. | ||||
| """ | """ | ||||
| try: | try: | ||||