Repetitive merges in GIT. How does it calculate differences?
问题 I've been doing a research of trying to understand how does the GIT merge works. I know there are several merge types as recursive, octopus, etc. I figured out that the resolve / recursive is used the most commonly. And that recursive merge is only useful when there are several common ancestors / bases. However, I couldn't find which algorithm is used (or how the ancestor should be calculated) with repetitive merges to the master from the branch. A simple example. Let's create an empty