How to use

carryOntoOne

method

in

org.eclipse.jgit.revwalk.MergeBaseGenerator

private void carryOntoHistoryInnerLoop(RevCommit c, int carry) {
  for (;;) {
    RevCommit[] parents = c.parents;
    if (parents == null || parents.length == 0) {
      break;
    }
    int e = parents.length - 1;
    for (int i = 0; i < e; i++) {
      RevCommit p = parents[i];
      if (carryOntoOne(p, carry) == CONTINUE) {
        // Walking p will be required, buffer p on stack.
        stack = new CarryStack(stack, p, carry);
      }
      // For other results from carryOntoOne:
      // HAVE_ALL: p has all bits, do nothing to skip that path.
      // CONTINUE_ON_STACK: callee pushed StackElement for p.
    }
    c = parents[e];
    if (carryOntoOne(c, carry) != CONTINUE) {
      break;
    }
  }
}

private void carryOntoHistory(RevCommit c, final int carry) {
  for (;;) {
    final RevCommit[] pList = c.parents;
    if (pList == null)
      return;
    final int n = pList.length;
    if (n == 0)
      return;
    for (int i = 1; i < n; i++) {
      final RevCommit p = pList[i];
      if (!carryOntoOne(p, carry))
        carryOntoHistory(p, carry);
    }
    c = pList[0];
    if (carryOntoOne(c, carry))
      break;
  }
}

private void carryOntoHistoryInnerLoop(RevCommit c, int carry) {
  for (;;) {
    RevCommit[] parents = c.parents;
    if (parents == null || parents.length == 0) {
      break;
    }
    int e = parents.length - 1;
    for (int i = 0; i < e; i++) {
      RevCommit p = parents[i];
      if (carryOntoOne(p, carry) == CONTINUE) {
        // Walking p will be required, buffer p on stack.
        stack = new CarryStack(stack, p, carry);
      }
      // For other results from carryOntoOne:
      // HAVE_ALL: p has all bits, do nothing to skip that path.
      // CONTINUE_ON_STACK: callee pushed StackElement for p.
    }
    c = parents[e];
    if (carryOntoOne(c, carry) != CONTINUE) {
      break;
    }
  }
}

private void carryOntoHistoryInnerLoop(RevCommit c, int carry) {
  for (;;) {
    RevCommit[] parents = c.parents;
    if (parents == null || parents.length == 0) {
      break;
    }
    int e = parents.length - 1;
    for (int i = 0; i < e; i++) {
      RevCommit p = parents[i];
      if (carryOntoOne(p, carry) == CONTINUE) {
        // Walking p will be required, buffer p on stack.
        stack = new CarryStack(stack, p, carry);
      }
      // For other results from carryOntoOne:
      // HAVE_ALL: p has all bits, do nothing to skip that path.
      // CONTINUE_ON_STACK: callee pushed StackElement for p.
    }
    c = parents[e];
    if (carryOntoOne(c, carry) != CONTINUE) {
      break;
    }
  }
}