How to use

clearRegionList

method

in

org.eclipse.jgit.blame.Candidate

void mergeRegions(Candidate other) {
  // regionList is always sorted by resultStart. Merge join two
  // linked lists, preserving the ordering. Combine neighboring
  // regions to reduce the number of results seen by callers.
  Region a = clearRegionList();
  Region b = other.clearRegionList();
  Region t = null;
  while (a != null && b != null) {
    if (a.resultStart < b.resultStart) {
      Region n = a.next;
      t = add(t, this, a);
      a = n;
    } else {
      Region n = b.next;
      t = add(t, this, b);
      b = n;
    }
  }
  if (a != null) {
    Region n = a.next;
    t = add(t, this, a);
    t.next = n;
  } else /* b != null */{
    Region n = b.next;
    t = add(t, this, b);
    t.next = n;
  }
}

void mergeRegions(Candidate other) {
  // regionList is always sorted by resultStart. Merge join two
  // linked lists, preserving the ordering. Combine neighboring
  // regions to reduce the number of results seen by callers.
  Region a = clearRegionList();
  Region b = other.clearRegionList();
  Region t = null;
  while (a != null && b != null) {
    if (a.resultStart < b.resultStart) {
      Region n = a.next;
      t = add(t, this, a);
      a = n;
    } else {
      Region n = b.next;
      t = add(t, this, b);
      b = n;
    }
  }
  if (a != null) {
    Region n = a.next;
    t = add(t, this, a);
    t.next = n;
  } else /* b != null */{
    Region n = b.next;
    t = add(t, this, b);
    t.next = n;
  }
}

void mergeRegions(Candidate other) {
  // regionList is always sorted by resultStart. Merge join two
  // linked lists, preserving the ordering. Combine neighboring
  // regions to reduce the number of results seen by callers.
  Region a = clearRegionList();
  Region b = other.clearRegionList();
  Region t = null;
  while (a != null && b != null) {
    if (a.resultStart < b.resultStart) {
      Region n = a.next;
      t = add(t, this, a);
      a = n;
    } else {
      Region n = b.next;
      t = add(t, this, b);
      b = n;
    }
  }
  if (a != null) {
    Region n = a.next;
    t = add(t, this, a);
    t.next = n;
  } else /* b != null */{
    Region n = b.next;
    t = add(t, this, b);
    t.next = n;
  }
}

private static void blame(EditList editList, Candidate a, Candidate b) {
  Region r = b.clearRegionList();
  Region aTail = null;
  Region bTail = null;

private static void blame(EditList editList, Candidate a, Candidate b) {
  Region r = b.clearRegionList();
  Region aTail = null;
  Region bTail = null;

private static void blame(EditList editList, Candidate a, Candidate b) {
  Region r = b.clearRegionList();
  Region aTail = null;
  Region bTail = null;