void add(RevFlag flag) { sourceCommit.add(flag); }
@Override public final boolean include(RevWalk rw, RevCommit c) { if (!bitmap.contains(c)) { return true; } for (RevCommit p : c.getParents()) { p.add(SEEN); } return false; }
@Override public boolean include(RevWalk walker, RevCommit c) { final boolean remoteKnowsIsCommon = c.has(COMMON); if (c.has(ADVERTISED)) { // Remote advertised this, and we have it, hence common. // Whether or not the remote knows that fact is tested // before we added the flag. If the remote doesn't know // we have to still send them this object. // c.add(COMMON); } return !remoteKnowsIsCommon; }
/** * Add a commit if it does not have a flag set yet, then set the flag. * <p> * This method permits the application to test if the commit has the given * flag; if it does not already have the flag than the commit is added to * the queue and the flag is set. This later will prevent the commit from * being added twice. * * @param c * commit to add. * @param queueControl * flag that controls admission to the queue. */ public final void add(RevCommit c, RevFlag queueControl) { if (!c.has(queueControl)) { c.add(queueControl); add(c); } }
private void parseReachable(ObjectId id) { try { RevCommit o = walk.parseCommit(id); if (!o.has(REACHABLE)) { o.add(REACHABLE); reachableCommits.add(o); } } catch (IOException readError) { // If we cannot read the value of the ref skip it. } }
final RevCommit c = (RevCommit) s.contents[index++]; if (matching.include(w, c)) c.add(flag); else c.remove(flag);
p.add(RevFlag.SEEN); } else { for (Candidate cd : candidates) {
/** {@inheritDoc} */ @Override public final boolean include(RevWalk walker, RevCommit cmit) { Bitmap visitedBitmap; if (bitmap.contains(cmit)) { // already included } else if ((visitedBitmap = bitmap.getBitmapIndex() .getBitmap(cmit)) != null) { bitmap.or(visitedBitmap); } else { bitmap.addObject(cmit, Constants.OBJ_COMMIT); return true; } for (RevCommit p : cmit.getParents()) { p.add(RevFlag.SEEN); } return false; }
/** {@inheritDoc} */ @Override public final boolean include(RevWalk walker, RevCommit cmit) { Bitmap visitedBitmap; if (seen.contains(cmit) || bitmap.contains(cmit)) { // already seen or included } else if ((visitedBitmap = bitmap.getBitmapIndex() .getBitmap(cmit)) != null) { bitmap.or(visitedBitmap); } else { bitmap.addObject(cmit, Constants.OBJ_COMMIT); return true; } for (RevCommit p : cmit.getParents()) { p.add(RevFlag.SEEN); } return false; }
c.add(COMMON); c.carry(COMMON); reachableCommits.add(c);
p.add(REINTERESTING); p.flags &= ~RevWalk.UNINTERESTING;
@Override public final boolean include(RevWalk rw, RevCommit c) { if (!bitmap.contains(c)) { return true; } for (RevCommit p : c.getParents()) { p.add(SEEN); } return false; }
@Override public final boolean include(RevWalk rw, RevCommit c) { if (!bitmap.contains(c)) { return true; } for (RevCommit p : c.getParents()) { p.add(SEEN); } return false; }
c.add(DEEPEN_NOT); for (RevCommit p : c.getParents()) { queue.add(p);
private void parseReachable(ObjectId id) { try { RevCommit o = walk.parseCommit(id); if (!o.has(REACHABLE)) { o.add(REACHABLE); reachableCommits.add(o); } } catch (IOException readError) { // If we cannot read the value of the ref skip it. } }