if (!leftQueue.isEmpty()) { GraphNode commit = leftQueue.poll(); if (processCommit(commit, leftQueue, leftSet, rightQueue, rightSet)) { potentialCommonAncestors.add(commit); if (processCommit(commit, rightQueue, rightSet, leftQueue, leftSet)) { potentialCommonAncestors.add(commit);
if (!leftQueue.isEmpty()) { GraphNode commit = leftQueue.poll(); if (processCommit(commit, leftQueue, leftSet, rightQueue, rightSet)) { potentialCommonAncestors.add(commit); if (processCommit(commit, rightQueue, rightSet, leftQueue, leftSet)) { potentialCommonAncestors.add(commit);