Package org.eclipse.jgit.treewalk

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


  public void testEmptyTree_WithTreeWalk() throws Exception {
    final DirCache dc = db.readDirCache();
    assertEquals(0, dc.getEntryCount());

    final TreeWalk tw = new TreeWalk(db);
    tw.reset();
    tw.addTree(new DirCacheIterator(dc));
    assertFalse(tw.next());
  }

  public void testNoSubtree_NoTreeWalk() throws Exception {
View Full Code Here


      b.add(ents[i]);
    b.finish();

    final DirCacheIterator i = new DirCacheIterator(dc);
    final TreeWalk tw = new TreeWalk(db);
    tw.reset();
    tw.addTree(i);
    int pathIdx = 0;
    while (tw.next()) {
      assertSame(i, tw.getTree(0, DirCacheIterator.class));
      assertEquals(pathIdx, i.ptr);
View Full Code Here

        FileMode.REGULAR_FILE };
    final int expPos[] = { 0, -1, 4 };

    final DirCacheIterator i = new DirCacheIterator(dc);
    final TreeWalk tw = new TreeWalk(db);
    tw.reset();
    tw.addTree(i);
    tw.setRecursive(false);
    int pathIdx = 0;
    while (tw.next()) {
      assertSame(i, tw.getTree(0, DirCacheIterator.class));
View Full Code Here

      b.add(ents[i]);
    b.finish();

    final DirCacheIterator i = new DirCacheIterator(dc);
    final TreeWalk tw = new TreeWalk(db);
    tw.reset();
    tw.addTree(i);
    tw.setRecursive(true);
    int pathIdx = 0;
    while (tw.next()) {
      final DirCacheIterator c = tw.getTree(0, DirCacheIterator.class);
View Full Code Here

    for (int i = 0; i < ents.length; i++)
      b.add(ents[i]);
    b.finish();

    final TreeWalk tw = new TreeWalk(db);
    tw.reset();
    tw.addTree(new DirCacheIterator(dc));
    tw.setRecursive(true);
    int pathIdx = 0;
    while (tw.next()) {
      final DirCacheIterator c = tw.getTree(0, DirCacheIterator.class);
View Full Code Here

      b.add(ents[i]);
    b.finish();

    final TreeWalk tw = new TreeWalk(db);
    for (int victimIdx = 0; victimIdx < paths.length; victimIdx++) {
      tw.reset();
      tw.addTree(new DirCacheIterator(dc));
      tw.setFilter(PathFilterGroup.createFromStrings(Collections
          .singleton(paths[victimIdx])));
      tw.setRecursive(tw.getFilter().shouldBeRecursive());
      assertTrue(tw.next());
View Full Code Here

    }
  }

  private List<DiffEntry> scan() throws IOException {
    final TreeWalk walk = new TreeWalk(db);
    walk.reset();
    walk.setRecursive(true);
    for (final AbstractTreeIterator i : trees)
      walk.addTree(i);
    walk.setFilter(AndTreeFilter.create(TreeFilter.ANY_DIFF, pathFilter));
View Full Code Here

  }

  public void assertWorkDir(HashMap<String, String> i)
      throws CorruptObjectException, IOException {
    TreeWalk walk = new TreeWalk(db);
    walk.reset();
    walk.setRecursive(true);
    walk.addTree(new FileTreeIterator(db));
    String expectedValue;
    String path;
    int nrFiles = 0;
View Full Code Here

    boolean merge = ourMerger.merge(new ObjectId[] { o, t });
    assertTrue(merge);

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

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

    boolean merge = ourMerger.merge(new ObjectId[] { o, t });
    assertTrue(merge);

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

    assertTrue(tw.next());
    assertEquals("d/o", tw.getPathString());
    assertCorrectId(treeO, tw);
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.