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

Class org.eclipse.jgit.treewalk.TreeWalk

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

org.eclipse.jgit.treewalk.TreeWalk.addTree()
Add an already existing tree object for walking.
The position of this tree is returned to the caller, in case the caller has lost track of the order they added the trees into the walker.
The tree must have the same root as existing trees in the walk. @param id identity of the tree object the caller wants walked. @return position of this tree within the walker. @throws MissingObjectException the given tree object does not exist in this repository. @throws IncorrectObjectTypeException the given object id does not denote a tree, but instead names some other non-tree type of object. Note that commits are not trees, even if they are sometimes called a "tree-ish". @throws CorruptObjectException the object claimed to be a tree, but its contents did not appear to be a tree. The repository may have data corruption. @throws IOException a loose object or pack file could not be read.

        config.setString(CONF_ALIAS, null, keyName, branchName);
        config.setString(CONF_BRANCH, null, keyName, tipId);


        // index the blob contents of the tree
        TreeWalk treeWalk = new TreeWalk(repository);
        treeWalk.addTree(tip.getTree());
        treeWalk.setRecursive(true);


        Map<String, ObjectId> paths = new TreeMap<String, ObjectId>();
        while (treeWalk.next()) {
          // ensure path is not in a submodule

View Full Code Here

        while ((paths.size() > 0) && (commit = commitWalk.next()) != null) {
          TreeWalk diffWalk = new TreeWalk(reader);
          int parentCount = commit.getParentCount();
          switch (parentCount) {
          case 0:
            diffWalk.addTree(new EmptyTreeIterator());
            break;
          case 1:
            diffWalk.addTree(getTree(commitWalk, commit.getParent(0)));
            break;
          default:

View Full Code Here

          switch (parentCount) {
          case 0:
            diffWalk.addTree(new EmptyTreeIterator());
            break;
          case 1:
            diffWalk.addTree(getTree(commitWalk, commit.getParent(0)));
            break;
          default:
            // skip merge commits
            continue;
          }

View Full Code Here

            break;
          default:
            // skip merge commits
            continue;
          }
          diffWalk.addTree(getTree(commitWalk, commit));
          diffWalk.setFilter(ANY_DIFF);
          diffWalk.setRecursive(true);
          while ((paths.size() > 0) && diffWalk.next()) {
            String path = diffWalk.getPathString();
            if (!paths.containsKey(path)) {

View Full Code Here

        // manually locate path in tree
        TreeWalk tw = new TreeWalk(r);
        tw.reset();
        tw.setRecursive(true);
        try {
          tw.addTree(commit.getTree());
          tw.setFilter(PathFilterGroup.createFromStrings(Collections.singleton(path)));
          while (tw.next()) {
            if (tw.getPathString().equals(path)) {
              matchingPath = new PathChangeModel(tw.getPathString(), tw.getPathString(), 0, tw
                .getRawMode(0), tw.getObjectId(0).getName(), commit.getId().getName(),

View Full Code Here


  @Override
  public boolean include(final RevWalk walker, final RevCommit commit)
      throws IOException {
    final TreeWalk walk = new TreeWalk(walker.getObjectReader());
    walk.addTree(commit.getTree());
    while (walk.next()) {
      if (!filter.include(walker, commit, walk))
        return include(false);
      if (walk.isSubtree())
        walk.enterSubtree();

View Full Code Here


  @Override
  public boolean include(final RevWalk walker, final RevCommit commit)
      throws IOException {
    final TreeWalk walk = new TreeWalk(walker.getObjectReader());
    walk.addTree(commit.getTree());
    RevTree tree = null;
    for (RevCommit parent : commit.getParents()) {
      tree = parent.getTree();
      if (tree == null) {
        walker.parseHeaders(parent);

View Full Code Here

      tree = parent.getTree();
      if (tree == null) {
        walker.parseHeaders(parent);
        tree = parent.getTree();
      }
      walk.addTree(tree);
    }


    while (walk.next()) {
      if (filter.include(walker, commit, walk))
        return true;

View Full Code Here

      final RevWalk rWalk, final RevCommit commit) throws IOException {
    final TreeWalk walk = new TreeWalk(reader);
    final int parentCount = commit.getParentCount();
    switch (parentCount) {
    case 0:
      walk.addTree(new EmptyTreeIterator());
      break;
    case 1:
      walk.addTree(getTree(rWalk, commit.getParent(0)));
      break;
    default:

View Full Code Here

    switch (parentCount) {
    case 0:
      walk.addTree(new EmptyTreeIterator());
      break;
    case 1:
      walk.addTree(getTree(rWalk, commit.getParent(0)));
      break;
    default:
      final RevCommit[] parents = commit.getParents();
      for (int i = 0; i < parentCount; i++)
        walk.addTree(getTree(rWalk, parents[i]));

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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.