a "patch tree" instead of a patch queue?

[Martin Geisler]

Dan <dan at dandrake.org> writes:

> [...]
>
> A patch queue is a strictly linear thing:
>
>     tip ---> patch1 ---> patch2 ---> patch3 ...
>
> and I can choose where I want to be along that chain. What I want is a
> tree with depth 1:
>
>           |---> version 1
>           |
>    tip ---+---> version 2
>           |
>           |---> version 3
>           ...
>
> (You'll need a monospace font to fully appreciate the ASCII art).

Cool :-)

You might be able to use "guards" on your patches:

  http://hgbook.red-bean.com/hgbookch13.html#x17-30500013.2

That will let you divide your patches into disjoint subsets, each
labeled with a different guard. You can then switch from one version to
another by doing:

  hg qpop -a
  hg qselect version-2
  hg qpush -a

and work like usual with the queue.

-- 
Martin Geisler

VIFF (Virtual Ideal Functionality Framework) brings easy and efficient
SMPC (Secure Multi-Party Computation) to Python. See: http://viff.dk/.
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 188 bytes
Desc: not available
Url : http://selenic.com/pipermail/mercurial/attachments/20080528/3a69b6e0/attachment.pgp