internal ReverseCandidate(ReverseWalk.ReverseCommit commit, PathFilter path) : base
(commit, path)
{
}
internal void AddChild(ReverseWalk.ReverseCommit c)
{
// Always put the most recent child onto the front of the list.
// This works correctly because our ReverseWalk parent (above)
// runs in COMMIT_TIME_DESC order. Older commits will be popped
// later and should go in front of the children list so they are
// visited first by BlameGenerator when considering candidates.
int cnt = children.Length;
if (cnt == 0)
{
children = new ReverseWalk.ReverseCommit[] { c };
}
else
{
if (cnt == 1)
{
children = new ReverseWalk.ReverseCommit[] { c, children[0] };
}
else
{
ReverseWalk.ReverseCommit[] n = new ReverseWalk.ReverseCommit[1 + cnt];
n[0] = c;
System.Array.Copy(children, 0, n, 1, cnt);
children = n;
}
}
}
