# Merge-base algorithm? 2 messages from 2009-07-30 to 2009-07-30. Participants: Josh ben Jore. Thread: https://gitlist.dev/t/20292 ## Josh ben Jore, 2009-07-30 04:16 Subject: Merge-base algorithm? Message-ID: URL: https://gitlist.dev/e/D5F958F92101F74D8A5683C2FE14F4200F231037%40post.corp.w3data.com ``` What is the merge-base algorithm for selecting nodes? How can I subsume nodes in the selected list? I want to change the result of my current merge-base command. Right now it includes nodes "A", "B", and "C" and I am experiencing a segmentation fault when merging "A" and "B." I want to add a commit to the tree which subsumes nodes "A" and "B" so that my merge-base is against "new node(A+B)" and "C" or something similar. I am attempting to work around the bug described in the thread "Null deref in recursive merge in df73af5f667a479764d2b2195cb0cb60b0b89e3d." Regards, Josh ``` ## Josh ben Jore, 2009-07-30 18:42 Subject: Re: Merge-base algorithm? Message-ID: URL: https://gitlist.dev/e/C697379B.61EB1%25jbenjore%40whitepages.com In-Reply-To: ``` On 7/29/09 9:16 PM, "Josh ben Jore" wrote: > What is the merge-base algorithm for selecting nodes? Oops, my /opt/git/bin/git merge-base --help on the approximately 1.6.4 was using the documentation from the other git in /usr/bin/git. While reading the source tree, I found Documentation/git-merge-base.txt which answered this question. The docs I'd read still said to read the source code. Josh ```