branches.\r
</p>\r
</dd>\r
+<dt>\r
+subtree\r
+</dt>\r
+<dd>\r
+<p>\r
+ This is a modified recursive strategy. When merging trees A and\r
+ B, if B corresponds to a subtree of A, B is first adjusted to\r
+ match the tree structure of A, instead of reading the trees at\r
+ the same level. This adjustment is also done to the common\r
+ ancestor tree.\r
+</p>\r
+</dd>\r
</dl>\r
<p>If you tried a merge which resulted in a complex conflicts and\r
would want to start over, you can recover with\r
</div>\r
<div id="footer">\r
<div id="footer-text">\r
-Last updated 04-Mar-2008 12:05:57 UTC\r
+Last updated 19-Mar-2008 09:24:07 UTC\r
</div>\r
</div>\r
</body>\r
branches.\r
</p>\r
</dd>\r
+<dt>\r
+subtree\r
+</dt>\r
+<dd>\r
+<p>\r
+ This is a modified recursive strategy. When merging trees A and\r
+ B, if B corresponds to a subtree of A, B is first adjusted to\r
+ match the tree structure of A, instead of reading the trees at\r
+ the same level. This adjustment is also done to the common\r
+ ancestor tree.\r
+</p>\r
+</dd>\r
</dl>\r
</div>\r
<h2>DEFAULT BEHAVIOUR</h2>\r
</div>\r
<div id="footer">\r
<div id="footer-text">\r
-Last updated 11-Mar-2008 22:49:45 UTC\r
+Last updated 19-Mar-2008 09:24:07 UTC\r
</div>\r
</div>\r
</body>\r
branches.\r
</p>\r
</dd>\r
+<dt>\r
+subtree\r
+</dt>\r
+<dd>\r
+<p>\r
+ This is a modified recursive strategy. When merging trees A and\r
+ B, if B corresponds to a subtree of A, B is first adjusted to\r
+ match the tree structure of A, instead of reading the trees at\r
+ the same level. This adjustment is also done to the common\r
+ ancestor tree.\r
+</p>\r
+</dd>\r
</dl>\r
</div>\r
<h2>NOTES</h2>\r
</div>\r
<div id="footer">\r
<div id="footer-text">\r
-Last updated 11-Mar-2008 22:49:45 UTC\r
+Last updated 19-Mar-2008 09:24:07 UTC\r
</div>\r
</div>\r
</body>\r
merge is always the current branch head. It is meant to
be used to supersede old development history of side
branches.
+
+subtree::
+ This is a modified recursive strategy. When merging trees A and
+ B, if B corresponds to a subtree of A, B is first adjusted to
+ match the tree structure of A, instead of reading the trees at
+ the same level. This adjustment is also done to the common
+ ancestor tree.