@Override void shareFreeList(BlockRevQueue q) { source.shareFreeList(q); }
@Override void shareFreeList(BlockRevQueue q) { g.shareFreeList(q); }
InitialGenerator(RevWalk w, Generator s) { walk = w; held = new FIFORevQueue(); source = s; source.shareFreeList(held); }
BlockRevQueue(Generator s) throws MissingObjectException, IncorrectObjectTypeException, IOException { free = new BlockFreeList(); outputType = s.outputType(); s.shareFreeList(this); for (;;) { final RevCommit c = s.next(); if (c == null) break; add(c); } }
/** * Create a new sorter and completely spin the generator. * <p> * When the constructor completes the supplied generator will have no * commits remaining, as all of the commits will be held inside of this * generator's internal buffer. * * @param s * generator to pull all commits out of, and into this buffer. * @throws MissingObjectException * @throws IncorrectObjectTypeException * @throws IOException */ TopoSortGenerator(Generator s) throws MissingObjectException, IncorrectObjectTypeException, IOException { pending = new FIFORevQueue(); outputType = s.outputType() | SORT_TOPO; s.shareFreeList(pending); for (;;) { final RevCommit c = s.next(); if (c == null) break; for (RevCommit p : c.parents) p.inDegree++; pending.add(c); } }
@Override void shareFreeList(BlockRevQueue q) { g.shareFreeList(q); }
@Override void shareFreeList(final BlockRevQueue q) { source.shareFreeList(q); }
@Override void shareFreeList(BlockRevQueue q) { source.shareFreeList(q); }
@Override void shareFreeList(final BlockRevQueue q) { g.shareFreeList(q); }
@Override void shareFreeList(BlockRevQueue q) { source.shareFreeList(q); }
@Override void shareFreeList(BlockRevQueue q) { g.shareFreeList(q); }
InitialGenerator(RevWalk w, Generator s) { walk = w; held = new FIFORevQueue(); source = s; source.shareFreeList(held); }
InitialGenerator(final RevWalk w, final Generator s) { walk = w; held = new FIFORevQueue(); source = s; source.shareFreeList(held); }
InitialGenerator(RevWalk w, Generator s) { walk = w; held = new FIFORevQueue(); source = s; source.shareFreeList(held); }
this.DEEPEN_NOT = w.getDeepenNotFlag(); s.shareFreeList(pending);
BlockRevQueue(Generator s) throws MissingObjectException, IncorrectObjectTypeException, IOException { free = new BlockFreeList(); outputType = s.outputType(); s.shareFreeList(this); for (;;) { final RevCommit c = s.next(); if (c == null) break; add(c); } }
BlockRevQueue(final Generator s) throws MissingObjectException, IncorrectObjectTypeException, IOException { free = new BlockFreeList(); outputType = s.outputType(); s.shareFreeList(this); for (;;) { final RevCommit c = s.next(); if (c == null) break; add(c); } }
BlockRevQueue(Generator s) throws MissingObjectException, IncorrectObjectTypeException, IOException { free = new BlockFreeList(); outputType = s.outputType(); s.shareFreeList(this); for (;;) { final RevCommit c = s.next(); if (c == null) break; add(c); } }
/** * Create a new sorter and completely spin the generator. * <p> * When the constructor completes the supplied generator will have no * commits remaining, as all of the commits will be held inside of this * generator's internal buffer. * * @param s * generator to pull all commits out of, and into this buffer. * @throws MissingObjectException * @throws IncorrectObjectTypeException * @throws IOException */ TopoSortGenerator(final Generator s) throws MissingObjectException, IncorrectObjectTypeException, IOException { pending = new FIFORevQueue(); outputType = s.outputType() | SORT_TOPO; s.shareFreeList(pending); for (;;) { final RevCommit c = s.next(); if (c == null) break; for (final RevCommit p : c.parents) p.inDegree++; pending.add(c); } }
/** * @param w * @param s Parent generator * @throws MissingObjectException * @throws IncorrectObjectTypeException * @throws IOException */ DepthGenerator(DepthWalk w, Generator s) throws MissingObjectException, IncorrectObjectTypeException, IOException { pending = new FIFORevQueue(); walk = (RevWalk)w; this.depth = w.getDepth(); this.UNSHALLOW = w.getUnshallowFlag(); this.REINTERESTING = w.getReinterestingFlag(); s.shareFreeList(pending); // Begin by sucking out all of the source's commits, and // adding them to the pending queue for (;;) { RevCommit c = s.next(); if (c == null) break; if (((DepthWalk.Commit) c).getDepth() == 0) pending.add(c); } }