Alice wants to start from the most recent revision, 22, to implement the new sorting algorithm. To do that, she creates a branch in her own archive alice@bar.org. She will create a branch called sort.bob.quick to denote that she is working on a quicksort implementation. To create the branch, she starts by typing
As Alice and Bob continue improving their respective branches, they can continue to merge with each other with merge.
The algorithm that ArX uses to classify a path is:
Type Stored in Archive? Created by tree-lint warning? Copied over? source Yes User No Yes control Yes ArX No Yes ignored No User No Yes unrecognized No User/ArX Yes Yes
This document was translated from LATEX by HEVEA.