Package org.eclipse.jgit.treewalk

Examples of org.eclipse.jgit.treewalk.TreeWalk.reset()


        if (c.getParentCount() != 1)
          continue;

        RevCommit p = c.getParent(0);
        rw.parseHeaders(p);
        tw.reset(p.getTree(), c.getTree());
        while (tw.next()) {
          if (!isFile(tw, 0) || !isFile(tw, 1))
            continue;

          byte[] raw0;
View Full Code Here


    ObjectReader or = db.newObjectReader();
    try {
      final MutableObjectId id = new MutableObjectId();
      RevWalk rw = new RevWalk(or);
      TreeWalk tw = new TreeWalk(or);
      tw.reset(rw.parseTree(db.resolve(Constants.HEAD)));
      tw.setRecursive(true);

      while (tw.next()) {
        FileMode fm = tw.getFileMode(0);
        if (!FileMode.REGULAR_FILE.equals(fm)
View Full Code Here

      tw.setRecursive(true);
      List<DiffEntry> l = null;
      String fromName = null;
      if (revCommit.getParentCount() > 0) {
        RevCommit parent = parseCommit(revCommit.getParent(0));
        tw.reset(parent.getTree(), revCommit.getTree());
        if (filter != null)
          tw.setFilter(filter);
        else
          tw.setFilter(TreeFilter.ANY_DIFF);
View Full Code Here

   */
  public boolean diff() throws IOException {
    boolean changesExist = false;
    DirCache dirCache = repository.readDirCache();
    TreeWalk treeWalk = new TreeWalk(repository);
    treeWalk.reset();
    treeWalk.setRecursive(true);
    // add the trees (tree, dirchache, workdir)
    treeWalk.addTree(tree);
    treeWalk.addTree(new DirCacheIterator(dirCache));
    treeWalk.addTree(initialWorkingTreeIterator);
View Full Code Here

    boolean merge = twm.merge(new ObjectId[] { O, T });
    assertTrue(merge);

    final TreeWalk tw = new TreeWalk(db);
    tw.setRecursive(true);
    tw.reset(twm.getResultTreeId());

    assertTrue(tw.next());
    assertEquals("a", tw.getPathString());
    assertCorrectId(treeO, tw);
View Full Code Here

    }

    final int expIdx = 2;
    final DirCacheBuilder b = dc.builder();
    final TreeWalk tw = new TreeWalk(db);
    tw.reset();
    tw.addTree(new DirCacheBuildIterator(b));
    tw.setRecursive(true);
    tw.setFilter(PathFilterGroup.createFromStrings(Collections
        .singleton(paths[expIdx])));
View Full Code Here

    dc.read();
    assertEquals(ls.size(), dc.getEntryCount());
    {
      final Iterator<CGitIndexRecord> rItr = ls.values().iterator();
      final TreeWalk tw = new TreeWalk(db);
      tw.reset();
      tw.setRecursive(true);
      tw.addTree(new DirCacheIterator(dc));
      while (rItr.hasNext()) {
        final DirCacheIterator dcItr;
View Full Code Here

  public RevObject get(final RevTree tree, final String path)
      throws AssertionFailedError, Exception {
    final TreeWalk tw = new TreeWalk(pool.getObjectReader());
    tw.setFilter(PathFilterGroup.createFromStrings(Collections
        .singleton(path)));
    tw.reset(tree);
    while (tw.next()) {
      if (tw.isSubtree() && !path.equals(tw.getPathString())) {
        tw.enterSubtree();
        continue;
      }
View Full Code Here

  private TreeFilter pathFilter = TreeFilter.ALL;

  @Override
  protected void run() throws Exception {
    final TreeWalk walk = new TreeWalk(db);
    walk.reset();
    walk.setRecursive(recursive);
    for (final AbstractTreeIterator i : trees)
      walk.addTree(i);
    walk.setFilter(AndTreeFilter.create(TreeFilter.ANY_DIFF, pathFilter));
View Full Code Here

  private AbstractTreeIterator tree;

  @Override
  protected void run() throws Exception {
    final TreeWalk walk = new TreeWalk(db);
    walk.reset(); // drop the first empty tree, which we do not need here
    walk.setRecursive(recursive);
    walk.addTree(tree);

    while (walk.next()) {
      final FileMode mode = walk.getFileMode(0);
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.